./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi010.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/rfi010.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/rfi010.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/rfi010.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:49:32,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:49:32,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:49:32,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:49:32,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:49:32,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:49:32,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:49:32,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:49:32,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:49:32,733 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:49:32,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:49:32,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:49:32,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:49:32,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:49:32,735 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:49:32,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:49:32,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:49:32,736 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:49:32,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:49:32,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:49:32,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:49:32,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:49:32,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:49:32,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:49:32,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:49:32,739 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:49:32,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:49:32,739 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:49:32,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:49:32,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:49:32,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:49:32,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:49:32,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:49:32,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:49:32,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:49:32,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:49:32,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:49:32,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:49:32,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:49:32,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:49:32,742 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:49:32,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:49:32,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:49:32,743 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:49:32,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:49:32,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:49:32,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:49:32,976 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:49:32,977 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:49:32,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010.i [2024-06-28 01:49:33,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:49:34,140 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:49:34,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010.i [2024-06-28 01:49:34,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60df46764/e7466b560e3742dbb9b7fd407ebdd003/FLAGb8b610b4e [2024-06-28 01:49:34,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60df46764/e7466b560e3742dbb9b7fd407ebdd003 [2024-06-28 01:49:34,166 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:49:34,166 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:49:34,167 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/rfi010.yml/witness.yml [2024-06-28 01:49:34,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:49:34,306 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:49:34,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:49:34,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:49:34,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:49:34,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:49:34" (1/2) ... [2024-06-28 01:49:34,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c78da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:49:34, skipping insertion in model container [2024-06-28 01:49:34,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:49:34" (1/2) ... [2024-06-28 01:49:34,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@110a4216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:49:34, skipping insertion in model container [2024-06-28 01:49:34,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:49:34" (2/2) ... [2024-06-28 01:49:34,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c78da5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34, skipping insertion in model container [2024-06-28 01:49:34,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:49:34" (2/2) ... [2024-06-28 01:49:34,315 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:49:34,367 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:49:34,369 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] (((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1)) [2024-06-28 01:49:34,369 INFO L97 edCorrectnessWitness]: Location invariant before [L827-L827] (((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1)) [2024-06-28 01:49:34,369 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:49:34,370 INFO L106 edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1; [2024-06-28 01:49:34,408 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:49:34,554 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/rfi010.i[983,996] [2024-06-28 01:49:34,679 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:49:34,688 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:49:34,721 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/rfi010.i[983,996] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:49:34,794 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:49:34,827 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:49:34,827 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34 WrapperNode [2024-06-28 01:49:34,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:49:34,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:49:34,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:49:34,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:49:34,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34" (1/1) ... [2024-06-28 01:49:34,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34" (1/1) ... [2024-06-28 01:49:34,872 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2024-06-28 01:49:34,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:49:34,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:49:34,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:49:34,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:49:34,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34" (1/1) ... [2024-06-28 01:49:34,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34" (1/1) ... [2024-06-28 01:49:34,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34" (1/1) ... [2024-06-28 01:49:34,916 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:49:34,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34" (1/1) ... [2024-06-28 01:49:34,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34" (1/1) ... [2024-06-28 01:49:34,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34" (1/1) ... [2024-06-28 01:49:34,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34" (1/1) ... [2024-06-28 01:49:34,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34" (1/1) ... [2024-06-28 01:49:34,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34" (1/1) ... [2024-06-28 01:49:34,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:49:34,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:49:34,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:49:34,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:49:34,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34" (1/1) ... [2024-06-28 01:49:34,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:49:34,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:49:34,962 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:49:34,984 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:49:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:49:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:49:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:49:34,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:49:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:49:34,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:49:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:49:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:49:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:49:34,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:49:34,994 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:49:35,133 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:49:35,135 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:49:35,360 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:49:35,361 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:49:35,473 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:49:35,473 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:49:35,474 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:49:35 BoogieIcfgContainer [2024-06-28 01:49:35,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:49:35,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:49:35,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:49:35,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:49:35,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:49:34" (1/4) ... [2024-06-28 01:49:35,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730d56ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:49:35, skipping insertion in model container [2024-06-28 01:49:35,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:49:34" (2/4) ... [2024-06-28 01:49:35,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730d56ea and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:49:35, skipping insertion in model container [2024-06-28 01:49:35,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:49:34" (3/4) ... [2024-06-28 01:49:35,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730d56ea and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:49:35, skipping insertion in model container [2024-06-28 01:49:35,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:49:35" (4/4) ... [2024-06-28 01:49:35,486 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010.i [2024-06-28 01:49:35,498 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:49:35,499 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-28 01:49:35,499 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:49:35,535 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:49:35,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 82 flow [2024-06-28 01:49:35,583 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-06-28 01:49:35,583 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:49:35,586 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 5. Compared 53 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:49:35,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 37 transitions, 82 flow [2024-06-28 01:49:35,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 76 flow [2024-06-28 01:49:35,598 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:49:35,607 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;@4dc91489, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:49:35,608 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-28 01:49:35,611 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:49:35,611 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:49:35,611 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:49:35,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:35,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:49:35,612 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:35,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:35,654 INFO L85 PathProgramCache]: Analyzing trace with hash 341274721, now seen corresponding path program 1 times [2024-06-28 01:49:35,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:35,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019454738] [2024-06-28 01:49:35,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:35,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:49:36,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:36,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019454738] [2024-06-28 01:49:36,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019454738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:36,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:36,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:49:36,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699921323] [2024-06-28 01:49:36,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:36,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:49:36,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:36,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:49:36,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:49:36,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-06-28 01:49:36,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call 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:36,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:36,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-06-28 01:49:36,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:36,570 INFO L124 PetriNetUnfolderBase]: 384/793 cut-off events. [2024-06-28 01:49:36,570 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-28 01:49:36,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 793 events. 384/793 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4437 event pairs, 284 based on Foata normal form. 31/742 useless extension candidates. Maximal degree in co-relation 1446. Up to 639 conditions per place. [2024-06-28 01:49:36,578 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 29 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-28 01:49:36,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 165 flow [2024-06-28 01:49:36,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:49:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:49:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-28 01:49:36,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7117117117117117 [2024-06-28 01:49:36,589 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 76 flow. Second operand 3 states and 79 transitions. [2024-06-28 01:49:36,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 165 flow [2024-06-28 01:49:36,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:49:36,595 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 100 flow [2024-06-28 01:49:36,596 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:49:36,599 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-06-28 01:49:36,600 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 100 flow [2024-06-28 01:49:36,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call 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:36,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:36,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:36,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:49:36,601 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:36,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1547525120, now seen corresponding path program 1 times [2024-06-28 01:49:36,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:36,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71125261] [2024-06-28 01:49:36,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:36,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:37,073 INFO 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:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:37,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71125261] [2024-06-28 01:49:37,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71125261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:37,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:37,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:49:37,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18534595] [2024-06-28 01:49:37,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:37,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:49:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:37,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:49:37,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:49:37,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-06-28 01:49:37,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:37,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:37,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-06-28 01:49:37,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:37,265 INFO L124 PetriNetUnfolderBase]: 434/884 cut-off events. [2024-06-28 01:49:37,265 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-06-28 01:49:37,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1812 conditions, 884 events. 434/884 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4941 event pairs, 225 based on Foata normal form. 4/813 useless extension candidates. Maximal degree in co-relation 1800. Up to 686 conditions per place. [2024-06-28 01:49:37,269 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 39 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2024-06-28 01:49:37,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 240 flow [2024-06-28 01:49:37,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:49:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:49:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-06-28 01:49:37,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-06-28 01:49:37,271 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 100 flow. Second operand 4 states and 100 transitions. [2024-06-28 01:49:37,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 240 flow [2024-06-28 01:49:37,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:49:37,272 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 134 flow [2024-06-28 01:49:37,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2024-06-28 01:49:37,273 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2024-06-28 01:49:37,273 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 134 flow [2024-06-28 01:49:37,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:37,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:37,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:37,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:49:37,274 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:37,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash 727998747, now seen corresponding path program 1 times [2024-06-28 01:49:37,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:37,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572555579] [2024-06-28 01:49:37,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:37,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:37,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:49:37,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:37,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572555579] [2024-06-28 01:49:37,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572555579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:37,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:37,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:49:37,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344867636] [2024-06-28 01:49:37,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:37,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:49:37,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:37,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:49:37,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:49:37,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 37 [2024-06-28 01:49:37,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:37,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:37,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 37 [2024-06-28 01:49:37,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:37,387 INFO L124 PetriNetUnfolderBase]: 163/382 cut-off events. [2024-06-28 01:49:37,388 INFO L125 PetriNetUnfolderBase]: For 113/120 co-relation queries the response was YES. [2024-06-28 01:49:37,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 382 events. 163/382 cut-off events. For 113/120 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2060 event pairs, 38 based on Foata normal form. 6/366 useless extension candidates. Maximal degree in co-relation 776. Up to 240 conditions per place. [2024-06-28 01:49:37,390 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 20 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2024-06-28 01:49:37,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 179 flow [2024-06-28 01:49:37,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:49:37,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:49:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-06-28 01:49:37,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7297297297297297 [2024-06-28 01:49:37,391 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 134 flow. Second operand 3 states and 81 transitions. [2024-06-28 01:49:37,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 179 flow [2024-06-28 01:49:37,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 170 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-28 01:49:37,393 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 114 flow [2024-06-28 01:49:37,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-28 01:49:37,394 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2024-06-28 01:49:37,394 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 114 flow [2024-06-28 01:49:37,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:37,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:37,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:37,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:49:37,395 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:37,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash -473369889, now seen corresponding path program 1 times [2024-06-28 01:49:37,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:37,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025018340] [2024-06-28 01:49:37,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:37,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:37,893 INFO 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:37,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:37,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025018340] [2024-06-28 01:49:37,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025018340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:37,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:37,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:49:37,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669098538] [2024-06-28 01:49:37,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:37,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:49:37,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:37,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:49:37,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:49:37,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-28 01:49:37,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:37,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:37,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-28 01:49:37,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:38,137 INFO L124 PetriNetUnfolderBase]: 373/760 cut-off events. [2024-06-28 01:49:38,137 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2024-06-28 01:49:38,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 760 events. 373/760 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4071 event pairs, 207 based on Foata normal form. 1/729 useless extension candidates. Maximal degree in co-relation 1653. Up to 613 conditions per place. [2024-06-28 01:49:38,140 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 34 selfloop transitions, 9 changer transitions 2/55 dead transitions. [2024-06-28 01:49:38,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 256 flow [2024-06-28 01:49:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:49:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:49:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-28 01:49:38,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:49:38,142 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 114 flow. Second operand 6 states and 114 transitions. [2024-06-28 01:49:38,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 256 flow [2024-06-28 01:49:38,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:49:38,144 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 172 flow [2024-06-28 01:49:38,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-06-28 01:49:38,144 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-06-28 01:49:38,145 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 172 flow [2024-06-28 01:49:38,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:38,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:38,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:38,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:49:38,145 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:38,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:38,146 INFO L85 PathProgramCache]: Analyzing trace with hash 137168702, now seen corresponding path program 1 times [2024-06-28 01:49:38,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:38,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391360465] [2024-06-28 01:49:38,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:38,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:38,826 INFO 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:38,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:38,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391360465] [2024-06-28 01:49:38,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391360465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:38,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:38,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:49:38,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179784527] [2024-06-28 01:49:38,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:38,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:49:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:38,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:49:38,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:49:38,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-06-28 01:49:38,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:38,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:38,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-06-28 01:49:38,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:39,087 INFO L124 PetriNetUnfolderBase]: 318/666 cut-off events. [2024-06-28 01:49:39,088 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2024-06-28 01:49:39,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 666 events. 318/666 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3554 event pairs, 99 based on Foata normal form. 4/641 useless extension candidates. Maximal degree in co-relation 1572. Up to 472 conditions per place. [2024-06-28 01:49:39,091 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 46 selfloop transitions, 11 changer transitions 0/68 dead transitions. [2024-06-28 01:49:39,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 350 flow [2024-06-28 01:49:39,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:49:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:49:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2024-06-28 01:49:39,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2024-06-28 01:49:39,094 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 172 flow. Second operand 6 states and 132 transitions. [2024-06-28 01:49:39,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 350 flow [2024-06-28 01:49:39,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 346 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 01:49:39,098 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 201 flow [2024-06-28 01:49:39,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2024-06-28 01:49:39,101 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2024-06-28 01:49:39,101 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 201 flow [2024-06-28 01:49:39,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:39,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:39,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:39,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:49:39,105 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:39,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:39,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1789563939, now seen corresponding path program 1 times [2024-06-28 01:49:39,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:39,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291478010] [2024-06-28 01:49:39,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:39,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:39,802 INFO 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:39,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:39,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291478010] [2024-06-28 01:49:39,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291478010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:39,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:39,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:49:39,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677093842] [2024-06-28 01:49:39,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:39,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:49:39,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:39,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:49:39,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:49:39,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-28 01:49:39,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 201 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 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:49:39,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:39,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-28 01:49:39,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:40,040 INFO L124 PetriNetUnfolderBase]: 319/682 cut-off events. [2024-06-28 01:49:40,040 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2024-06-28 01:49:40,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 682 events. 319/682 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3645 event pairs, 105 based on Foata normal form. 1/656 useless extension candidates. Maximal degree in co-relation 1723. Up to 515 conditions per place. [2024-06-28 01:49:40,044 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 41 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2024-06-28 01:49:40,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 347 flow [2024-06-28 01:49:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:49:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:49:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-28 01:49:40,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2024-06-28 01:49:40,046 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 201 flow. Second operand 6 states and 117 transitions. [2024-06-28 01:49:40,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 347 flow [2024-06-28 01:49:40,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 61 transitions, 325 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-28 01:49:40,050 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 216 flow [2024-06-28 01:49:40,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-06-28 01:49:40,053 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2024-06-28 01:49:40,053 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 216 flow [2024-06-28 01:49:40,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 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:49:40,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:40,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:40,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:49:40,054 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:40,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1050836422, now seen corresponding path program 1 times [2024-06-28 01:49:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:40,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357103075] [2024-06-28 01:49:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:40,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:40,482 INFO 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:40,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:40,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357103075] [2024-06-28 01:49:40,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357103075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:40,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:40,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:49:40,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795483079] [2024-06-28 01:49:40,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:40,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:49:40,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:40,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:49:40,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:49:40,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:40,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:40,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:40,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:40,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:40,760 INFO L124 PetriNetUnfolderBase]: 400/821 cut-off events. [2024-06-28 01:49:40,761 INFO L125 PetriNetUnfolderBase]: For 921/921 co-relation queries the response was YES. [2024-06-28 01:49:40,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2173 conditions, 821 events. 400/821 cut-off events. For 921/921 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4503 event pairs, 127 based on Foata normal form. 2/790 useless extension candidates. Maximal degree in co-relation 2149. Up to 631 conditions per place. [2024-06-28 01:49:40,764 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 48 selfloop transitions, 11 changer transitions 0/68 dead transitions. [2024-06-28 01:49:40,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 400 flow [2024-06-28 01:49:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:49:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:49:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-28 01:49:40,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180180180180181 [2024-06-28 01:49:40,766 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 216 flow. Second operand 6 states and 115 transitions. [2024-06-28 01:49:40,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 400 flow [2024-06-28 01:49:40,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 379 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-28 01:49:40,769 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 259 flow [2024-06-28 01:49:40,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2024-06-28 01:49:40,770 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2024-06-28 01:49:40,770 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 259 flow [2024-06-28 01:49:40,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:40,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:40,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:40,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:49:40,771 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:40,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash 358083582, now seen corresponding path program 2 times [2024-06-28 01:49:40,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:40,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415823283] [2024-06-28 01:49:40,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:40,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:41,217 INFO 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:41,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:41,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415823283] [2024-06-28 01:49:41,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415823283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:41,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:41,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:49:41,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277643256] [2024-06-28 01:49:41,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:41,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:49:41,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:41,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:49:41,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:49:41,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:41,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:41,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:41,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:41,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:41,450 INFO L124 PetriNetUnfolderBase]: 412/849 cut-off events. [2024-06-28 01:49:41,450 INFO L125 PetriNetUnfolderBase]: For 1292/1292 co-relation queries the response was YES. [2024-06-28 01:49:41,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2395 conditions, 849 events. 412/849 cut-off events. For 1292/1292 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4701 event pairs, 122 based on Foata normal form. 2/814 useless extension candidates. Maximal degree in co-relation 2369. Up to 619 conditions per place. [2024-06-28 01:49:41,455 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 49 selfloop transitions, 13 changer transitions 0/71 dead transitions. [2024-06-28 01:49:41,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 71 transitions, 447 flow [2024-06-28 01:49:41,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:49:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:49:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-28 01:49:41,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225225225225225 [2024-06-28 01:49:41,458 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 259 flow. Second operand 6 states and 116 transitions. [2024-06-28 01:49:41,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 71 transitions, 447 flow [2024-06-28 01:49:41,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 71 transitions, 427 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-28 01:49:41,462 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 286 flow [2024-06-28 01:49:41,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-06-28 01:49:41,463 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2024-06-28 01:49:41,463 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 286 flow [2024-06-28 01:49:41,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:49:41,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:41,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:41,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:49:41,464 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:41,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:41,464 INFO L85 PathProgramCache]: Analyzing trace with hash 210268128, now seen corresponding path program 1 times [2024-06-28 01:49:41,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386637397] [2024-06-28 01:49:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:42,129 INFO 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:42,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:42,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386637397] [2024-06-28 01:49:42,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386637397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:42,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:42,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:49:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217373367] [2024-06-28 01:49:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:42,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:49:42,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:42,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:49:42,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:49:42,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:42,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 286 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call 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:42,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:42,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:42,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:42,448 INFO L124 PetriNetUnfolderBase]: 434/882 cut-off events. [2024-06-28 01:49:42,448 INFO L125 PetriNetUnfolderBase]: For 1658/1658 co-relation queries the response was YES. [2024-06-28 01:49:42,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2617 conditions, 882 events. 434/882 cut-off events. For 1658/1658 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4888 event pairs, 129 based on Foata normal form. 2/850 useless extension candidates. Maximal degree in co-relation 2590. Up to 662 conditions per place. [2024-06-28 01:49:42,453 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 55 selfloop transitions, 14 changer transitions 0/78 dead transitions. [2024-06-28 01:49:42,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 498 flow [2024-06-28 01:49:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:49:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:49:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-28 01:49:42,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173745173745173 [2024-06-28 01:49:42,454 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 286 flow. Second operand 7 states and 134 transitions. [2024-06-28 01:49:42,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 498 flow [2024-06-28 01:49:42,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 78 transitions, 467 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-28 01:49:42,457 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 309 flow [2024-06-28 01:49:42,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2024-06-28 01:49:42,458 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2024-06-28 01:49:42,458 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 309 flow [2024-06-28 01:49:42,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call 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:42,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:42,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:42,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:49:42,460 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:42,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:42,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1784310114, now seen corresponding path program 2 times [2024-06-28 01:49:42,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:42,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476999919] [2024-06-28 01:49:42,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:42,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:49:43,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:43,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476999919] [2024-06-28 01:49:43,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476999919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:43,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:43,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:49:43,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135126930] [2024-06-28 01:49:43,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:43,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:49:43,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:43,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:49:43,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:49:43,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:43,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 309 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call 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:43,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:43,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:43,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:43,407 INFO L124 PetriNetUnfolderBase]: 456/924 cut-off events. [2024-06-28 01:49:43,408 INFO L125 PetriNetUnfolderBase]: For 2104/2104 co-relation queries the response was YES. [2024-06-28 01:49:43,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2894 conditions, 924 events. 456/924 cut-off events. For 2104/2104 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5139 event pairs, 122 based on Foata normal form. 2/886 useless extension candidates. Maximal degree in co-relation 2866. Up to 665 conditions per place. [2024-06-28 01:49:43,413 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 57 selfloop transitions, 16 changer transitions 0/82 dead transitions. [2024-06-28 01:49:43,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 82 transitions, 545 flow [2024-06-28 01:49:43,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:49:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:49:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-28 01:49:43,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212355212355212 [2024-06-28 01:49:43,414 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 309 flow. Second operand 7 states and 135 transitions. [2024-06-28 01:49:43,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 82 transitions, 545 flow [2024-06-28 01:49:43,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 82 transitions, 513 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 01:49:43,419 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 341 flow [2024-06-28 01:49:43,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2024-06-28 01:49:43,420 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2024-06-28 01:49:43,420 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 341 flow [2024-06-28 01:49:43,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call 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:43,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:43,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:43,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 01:49:43,421 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:43,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:43,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1784013444, now seen corresponding path program 3 times [2024-06-28 01:49:43,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:43,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339328157] [2024-06-28 01:49:43,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:43,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:49:44,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:44,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339328157] [2024-06-28 01:49:44,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339328157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:44,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:44,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:49:44,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223036195] [2024-06-28 01:49:44,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:44,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:49:44,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:44,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:49:44,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:49:44,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:44,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 341 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call 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:44,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:44,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:44,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:44,424 INFO L124 PetriNetUnfolderBase]: 457/923 cut-off events. [2024-06-28 01:49:44,424 INFO L125 PetriNetUnfolderBase]: For 2588/2588 co-relation queries the response was YES. [2024-06-28 01:49:44,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 923 events. 457/923 cut-off events. For 2588/2588 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5149 event pairs, 124 based on Foata normal form. 1/885 useless extension candidates. Maximal degree in co-relation 3051. Up to 623 conditions per place. [2024-06-28 01:49:44,429 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 54 selfloop transitions, 22 changer transitions 0/85 dead transitions. [2024-06-28 01:49:44,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 85 transitions, 583 flow [2024-06-28 01:49:44,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:49:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:49:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-28 01:49:44,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212355212355212 [2024-06-28 01:49:44,430 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 341 flow. Second operand 7 states and 135 transitions. [2024-06-28 01:49:44,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 85 transitions, 583 flow [2024-06-28 01:49:44,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 85 transitions, 541 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-28 01:49:44,434 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 389 flow [2024-06-28 01:49:44,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=389, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2024-06-28 01:49:44,435 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2024-06-28 01:49:44,435 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 389 flow [2024-06-28 01:49:44,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call 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:44,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:44,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:44,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 01:49:44,436 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:44,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:44,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1784002532, now seen corresponding path program 1 times [2024-06-28 01:49:44,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:44,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296810350] [2024-06-28 01:49:44,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:44,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:45,664 INFO 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:45,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:45,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296810350] [2024-06-28 01:49:45,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296810350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:45,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:45,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:49:45,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404628000] [2024-06-28 01:49:45,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:45,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:49:45,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:45,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:49:45,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:49:45,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:45,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 389 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:45,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:45,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:45,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:46,064 INFO L124 PetriNetUnfolderBase]: 458/948 cut-off events. [2024-06-28 01:49:46,064 INFO L125 PetriNetUnfolderBase]: For 3069/3069 co-relation queries the response was YES. [2024-06-28 01:49:46,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3280 conditions, 948 events. 458/948 cut-off events. For 3069/3069 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5410 event pairs, 125 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 3249. Up to 713 conditions per place. [2024-06-28 01:49:46,070 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 67 selfloop transitions, 14 changer transitions 0/90 dead transitions. [2024-06-28 01:49:46,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 90 transitions, 629 flow [2024-06-28 01:49:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:49:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:49:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-28 01:49:46,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:49:46,072 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 389 flow. Second operand 8 states and 148 transitions. [2024-06-28 01:49:46,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 90 transitions, 629 flow [2024-06-28 01:49:46,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 90 transitions, 604 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-28 01:49:46,076 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 411 flow [2024-06-28 01:49:46,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=411, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2024-06-28 01:49:46,077 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2024-06-28 01:49:46,077 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 411 flow [2024-06-28 01:49:46,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:46,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:46,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:46,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:49:46,078 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:46,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:46,078 INFO L85 PathProgramCache]: Analyzing trace with hash -541262823, now seen corresponding path program 1 times [2024-06-28 01:49:46,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:46,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472716867] [2024-06-28 01:49:46,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:46,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:49:46,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:46,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472716867] [2024-06-28 01:49:46,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472716867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:46,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:46,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:49:46,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63802717] [2024-06-28 01:49:46,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:46,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:49:46,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:46,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:49:46,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:49:46,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:46,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 411 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call 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:46,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:46,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:46,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:47,085 INFO L124 PetriNetUnfolderBase]: 459/898 cut-off events. [2024-06-28 01:49:47,085 INFO L125 PetriNetUnfolderBase]: For 3183/3183 co-relation queries the response was YES. [2024-06-28 01:49:47,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3341 conditions, 898 events. 459/898 cut-off events. For 3183/3183 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4974 event pairs, 135 based on Foata normal form. 1/872 useless extension candidates. Maximal degree in co-relation 3308. Up to 722 conditions per place. [2024-06-28 01:49:47,091 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 69 selfloop transitions, 14 changer transitions 0/92 dead transitions. [2024-06-28 01:49:47,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 92 transitions, 671 flow [2024-06-28 01:49:47,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:49:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:49:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-28 01:49:47,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173745173745173 [2024-06-28 01:49:47,092 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 411 flow. Second operand 7 states and 134 transitions. [2024-06-28 01:49:47,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 92 transitions, 671 flow [2024-06-28 01:49:47,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 92 transitions, 614 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-28 01:49:47,097 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 437 flow [2024-06-28 01:49:47,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=437, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2024-06-28 01:49:47,098 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2024-06-28 01:49:47,098 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 437 flow [2024-06-28 01:49:47,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call 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:47,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:47,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:47,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 01:49:47,099 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:47,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash -536463527, now seen corresponding path program 1 times [2024-06-28 01:49:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:47,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799623653] [2024-06-28 01:49:47,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:47,823 INFO 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:47,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:47,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799623653] [2024-06-28 01:49:47,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799623653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:47,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:47,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:49:47,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984519497] [2024-06-28 01:49:47,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:47,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:49:47,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:47,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:49:47,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:49:47,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:47,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 437 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:47,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:47,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:47,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:48,218 INFO L124 PetriNetUnfolderBase]: 481/926 cut-off events. [2024-06-28 01:49:48,219 INFO L125 PetriNetUnfolderBase]: For 3774/3774 co-relation queries the response was YES. [2024-06-28 01:49:48,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3503 conditions, 926 events. 481/926 cut-off events. For 3774/3774 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5109 event pairs, 129 based on Foata normal form. 2/902 useless extension candidates. Maximal degree in co-relation 3469. Up to 714 conditions per place. [2024-06-28 01:49:48,225 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 74 selfloop transitions, 17 changer transitions 0/100 dead transitions. [2024-06-28 01:49:48,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 100 transitions, 733 flow [2024-06-28 01:49:48,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:49:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:49:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-28 01:49:48,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168918918918919 [2024-06-28 01:49:48,226 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 437 flow. Second operand 8 states and 153 transitions. [2024-06-28 01:49:48,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 100 transitions, 733 flow [2024-06-28 01:49:48,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 100 transitions, 692 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 01:49:48,232 INFO L231 Difference]: Finished difference. Result has 81 places, 73 transitions, 470 flow [2024-06-28 01:49:48,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=470, PETRI_PLACES=81, PETRI_TRANSITIONS=73} [2024-06-28 01:49:48,233 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 40 predicate places. [2024-06-28 01:49:48,233 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 73 transitions, 470 flow [2024-06-28 01:49:48,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:48,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:48,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:48,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:49:48,233 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:48,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:48,234 INFO L85 PathProgramCache]: Analyzing trace with hash -362820437, now seen corresponding path program 2 times [2024-06-28 01:49:48,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:48,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955782060] [2024-06-28 01:49:48,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:48,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:48,965 INFO 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:48,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:48,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955782060] [2024-06-28 01:49:48,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955782060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:48,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:48,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:49:48,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780077905] [2024-06-28 01:49:48,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:48,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:49:48,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:48,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:49:48,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:49:49,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:49,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 73 transitions, 470 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:49,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:49,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:49,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:49,360 INFO L124 PetriNetUnfolderBase]: 521/1020 cut-off events. [2024-06-28 01:49:49,360 INFO L125 PetriNetUnfolderBase]: For 4918/4918 co-relation queries the response was YES. [2024-06-28 01:49:49,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4024 conditions, 1020 events. 521/1020 cut-off events. For 4918/4918 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5664 event pairs, 118 based on Foata normal form. 1/985 useless extension candidates. Maximal degree in co-relation 3989. Up to 643 conditions per place. [2024-06-28 01:49:49,367 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 69 selfloop transitions, 31 changer transitions 0/109 dead transitions. [2024-06-28 01:49:49,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 109 transitions, 888 flow [2024-06-28 01:49:49,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:49:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:49:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-28 01:49:49,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304054054054054 [2024-06-28 01:49:49,368 INFO L175 Difference]: Start difference. First operand has 81 places, 73 transitions, 470 flow. Second operand 8 states and 157 transitions. [2024-06-28 01:49:49,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 109 transitions, 888 flow [2024-06-28 01:49:49,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 109 transitions, 836 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-28 01:49:49,375 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 591 flow [2024-06-28 01:49:49,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=591, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2024-06-28 01:49:49,376 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2024-06-28 01:49:49,376 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 591 flow [2024-06-28 01:49:49,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:49,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:49,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:49,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 01:49:49,377 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:49,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:49,377 INFO L85 PathProgramCache]: Analyzing trace with hash 530485277, now seen corresponding path program 3 times [2024-06-28 01:49:49,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:49,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479990449] [2024-06-28 01:49:49,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:49,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:50,055 INFO 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:50,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:50,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479990449] [2024-06-28 01:49:50,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479990449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:50,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:50,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:49:50,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791254261] [2024-06-28 01:49:50,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:50,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:49:50,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:50,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:49:50,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:49:50,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:50,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 591 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:50,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:50,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:50,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:50,416 INFO L124 PetriNetUnfolderBase]: 519/1062 cut-off events. [2024-06-28 01:49:50,416 INFO L125 PetriNetUnfolderBase]: For 5839/5839 co-relation queries the response was YES. [2024-06-28 01:49:50,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4315 conditions, 1062 events. 519/1062 cut-off events. For 5839/5839 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6100 event pairs, 127 based on Foata normal form. 1/1018 useless extension candidates. Maximal degree in co-relation 4278. Up to 808 conditions per place. [2024-06-28 01:49:50,425 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 83 selfloop transitions, 14 changer transitions 0/106 dead transitions. [2024-06-28 01:49:50,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 106 transitions, 861 flow [2024-06-28 01:49:50,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:49:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:49:50,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-28 01:49:50,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:49:50,427 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 591 flow. Second operand 8 states and 148 transitions. [2024-06-28 01:49:50,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 106 transitions, 861 flow [2024-06-28 01:49:50,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 106 transitions, 815 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-06-28 01:49:50,436 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 578 flow [2024-06-28 01:49:50,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=578, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2024-06-28 01:49:50,437 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places. [2024-06-28 01:49:50,438 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 578 flow [2024-06-28 01:49:50,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:50,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:50,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:50,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 01:49:50,438 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:50,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:50,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1445543007, now seen corresponding path program 4 times [2024-06-28 01:49:50,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:50,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877335082] [2024-06-28 01:49:50,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:51,088 INFO 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:51,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:51,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877335082] [2024-06-28 01:49:51,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877335082] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:51,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:51,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:49:51,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353449412] [2024-06-28 01:49:51,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:51,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:49:51,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:51,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:49:51,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:49:51,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:51,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 578 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:51,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:51,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:51,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:51,485 INFO L124 PetriNetUnfolderBase]: 515/972 cut-off events. [2024-06-28 01:49:51,485 INFO L125 PetriNetUnfolderBase]: For 5623/5623 co-relation queries the response was YES. [2024-06-28 01:49:51,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4119 conditions, 972 events. 515/972 cut-off events. For 5623/5623 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5364 event pairs, 121 based on Foata normal form. 2/942 useless extension candidates. Maximal degree in co-relation 4080. Up to 714 conditions per place. [2024-06-28 01:49:51,498 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 76 selfloop transitions, 23 changer transitions 0/108 dead transitions. [2024-06-28 01:49:51,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 108 transitions, 860 flow [2024-06-28 01:49:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:49:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:49:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-28 01:49:51,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5236486486486487 [2024-06-28 01:49:51,500 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 578 flow. Second operand 8 states and 155 transitions. [2024-06-28 01:49:51,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 108 transitions, 860 flow [2024-06-28 01:49:51,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 108 transitions, 817 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-28 01:49:51,509 INFO L231 Difference]: Finished difference. Result has 91 places, 81 transitions, 587 flow [2024-06-28 01:49:51,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=587, PETRI_PLACES=91, PETRI_TRANSITIONS=81} [2024-06-28 01:49:51,509 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2024-06-28 01:49:51,509 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 81 transitions, 587 flow [2024-06-28 01:49:51,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:51,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:51,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:51,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 01:49:51,510 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:51,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:51,510 INFO L85 PathProgramCache]: Analyzing trace with hash 530497181, now seen corresponding path program 1 times [2024-06-28 01:49:51,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:51,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761444460] [2024-06-28 01:49:51,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:51,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:52,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:49:52,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:52,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761444460] [2024-06-28 01:49:52,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761444460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:52,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:52,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:49:52,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867300840] [2024-06-28 01:49:52,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:52,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:49:52,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:52,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:49:52,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:49:52,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:52,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 81 transitions, 587 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:49:52,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:52,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:52,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:53,110 INFO L124 PetriNetUnfolderBase]: 516/1042 cut-off events. [2024-06-28 01:49:53,110 INFO L125 PetriNetUnfolderBase]: For 5822/5822 co-relation queries the response was YES. [2024-06-28 01:49:53,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 1042 events. 516/1042 cut-off events. For 5822/5822 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5993 event pairs, 126 based on Foata normal form. 2/1003 useless extension candidates. Maximal degree in co-relation 4203. Up to 783 conditions per place. [2024-06-28 01:49:53,116 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 89 selfloop transitions, 15 changer transitions 0/113 dead transitions. [2024-06-28 01:49:53,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 113 transitions, 899 flow [2024-06-28 01:49:53,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:49:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:49:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-28 01:49:53,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984984984984985 [2024-06-28 01:49:53,117 INFO L175 Difference]: Start difference. First operand has 91 places, 81 transitions, 587 flow. Second operand 9 states and 166 transitions. [2024-06-28 01:49:53,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 113 transitions, 899 flow [2024-06-28 01:49:53,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 113 transitions, 825 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-28 01:49:53,125 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 559 flow [2024-06-28 01:49:53,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=559, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2024-06-28 01:49:53,125 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places. [2024-06-28 01:49:53,125 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 559 flow [2024-06-28 01:49:53,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:49:53,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:53,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:53,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 01:49:53,126 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:53,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:53,126 INFO L85 PathProgramCache]: Analyzing trace with hash -623259811, now seen corresponding path program 1 times [2024-06-28 01:49:53,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:53,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275949960] [2024-06-28 01:49:53,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:53,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:53,907 INFO 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:53,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:53,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275949960] [2024-06-28 01:49:53,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275949960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:53,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:53,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:49:53,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579273949] [2024-06-28 01:49:53,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:53,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:49:53,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:53,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:49:53,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:49:53,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:53,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 559 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:53,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:53,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:53,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:54,292 INFO L124 PetriNetUnfolderBase]: 527/1033 cut-off events. [2024-06-28 01:49:54,292 INFO L125 PetriNetUnfolderBase]: For 5976/5976 co-relation queries the response was YES. [2024-06-28 01:49:54,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4229 conditions, 1033 events. 527/1033 cut-off events. For 5976/5976 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5895 event pairs, 144 based on Foata normal form. 1/1002 useless extension candidates. Maximal degree in co-relation 4188. Up to 818 conditions per place. [2024-06-28 01:49:54,301 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 86 selfloop transitions, 16 changer transitions 0/111 dead transitions. [2024-06-28 01:49:54,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 111 transitions, 865 flow [2024-06-28 01:49:54,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:49:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:49:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-28 01:49:54,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:49:54,302 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 559 flow. Second operand 8 states and 152 transitions. [2024-06-28 01:49:54,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 111 transitions, 865 flow [2024-06-28 01:49:54,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 111 transitions, 829 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-28 01:49:54,316 INFO L231 Difference]: Finished difference. Result has 94 places, 84 transitions, 590 flow [2024-06-28 01:49:54,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=590, PETRI_PLACES=94, PETRI_TRANSITIONS=84} [2024-06-28 01:49:54,317 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2024-06-28 01:49:54,317 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 84 transitions, 590 flow [2024-06-28 01:49:54,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:54,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:54,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:54,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 01:49:54,318 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:54,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:54,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1352873981, now seen corresponding path program 2 times [2024-06-28 01:49:54,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:54,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60567000] [2024-06-28 01:49:54,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:54,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:55,264 INFO 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:55,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:55,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60567000] [2024-06-28 01:49:55,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60567000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:55,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:55,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:49:55,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120019259] [2024-06-28 01:49:55,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:55,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:49:55,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:55,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:49:55,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:49:55,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:55,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 84 transitions, 590 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:55,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:55,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:55,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:55,676 INFO L124 PetriNetUnfolderBase]: 538/1057 cut-off events. [2024-06-28 01:49:55,677 INFO L125 PetriNetUnfolderBase]: For 6676/6676 co-relation queries the response was YES. [2024-06-28 01:49:55,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4392 conditions, 1057 events. 538/1057 cut-off events. For 6676/6676 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6062 event pairs, 136 based on Foata normal form. 1/1025 useless extension candidates. Maximal degree in co-relation 4350. Up to 782 conditions per place. [2024-06-28 01:49:55,683 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 82 selfloop transitions, 22 changer transitions 0/113 dead transitions. [2024-06-28 01:49:55,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 113 transitions, 908 flow [2024-06-28 01:49:55,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:49:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:49:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-28 01:49:55,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168918918918919 [2024-06-28 01:49:55,685 INFO L175 Difference]: Start difference. First operand has 94 places, 84 transitions, 590 flow. Second operand 8 states and 153 transitions. [2024-06-28 01:49:55,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 113 transitions, 908 flow [2024-06-28 01:49:55,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 113 transitions, 857 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-28 01:49:55,693 INFO L231 Difference]: Finished difference. Result has 96 places, 86 transitions, 622 flow [2024-06-28 01:49:55,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=622, PETRI_PLACES=96, PETRI_TRANSITIONS=86} [2024-06-28 01:49:55,693 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2024-06-28 01:49:55,693 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 86 transitions, 622 flow [2024-06-28 01:49:55,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:55,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:55,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:55,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 01:49:55,694 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:55,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:55,694 INFO L85 PathProgramCache]: Analyzing trace with hash -391625221, now seen corresponding path program 1 times [2024-06-28 01:49:55,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:55,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73381423] [2024-06-28 01:49:55,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:55,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:56,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:49:56,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:56,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73381423] [2024-06-28 01:49:56,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73381423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:56,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:56,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:49:56,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010623028] [2024-06-28 01:49:56,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:56,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:49:56,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:56,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:49:56,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:49:56,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:56,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 86 transitions, 622 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:49:56,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:56,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:56,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:56,901 INFO L124 PetriNetUnfolderBase]: 560/1082 cut-off events. [2024-06-28 01:49:56,902 INFO L125 PetriNetUnfolderBase]: For 7852/7852 co-relation queries the response was YES. [2024-06-28 01:49:56,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4647 conditions, 1082 events. 560/1082 cut-off events. For 7852/7852 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6177 event pairs, 136 based on Foata normal form. 2/1053 useless extension candidates. Maximal degree in co-relation 4604. Up to 816 conditions per place. [2024-06-28 01:49:56,907 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 92 selfloop transitions, 20 changer transitions 0/121 dead transitions. [2024-06-28 01:49:56,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 121 transitions, 982 flow [2024-06-28 01:49:56,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:49:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:49:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-28 01:49:56,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165165165165165 [2024-06-28 01:49:56,908 INFO L175 Difference]: Start difference. First operand has 96 places, 86 transitions, 622 flow. Second operand 9 states and 172 transitions. [2024-06-28 01:49:56,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 121 transitions, 982 flow [2024-06-28 01:49:56,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 121 transitions, 915 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-28 01:49:56,918 INFO L231 Difference]: Finished difference. Result has 99 places, 89 transitions, 647 flow [2024-06-28 01:49:56,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=647, PETRI_PLACES=99, PETRI_TRANSITIONS=89} [2024-06-28 01:49:56,918 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2024-06-28 01:49:56,918 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 89 transitions, 647 flow [2024-06-28 01:49:56,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:49:56,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:56,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:56,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 01:49:56,919 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:56,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:56,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1030052931, now seen corresponding path program 3 times [2024-06-28 01:49:56,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:56,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859404219] [2024-06-28 01:49:56,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:56,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:57,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:49:57,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:57,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859404219] [2024-06-28 01:49:57,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859404219] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:57,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:57,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:49:57,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707098100] [2024-06-28 01:49:57,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:57,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:49:57,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:57,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:49:57,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:49:57,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:57,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 89 transitions, 647 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:57,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:57,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:57,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:58,106 INFO L124 PetriNetUnfolderBase]: 571/1095 cut-off events. [2024-06-28 01:49:58,107 INFO L125 PetriNetUnfolderBase]: For 8542/8542 co-relation queries the response was YES. [2024-06-28 01:49:58,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4850 conditions, 1095 events. 571/1095 cut-off events. For 8542/8542 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6277 event pairs, 125 based on Foata normal form. 1/1062 useless extension candidates. Maximal degree in co-relation 4806. Up to 835 conditions per place. [2024-06-28 01:49:58,113 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 91 selfloop transitions, 18 changer transitions 0/118 dead transitions. [2024-06-28 01:49:58,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 118 transitions, 985 flow [2024-06-28 01:49:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:49:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:49:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-28 01:49:58,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168918918918919 [2024-06-28 01:49:58,114 INFO L175 Difference]: Start difference. First operand has 99 places, 89 transitions, 647 flow. Second operand 8 states and 153 transitions. [2024-06-28 01:49:58,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 118 transitions, 985 flow [2024-06-28 01:49:58,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 118 transitions, 915 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-28 01:49:58,126 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 658 flow [2024-06-28 01:49:58,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=658, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2024-06-28 01:49:58,127 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2024-06-28 01:49:58,127 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 658 flow [2024-06-28 01:49:58,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:58,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:58,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:58,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 01:49:58,127 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:58,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:58,128 INFO L85 PathProgramCache]: Analyzing trace with hash -744953061, now seen corresponding path program 4 times [2024-06-28 01:49:58,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:58,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11168974] [2024-06-28 01:49:58,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:58,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:49:59,016 INFO 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:59,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:49:59,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11168974] [2024-06-28 01:49:59,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11168974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:49:59,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:49:59,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:49:59,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095711471] [2024-06-28 01:49:59,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:49:59,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:49:59,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:49:59,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:49:59,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:49:59,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:49:59,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 658 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:59,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:49:59,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:49:59,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:49:59,454 INFO L124 PetriNetUnfolderBase]: 572/1110 cut-off events. [2024-06-28 01:49:59,454 INFO L125 PetriNetUnfolderBase]: For 9220/9220 co-relation queries the response was YES. [2024-06-28 01:49:59,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4850 conditions, 1110 events. 572/1110 cut-off events. For 9220/9220 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6438 event pairs, 123 based on Foata normal form. 1/1075 useless extension candidates. Maximal degree in co-relation 4805. Up to 771 conditions per place. [2024-06-28 01:49:59,460 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 84 selfloop transitions, 26 changer transitions 0/119 dead transitions. [2024-06-28 01:49:59,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 119 transitions, 998 flow [2024-06-28 01:49:59,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:49:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:49:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-28 01:49:59,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168918918918919 [2024-06-28 01:49:59,461 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 658 flow. Second operand 8 states and 153 transitions. [2024-06-28 01:49:59,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 119 transitions, 998 flow [2024-06-28 01:49:59,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 119 transitions, 933 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-28 01:49:59,476 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 694 flow [2024-06-28 01:49:59,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=694, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2024-06-28 01:49:59,477 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2024-06-28 01:49:59,477 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 694 flow [2024-06-28 01:49:59,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:59,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:49:59,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:49:59,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 01:49:59,477 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:49:59,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:49:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash -744944133, now seen corresponding path program 2 times [2024-06-28 01:49:59,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:49:59,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574339165] [2024-06-28 01:49:59,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:49:59,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:49:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:50:00,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:00,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574339165] [2024-06-28 01:50:00,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574339165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:00,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:00,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:00,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043798401] [2024-06-28 01:50:00,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:00,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:00,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:00,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:00,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:00,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:00,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 694 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:00,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:00,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:00,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:00,819 INFO L124 PetriNetUnfolderBase]: 583/1145 cut-off events. [2024-06-28 01:50:00,819 INFO L125 PetriNetUnfolderBase]: For 9857/9857 co-relation queries the response was YES. [2024-06-28 01:50:00,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5007 conditions, 1145 events. 583/1145 cut-off events. For 9857/9857 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6556 event pairs, 119 based on Foata normal form. 1/1106 useless extension candidates. Maximal degree in co-relation 4961. Up to 733 conditions per place. [2024-06-28 01:50:00,825 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 84 selfloop transitions, 33 changer transitions 0/126 dead transitions. [2024-06-28 01:50:00,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 126 transitions, 1046 flow [2024-06-28 01:50:00,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-28 01:50:00,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195195195195195 [2024-06-28 01:50:00,827 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 694 flow. Second operand 9 states and 173 transitions. [2024-06-28 01:50:00,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 126 transitions, 1046 flow [2024-06-28 01:50:00,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 126 transitions, 961 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-28 01:50:00,845 INFO L231 Difference]: Finished difference. Result has 105 places, 95 transitions, 706 flow [2024-06-28 01:50:00,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=706, PETRI_PLACES=105, PETRI_TRANSITIONS=95} [2024-06-28 01:50:00,846 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2024-06-28 01:50:00,846 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 95 transitions, 706 flow [2024-06-28 01:50:00,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:00,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:00,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:50:00,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 01:50:00,847 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:00,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:00,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1030044003, now seen corresponding path program 3 times [2024-06-28 01:50:00,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:00,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152104432] [2024-06-28 01:50:00,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:00,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:50:01,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:01,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152104432] [2024-06-28 01:50:01,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152104432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:01,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:01,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:01,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562743203] [2024-06-28 01:50:01,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:01,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:01,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:01,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:01,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:02,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:02,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 95 transitions, 706 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:02,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:02,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:02,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:02,381 INFO L124 PetriNetUnfolderBase]: 605/1147 cut-off events. [2024-06-28 01:50:02,381 INFO L125 PetriNetUnfolderBase]: For 10739/10739 co-relation queries the response was YES. [2024-06-28 01:50:02,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5240 conditions, 1147 events. 605/1147 cut-off events. For 10739/10739 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6597 event pairs, 126 based on Foata normal form. 2/1112 useless extension candidates. Maximal degree in co-relation 5193. Up to 833 conditions per place. [2024-06-28 01:50:02,388 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 95 selfloop transitions, 26 changer transitions 0/130 dead transitions. [2024-06-28 01:50:02,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 130 transitions, 1102 flow [2024-06-28 01:50:02,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-28 01:50:02,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225225225225225 [2024-06-28 01:50:02,389 INFO L175 Difference]: Start difference. First operand has 105 places, 95 transitions, 706 flow. Second operand 9 states and 174 transitions. [2024-06-28 01:50:02,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 130 transitions, 1102 flow [2024-06-28 01:50:02,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 130 transitions, 1021 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-28 01:50:02,405 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 743 flow [2024-06-28 01:50:02,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=743, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2024-06-28 01:50:02,405 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2024-06-28 01:50:02,405 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 743 flow [2024-06-28 01:50:02,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:02,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:02,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:50:02,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 01:50:02,406 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:02,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:02,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1021701903, now seen corresponding path program 4 times [2024-06-28 01:50:02,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:02,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61775883] [2024-06-28 01:50:02,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:02,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:03,422 INFO 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:50:03,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:03,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61775883] [2024-06-28 01:50:03,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61775883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:03,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:03,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:03,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359797720] [2024-06-28 01:50:03,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:03,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:03,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:03,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:03,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:03,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:03,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 743 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:03,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:03,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:03,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:03,980 INFO L124 PetriNetUnfolderBase]: 619/1222 cut-off events. [2024-06-28 01:50:03,980 INFO L125 PetriNetUnfolderBase]: For 11892/11892 co-relation queries the response was YES. [2024-06-28 01:50:03,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5486 conditions, 1222 events. 619/1222 cut-off events. For 11892/11892 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7246 event pairs, 136 based on Foata normal form. 1/1181 useless extension candidates. Maximal degree in co-relation 5438. Up to 931 conditions per place. [2024-06-28 01:50:03,988 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 109 selfloop transitions, 20 changer transitions 0/138 dead transitions. [2024-06-28 01:50:03,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 138 transitions, 1219 flow [2024-06-28 01:50:04,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:50:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:50:04,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-06-28 01:50:04,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027027027027027 [2024-06-28 01:50:04,002 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 743 flow. Second operand 10 states and 186 transitions. [2024-06-28 01:50:04,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 138 transitions, 1219 flow [2024-06-28 01:50:04,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 138 transitions, 1123 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-28 01:50:04,018 INFO L231 Difference]: Finished difference. Result has 110 places, 102 transitions, 756 flow [2024-06-28 01:50:04,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=756, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2024-06-28 01:50:04,019 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2024-06-28 01:50:04,019 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 756 flow [2024-06-28 01:50:04,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:04,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:04,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:50:04,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 01:50:04,020 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:04,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:04,020 INFO L85 PathProgramCache]: Analyzing trace with hash -734824803, now seen corresponding path program 5 times [2024-06-28 01:50:04,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:04,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621839075] [2024-06-28 01:50:04,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:04,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:04,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:50:04,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:04,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621839075] [2024-06-28 01:50:04,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621839075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:04,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:04,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:04,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429528881] [2024-06-28 01:50:04,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:04,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:04,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:04,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:04,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:05,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:05,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 756 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:05,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:05,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:05,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:05,434 INFO L124 PetriNetUnfolderBase]: 617/1216 cut-off events. [2024-06-28 01:50:05,434 INFO L125 PetriNetUnfolderBase]: For 11541/11541 co-relation queries the response was YES. [2024-06-28 01:50:05,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5310 conditions, 1216 events. 617/1216 cut-off events. For 11541/11541 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7196 event pairs, 136 based on Foata normal form. 1/1176 useless extension candidates. Maximal degree in co-relation 5261. Up to 929 conditions per place. [2024-06-28 01:50:05,442 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 100 selfloop transitions, 18 changer transitions 0/127 dead transitions. [2024-06-28 01:50:05,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 127 transitions, 1068 flow [2024-06-28 01:50:05,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:50:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:50:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-28 01:50:05,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067567567567568 [2024-06-28 01:50:05,448 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 756 flow. Second operand 8 states and 150 transitions. [2024-06-28 01:50:05,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 127 transitions, 1068 flow [2024-06-28 01:50:05,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 127 transitions, 999 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-28 01:50:05,463 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 732 flow [2024-06-28 01:50:05,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=732, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2024-06-28 01:50:05,464 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2024-06-28 01:50:05,464 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 732 flow [2024-06-28 01:50:05,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:05,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:05,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:50:05,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 01:50:05,465 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:05,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:05,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1002902260, now seen corresponding path program 1 times [2024-06-28 01:50:05,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:05,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157649152] [2024-06-28 01:50:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:05,524 INFO 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:50:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:05,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157649152] [2024-06-28 01:50:05,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157649152] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:05,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:05,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:50:05,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093262737] [2024-06-28 01:50:05,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:05,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:50:05,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:05,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:50:05,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:50:05,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-28 01:50:05,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 732 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:05,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:05,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-28 01:50:05,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:05,792 INFO L124 PetriNetUnfolderBase]: 707/1424 cut-off events. [2024-06-28 01:50:05,792 INFO L125 PetriNetUnfolderBase]: For 11863/11898 co-relation queries the response was YES. [2024-06-28 01:50:05,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6089 conditions, 1424 events. 707/1424 cut-off events. For 11863/11898 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9305 event pairs, 112 based on Foata normal form. 19/1362 useless extension candidates. Maximal degree in co-relation 6039. Up to 498 conditions per place. [2024-06-28 01:50:05,802 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 83 selfloop transitions, 9 changer transitions 59/201 dead transitions. [2024-06-28 01:50:05,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 201 transitions, 1735 flow [2024-06-28 01:50:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:50:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:50:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-06-28 01:50:05,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2024-06-28 01:50:05,804 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 732 flow. Second operand 8 states and 178 transitions. [2024-06-28 01:50:05,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 201 transitions, 1735 flow [2024-06-28 01:50:05,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 201 transitions, 1672 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-28 01:50:05,825 INFO L231 Difference]: Finished difference. Result has 117 places, 105 transitions, 744 flow [2024-06-28 01:50:05,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=744, PETRI_PLACES=117, PETRI_TRANSITIONS=105} [2024-06-28 01:50:05,830 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2024-06-28 01:50:05,830 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 105 transitions, 744 flow [2024-06-28 01:50:05,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:05,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:05,830 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:50:05,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 01:50:05,831 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:05,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:05,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1113007152, now seen corresponding path program 1 times [2024-06-28 01:50:05,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:05,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284462167] [2024-06-28 01:50:05,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:05,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:50:06,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:06,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284462167] [2024-06-28 01:50:06,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284462167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:06,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:06,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:50:06,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704812743] [2024-06-28 01:50:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:06,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:50:06,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:06,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:50:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:50:06,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:06,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 105 transitions, 744 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:06,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:06,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:06,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:06,933 INFO L124 PetriNetUnfolderBase]: 624/1240 cut-off events. [2024-06-28 01:50:06,933 INFO L125 PetriNetUnfolderBase]: For 11514/11521 co-relation queries the response was YES. [2024-06-28 01:50:06,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5651 conditions, 1240 events. 624/1240 cut-off events. For 11514/11521 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7423 event pairs, 103 based on Foata normal form. 9/1244 useless extension candidates. Maximal degree in co-relation 5597. Up to 931 conditions per place. [2024-06-28 01:50:06,940 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 104 selfloop transitions, 18 changer transitions 7/139 dead transitions. [2024-06-28 01:50:06,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 139 transitions, 1124 flow [2024-06-28 01:50:06,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:50:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:50:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-28 01:50:06,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5236486486486487 [2024-06-28 01:50:06,941 INFO L175 Difference]: Start difference. First operand has 117 places, 105 transitions, 744 flow. Second operand 8 states and 155 transitions. [2024-06-28 01:50:06,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 139 transitions, 1124 flow [2024-06-28 01:50:06,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 139 transitions, 1120 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 01:50:06,958 INFO L231 Difference]: Finished difference. Result has 122 places, 106 transitions, 806 flow [2024-06-28 01:50:06,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=806, PETRI_PLACES=122, PETRI_TRANSITIONS=106} [2024-06-28 01:50:06,960 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 81 predicate places. [2024-06-28 01:50:06,960 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 106 transitions, 806 flow [2024-06-28 01:50:06,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:06,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:06,961 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:50:06,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 01:50:06,961 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:06,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:06,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1330291392, now seen corresponding path program 2 times [2024-06-28 01:50:06,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:06,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737607097] [2024-06-28 01:50:06,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:06,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:07,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:50:07,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:07,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737607097] [2024-06-28 01:50:07,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737607097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:07,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:07,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:50:07,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560037944] [2024-06-28 01:50:07,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:07,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:50:07,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:07,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:50:07,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:50:07,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:07,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 106 transitions, 806 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:07,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:07,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:07,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:08,099 INFO L124 PetriNetUnfolderBase]: 615/1208 cut-off events. [2024-06-28 01:50:08,099 INFO L125 PetriNetUnfolderBase]: For 12454/12464 co-relation queries the response was YES. [2024-06-28 01:50:08,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5674 conditions, 1208 events. 615/1208 cut-off events. For 12454/12464 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7085 event pairs, 141 based on Foata normal form. 12/1215 useless extension candidates. Maximal degree in co-relation 5617. Up to 950 conditions per place. [2024-06-28 01:50:08,105 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 105 selfloop transitions, 20 changer transitions 0/135 dead transitions. [2024-06-28 01:50:08,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 135 transitions, 1196 flow [2024-06-28 01:50:08,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:50:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:50:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-28 01:50:08,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067567567567568 [2024-06-28 01:50:08,107 INFO L175 Difference]: Start difference. First operand has 122 places, 106 transitions, 806 flow. Second operand 8 states and 150 transitions. [2024-06-28 01:50:08,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 135 transitions, 1196 flow [2024-06-28 01:50:08,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 135 transitions, 1130 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-28 01:50:08,124 INFO L231 Difference]: Finished difference. Result has 122 places, 109 transitions, 857 flow [2024-06-28 01:50:08,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=857, PETRI_PLACES=122, PETRI_TRANSITIONS=109} [2024-06-28 01:50:08,125 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 81 predicate places. [2024-06-28 01:50:08,125 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 109 transitions, 857 flow [2024-06-28 01:50:08,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:08,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:08,125 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:50:08,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 01:50:08,125 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:08,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:08,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1327460100, now seen corresponding path program 1 times [2024-06-28 01:50:08,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:08,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906035944] [2024-06-28 01:50:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:08,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:09,063 INFO 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:50:09,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:09,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906035944] [2024-06-28 01:50:09,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906035944] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:09,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:09,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:09,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682180046] [2024-06-28 01:50:09,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:09,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:09,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:09,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:09,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:09,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:09,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 109 transitions, 857 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:09,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:09,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:09,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:09,584 INFO L124 PetriNetUnfolderBase]: 629/1241 cut-off events. [2024-06-28 01:50:09,585 INFO L125 PetriNetUnfolderBase]: For 13848/13856 co-relation queries the response was YES. [2024-06-28 01:50:09,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5823 conditions, 1241 events. 629/1241 cut-off events. For 13848/13856 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7350 event pairs, 141 based on Foata normal form. 9/1212 useless extension candidates. Maximal degree in co-relation 5767. Up to 966 conditions per place. [2024-06-28 01:50:09,592 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 109 selfloop transitions, 25 changer transitions 0/144 dead transitions. [2024-06-28 01:50:09,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 144 transitions, 1313 flow [2024-06-28 01:50:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-28 01:50:09,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2024-06-28 01:50:09,605 INFO L175 Difference]: Start difference. First operand has 122 places, 109 transitions, 857 flow. Second operand 9 states and 169 transitions. [2024-06-28 01:50:09,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 144 transitions, 1313 flow [2024-06-28 01:50:09,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 144 transitions, 1248 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-28 01:50:09,623 INFO L231 Difference]: Finished difference. Result has 128 places, 113 transitions, 948 flow [2024-06-28 01:50:09,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=948, PETRI_PLACES=128, PETRI_TRANSITIONS=113} [2024-06-28 01:50:09,623 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 87 predicate places. [2024-06-28 01:50:09,623 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 113 transitions, 948 flow [2024-06-28 01:50:09,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:09,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:09,624 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:50:09,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 01:50:09,624 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:09,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1017936388, now seen corresponding path program 3 times [2024-06-28 01:50:09,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:09,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310966134] [2024-06-28 01:50:09,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:50:10,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:10,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310966134] [2024-06-28 01:50:10,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310966134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:10,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:10,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:50:10,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997758064] [2024-06-28 01:50:10,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:10,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:50:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:10,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:50:10,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:50:10,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:10,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 113 transitions, 948 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:10,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:10,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:10,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:10,588 INFO L124 PetriNetUnfolderBase]: 642/1257 cut-off events. [2024-06-28 01:50:10,588 INFO L125 PetriNetUnfolderBase]: For 15165/15176 co-relation queries the response was YES. [2024-06-28 01:50:10,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6056 conditions, 1257 events. 642/1257 cut-off events. For 15165/15176 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7413 event pairs, 144 based on Foata normal form. 13/1233 useless extension candidates. Maximal degree in co-relation 5997. Up to 1006 conditions per place. [2024-06-28 01:50:10,595 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 116 selfloop transitions, 14 changer transitions 0/140 dead transitions. [2024-06-28 01:50:10,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 140 transitions, 1316 flow [2024-06-28 01:50:10,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:50:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:50:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-28 01:50:10,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4966216216216216 [2024-06-28 01:50:10,597 INFO L175 Difference]: Start difference. First operand has 128 places, 113 transitions, 948 flow. Second operand 8 states and 147 transitions. [2024-06-28 01:50:10,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 140 transitions, 1316 flow [2024-06-28 01:50:10,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 140 transitions, 1205 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-28 01:50:10,617 INFO L231 Difference]: Finished difference. Result has 131 places, 116 transitions, 906 flow [2024-06-28 01:50:10,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=906, PETRI_PLACES=131, PETRI_TRANSITIONS=116} [2024-06-28 01:50:10,617 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 90 predicate places. [2024-06-28 01:50:10,617 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 116 transitions, 906 flow [2024-06-28 01:50:10,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:10,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:10,618 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:50:10,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 01:50:10,618 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:10,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:10,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1211073390, now seen corresponding path program 2 times [2024-06-28 01:50:10,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:10,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009970699] [2024-06-28 01:50:10,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:10,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:11,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:50:11,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:11,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009970699] [2024-06-28 01:50:11,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009970699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:11,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:11,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:11,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345678265] [2024-06-28 01:50:11,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:11,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:11,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:11,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:11,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:11,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 116 transitions, 906 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:11,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:11,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:11,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:11,962 INFO L124 PetriNetUnfolderBase]: 666/1296 cut-off events. [2024-06-28 01:50:11,962 INFO L125 PetriNetUnfolderBase]: For 15711/15719 co-relation queries the response was YES. [2024-06-28 01:50:11,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6319 conditions, 1296 events. 666/1296 cut-off events. For 15711/15719 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7685 event pairs, 139 based on Foata normal form. 9/1270 useless extension candidates. Maximal degree in co-relation 6258. Up to 985 conditions per place. [2024-06-28 01:50:11,970 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 118 selfloop transitions, 23 changer transitions 0/151 dead transitions. [2024-06-28 01:50:11,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 151 transitions, 1434 flow [2024-06-28 01:50:11,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-28 01:50:11,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165165165165165 [2024-06-28 01:50:11,971 INFO L175 Difference]: Start difference. First operand has 131 places, 116 transitions, 906 flow. Second operand 9 states and 172 transitions. [2024-06-28 01:50:11,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 151 transitions, 1434 flow [2024-06-28 01:50:11,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 151 transitions, 1396 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-28 01:50:11,992 INFO L231 Difference]: Finished difference. Result has 135 places, 120 transitions, 1007 flow [2024-06-28 01:50:11,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1007, PETRI_PLACES=135, PETRI_TRANSITIONS=120} [2024-06-28 01:50:11,992 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 94 predicate places. [2024-06-28 01:50:11,992 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 120 transitions, 1007 flow [2024-06-28 01:50:11,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:11,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:11,993 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:50:11,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 01:50:11,993 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:11,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1010311876, now seen corresponding path program 3 times [2024-06-28 01:50:11,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:11,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860279233] [2024-06-28 01:50:11,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:11,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:50:12,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:12,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860279233] [2024-06-28 01:50:12,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860279233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:12,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:12,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:12,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314231824] [2024-06-28 01:50:12,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:12,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:12,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:12,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:12,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:12,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:12,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 120 transitions, 1007 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:12,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:12,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:12,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:13,274 INFO L124 PetriNetUnfolderBase]: 664/1302 cut-off events. [2024-06-28 01:50:13,274 INFO L125 PetriNetUnfolderBase]: For 16288/16296 co-relation queries the response was YES. [2024-06-28 01:50:13,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6367 conditions, 1302 events. 664/1302 cut-off events. For 16288/16296 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7774 event pairs, 138 based on Foata normal form. 9/1275 useless extension candidates. Maximal degree in co-relation 6305. Up to 983 conditions per place. [2024-06-28 01:50:13,281 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 117 selfloop transitions, 23 changer transitions 0/150 dead transitions. [2024-06-28 01:50:13,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 150 transitions, 1391 flow [2024-06-28 01:50:13,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-28 01:50:13,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105105105105106 [2024-06-28 01:50:13,282 INFO L175 Difference]: Start difference. First operand has 135 places, 120 transitions, 1007 flow. Second operand 9 states and 170 transitions. [2024-06-28 01:50:13,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 150 transitions, 1391 flow [2024-06-28 01:50:13,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 150 transitions, 1294 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-06-28 01:50:13,308 INFO L231 Difference]: Finished difference. Result has 139 places, 120 transitions, 961 flow [2024-06-28 01:50:13,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=961, PETRI_PLACES=139, PETRI_TRANSITIONS=120} [2024-06-28 01:50:13,308 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 98 predicate places. [2024-06-28 01:50:13,308 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 120 transitions, 961 flow [2024-06-28 01:50:13,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:13,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:13,308 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:50:13,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 01:50:13,308 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:13,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash -145348488, now seen corresponding path program 1 times [2024-06-28 01:50:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:13,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26521990] [2024-06-28 01:50:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:13,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:50:14,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:14,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26521990] [2024-06-28 01:50:14,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26521990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:14,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:14,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:14,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103428565] [2024-06-28 01:50:14,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:14,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:14,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:14,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:14,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:50:14,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:14,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 120 transitions, 961 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:14,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:14,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:14,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:14,827 INFO L124 PetriNetUnfolderBase]: 732/1423 cut-off events. [2024-06-28 01:50:14,827 INFO L125 PetriNetUnfolderBase]: For 21199/21207 co-relation queries the response was YES. [2024-06-28 01:50:14,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6943 conditions, 1423 events. 732/1423 cut-off events. For 21199/21207 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8644 event pairs, 149 based on Foata normal form. 18/1406 useless extension candidates. Maximal degree in co-relation 6879. Up to 988 conditions per place. [2024-06-28 01:50:14,835 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 128 selfloop transitions, 22 changer transitions 0/160 dead transitions. [2024-06-28 01:50:14,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 160 transitions, 1457 flow [2024-06-28 01:50:14,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:50:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:50:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-28 01:50:14,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518918918918919 [2024-06-28 01:50:14,836 INFO L175 Difference]: Start difference. First operand has 139 places, 120 transitions, 961 flow. Second operand 10 states and 192 transitions. [2024-06-28 01:50:14,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 160 transitions, 1457 flow [2024-06-28 01:50:14,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 160 transitions, 1406 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-28 01:50:14,863 INFO L231 Difference]: Finished difference. Result has 141 places, 121 transitions, 983 flow [2024-06-28 01:50:14,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=983, PETRI_PLACES=141, PETRI_TRANSITIONS=121} [2024-06-28 01:50:14,864 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 100 predicate places. [2024-06-28 01:50:14,864 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 121 transitions, 983 flow [2024-06-28 01:50:14,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:14,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:14,864 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:50:14,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 01:50:14,864 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:14,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:14,865 INFO L85 PathProgramCache]: Analyzing trace with hash -258034118, now seen corresponding path program 4 times [2024-06-28 01:50:14,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:14,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676666448] [2024-06-28 01:50:14,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:14,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:50:15,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:15,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676666448] [2024-06-28 01:50:15,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676666448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:15,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:15,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:50:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883117160] [2024-06-28 01:50:15,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:15,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:50:15,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:15,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:50:15,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:50:15,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:15,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 121 transitions, 983 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:15,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:15,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:15,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:15,816 INFO L124 PetriNetUnfolderBase]: 730/1360 cut-off events. [2024-06-28 01:50:15,816 INFO L125 PetriNetUnfolderBase]: For 17923/17937 co-relation queries the response was YES. [2024-06-28 01:50:15,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6820 conditions, 1360 events. 730/1360 cut-off events. For 17923/17937 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8001 event pairs, 146 based on Foata normal form. 16/1353 useless extension candidates. Maximal degree in co-relation 6755. Up to 1140 conditions per place. [2024-06-28 01:50:15,824 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 119 selfloop transitions, 17 changer transitions 0/146 dead transitions. [2024-06-28 01:50:15,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 146 transitions, 1365 flow [2024-06-28 01:50:15,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:50:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:50:15,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-28 01:50:15,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4966216216216216 [2024-06-28 01:50:15,826 INFO L175 Difference]: Start difference. First operand has 141 places, 121 transitions, 983 flow. Second operand 8 states and 147 transitions. [2024-06-28 01:50:15,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 146 transitions, 1365 flow [2024-06-28 01:50:15,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 146 transitions, 1318 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-28 01:50:15,854 INFO L231 Difference]: Finished difference. Result has 141 places, 123 transitions, 1004 flow [2024-06-28 01:50:15,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1004, PETRI_PLACES=141, PETRI_TRANSITIONS=123} [2024-06-28 01:50:15,855 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 100 predicate places. [2024-06-28 01:50:15,855 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 123 transitions, 1004 flow [2024-06-28 01:50:15,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:15,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:15,855 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:50:15,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 01:50:15,855 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:15,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:15,855 INFO L85 PathProgramCache]: Analyzing trace with hash -778332932, now seen corresponding path program 4 times [2024-06-28 01:50:15,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:15,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27634720] [2024-06-28 01:50:15,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:15,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:16,599 INFO 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:50:16,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:16,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27634720] [2024-06-28 01:50:16,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27634720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:16,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:16,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:16,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245925381] [2024-06-28 01:50:16,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:16,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:16,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:16,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:16,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:16,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 123 transitions, 1004 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:16,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:16,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:16,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:17,123 INFO L124 PetriNetUnfolderBase]: 820/1563 cut-off events. [2024-06-28 01:50:17,123 INFO L125 PetriNetUnfolderBase]: For 26886/26898 co-relation queries the response was YES. [2024-06-28 01:50:17,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8376 conditions, 1563 events. 820/1563 cut-off events. For 26886/26898 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9454 event pairs, 131 based on Foata normal form. 14/1544 useless extension candidates. Maximal degree in co-relation 8310. Up to 871 conditions per place. [2024-06-28 01:50:17,132 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 111 selfloop transitions, 47 changer transitions 0/168 dead transitions. [2024-06-28 01:50:17,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 168 transitions, 1862 flow [2024-06-28 01:50:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2024-06-28 01:50:17,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5435435435435435 [2024-06-28 01:50:17,133 INFO L175 Difference]: Start difference. First operand has 141 places, 123 transitions, 1004 flow. Second operand 9 states and 181 transitions. [2024-06-28 01:50:17,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 168 transitions, 1862 flow [2024-06-28 01:50:17,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 168 transitions, 1802 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-28 01:50:17,165 INFO L231 Difference]: Finished difference. Result has 143 places, 132 transitions, 1247 flow [2024-06-28 01:50:17,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1247, PETRI_PLACES=143, PETRI_TRANSITIONS=132} [2024-06-28 01:50:17,165 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 102 predicate places. [2024-06-28 01:50:17,166 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 1247 flow [2024-06-28 01:50:17,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:17,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:17,166 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:50:17,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 01:50:17,166 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:17,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:17,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1866869026, now seen corresponding path program 5 times [2024-06-28 01:50:17,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:17,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500595892] [2024-06-28 01:50:17,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:17,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:18,135 INFO 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:50:18,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:18,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500595892] [2024-06-28 01:50:18,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500595892] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:18,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:18,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:18,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458293504] [2024-06-28 01:50:18,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:18,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:18,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:18,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:18,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:18,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:18,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 1247 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:18,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:18,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:18,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:18,735 INFO L124 PetriNetUnfolderBase]: 831/1548 cut-off events. [2024-06-28 01:50:18,736 INFO L125 PetriNetUnfolderBase]: For 28914/28928 co-relation queries the response was YES. [2024-06-28 01:50:18,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8793 conditions, 1548 events. 831/1548 cut-off events. For 28914/28928 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9376 event pairs, 150 based on Foata normal form. 15/1538 useless extension candidates. Maximal degree in co-relation 8727. Up to 1238 conditions per place. [2024-06-28 01:50:18,746 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 130 selfloop transitions, 26 changer transitions 0/166 dead transitions. [2024-06-28 01:50:18,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 166 transitions, 1835 flow [2024-06-28 01:50:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-28 01:50:18,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165165165165165 [2024-06-28 01:50:18,747 INFO L175 Difference]: Start difference. First operand has 143 places, 132 transitions, 1247 flow. Second operand 9 states and 172 transitions. [2024-06-28 01:50:18,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 166 transitions, 1835 flow [2024-06-28 01:50:18,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 166 transitions, 1748 flow, removed 35 selfloop flow, removed 3 redundant places. [2024-06-28 01:50:18,812 INFO L231 Difference]: Finished difference. Result has 149 places, 136 transitions, 1321 flow [2024-06-28 01:50:18,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1321, PETRI_PLACES=149, PETRI_TRANSITIONS=136} [2024-06-28 01:50:18,812 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 108 predicate places. [2024-06-28 01:50:18,812 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 136 transitions, 1321 flow [2024-06-28 01:50:18,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:18,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:18,813 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:50:18,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 01:50:18,813 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:18,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:18,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1866602116, now seen corresponding path program 6 times [2024-06-28 01:50:18,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:18,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547532961] [2024-06-28 01:50:18,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:19,573 INFO 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:50:19,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:19,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547532961] [2024-06-28 01:50:19,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547532961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:19,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:19,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:19,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126960801] [2024-06-28 01:50:19,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:19,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:19,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:19,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:19,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:19,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:19,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 136 transitions, 1321 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:19,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:19,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:19,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:20,084 INFO L124 PetriNetUnfolderBase]: 853/1600 cut-off events. [2024-06-28 01:50:20,085 INFO L125 PetriNetUnfolderBase]: For 29024/29038 co-relation queries the response was YES. [2024-06-28 01:50:20,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8994 conditions, 1600 events. 853/1600 cut-off events. For 29024/29038 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9778 event pairs, 152 based on Foata normal form. 16/1589 useless extension candidates. Maximal degree in co-relation 8926. Up to 1222 conditions per place. [2024-06-28 01:50:20,095 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 129 selfloop transitions, 31 changer transitions 0/170 dead transitions. [2024-06-28 01:50:20,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 170 transitions, 1919 flow [2024-06-28 01:50:20,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-28 01:50:20,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195195195195195 [2024-06-28 01:50:20,096 INFO L175 Difference]: Start difference. First operand has 149 places, 136 transitions, 1321 flow. Second operand 9 states and 173 transitions. [2024-06-28 01:50:20,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 170 transitions, 1919 flow [2024-06-28 01:50:20,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 170 transitions, 1811 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-28 01:50:20,143 INFO L231 Difference]: Finished difference. Result has 153 places, 140 transitions, 1387 flow [2024-06-28 01:50:20,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1387, PETRI_PLACES=153, PETRI_TRANSITIONS=140} [2024-06-28 01:50:20,144 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 112 predicate places. [2024-06-28 01:50:20,144 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 140 transitions, 1387 flow [2024-06-28 01:50:20,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:20,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:20,144 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:50:20,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 01:50:20,144 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:20,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:20,145 INFO L85 PathProgramCache]: Analyzing trace with hash -778340372, now seen corresponding path program 7 times [2024-06-28 01:50:20,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:20,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963650083] [2024-06-28 01:50:20,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:20,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:21,125 INFO 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:50:21,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:21,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963650083] [2024-06-28 01:50:21,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963650083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:21,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:21,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:21,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362316249] [2024-06-28 01:50:21,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:21,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:21,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:21,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:21,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:21,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:21,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 140 transitions, 1387 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:21,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:21,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:21,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:21,782 INFO L124 PetriNetUnfolderBase]: 864/1643 cut-off events. [2024-06-28 01:50:21,783 INFO L125 PetriNetUnfolderBase]: For 28970/28982 co-relation queries the response was YES. [2024-06-28 01:50:21,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9163 conditions, 1643 events. 864/1643 cut-off events. For 28970/28982 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10084 event pairs, 134 based on Foata normal form. 13/1623 useless extension candidates. Maximal degree in co-relation 9093. Up to 915 conditions per place. [2024-06-28 01:50:21,793 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 107 selfloop transitions, 61 changer transitions 0/178 dead transitions. [2024-06-28 01:50:21,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 178 transitions, 2161 flow [2024-06-28 01:50:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-28 01:50:21,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-06-28 01:50:21,795 INFO L175 Difference]: Start difference. First operand has 153 places, 140 transitions, 1387 flow. Second operand 9 states and 180 transitions. [2024-06-28 01:50:21,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 178 transitions, 2161 flow [2024-06-28 01:50:21,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 178 transitions, 2090 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-28 01:50:21,848 INFO L231 Difference]: Finished difference. Result has 157 places, 145 transitions, 1555 flow [2024-06-28 01:50:21,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1555, PETRI_PLACES=157, PETRI_TRANSITIONS=145} [2024-06-28 01:50:21,848 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 116 predicate places. [2024-06-28 01:50:21,849 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 145 transitions, 1555 flow [2024-06-28 01:50:21,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:21,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:21,849 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:50:21,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 01:50:21,849 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:21,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:21,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1304741508, now seen corresponding path program 8 times [2024-06-28 01:50:21,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:21,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646348546] [2024-06-28 01:50:21,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:21,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:22,880 INFO 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:50:22,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:22,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646348546] [2024-06-28 01:50:22,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646348546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:22,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:22,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479800881] [2024-06-28 01:50:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:22,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:22,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:22,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:22,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:22,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:22,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 145 transitions, 1555 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:22,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:22,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:22,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:23,473 INFO L124 PetriNetUnfolderBase]: 862/1652 cut-off events. [2024-06-28 01:50:23,473 INFO L125 PetriNetUnfolderBase]: For 28891/28903 co-relation queries the response was YES. [2024-06-28 01:50:23,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9376 conditions, 1652 events. 862/1652 cut-off events. For 28891/28903 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10304 event pairs, 157 based on Foata normal form. 13/1635 useless extension candidates. Maximal degree in co-relation 9304. Up to 1367 conditions per place. [2024-06-28 01:50:23,484 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 149 selfloop transitions, 16 changer transitions 0/175 dead transitions. [2024-06-28 01:50:23,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 175 transitions, 2027 flow [2024-06-28 01:50:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-28 01:50:23,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-28 01:50:23,485 INFO L175 Difference]: Start difference. First operand has 157 places, 145 transitions, 1555 flow. Second operand 9 states and 165 transitions. [2024-06-28 01:50:23,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 175 transitions, 2027 flow [2024-06-28 01:50:23,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 175 transitions, 1921 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-28 01:50:23,550 INFO L231 Difference]: Finished difference. Result has 162 places, 146 transitions, 1522 flow [2024-06-28 01:50:23,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1451, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1522, PETRI_PLACES=162, PETRI_TRANSITIONS=146} [2024-06-28 01:50:23,551 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 121 predicate places. [2024-06-28 01:50:23,551 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 146 transitions, 1522 flow [2024-06-28 01:50:23,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:23,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:23,551 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:50:23,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 01:50:23,551 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:23,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:23,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1618430818, now seen corresponding path program 2 times [2024-06-28 01:50:23,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:23,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457719844] [2024-06-28 01:50:23,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:23,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:24,857 INFO 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:50:24,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:24,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457719844] [2024-06-28 01:50:24,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457719844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:24,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:24,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:24,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612446708] [2024-06-28 01:50:24,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:24,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:24,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:24,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:24,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:50:24,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:24,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 146 transitions, 1522 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:24,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:24,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:24,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:25,464 INFO L124 PetriNetUnfolderBase]: 878/1644 cut-off events. [2024-06-28 01:50:25,464 INFO L125 PetriNetUnfolderBase]: For 29331/29343 co-relation queries the response was YES. [2024-06-28 01:50:25,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9401 conditions, 1644 events. 878/1644 cut-off events. For 29331/29343 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10092 event pairs, 120 based on Foata normal form. 14/1631 useless extension candidates. Maximal degree in co-relation 9327. Up to 1219 conditions per place. [2024-06-28 01:50:25,476 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 137 selfloop transitions, 36 changer transitions 0/183 dead transitions. [2024-06-28 01:50:25,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 183 transitions, 2026 flow [2024-06-28 01:50:25,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:50:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:50:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-28 01:50:25,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:50:25,477 INFO L175 Difference]: Start difference. First operand has 162 places, 146 transitions, 1522 flow. Second operand 10 states and 190 transitions. [2024-06-28 01:50:25,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 183 transitions, 2026 flow [2024-06-28 01:50:25,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 183 transitions, 1961 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-28 01:50:25,561 INFO L231 Difference]: Finished difference. Result has 165 places, 147 transitions, 1559 flow [2024-06-28 01:50:25,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1559, PETRI_PLACES=165, PETRI_TRANSITIONS=147} [2024-06-28 01:50:25,561 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 124 predicate places. [2024-06-28 01:50:25,561 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 147 transitions, 1559 flow [2024-06-28 01:50:25,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:25,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:25,561 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:50:25,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 01:50:25,562 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:25,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:25,562 INFO L85 PathProgramCache]: Analyzing trace with hash -250399686, now seen corresponding path program 3 times [2024-06-28 01:50:25,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:25,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214986379] [2024-06-28 01:50:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:25,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:26,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:50:26,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:26,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214986379] [2024-06-28 01:50:26,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214986379] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:26,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:26,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:26,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500763418] [2024-06-28 01:50:26,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:26,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:26,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:26,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:26,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:26,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:26,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 147 transitions, 1559 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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:50:26,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:26,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:26,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:26,858 INFO L124 PetriNetUnfolderBase]: 962/1798 cut-off events. [2024-06-28 01:50:26,858 INFO L125 PetriNetUnfolderBase]: For 39317/39331 co-relation queries the response was YES. [2024-06-28 01:50:26,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10337 conditions, 1798 events. 962/1798 cut-off events. For 39317/39331 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11233 event pairs, 169 based on Foata normal form. 26/1798 useless extension candidates. Maximal degree in co-relation 10262. Up to 1314 conditions per place. [2024-06-28 01:50:26,872 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 148 selfloop transitions, 24 changer transitions 0/182 dead transitions. [2024-06-28 01:50:26,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 182 transitions, 2105 flow [2024-06-28 01:50:26,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-28 01:50:26,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255255255255256 [2024-06-28 01:50:26,874 INFO L175 Difference]: Start difference. First operand has 165 places, 147 transitions, 1559 flow. Second operand 9 states and 175 transitions. [2024-06-28 01:50:26,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 182 transitions, 2105 flow [2024-06-28 01:50:26,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 182 transitions, 2013 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-28 01:50:26,941 INFO L231 Difference]: Finished difference. Result has 166 places, 148 transitions, 1549 flow [2024-06-28 01:50:26,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1549, PETRI_PLACES=166, PETRI_TRANSITIONS=148} [2024-06-28 01:50:26,941 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 125 predicate places. [2024-06-28 01:50:26,941 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 148 transitions, 1549 flow [2024-06-28 01:50:26,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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:50:26,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:26,942 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:50:26,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 01:50:26,942 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:26,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:26,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1293303748, now seen corresponding path program 4 times [2024-06-28 01:50:26,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:26,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890949344] [2024-06-28 01:50:26,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:26,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:28,054 INFO 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:50:28,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:28,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890949344] [2024-06-28 01:50:28,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890949344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:28,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:28,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:28,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083358704] [2024-06-28 01:50:28,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:28,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:28,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:28,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:50:28,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:28,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 148 transitions, 1549 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:28,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:28,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:28,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:28,701 INFO L124 PetriNetUnfolderBase]: 982/1875 cut-off events. [2024-06-28 01:50:28,701 INFO L125 PetriNetUnfolderBase]: For 34693/34705 co-relation queries the response was YES. [2024-06-28 01:50:28,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10546 conditions, 1875 events. 982/1875 cut-off events. For 34693/34705 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12044 event pairs, 181 based on Foata normal form. 14/1860 useless extension candidates. Maximal degree in co-relation 10470. Up to 1484 conditions per place. [2024-06-28 01:50:28,714 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 160 selfloop transitions, 22 changer transitions 0/192 dead transitions. [2024-06-28 01:50:28,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 192 transitions, 2201 flow [2024-06-28 01:50:28,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:50:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:50:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2024-06-28 01:50:28,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012285012285013 [2024-06-28 01:50:28,715 INFO L175 Difference]: Start difference. First operand has 166 places, 148 transitions, 1549 flow. Second operand 11 states and 204 transitions. [2024-06-28 01:50:28,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 192 transitions, 2201 flow [2024-06-28 01:50:28,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 192 transitions, 2149 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-28 01:50:28,776 INFO L231 Difference]: Finished difference. Result has 170 places, 150 transitions, 1603 flow [2024-06-28 01:50:28,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1497, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1603, PETRI_PLACES=170, PETRI_TRANSITIONS=150} [2024-06-28 01:50:28,777 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 129 predicate places. [2024-06-28 01:50:28,777 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 150 transitions, 1603 flow [2024-06-28 01:50:28,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:28,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:28,777 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:50:28,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 01:50:28,778 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:28,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:28,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1293689698, now seen corresponding path program 5 times [2024-06-28 01:50:28,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:28,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877444259] [2024-06-28 01:50:28,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:28,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:50:29,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:29,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877444259] [2024-06-28 01:50:29,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877444259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:29,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:29,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:29,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364739341] [2024-06-28 01:50:29,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:29,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:29,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:29,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:50:29,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:29,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 150 transitions, 1603 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:29,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:29,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:29,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:30,520 INFO L124 PetriNetUnfolderBase]: 998/1911 cut-off events. [2024-06-28 01:50:30,521 INFO L125 PetriNetUnfolderBase]: For 36547/36559 co-relation queries the response was YES. [2024-06-28 01:50:30,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10809 conditions, 1911 events. 998/1911 cut-off events. For 36547/36559 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 12328 event pairs, 187 based on Foata normal form. 14/1896 useless extension candidates. Maximal degree in co-relation 10732. Up to 1571 conditions per place. [2024-06-28 01:50:30,532 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 160 selfloop transitions, 21 changer transitions 0/191 dead transitions. [2024-06-28 01:50:30,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 191 transitions, 2145 flow [2024-06-28 01:50:30,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:50:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:50:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2024-06-28 01:50:30,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963144963144963 [2024-06-28 01:50:30,534 INFO L175 Difference]: Start difference. First operand has 170 places, 150 transitions, 1603 flow. Second operand 11 states and 202 transitions. [2024-06-28 01:50:30,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 191 transitions, 2145 flow [2024-06-28 01:50:30,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 191 transitions, 2081 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-28 01:50:30,605 INFO L231 Difference]: Finished difference. Result has 174 places, 151 transitions, 1617 flow [2024-06-28 01:50:30,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1617, PETRI_PLACES=174, PETRI_TRANSITIONS=151} [2024-06-28 01:50:30,605 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 133 predicate places. [2024-06-28 01:50:30,606 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 151 transitions, 1617 flow [2024-06-28 01:50:30,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:30,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:30,606 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:50:30,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 01:50:30,606 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:30,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:30,607 INFO L85 PathProgramCache]: Analyzing trace with hash 311460922, now seen corresponding path program 6 times [2024-06-28 01:50:30,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:30,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280348056] [2024-06-28 01:50:30,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:30,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:50:31,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:31,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280348056] [2024-06-28 01:50:31,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280348056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:31,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:31,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:31,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124435489] [2024-06-28 01:50:31,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:31,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:31,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:31,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:31,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:50:32,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:32,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 151 transitions, 1617 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:32,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:32,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:32,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:32,676 INFO L124 PetriNetUnfolderBase]: 995/1909 cut-off events. [2024-06-28 01:50:32,676 INFO L125 PetriNetUnfolderBase]: For 33913/33925 co-relation queries the response was YES. [2024-06-28 01:50:32,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10584 conditions, 1909 events. 995/1909 cut-off events. For 33913/33925 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12293 event pairs, 186 based on Foata normal form. 14/1893 useless extension candidates. Maximal degree in co-relation 10505. Up to 1588 conditions per place. [2024-06-28 01:50:32,688 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 159 selfloop transitions, 17 changer transitions 0/186 dead transitions. [2024-06-28 01:50:32,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 186 transitions, 2099 flow [2024-06-28 01:50:32,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:50:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:50:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-28 01:50:32,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2024-06-28 01:50:32,690 INFO L175 Difference]: Start difference. First operand has 174 places, 151 transitions, 1617 flow. Second operand 10 states and 183 transitions. [2024-06-28 01:50:32,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 186 transitions, 2099 flow [2024-06-28 01:50:32,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 186 transitions, 2019 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-28 01:50:32,774 INFO L231 Difference]: Finished difference. Result has 175 places, 151 transitions, 1575 flow [2024-06-28 01:50:32,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1537, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1575, PETRI_PLACES=175, PETRI_TRANSITIONS=151} [2024-06-28 01:50:32,775 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 134 predicate places. [2024-06-28 01:50:32,775 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 151 transitions, 1575 flow [2024-06-28 01:50:32,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:32,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:32,775 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:50:32,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 01:50:32,775 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:32,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:32,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1708737760, now seen corresponding path program 1 times [2024-06-28 01:50:32,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:32,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348508497] [2024-06-28 01:50:32,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:32,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:33,549 INFO 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:50:33,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:33,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348508497] [2024-06-28 01:50:33,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348508497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:33,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:33,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:33,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326989439] [2024-06-28 01:50:33,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:33,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:33,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:33,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:33,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:33,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:33,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 151 transitions, 1575 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:33,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:33,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:33,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:34,182 INFO L124 PetriNetUnfolderBase]: 1012/1978 cut-off events. [2024-06-28 01:50:34,182 INFO L125 PetriNetUnfolderBase]: For 33679/33692 co-relation queries the response was YES. [2024-06-28 01:50:34,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10598 conditions, 1978 events. 1012/1978 cut-off events. For 33679/33692 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12990 event pairs, 222 based on Foata normal form. 15/1937 useless extension candidates. Maximal degree in co-relation 10518. Up to 1593 conditions per place. [2024-06-28 01:50:34,198 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 160 selfloop transitions, 16 changer transitions 0/186 dead transitions. [2024-06-28 01:50:34,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 186 transitions, 2051 flow [2024-06-28 01:50:34,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-28 01:50:34,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2024-06-28 01:50:34,199 INFO L175 Difference]: Start difference. First operand has 175 places, 151 transitions, 1575 flow. Second operand 9 states and 168 transitions. [2024-06-28 01:50:34,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 186 transitions, 2051 flow [2024-06-28 01:50:34,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 186 transitions, 2001 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-28 01:50:34,274 INFO L231 Difference]: Finished difference. Result has 176 places, 154 transitions, 1604 flow [2024-06-28 01:50:34,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1604, PETRI_PLACES=176, PETRI_TRANSITIONS=154} [2024-06-28 01:50:34,274 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 135 predicate places. [2024-06-28 01:50:34,274 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 154 transitions, 1604 flow [2024-06-28 01:50:34,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:34,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:34,275 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:50:34,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 01:50:34,275 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:34,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:34,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1798226080, now seen corresponding path program 2 times [2024-06-28 01:50:34,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:34,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299590187] [2024-06-28 01:50:34,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:34,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:35,160 INFO 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:50:35,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:35,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299590187] [2024-06-28 01:50:35,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299590187] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:35,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:35,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:35,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87048585] [2024-06-28 01:50:35,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:35,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:35,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:35,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:35,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:35,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:35,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 154 transitions, 1604 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:35,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:35,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:35,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:35,812 INFO L124 PetriNetUnfolderBase]: 1029/2008 cut-off events. [2024-06-28 01:50:35,812 INFO L125 PetriNetUnfolderBase]: For 34912/34926 co-relation queries the response was YES. [2024-06-28 01:50:35,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10804 conditions, 2008 events. 1029/2008 cut-off events. For 34912/34926 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13292 event pairs, 264 based on Foata normal form. 16/1969 useless extension candidates. Maximal degree in co-relation 10721. Up to 1645 conditions per place. [2024-06-28 01:50:35,828 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 162 selfloop transitions, 16 changer transitions 0/188 dead transitions. [2024-06-28 01:50:35,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 188 transitions, 2087 flow [2024-06-28 01:50:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-28 01:50:35,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2024-06-28 01:50:35,829 INFO L175 Difference]: Start difference. First operand has 176 places, 154 transitions, 1604 flow. Second operand 9 states and 168 transitions. [2024-06-28 01:50:35,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 188 transitions, 2087 flow [2024-06-28 01:50:35,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 188 transitions, 2046 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-28 01:50:35,910 INFO L231 Difference]: Finished difference. Result has 181 places, 156 transitions, 1632 flow [2024-06-28 01:50:35,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1632, PETRI_PLACES=181, PETRI_TRANSITIONS=156} [2024-06-28 01:50:35,910 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 140 predicate places. [2024-06-28 01:50:35,910 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 156 transitions, 1632 flow [2024-06-28 01:50:35,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:35,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:35,911 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:50:35,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 01:50:35,911 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:35,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:35,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1710645190, now seen corresponding path program 3 times [2024-06-28 01:50:35,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:35,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705530248] [2024-06-28 01:50:35,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:35,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:36,777 INFO 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:50:36,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:36,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705530248] [2024-06-28 01:50:36,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705530248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:36,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:36,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:36,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329596363] [2024-06-28 01:50:36,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:36,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:36,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:36,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:36,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:36,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 156 transitions, 1632 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:36,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:36,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:36,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:37,396 INFO L124 PetriNetUnfolderBase]: 1083/2108 cut-off events. [2024-06-28 01:50:37,396 INFO L125 PetriNetUnfolderBase]: For 37178/37190 co-relation queries the response was YES. [2024-06-28 01:50:37,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11382 conditions, 2108 events. 1083/2108 cut-off events. For 37178/37190 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14120 event pairs, 270 based on Foata normal form. 14/2061 useless extension candidates. Maximal degree in co-relation 11297. Up to 1731 conditions per place. [2024-06-28 01:50:37,413 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 164 selfloop transitions, 24 changer transitions 0/198 dead transitions. [2024-06-28 01:50:37,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 198 transitions, 2275 flow [2024-06-28 01:50:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:50:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:50:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-28 01:50:37,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891891891891892 [2024-06-28 01:50:37,414 INFO L175 Difference]: Start difference. First operand has 181 places, 156 transitions, 1632 flow. Second operand 10 states and 181 transitions. [2024-06-28 01:50:37,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 198 transitions, 2275 flow [2024-06-28 01:50:37,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 198 transitions, 2210 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-28 01:50:37,507 INFO L231 Difference]: Finished difference. Result has 189 places, 169 transitions, 1808 flow [2024-06-28 01:50:37,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1586, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1808, PETRI_PLACES=189, PETRI_TRANSITIONS=169} [2024-06-28 01:50:37,507 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 148 predicate places. [2024-06-28 01:50:37,507 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 169 transitions, 1808 flow [2024-06-28 01:50:37,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:37,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:37,508 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:50:37,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 01:50:37,508 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:37,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:37,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1111424424, now seen corresponding path program 4 times [2024-06-28 01:50:37,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:37,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849563663] [2024-06-28 01:50:37,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:37,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:38,893 INFO 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:50:38,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:38,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849563663] [2024-06-28 01:50:38,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849563663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:38,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:38,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:38,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263459489] [2024-06-28 01:50:38,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:38,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:38,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:38,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:38,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:38,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:38,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 169 transitions, 1808 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:38,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:38,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:38,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:39,559 INFO L124 PetriNetUnfolderBase]: 1099/2139 cut-off events. [2024-06-28 01:50:39,559 INFO L125 PetriNetUnfolderBase]: For 38635/38647 co-relation queries the response was YES. [2024-06-28 01:50:39,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11602 conditions, 2139 events. 1099/2139 cut-off events. For 38635/38647 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 14294 event pairs, 263 based on Foata normal form. 14/2097 useless extension candidates. Maximal degree in co-relation 11512. Up to 1747 conditions per place. [2024-06-28 01:50:39,577 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 170 selfloop transitions, 21 changer transitions 0/201 dead transitions. [2024-06-28 01:50:39,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 201 transitions, 2323 flow [2024-06-28 01:50:39,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-28 01:50:39,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2024-06-28 01:50:39,578 INFO L175 Difference]: Start difference. First operand has 189 places, 169 transitions, 1808 flow. Second operand 9 states and 169 transitions. [2024-06-28 01:50:39,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 201 transitions, 2323 flow [2024-06-28 01:50:39,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 201 transitions, 2283 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-28 01:50:39,669 INFO L231 Difference]: Finished difference. Result has 196 places, 170 transitions, 1840 flow [2024-06-28 01:50:39,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1840, PETRI_PLACES=196, PETRI_TRANSITIONS=170} [2024-06-28 01:50:39,670 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 155 predicate places. [2024-06-28 01:50:39,670 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 170 transitions, 1840 flow [2024-06-28 01:50:39,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:39,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:39,670 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:50:39,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 01:50:39,670 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:39,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:39,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1104995334, now seen corresponding path program 5 times [2024-06-28 01:50:39,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:39,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949801801] [2024-06-28 01:50:39,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:39,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:40,581 INFO 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:50:40,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:40,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949801801] [2024-06-28 01:50:40,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949801801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:40,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:40,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:40,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934087681] [2024-06-28 01:50:40,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:40,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:40,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:40,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:40,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:40,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:40,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 170 transitions, 1840 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:40,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:40,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:40,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:41,187 INFO L124 PetriNetUnfolderBase]: 1115/2187 cut-off events. [2024-06-28 01:50:41,187 INFO L125 PetriNetUnfolderBase]: For 39503/39516 co-relation queries the response was YES. [2024-06-28 01:50:41,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11809 conditions, 2187 events. 1115/2187 cut-off events. For 39503/39516 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14799 event pairs, 271 based on Foata normal form. 15/2142 useless extension candidates. Maximal degree in co-relation 11717. Up to 1796 conditions per place. [2024-06-28 01:50:41,205 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 173 selfloop transitions, 19 changer transitions 0/202 dead transitions. [2024-06-28 01:50:41,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 202 transitions, 2364 flow [2024-06-28 01:50:41,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-28 01:50:41,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984984984984985 [2024-06-28 01:50:41,206 INFO L175 Difference]: Start difference. First operand has 196 places, 170 transitions, 1840 flow. Second operand 9 states and 166 transitions. [2024-06-28 01:50:41,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 202 transitions, 2364 flow [2024-06-28 01:50:41,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 202 transitions, 2300 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-28 01:50:41,305 INFO L231 Difference]: Finished difference. Result has 199 places, 172 transitions, 1860 flow [2024-06-28 01:50:41,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1778, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1860, PETRI_PLACES=199, PETRI_TRANSITIONS=172} [2024-06-28 01:50:41,305 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 158 predicate places. [2024-06-28 01:50:41,305 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 172 transitions, 1860 flow [2024-06-28 01:50:41,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:41,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:41,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:50:41,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 01:50:41,306 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:41,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1491256224, now seen corresponding path program 6 times [2024-06-28 01:50:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093205652] [2024-06-28 01:50:41,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:41,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:42,147 INFO 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:50:42,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:42,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093205652] [2024-06-28 01:50:42,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093205652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:42,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:42,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:42,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141975949] [2024-06-28 01:50:42,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:42,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:42,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:42,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:42,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:42,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:42,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 172 transitions, 1860 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:42,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:42,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:42,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:42,760 INFO L124 PetriNetUnfolderBase]: 1131/2199 cut-off events. [2024-06-28 01:50:42,760 INFO L125 PetriNetUnfolderBase]: For 41557/41572 co-relation queries the response was YES. [2024-06-28 01:50:42,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11932 conditions, 2199 events. 1131/2199 cut-off events. For 41557/41572 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 14826 event pairs, 277 based on Foata normal form. 17/2158 useless extension candidates. Maximal degree in co-relation 11838. Up to 1812 conditions per place. [2024-06-28 01:50:42,778 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 175 selfloop transitions, 18 changer transitions 0/203 dead transitions. [2024-06-28 01:50:42,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 203 transitions, 2377 flow [2024-06-28 01:50:42,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-28 01:50:42,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-28 01:50:42,779 INFO L175 Difference]: Start difference. First operand has 199 places, 172 transitions, 1860 flow. Second operand 9 states and 165 transitions. [2024-06-28 01:50:42,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 203 transitions, 2377 flow [2024-06-28 01:50:42,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 203 transitions, 2320 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-28 01:50:42,891 INFO L231 Difference]: Finished difference. Result has 202 places, 173 transitions, 1873 flow [2024-06-28 01:50:42,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1803, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1873, PETRI_PLACES=202, PETRI_TRANSITIONS=173} [2024-06-28 01:50:42,892 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 161 predicate places. [2024-06-28 01:50:42,892 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 173 transitions, 1873 flow [2024-06-28 01:50:42,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:42,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:42,893 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:50:42,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 01:50:42,893 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:42,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:42,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1263170500, now seen corresponding path program 1 times [2024-06-28 01:50:42,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:42,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580640997] [2024-06-28 01:50:42,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:42,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:44,343 INFO 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:50:44,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:44,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580640997] [2024-06-28 01:50:44,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580640997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:44,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:44,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:44,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993558844] [2024-06-28 01:50:44,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:44,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:44,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:44,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:44,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:50:44,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:44,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 173 transitions, 1873 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:44,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:44,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:44,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:45,183 INFO L124 PetriNetUnfolderBase]: 1161/2283 cut-off events. [2024-06-28 01:50:45,183 INFO L125 PetriNetUnfolderBase]: For 44464/44478 co-relation queries the response was YES. [2024-06-28 01:50:45,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12449 conditions, 2283 events. 1161/2283 cut-off events. For 44464/44478 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15585 event pairs, 261 based on Foata normal form. 13/2229 useless extension candidates. Maximal degree in co-relation 12354. Up to 1684 conditions per place. [2024-06-28 01:50:45,204 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 159 selfloop transitions, 48 changer transitions 0/217 dead transitions. [2024-06-28 01:50:45,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 217 transitions, 2769 flow [2024-06-28 01:50:45,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:50:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:50:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-06-28 01:50:45,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5243243243243243 [2024-06-28 01:50:45,206 INFO L175 Difference]: Start difference. First operand has 202 places, 173 transitions, 1873 flow. Second operand 10 states and 194 transitions. [2024-06-28 01:50:45,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 217 transitions, 2769 flow [2024-06-28 01:50:45,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 217 transitions, 2709 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-28 01:50:45,323 INFO L231 Difference]: Finished difference. Result has 206 places, 180 transitions, 2100 flow [2024-06-28 01:50:45,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1813, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2100, PETRI_PLACES=206, PETRI_TRANSITIONS=180} [2024-06-28 01:50:45,324 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 165 predicate places. [2024-06-28 01:50:45,324 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 180 transitions, 2100 flow [2024-06-28 01:50:45,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:45,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:45,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:50:45,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 01:50:45,325 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:45,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1254599620, now seen corresponding path program 2 times [2024-06-28 01:50:45,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:45,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679598219] [2024-06-28 01:50:45,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:45,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:50:46,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679598219] [2024-06-28 01:50:46,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679598219] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:46,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:46,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:46,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782548254] [2024-06-28 01:50:46,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:46,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:46,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:46,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:46,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:50:46,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:46,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 180 transitions, 2100 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:46,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:46,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:46,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:47,148 INFO L124 PetriNetUnfolderBase]: 1159/2292 cut-off events. [2024-06-28 01:50:47,148 INFO L125 PetriNetUnfolderBase]: For 44721/44735 co-relation queries the response was YES. [2024-06-28 01:50:47,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12613 conditions, 2292 events. 1159/2292 cut-off events. For 44721/44735 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15737 event pairs, 255 based on Foata normal form. 13/2237 useless extension candidates. Maximal degree in co-relation 12516. Up to 1682 conditions per place. [2024-06-28 01:50:47,167 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 158 selfloop transitions, 53 changer transitions 0/221 dead transitions. [2024-06-28 01:50:47,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 221 transitions, 2767 flow [2024-06-28 01:50:47,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:50:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:50:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2024-06-28 01:50:47,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:50:47,168 INFO L175 Difference]: Start difference. First operand has 206 places, 180 transitions, 2100 flow. Second operand 11 states and 209 transitions. [2024-06-28 01:50:47,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 221 transitions, 2767 flow [2024-06-28 01:50:47,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 221 transitions, 2588 flow, removed 46 selfloop flow, removed 7 redundant places. [2024-06-28 01:50:47,263 INFO L231 Difference]: Finished difference. Result has 211 places, 181 transitions, 2051 flow [2024-06-28 01:50:47,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1921, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2051, PETRI_PLACES=211, PETRI_TRANSITIONS=181} [2024-06-28 01:50:47,264 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 170 predicate places. [2024-06-28 01:50:47,264 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 181 transitions, 2051 flow [2024-06-28 01:50:47,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:47,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:47,264 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:50:47,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 01:50:47,264 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:47,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:47,264 INFO L85 PathProgramCache]: Analyzing trace with hash -211142558, now seen corresponding path program 3 times [2024-06-28 01:50:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:47,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847686827] [2024-06-28 01:50:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:47,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:48,317 INFO 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:50:48,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:48,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847686827] [2024-06-28 01:50:48,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847686827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:48,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:48,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:48,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805602279] [2024-06-28 01:50:48,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:48,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:48,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:48,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:48,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:50:48,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:48,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 181 transitions, 2051 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:48,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:48,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:48,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:49,038 INFO L124 PetriNetUnfolderBase]: 1157/2282 cut-off events. [2024-06-28 01:50:49,038 INFO L125 PetriNetUnfolderBase]: For 42687/42699 co-relation queries the response was YES. [2024-06-28 01:50:49,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12290 conditions, 2282 events. 1157/2282 cut-off events. For 42687/42699 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15584 event pairs, 270 based on Foata normal form. 13/2228 useless extension candidates. Maximal degree in co-relation 12192. Up to 1767 conditions per place. [2024-06-28 01:50:49,059 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 172 selfloop transitions, 34 changer transitions 0/216 dead transitions. [2024-06-28 01:50:49,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 216 transitions, 2590 flow [2024-06-28 01:50:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:50:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:50:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-28 01:50:49,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:50:49,060 INFO L175 Difference]: Start difference. First operand has 211 places, 181 transitions, 2051 flow. Second operand 10 states and 190 transitions. [2024-06-28 01:50:49,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 216 transitions, 2590 flow [2024-06-28 01:50:49,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 216 transitions, 2491 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-28 01:50:49,172 INFO L231 Difference]: Finished difference. Result has 213 places, 181 transitions, 2025 flow [2024-06-28 01:50:49,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1952, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2025, PETRI_PLACES=213, PETRI_TRANSITIONS=181} [2024-06-28 01:50:49,173 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 172 predicate places. [2024-06-28 01:50:49,173 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 181 transitions, 2025 flow [2024-06-28 01:50:49,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:49,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:49,173 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:50:49,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 01:50:49,173 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:49,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:49,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1798410654, now seen corresponding path program 4 times [2024-06-28 01:50:49,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:49,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284530033] [2024-06-28 01:50:49,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:49,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:50,572 INFO 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:50:50,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:50,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284530033] [2024-06-28 01:50:50,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284530033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:50,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:50,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:50,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972719158] [2024-06-28 01:50:50,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:50,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:50,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:50,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:50,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:50:50,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:50,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 181 transitions, 2025 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:50,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:50,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:50,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:51,240 INFO L124 PetriNetUnfolderBase]: 1155/2261 cut-off events. [2024-06-28 01:50:51,240 INFO L125 PetriNetUnfolderBase]: For 40363/40375 co-relation queries the response was YES. [2024-06-28 01:50:51,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12132 conditions, 2261 events. 1155/2261 cut-off events. For 40363/40375 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15402 event pairs, 278 based on Foata normal form. 13/2212 useless extension candidates. Maximal degree in co-relation 12033. Up to 1829 conditions per place. [2024-06-28 01:50:51,262 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 175 selfloop transitions, 31 changer transitions 0/216 dead transitions. [2024-06-28 01:50:51,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 216 transitions, 2556 flow [2024-06-28 01:50:51,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:50:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:50:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-28 01:50:51,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054054054054054 [2024-06-28 01:50:51,263 INFO L175 Difference]: Start difference. First operand has 213 places, 181 transitions, 2025 flow. Second operand 10 states and 187 transitions. [2024-06-28 01:50:51,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 216 transitions, 2556 flow [2024-06-28 01:50:51,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 216 transitions, 2394 flow, removed 32 selfloop flow, removed 9 redundant places. [2024-06-28 01:50:51,390 INFO L231 Difference]: Finished difference. Result has 214 places, 181 transitions, 1930 flow [2024-06-28 01:50:51,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1930, PETRI_PLACES=214, PETRI_TRANSITIONS=181} [2024-06-28 01:50:51,391 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 173 predicate places. [2024-06-28 01:50:51,391 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 181 transitions, 1930 flow [2024-06-28 01:50:51,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:50:51,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:51,391 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:50:51,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-28 01:50:51,391 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:51,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:51,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2015302420, now seen corresponding path program 7 times [2024-06-28 01:50:51,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:51,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92539517] [2024-06-28 01:50:51,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:51,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:50:52,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:52,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92539517] [2024-06-28 01:50:52,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92539517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:52,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:52,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776449588] [2024-06-28 01:50:52,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:52,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:52,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:52,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:52,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:52,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 181 transitions, 1930 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:52,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:52,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:52,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:52,977 INFO L124 PetriNetUnfolderBase]: 1171/2248 cut-off events. [2024-06-28 01:50:52,977 INFO L125 PetriNetUnfolderBase]: For 42977/42995 co-relation queries the response was YES. [2024-06-28 01:50:52,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12052 conditions, 2248 events. 1171/2248 cut-off events. For 42977/42995 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14922 event pairs, 202 based on Foata normal form. 20/2223 useless extension candidates. Maximal degree in co-relation 11952. Up to 1843 conditions per place. [2024-06-28 01:50:52,995 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 178 selfloop transitions, 24 changer transitions 0/212 dead transitions. [2024-06-28 01:50:52,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 212 transitions, 2477 flow [2024-06-28 01:50:52,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-28 01:50:52,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2024-06-28 01:50:52,996 INFO L175 Difference]: Start difference. First operand has 214 places, 181 transitions, 1930 flow. Second operand 9 states and 169 transitions. [2024-06-28 01:50:52,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 212 transitions, 2477 flow [2024-06-28 01:50:53,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 212 transitions, 2370 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-28 01:50:53,102 INFO L231 Difference]: Finished difference. Result has 213 places, 182 transitions, 1907 flow [2024-06-28 01:50:53,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1823, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1907, PETRI_PLACES=213, PETRI_TRANSITIONS=182} [2024-06-28 01:50:53,103 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 172 predicate places. [2024-06-28 01:50:53,103 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 182 transitions, 1907 flow [2024-06-28 01:50:53,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:53,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:53,103 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:50:53,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-28 01:50:53,103 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:53,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:53,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2028695038, now seen corresponding path program 8 times [2024-06-28 01:50:53,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:53,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538880990] [2024-06-28 01:50:53,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:53,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:50:54,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:54,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538880990] [2024-06-28 01:50:54,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538880990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:54,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:54,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:54,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533093968] [2024-06-28 01:50:54,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:54,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:54,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:54,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:54,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:54,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:54,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 182 transitions, 1907 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:54,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:54,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:54,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:54,696 INFO L124 PetriNetUnfolderBase]: 1187/2254 cut-off events. [2024-06-28 01:50:54,696 INFO L125 PetriNetUnfolderBase]: For 45304/45322 co-relation queries the response was YES. [2024-06-28 01:50:54,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12216 conditions, 2254 events. 1187/2254 cut-off events. For 45304/45322 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14882 event pairs, 223 based on Foata normal form. 20/2234 useless extension candidates. Maximal degree in co-relation 12115. Up to 1892 conditions per place. [2024-06-28 01:50:54,716 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 181 selfloop transitions, 22 changer transitions 0/213 dead transitions. [2024-06-28 01:50:54,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 213 transitions, 2464 flow [2024-06-28 01:50:54,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-28 01:50:54,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984984984984985 [2024-06-28 01:50:54,717 INFO L175 Difference]: Start difference. First operand has 213 places, 182 transitions, 1907 flow. Second operand 9 states and 166 transitions. [2024-06-28 01:50:54,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 213 transitions, 2464 flow [2024-06-28 01:50:54,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 213 transitions, 2388 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-28 01:50:54,839 INFO L231 Difference]: Finished difference. Result has 216 places, 184 transitions, 1928 flow [2024-06-28 01:50:54,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1928, PETRI_PLACES=216, PETRI_TRANSITIONS=184} [2024-06-28 01:50:54,839 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 175 predicate places. [2024-06-28 01:50:54,839 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 184 transitions, 1928 flow [2024-06-28 01:50:54,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:54,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:54,840 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:50:54,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-28 01:50:54,840 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:54,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1359664314, now seen corresponding path program 9 times [2024-06-28 01:50:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:54,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080640826] [2024-06-28 01:50:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:54,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:50:55,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:55,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080640826] [2024-06-28 01:50:55,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080640826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:55,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:55,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:55,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454141365] [2024-06-28 01:50:55,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:55,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:55,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:55,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:55,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:55,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:55,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 184 transitions, 1928 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:55,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:55,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:55,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:56,692 INFO L124 PetriNetUnfolderBase]: 1276/2410 cut-off events. [2024-06-28 01:50:56,692 INFO L125 PetriNetUnfolderBase]: For 47399/47419 co-relation queries the response was YES. [2024-06-28 01:50:56,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13045 conditions, 2410 events. 1276/2410 cut-off events. For 47399/47419 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16220 event pairs, 159 based on Foata normal form. 22/2402 useless extension candidates. Maximal degree in co-relation 12942. Up to 1872 conditions per place. [2024-06-28 01:50:56,714 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 177 selfloop transitions, 58 changer transitions 0/245 dead transitions. [2024-06-28 01:50:56,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 245 transitions, 2831 flow [2024-06-28 01:50:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:50:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:50:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 232 transitions. [2024-06-28 01:50:56,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48232848232848236 [2024-06-28 01:50:56,715 INFO L175 Difference]: Start difference. First operand has 216 places, 184 transitions, 1928 flow. Second operand 13 states and 232 transitions. [2024-06-28 01:50:56,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 245 transitions, 2831 flow [2024-06-28 01:50:56,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 245 transitions, 2735 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-28 01:50:56,850 INFO L231 Difference]: Finished difference. Result has 228 places, 208 transitions, 2289 flow [2024-06-28 01:50:56,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1859, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2289, PETRI_PLACES=228, PETRI_TRANSITIONS=208} [2024-06-28 01:50:56,851 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 187 predicate places. [2024-06-28 01:50:56,851 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 208 transitions, 2289 flow [2024-06-28 01:50:56,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:56,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:56,851 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:50:56,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-28 01:50:56,851 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:56,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:56,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2028517408, now seen corresponding path program 10 times [2024-06-28 01:50:56,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:56,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754386827] [2024-06-28 01:50:56,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:56,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:57,722 INFO 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:50:57,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:57,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754386827] [2024-06-28 01:50:57,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754386827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:57,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:57,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:50:57,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827638543] [2024-06-28 01:50:57,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:57,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:50:57,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:57,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:50:57,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:50:57,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:50:57,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 208 transitions, 2289 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:57,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:50:57,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:50:57,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:50:58,339 INFO L124 PetriNetUnfolderBase]: 1292/2444 cut-off events. [2024-06-28 01:50:58,339 INFO L125 PetriNetUnfolderBase]: For 49465/49488 co-relation queries the response was YES. [2024-06-28 01:50:58,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13603 conditions, 2444 events. 1292/2444 cut-off events. For 49465/49488 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 16499 event pairs, 234 based on Foata normal form. 25/2432 useless extension candidates. Maximal degree in co-relation 13494. Up to 2011 conditions per place. [2024-06-28 01:50:58,363 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 191 selfloop transitions, 35 changer transitions 0/236 dead transitions. [2024-06-28 01:50:58,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 236 transitions, 2889 flow [2024-06-28 01:50:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:50:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:50:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-28 01:50:58,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-28 01:50:58,364 INFO L175 Difference]: Start difference. First operand has 228 places, 208 transitions, 2289 flow. Second operand 9 states and 165 transitions. [2024-06-28 01:50:58,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 236 transitions, 2889 flow [2024-06-28 01:50:58,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 236 transitions, 2822 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-28 01:50:58,500 INFO L231 Difference]: Finished difference. Result has 235 places, 209 transitions, 2335 flow [2024-06-28 01:50:58,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2222, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2335, PETRI_PLACES=235, PETRI_TRANSITIONS=209} [2024-06-28 01:50:58,500 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 194 predicate places. [2024-06-28 01:50:58,501 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 209 transitions, 2335 flow [2024-06-28 01:50:58,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:50:58,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:50:58,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:50:58,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-28 01:50:58,501 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:50:58,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:50:58,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2038364164, now seen corresponding path program 5 times [2024-06-28 01:50:58,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:50:58,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583866785] [2024-06-28 01:50:58,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:50:58,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:50:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:50:59,897 INFO 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:50:59,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:50:59,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583866785] [2024-06-28 01:50:59,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583866785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:50:59,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:50:59,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:50:59,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720306663] [2024-06-28 01:50:59,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:50:59,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:50:59,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:50:59,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:50:59,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:00,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:00,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 209 transitions, 2335 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:00,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:00,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:00,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:00,823 INFO L124 PetriNetUnfolderBase]: 1303/2513 cut-off events. [2024-06-28 01:51:00,823 INFO L125 PetriNetUnfolderBase]: For 49082/49104 co-relation queries the response was YES. [2024-06-28 01:51:00,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13708 conditions, 2513 events. 1303/2513 cut-off events. For 49082/49104 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17174 event pairs, 232 based on Foata normal form. 23/2481 useless extension candidates. Maximal degree in co-relation 13597. Up to 1968 conditions per place. [2024-06-28 01:51:00,847 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 186 selfloop transitions, 47 changer transitions 0/243 dead transitions. [2024-06-28 01:51:00,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 243 transitions, 2985 flow [2024-06-28 01:51:00,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-28 01:51:00,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108108108108108 [2024-06-28 01:51:00,848 INFO L175 Difference]: Start difference. First operand has 235 places, 209 transitions, 2335 flow. Second operand 10 states and 189 transitions. [2024-06-28 01:51:00,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 243 transitions, 2985 flow [2024-06-28 01:51:00,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 243 transitions, 2884 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-28 01:51:00,993 INFO L231 Difference]: Finished difference. Result has 238 places, 211 transitions, 2385 flow [2024-06-28 01:51:00,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2234, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2385, PETRI_PLACES=238, PETRI_TRANSITIONS=211} [2024-06-28 01:51:00,994 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 197 predicate places. [2024-06-28 01:51:00,994 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 211 transitions, 2385 flow [2024-06-28 01:51:00,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:00,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:00,994 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:51:00,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-28 01:51:00,994 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:00,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:00,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2030089954, now seen corresponding path program 6 times [2024-06-28 01:51:00,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:00,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561394142] [2024-06-28 01:51:00,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:00,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:02,098 INFO 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:51:02,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:02,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561394142] [2024-06-28 01:51:02,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561394142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:02,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:02,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:02,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777487328] [2024-06-28 01:51:02,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:02,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:02,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:02,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:02,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:02,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:02,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 211 transitions, 2385 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:02,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:02,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:02,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:02,914 INFO L124 PetriNetUnfolderBase]: 1301/2519 cut-off events. [2024-06-28 01:51:02,914 INFO L125 PetriNetUnfolderBase]: For 47138/47160 co-relation queries the response was YES. [2024-06-28 01:51:02,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13548 conditions, 2519 events. 1301/2519 cut-off events. For 47138/47160 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 17280 event pairs, 232 based on Foata normal form. 23/2486 useless extension candidates. Maximal degree in co-relation 13436. Up to 1965 conditions per place. [2024-06-28 01:51:02,938 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 184 selfloop transitions, 49 changer transitions 0/243 dead transitions. [2024-06-28 01:51:02,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 243 transitions, 2987 flow [2024-06-28 01:51:02,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-28 01:51:02,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081081081081081 [2024-06-28 01:51:02,939 INFO L175 Difference]: Start difference. First operand has 238 places, 211 transitions, 2385 flow. Second operand 10 states and 188 transitions. [2024-06-28 01:51:02,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 243 transitions, 2987 flow [2024-06-28 01:51:03,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 243 transitions, 2828 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-28 01:51:03,076 INFO L231 Difference]: Finished difference. Result has 240 places, 211 transitions, 2329 flow [2024-06-28 01:51:03,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2329, PETRI_PLACES=240, PETRI_TRANSITIONS=211} [2024-06-28 01:51:03,076 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 199 predicate places. [2024-06-28 01:51:03,077 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 211 transitions, 2329 flow [2024-06-28 01:51:03,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:03,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:03,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:51:03,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-28 01:51:03,077 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:03,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:03,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1641483678, now seen corresponding path program 7 times [2024-06-28 01:51:03,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:03,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361653330] [2024-06-28 01:51:03,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:03,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:04,301 INFO 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:51:04,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:04,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361653330] [2024-06-28 01:51:04,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361653330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:04,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:04,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:04,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276540394] [2024-06-28 01:51:04,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:04,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:04,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:04,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:04,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:04,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:04,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 211 transitions, 2329 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:04,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:04,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:04,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:05,084 INFO L124 PetriNetUnfolderBase]: 1312/2494 cut-off events. [2024-06-28 01:51:05,085 INFO L125 PetriNetUnfolderBase]: For 47186/47204 co-relation queries the response was YES. [2024-06-28 01:51:05,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13509 conditions, 2494 events. 1312/2494 cut-off events. For 47186/47204 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16931 event pairs, 181 based on Foata normal form. 19/2472 useless extension candidates. Maximal degree in co-relation 13396. Up to 1800 conditions per place. [2024-06-28 01:51:05,108 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 174 selfloop transitions, 63 changer transitions 0/247 dead transitions. [2024-06-28 01:51:05,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 247 transitions, 2994 flow [2024-06-28 01:51:05,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-28 01:51:05,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518918918918919 [2024-06-28 01:51:05,109 INFO L175 Difference]: Start difference. First operand has 240 places, 211 transitions, 2329 flow. Second operand 10 states and 192 transitions. [2024-06-28 01:51:05,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 247 transitions, 2994 flow [2024-06-28 01:51:05,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 247 transitions, 2837 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-28 01:51:05,247 INFO L231 Difference]: Finished difference. Result has 241 places, 214 transitions, 2365 flow [2024-06-28 01:51:05,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2172, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2365, PETRI_PLACES=241, PETRI_TRANSITIONS=214} [2024-06-28 01:51:05,247 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 200 predicate places. [2024-06-28 01:51:05,247 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 214 transitions, 2365 flow [2024-06-28 01:51:05,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:05,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:05,248 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:51:05,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-28 01:51:05,248 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:05,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1359671258, now seen corresponding path program 8 times [2024-06-28 01:51:05,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:05,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617665900] [2024-06-28 01:51:05,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:05,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:06,558 INFO 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:51:06,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:06,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617665900] [2024-06-28 01:51:06,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617665900] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:06,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:06,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:06,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088170175] [2024-06-28 01:51:06,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:06,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:06,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:06,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:06,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:06,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:06,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 214 transitions, 2365 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:06,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:06,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:06,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:07,424 INFO L124 PetriNetUnfolderBase]: 1310/2491 cut-off events. [2024-06-28 01:51:07,425 INFO L125 PetriNetUnfolderBase]: For 46376/46394 co-relation queries the response was YES. [2024-06-28 01:51:07,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13407 conditions, 2491 events. 1310/2491 cut-off events. For 46376/46394 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 16893 event pairs, 181 based on Foata normal form. 19/2469 useless extension candidates. Maximal degree in co-relation 13293. Up to 1797 conditions per place. [2024-06-28 01:51:07,450 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 173 selfloop transitions, 64 changer transitions 0/247 dead transitions. [2024-06-28 01:51:07,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 247 transitions, 2977 flow [2024-06-28 01:51:07,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-28 01:51:07,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162162162162162 [2024-06-28 01:51:07,452 INFO L175 Difference]: Start difference. First operand has 241 places, 214 transitions, 2365 flow. Second operand 10 states and 191 transitions. [2024-06-28 01:51:07,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 247 transitions, 2977 flow [2024-06-28 01:51:07,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 247 transitions, 2791 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-28 01:51:07,602 INFO L231 Difference]: Finished difference. Result has 244 places, 214 transitions, 2312 flow [2024-06-28 01:51:07,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2179, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2312, PETRI_PLACES=244, PETRI_TRANSITIONS=214} [2024-06-28 01:51:07,603 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 203 predicate places. [2024-06-28 01:51:07,603 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 214 transitions, 2312 flow [2024-06-28 01:51:07,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:07,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:07,603 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:51:07,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-28 01:51:07,604 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:07,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1926591918, now seen corresponding path program 9 times [2024-06-28 01:51:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:07,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168131511] [2024-06-28 01:51:07,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:07,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:08,793 INFO 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:51:08,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:08,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168131511] [2024-06-28 01:51:08,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168131511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:08,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:08,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:08,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060775142] [2024-06-28 01:51:08,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:08,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:08,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:08,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:08,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:08,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:08,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 214 transitions, 2312 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:08,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:08,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:08,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:09,637 INFO L124 PetriNetUnfolderBase]: 1336/2613 cut-off events. [2024-06-28 01:51:09,637 INFO L125 PetriNetUnfolderBase]: For 48424/48440 co-relation queries the response was YES. [2024-06-28 01:51:09,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13831 conditions, 2613 events. 1336/2613 cut-off events. For 48424/48440 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 18310 event pairs, 263 based on Foata normal form. 17/2577 useless extension candidates. Maximal degree in co-relation 13716. Up to 2122 conditions per place. [2024-06-28 01:51:09,660 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 218 selfloop transitions, 37 changer transitions 0/265 dead transitions. [2024-06-28 01:51:09,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 265 transitions, 3462 flow [2024-06-28 01:51:09,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-06-28 01:51:09,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027027027027027 [2024-06-28 01:51:09,661 INFO L175 Difference]: Start difference. First operand has 244 places, 214 transitions, 2312 flow. Second operand 10 states and 186 transitions. [2024-06-28 01:51:09,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 265 transitions, 3462 flow [2024-06-28 01:51:09,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 265 transitions, 3320 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-28 01:51:09,779 INFO L231 Difference]: Finished difference. Result has 248 places, 229 transitions, 2639 flow [2024-06-28 01:51:09,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2639, PETRI_PLACES=248, PETRI_TRANSITIONS=229} [2024-06-28 01:51:09,779 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 207 predicate places. [2024-06-28 01:51:09,780 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 229 transitions, 2639 flow [2024-06-28 01:51:09,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:09,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:09,780 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:51:09,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-28 01:51:09,780 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:09,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1449685030, now seen corresponding path program 10 times [2024-06-28 01:51:09,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:09,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263561774] [2024-06-28 01:51:09,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:09,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:51:10,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:10,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263561774] [2024-06-28 01:51:10,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263561774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:10,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:10,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:51:10,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574168390] [2024-06-28 01:51:10,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:10,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:51:10,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:10,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:51:10,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:51:10,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:10,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 229 transitions, 2639 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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:51:10,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:10,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:10,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:11,450 INFO L124 PetriNetUnfolderBase]: 1334/2610 cut-off events. [2024-06-28 01:51:11,451 INFO L125 PetriNetUnfolderBase]: For 48801/48817 co-relation queries the response was YES. [2024-06-28 01:51:11,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13807 conditions, 2610 events. 1334/2610 cut-off events. For 48801/48817 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18319 event pairs, 279 based on Foata normal form. 17/2573 useless extension candidates. Maximal degree in co-relation 13688. Up to 2108 conditions per place. [2024-06-28 01:51:11,478 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 221 selfloop transitions, 28 changer transitions 0/259 dead transitions. [2024-06-28 01:51:11,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 259 transitions, 3383 flow [2024-06-28 01:51:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:51:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:51:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-28 01:51:11,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105105105105106 [2024-06-28 01:51:11,479 INFO L175 Difference]: Start difference. First operand has 248 places, 229 transitions, 2639 flow. Second operand 9 states and 170 transitions. [2024-06-28 01:51:11,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 259 transitions, 3383 flow [2024-06-28 01:51:11,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 259 transitions, 3141 flow, removed 117 selfloop flow, removed 2 redundant places. [2024-06-28 01:51:11,647 INFO L231 Difference]: Finished difference. Result has 255 places, 229 transitions, 2464 flow [2024-06-28 01:51:11,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2397, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2464, PETRI_PLACES=255, PETRI_TRANSITIONS=229} [2024-06-28 01:51:11,647 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 214 predicate places. [2024-06-28 01:51:11,647 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 229 transitions, 2464 flow [2024-06-28 01:51:11,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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:51:11,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:11,647 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:51:11,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-28 01:51:11,648 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:11,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:11,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1792280290, now seen corresponding path program 11 times [2024-06-28 01:51:11,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:11,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041494423] [2024-06-28 01:51:11,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:11,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:12,991 INFO 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:51:12,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:12,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041494423] [2024-06-28 01:51:12,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041494423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:12,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:12,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:12,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778815353] [2024-06-28 01:51:12,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:12,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:12,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:12,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:12,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:13,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:13,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 229 transitions, 2464 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:13,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:13,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:13,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:13,900 INFO L124 PetriNetUnfolderBase]: 1332/2607 cut-off events. [2024-06-28 01:51:13,900 INFO L125 PetriNetUnfolderBase]: For 44818/44834 co-relation queries the response was YES. [2024-06-28 01:51:13,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13531 conditions, 2607 events. 1332/2607 cut-off events. For 44818/44834 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18278 event pairs, 279 based on Foata normal form. 17/2570 useless extension candidates. Maximal degree in co-relation 13410. Up to 2106 conditions per place. [2024-06-28 01:51:13,925 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 225 selfloop transitions, 28 changer transitions 0/263 dead transitions. [2024-06-28 01:51:13,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 263 transitions, 3114 flow [2024-06-28 01:51:13,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-06-28 01:51:13,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027027027027027 [2024-06-28 01:51:13,926 INFO L175 Difference]: Start difference. First operand has 255 places, 229 transitions, 2464 flow. Second operand 10 states and 186 transitions. [2024-06-28 01:51:13,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 263 transitions, 3114 flow [2024-06-28 01:51:14,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 263 transitions, 2931 flow, removed 46 selfloop flow, removed 9 redundant places. [2024-06-28 01:51:14,067 INFO L231 Difference]: Finished difference. Result has 256 places, 229 transitions, 2342 flow [2024-06-28 01:51:14,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2281, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2342, PETRI_PLACES=256, PETRI_TRANSITIONS=229} [2024-06-28 01:51:14,068 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 215 predicate places. [2024-06-28 01:51:14,068 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 229 transitions, 2342 flow [2024-06-28 01:51:14,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:14,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:14,068 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:51:14,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-28 01:51:14,068 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:14,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:14,069 INFO L85 PathProgramCache]: Analyzing trace with hash 224305018, now seen corresponding path program 11 times [2024-06-28 01:51:14,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:14,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442452242] [2024-06-28 01:51:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:14,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:14,966 INFO 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:51:14,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:14,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442452242] [2024-06-28 01:51:14,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442452242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:14,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:14,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:51:14,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74936776] [2024-06-28 01:51:14,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:14,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:51:14,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:51:14,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:51:15,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:15,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 229 transitions, 2342 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:51:15,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:15,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:15,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:15,672 INFO L124 PetriNetUnfolderBase]: 1411/2746 cut-off events. [2024-06-28 01:51:15,672 INFO L125 PetriNetUnfolderBase]: For 48258/48270 co-relation queries the response was YES. [2024-06-28 01:51:15,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14231 conditions, 2746 events. 1411/2746 cut-off events. For 48258/48270 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 19470 event pairs, 362 based on Foata normal form. 14/2690 useless extension candidates. Maximal degree in co-relation 14109. Up to 2244 conditions per place. [2024-06-28 01:51:15,701 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 231 selfloop transitions, 43 changer transitions 0/284 dead transitions. [2024-06-28 01:51:15,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 284 transitions, 3294 flow [2024-06-28 01:51:15,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-28 01:51:15,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054054054054054 [2024-06-28 01:51:15,702 INFO L175 Difference]: Start difference. First operand has 256 places, 229 transitions, 2342 flow. Second operand 10 states and 187 transitions. [2024-06-28 01:51:15,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 284 transitions, 3294 flow [2024-06-28 01:51:15,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 284 transitions, 3229 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-28 01:51:15,871 INFO L231 Difference]: Finished difference. Result has 261 places, 252 transitions, 2723 flow [2024-06-28 01:51:15,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2277, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2723, PETRI_PLACES=261, PETRI_TRANSITIONS=252} [2024-06-28 01:51:15,872 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 220 predicate places. [2024-06-28 01:51:15,872 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 252 transitions, 2723 flow [2024-06-28 01:51:15,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:51:15,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:15,872 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:51:15,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-28 01:51:15,872 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:15,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:15,873 INFO L85 PathProgramCache]: Analyzing trace with hash -82214342, now seen corresponding path program 12 times [2024-06-28 01:51:15,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:15,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920184186] [2024-06-28 01:51:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:16,664 INFO 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:51:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:16,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920184186] [2024-06-28 01:51:16,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920184186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:16,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:16,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:51:16,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141558584] [2024-06-28 01:51:16,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:16,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:51:16,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:16,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:51:16,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:51:16,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:16,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 252 transitions, 2723 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:51:16,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:16,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:16,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:17,429 INFO L124 PetriNetUnfolderBase]: 1460/2840 cut-off events. [2024-06-28 01:51:17,429 INFO L125 PetriNetUnfolderBase]: For 48838/48850 co-relation queries the response was YES. [2024-06-28 01:51:17,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15091 conditions, 2840 events. 1460/2840 cut-off events. For 48838/48850 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20261 event pairs, 367 based on Foata normal form. 14/2782 useless extension candidates. Maximal degree in co-relation 14964. Up to 2302 conditions per place. [2024-06-28 01:51:17,460 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 238 selfloop transitions, 53 changer transitions 0/301 dead transitions. [2024-06-28 01:51:17,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 301 transitions, 3697 flow [2024-06-28 01:51:17,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-28 01:51:17,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054054054054054 [2024-06-28 01:51:17,461 INFO L175 Difference]: Start difference. First operand has 261 places, 252 transitions, 2723 flow. Second operand 10 states and 187 transitions. [2024-06-28 01:51:17,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 301 transitions, 3697 flow [2024-06-28 01:51:17,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 301 transitions, 3575 flow, removed 39 selfloop flow, removed 4 redundant places. [2024-06-28 01:51:17,653 INFO L231 Difference]: Finished difference. Result has 270 places, 268 transitions, 3042 flow [2024-06-28 01:51:17,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2644, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3042, PETRI_PLACES=270, PETRI_TRANSITIONS=268} [2024-06-28 01:51:17,654 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 229 predicate places. [2024-06-28 01:51:17,654 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 268 transitions, 3042 flow [2024-06-28 01:51:17,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 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:51:17,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:17,654 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:51:17,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-28 01:51:17,654 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:17,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash -982168071, now seen corresponding path program 1 times [2024-06-28 01:51:17,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:17,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596110303] [2024-06-28 01:51:17,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:17,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:18,523 INFO 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:51:18,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:18,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596110303] [2024-06-28 01:51:18,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596110303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:18,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:18,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:18,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539069943] [2024-06-28 01:51:18,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:18,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:18,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:18,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:18,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:18,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:18,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 268 transitions, 3042 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:18,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:18,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:18,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:19,377 INFO L124 PetriNetUnfolderBase]: 1495/2914 cut-off events. [2024-06-28 01:51:19,377 INFO L125 PetriNetUnfolderBase]: For 52942/52956 co-relation queries the response was YES. [2024-06-28 01:51:19,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15615 conditions, 2914 events. 1495/2914 cut-off events. For 52942/52956 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 20953 event pairs, 379 based on Foata normal form. 16/2854 useless extension candidates. Maximal degree in co-relation 15485. Up to 2353 conditions per place. [2024-06-28 01:51:19,403 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 268 selfloop transitions, 29 changer transitions 0/307 dead transitions. [2024-06-28 01:51:19,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 307 transitions, 3969 flow [2024-06-28 01:51:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-28 01:51:19,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054054054054054 [2024-06-28 01:51:19,408 INFO L175 Difference]: Start difference. First operand has 270 places, 268 transitions, 3042 flow. Second operand 10 states and 187 transitions. [2024-06-28 01:51:19,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 307 transitions, 3969 flow [2024-06-28 01:51:19,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 307 transitions, 3813 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-28 01:51:19,591 INFO L231 Difference]: Finished difference. Result has 273 places, 271 transitions, 3002 flow [2024-06-28 01:51:19,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2886, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3002, PETRI_PLACES=273, PETRI_TRANSITIONS=271} [2024-06-28 01:51:19,592 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 232 predicate places. [2024-06-28 01:51:19,592 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 271 transitions, 3002 flow [2024-06-28 01:51:19,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:19,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:19,592 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:51:19,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-28 01:51:19,592 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:19,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1021411995, now seen corresponding path program 2 times [2024-06-28 01:51:19,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:19,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070992616] [2024-06-28 01:51:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:19,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:20,651 INFO 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:51:20,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:20,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070992616] [2024-06-28 01:51:20,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070992616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:20,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:20,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:20,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257359912] [2024-06-28 01:51:20,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:20,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:20,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:20,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:20,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:20,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:20,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 271 transitions, 3002 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:20,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:20,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:20,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:21,463 INFO L124 PetriNetUnfolderBase]: 1528/2981 cut-off events. [2024-06-28 01:51:21,464 INFO L125 PetriNetUnfolderBase]: For 59054/59068 co-relation queries the response was YES. [2024-06-28 01:51:21,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15556 conditions, 2981 events. 1528/2981 cut-off events. For 59054/59068 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 21528 event pairs, 365 based on Foata normal form. 22/2928 useless extension candidates. Maximal degree in co-relation 15425. Up to 2199 conditions per place. [2024-06-28 01:51:21,497 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 245 selfloop transitions, 55 changer transitions 0/310 dead transitions. [2024-06-28 01:51:21,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 310 transitions, 3833 flow [2024-06-28 01:51:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-28 01:51:21,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:51:21,498 INFO L175 Difference]: Start difference. First operand has 273 places, 271 transitions, 3002 flow. Second operand 10 states and 190 transitions. [2024-06-28 01:51:21,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 310 transitions, 3833 flow [2024-06-28 01:51:21,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 310 transitions, 3771 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-28 01:51:21,698 INFO L231 Difference]: Finished difference. Result has 279 places, 272 transitions, 3070 flow [2024-06-28 01:51:21,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2940, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3070, PETRI_PLACES=279, PETRI_TRANSITIONS=272} [2024-06-28 01:51:21,698 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 238 predicate places. [2024-06-28 01:51:21,698 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 272 transitions, 3070 flow [2024-06-28 01:51:21,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:21,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:21,699 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:51:21,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-28 01:51:21,699 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:21,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1787805863, now seen corresponding path program 3 times [2024-06-28 01:51:21,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:21,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638868116] [2024-06-28 01:51:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:21,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:23,256 INFO 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:51:23,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:23,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638868116] [2024-06-28 01:51:23,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638868116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:23,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:23,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:23,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788404348] [2024-06-28 01:51:23,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:23,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:23,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:23,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:23,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:23,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:23,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 272 transitions, 3070 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:23,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:23,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:23,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:24,194 INFO L124 PetriNetUnfolderBase]: 1544/3016 cut-off events. [2024-06-28 01:51:24,195 INFO L125 PetriNetUnfolderBase]: For 48826/48838 co-relation queries the response was YES. [2024-06-28 01:51:24,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15751 conditions, 3016 events. 1544/3016 cut-off events. For 48826/48838 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21820 event pairs, 419 based on Foata normal form. 14/2955 useless extension candidates. Maximal degree in co-relation 15617. Up to 2444 conditions per place. [2024-06-28 01:51:24,228 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 263 selfloop transitions, 35 changer transitions 0/308 dead transitions. [2024-06-28 01:51:24,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 308 transitions, 3848 flow [2024-06-28 01:51:24,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-28 01:51:24,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108108108108108 [2024-06-28 01:51:24,229 INFO L175 Difference]: Start difference. First operand has 279 places, 272 transitions, 3070 flow. Second operand 10 states and 189 transitions. [2024-06-28 01:51:24,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 308 transitions, 3848 flow [2024-06-28 01:51:24,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 308 transitions, 3745 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 01:51:24,429 INFO L231 Difference]: Finished difference. Result has 282 places, 273 transitions, 3063 flow [2024-06-28 01:51:24,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2967, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3063, PETRI_PLACES=282, PETRI_TRANSITIONS=273} [2024-06-28 01:51:24,430 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 241 predicate places. [2024-06-28 01:51:24,430 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 273 transitions, 3063 flow [2024-06-28 01:51:24,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:24,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:24,430 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:51:24,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-28 01:51:24,430 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:24,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:24,430 INFO L85 PathProgramCache]: Analyzing trace with hash -987674601, now seen corresponding path program 4 times [2024-06-28 01:51:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92187809] [2024-06-28 01:51:24,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:24,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:25,606 INFO 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:51:25,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:25,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92187809] [2024-06-28 01:51:25,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92187809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:25,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:25,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:25,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472730224] [2024-06-28 01:51:25,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:25,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:25,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:25,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:25,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:25,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 273 transitions, 3063 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:25,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:25,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:25,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:26,472 INFO L124 PetriNetUnfolderBase]: 1560/3021 cut-off events. [2024-06-28 01:51:26,473 INFO L125 PetriNetUnfolderBase]: For 50258/50274 co-relation queries the response was YES. [2024-06-28 01:51:26,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15946 conditions, 3021 events. 1560/3021 cut-off events. For 50258/50274 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21807 event pairs, 409 based on Foata normal form. 18/2967 useless extension candidates. Maximal degree in co-relation 15811. Up to 2433 conditions per place. [2024-06-28 01:51:26,506 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 247 selfloop transitions, 53 changer transitions 0/310 dead transitions. [2024-06-28 01:51:26,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 310 transitions, 3849 flow [2024-06-28 01:51:26,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-28 01:51:26,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:51:26,507 INFO L175 Difference]: Start difference. First operand has 282 places, 273 transitions, 3063 flow. Second operand 10 states and 185 transitions. [2024-06-28 01:51:26,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 310 transitions, 3849 flow [2024-06-28 01:51:26,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 310 transitions, 3763 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-28 01:51:26,719 INFO L231 Difference]: Finished difference. Result has 284 places, 274 transitions, 3111 flow [2024-06-28 01:51:26,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2977, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3111, PETRI_PLACES=284, PETRI_TRANSITIONS=274} [2024-06-28 01:51:26,719 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 243 predicate places. [2024-06-28 01:51:26,719 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 274 transitions, 3111 flow [2024-06-28 01:51:26,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:26,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:26,719 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:51:26,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-28 01:51:26,720 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:26,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash -503794337, now seen corresponding path program 5 times [2024-06-28 01:51:26,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:26,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092036165] [2024-06-28 01:51:26,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:26,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:27,882 INFO 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:51:27,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:27,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092036165] [2024-06-28 01:51:27,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092036165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:27,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:27,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:27,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663632674] [2024-06-28 01:51:27,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:27,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:27,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:27,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:27,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:27,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:27,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 274 transitions, 3111 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:27,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:27,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:27,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:28,846 INFO L124 PetriNetUnfolderBase]: 1595/3097 cut-off events. [2024-06-28 01:51:28,846 INFO L125 PetriNetUnfolderBase]: For 57097/57109 co-relation queries the response was YES. [2024-06-28 01:51:28,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16539 conditions, 3097 events. 1595/3097 cut-off events. For 57097/57109 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22426 event pairs, 428 based on Foata normal form. 14/3038 useless extension candidates. Maximal degree in co-relation 16403. Up to 2458 conditions per place. [2024-06-28 01:51:28,882 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 266 selfloop transitions, 37 changer transitions 0/313 dead transitions. [2024-06-28 01:51:28,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 313 transitions, 4067 flow [2024-06-28 01:51:28,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-28 01:51:28,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162162162162162 [2024-06-28 01:51:28,883 INFO L175 Difference]: Start difference. First operand has 284 places, 274 transitions, 3111 flow. Second operand 10 states and 191 transitions. [2024-06-28 01:51:28,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 313 transitions, 4067 flow [2024-06-28 01:51:29,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 313 transitions, 3943 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-28 01:51:29,121 INFO L231 Difference]: Finished difference. Result has 286 places, 276 transitions, 3115 flow [2024-06-28 01:51:29,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2987, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3115, PETRI_PLACES=286, PETRI_TRANSITIONS=276} [2024-06-28 01:51:29,121 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 245 predicate places. [2024-06-28 01:51:29,121 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 276 transitions, 3115 flow [2024-06-28 01:51:29,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:29,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:29,122 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:51:29,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-28 01:51:29,122 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:29,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:29,122 INFO L85 PathProgramCache]: Analyzing trace with hash -247086437, now seen corresponding path program 6 times [2024-06-28 01:51:29,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:29,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667193657] [2024-06-28 01:51:29,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:29,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:30,000 INFO 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:51:30,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:30,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667193657] [2024-06-28 01:51:30,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667193657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:30,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:30,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:30,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843970121] [2024-06-28 01:51:30,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:30,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:30,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:30,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:30,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:30,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:30,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 276 transitions, 3115 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:30,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:30,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:30,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:30,866 INFO L124 PetriNetUnfolderBase]: 1644/3212 cut-off events. [2024-06-28 01:51:30,867 INFO L125 PetriNetUnfolderBase]: For 73182/73194 co-relation queries the response was YES. [2024-06-28 01:51:30,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16913 conditions, 3212 events. 1644/3212 cut-off events. For 73182/73194 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 23590 event pairs, 442 based on Foata normal form. 22/3156 useless extension candidates. Maximal degree in co-relation 16776. Up to 2461 conditions per place. [2024-06-28 01:51:30,903 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 261 selfloop transitions, 43 changer transitions 0/314 dead transitions. [2024-06-28 01:51:30,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 314 transitions, 3943 flow [2024-06-28 01:51:30,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-28 01:51:30,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216216216216216 [2024-06-28 01:51:30,904 INFO L175 Difference]: Start difference. First operand has 286 places, 276 transitions, 3115 flow. Second operand 10 states and 193 transitions. [2024-06-28 01:51:30,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 314 transitions, 3943 flow [2024-06-28 01:51:31,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 314 transitions, 3856 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-28 01:51:31,149 INFO L231 Difference]: Finished difference. Result has 290 places, 276 transitions, 3120 flow [2024-06-28 01:51:31,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3028, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3120, PETRI_PLACES=290, PETRI_TRANSITIONS=276} [2024-06-28 01:51:31,150 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 249 predicate places. [2024-06-28 01:51:31,150 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 276 transitions, 3120 flow [2024-06-28 01:51:31,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:31,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:31,150 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:51:31,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-28 01:51:31,150 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:31,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:31,150 INFO L85 PathProgramCache]: Analyzing trace with hash -89565605, now seen corresponding path program 7 times [2024-06-28 01:51:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:31,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530957690] [2024-06-28 01:51:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:31,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:32,032 INFO 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:51:32,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:32,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530957690] [2024-06-28 01:51:32,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530957690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:32,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:32,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:32,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176158195] [2024-06-28 01:51:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:32,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:32,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:32,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:32,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:32,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:32,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 276 transitions, 3120 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:32,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:32,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:32,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:32,950 INFO L124 PetriNetUnfolderBase]: 1696/3287 cut-off events. [2024-06-28 01:51:32,950 INFO L125 PetriNetUnfolderBase]: For 70137/70151 co-relation queries the response was YES. [2024-06-28 01:51:32,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17300 conditions, 3287 events. 1696/3287 cut-off events. For 70137/70151 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 24114 event pairs, 462 based on Foata normal form. 22/3235 useless extension candidates. Maximal degree in co-relation 17161. Up to 2619 conditions per place. [2024-06-28 01:51:32,983 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 256 selfloop transitions, 49 changer transitions 0/315 dead transitions. [2024-06-28 01:51:32,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 315 transitions, 3932 flow [2024-06-28 01:51:32,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-28 01:51:32,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081081081081081 [2024-06-28 01:51:32,984 INFO L175 Difference]: Start difference. First operand has 290 places, 276 transitions, 3120 flow. Second operand 10 states and 188 transitions. [2024-06-28 01:51:32,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 315 transitions, 3932 flow [2024-06-28 01:51:33,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 315 transitions, 3848 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-28 01:51:33,238 INFO L231 Difference]: Finished difference. Result has 292 places, 276 transitions, 3137 flow [2024-06-28 01:51:33,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3036, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3137, PETRI_PLACES=292, PETRI_TRANSITIONS=276} [2024-06-28 01:51:33,238 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 251 predicate places. [2024-06-28 01:51:33,238 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 276 transitions, 3137 flow [2024-06-28 01:51:33,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:33,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:33,239 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:51:33,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-28 01:51:33,239 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:33,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:33,239 INFO L85 PathProgramCache]: Analyzing trace with hash -83851685, now seen corresponding path program 8 times [2024-06-28 01:51:33,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:33,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446475852] [2024-06-28 01:51:33,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:33,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:34,294 INFO 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:51:34,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:34,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446475852] [2024-06-28 01:51:34,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446475852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:34,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:34,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:34,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864359203] [2024-06-28 01:51:34,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:34,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:34,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:34,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:34,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:34,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:34,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 276 transitions, 3137 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:34,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:34,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:34,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:35,197 INFO L124 PetriNetUnfolderBase]: 1712/3370 cut-off events. [2024-06-28 01:51:35,197 INFO L125 PetriNetUnfolderBase]: For 57645/57657 co-relation queries the response was YES. [2024-06-28 01:51:35,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17579 conditions, 3370 events. 1712/3370 cut-off events. For 57645/57657 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 25096 event pairs, 502 based on Foata normal form. 14/3298 useless extension candidates. Maximal degree in co-relation 17439. Up to 2717 conditions per place. [2024-06-28 01:51:35,237 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 240 selfloop transitions, 62 changer transitions 0/312 dead transitions. [2024-06-28 01:51:35,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 312 transitions, 3923 flow [2024-06-28 01:51:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-28 01:51:35,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054054054054054 [2024-06-28 01:51:35,238 INFO L175 Difference]: Start difference. First operand has 292 places, 276 transitions, 3137 flow. Second operand 10 states and 187 transitions. [2024-06-28 01:51:35,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 312 transitions, 3923 flow [2024-06-28 01:51:35,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 312 transitions, 3826 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:51:35,520 INFO L231 Difference]: Finished difference. Result has 294 places, 277 transitions, 3196 flow [2024-06-28 01:51:35,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3040, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3196, PETRI_PLACES=294, PETRI_TRANSITIONS=277} [2024-06-28 01:51:35,521 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 253 predicate places. [2024-06-28 01:51:35,521 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 277 transitions, 3196 flow [2024-06-28 01:51:35,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:35,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:35,521 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:51:35,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-28 01:51:35,521 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:35,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:35,522 INFO L85 PathProgramCache]: Analyzing trace with hash -84059075, now seen corresponding path program 9 times [2024-06-28 01:51:35,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:35,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11639021] [2024-06-28 01:51:35,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:35,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:36,869 INFO 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:51:36,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:36,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11639021] [2024-06-28 01:51:36,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11639021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:36,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:36,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:36,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211193109] [2024-06-28 01:51:36,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:36,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:36,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:36,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:36,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:36,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 277 transitions, 3196 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:36,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:36,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:36,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:37,837 INFO L124 PetriNetUnfolderBase]: 1728/3348 cut-off events. [2024-06-28 01:51:37,837 INFO L125 PetriNetUnfolderBase]: For 59960/59972 co-relation queries the response was YES. [2024-06-28 01:51:37,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17872 conditions, 3348 events. 1728/3348 cut-off events. For 59960/59972 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 24650 event pairs, 486 based on Foata normal form. 14/3287 useless extension candidates. Maximal degree in co-relation 17731. Up to 2561 conditions per place. [2024-06-28 01:51:37,875 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 241 selfloop transitions, 63 changer transitions 0/314 dead transitions. [2024-06-28 01:51:37,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 314 transitions, 3990 flow [2024-06-28 01:51:37,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:37,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-28 01:51:37,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108108108108108 [2024-06-28 01:51:37,877 INFO L175 Difference]: Start difference. First operand has 294 places, 277 transitions, 3196 flow. Second operand 10 states and 189 transitions. [2024-06-28 01:51:37,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 314 transitions, 3990 flow [2024-06-28 01:51:38,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 314 transitions, 3844 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-28 01:51:38,160 INFO L231 Difference]: Finished difference. Result has 296 places, 278 transitions, 3215 flow [2024-06-28 01:51:38,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3050, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3215, PETRI_PLACES=296, PETRI_TRANSITIONS=278} [2024-06-28 01:51:38,160 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 255 predicate places. [2024-06-28 01:51:38,160 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 278 transitions, 3215 flow [2024-06-28 01:51:38,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:38,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:38,161 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:51:38,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-28 01:51:38,161 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:38,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:38,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1431263771, now seen corresponding path program 10 times [2024-06-28 01:51:38,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:38,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491919404] [2024-06-28 01:51:38,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:38,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:38,979 INFO 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:51:38,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:38,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491919404] [2024-06-28 01:51:38,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491919404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:38,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:38,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:38,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459580902] [2024-06-28 01:51:38,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:38,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:38,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:38,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:38,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:39,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:39,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 278 transitions, 3215 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:39,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:39,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:39,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:39,948 INFO L124 PetriNetUnfolderBase]: 1780/3421 cut-off events. [2024-06-28 01:51:39,948 INFO L125 PetriNetUnfolderBase]: For 77527/77543 co-relation queries the response was YES. [2024-06-28 01:51:39,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18322 conditions, 3421 events. 1780/3421 cut-off events. For 77527/77543 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 25114 event pairs, 524 based on Foata normal form. 24/3371 useless extension candidates. Maximal degree in co-relation 18180. Up to 2785 conditions per place. [2024-06-28 01:51:39,983 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 268 selfloop transitions, 39 changer transitions 0/317 dead transitions. [2024-06-28 01:51:39,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 317 transitions, 4027 flow [2024-06-28 01:51:39,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-28 01:51:39,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081081081081081 [2024-06-28 01:51:39,984 INFO L175 Difference]: Start difference. First operand has 296 places, 278 transitions, 3215 flow. Second operand 10 states and 188 transitions. [2024-06-28 01:51:39,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 317 transitions, 4027 flow [2024-06-28 01:51:40,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 317 transitions, 3882 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-28 01:51:40,314 INFO L231 Difference]: Finished difference. Result has 298 places, 278 transitions, 3151 flow [2024-06-28 01:51:40,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3070, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3151, PETRI_PLACES=298, PETRI_TRANSITIONS=278} [2024-06-28 01:51:40,315 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 257 predicate places. [2024-06-28 01:51:40,315 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 278 transitions, 3151 flow [2024-06-28 01:51:40,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:40,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:40,315 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:51:40,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-28 01:51:40,315 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:40,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:40,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1908737811, now seen corresponding path program 1 times [2024-06-28 01:51:40,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:40,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233157260] [2024-06-28 01:51:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:40,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:41,516 INFO 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:51:41,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:41,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233157260] [2024-06-28 01:51:41,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233157260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:41,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:41,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:51:41,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827964542] [2024-06-28 01:51:41,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:41,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:51:41,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:41,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:51:41,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:51:41,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:41,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 278 transitions, 3151 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:41,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:41,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:41,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:42,747 INFO L124 PetriNetUnfolderBase]: 1832/3588 cut-off events. [2024-06-28 01:51:42,747 INFO L125 PetriNetUnfolderBase]: For 79139/79151 co-relation queries the response was YES. [2024-06-28 01:51:42,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18770 conditions, 3588 events. 1832/3588 cut-off events. For 79139/79151 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 26867 event pairs, 566 based on Foata normal form. 20/3526 useless extension candidates. Maximal degree in co-relation 18627. Up to 2805 conditions per place. [2024-06-28 01:51:42,784 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 269 selfloop transitions, 42 changer transitions 0/321 dead transitions. [2024-06-28 01:51:42,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 321 transitions, 4019 flow [2024-06-28 01:51:42,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:51:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:51:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-28 01:51:42,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208845208845209 [2024-06-28 01:51:42,785 INFO L175 Difference]: Start difference. First operand has 298 places, 278 transitions, 3151 flow. Second operand 11 states and 212 transitions. [2024-06-28 01:51:42,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 321 transitions, 4019 flow [2024-06-28 01:51:43,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 321 transitions, 3942 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:51:43,159 INFO L231 Difference]: Finished difference. Result has 301 places, 278 transitions, 3163 flow [2024-06-28 01:51:43,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3074, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3163, PETRI_PLACES=301, PETRI_TRANSITIONS=278} [2024-06-28 01:51:43,160 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 260 predicate places. [2024-06-28 01:51:43,160 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 278 transitions, 3163 flow [2024-06-28 01:51:43,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:43,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:43,160 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:51:43,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-28 01:51:43,160 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:43,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:43,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2054039319, now seen corresponding path program 2 times [2024-06-28 01:51:43,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:43,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543699861] [2024-06-28 01:51:43,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:44,475 INFO 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:51:44,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:44,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543699861] [2024-06-28 01:51:44,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543699861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:44,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:44,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:51:44,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101198295] [2024-06-28 01:51:44,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:44,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:51:44,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:44,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:51:44,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:51:44,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:44,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 278 transitions, 3163 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:44,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:44,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:44,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:45,551 INFO L124 PetriNetUnfolderBase]: 1930/3734 cut-off events. [2024-06-28 01:51:45,551 INFO L125 PetriNetUnfolderBase]: For 101064/101076 co-relation queries the response was YES. [2024-06-28 01:51:45,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20464 conditions, 3734 events. 1930/3734 cut-off events. For 101064/101076 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 28149 event pairs, 534 based on Foata normal form. 18/3686 useless extension candidates. Maximal degree in co-relation 20320. Up to 2395 conditions per place. [2024-06-28 01:51:45,597 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 271 selfloop transitions, 44 changer transitions 0/325 dead transitions. [2024-06-28 01:51:45,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 325 transitions, 4233 flow [2024-06-28 01:51:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:51:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:51:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2024-06-28 01:51:45,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233415233415234 [2024-06-28 01:51:45,598 INFO L175 Difference]: Start difference. First operand has 301 places, 278 transitions, 3163 flow. Second operand 11 states and 213 transitions. [2024-06-28 01:51:45,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 325 transitions, 4233 flow [2024-06-28 01:51:46,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 325 transitions, 4152 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:51:46,089 INFO L231 Difference]: Finished difference. Result has 303 places, 278 transitions, 3173 flow [2024-06-28 01:51:46,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3082, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3173, PETRI_PLACES=303, PETRI_TRANSITIONS=278} [2024-06-28 01:51:46,090 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 262 predicate places. [2024-06-28 01:51:46,090 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 278 transitions, 3173 flow [2024-06-28 01:51:46,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:46,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:46,090 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:51:46,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-28 01:51:46,090 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:46,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:46,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2044516119, now seen corresponding path program 3 times [2024-06-28 01:51:46,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:46,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485099067] [2024-06-28 01:51:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:47,616 INFO 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:51:47,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:47,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485099067] [2024-06-28 01:51:47,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485099067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:47,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:47,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:51:47,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719674074] [2024-06-28 01:51:47,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:47,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:51:47,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:47,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:51:47,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:51:47,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:47,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 278 transitions, 3173 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:47,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:47,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:47,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:48,882 INFO L124 PetriNetUnfolderBase]: 1963/3846 cut-off events. [2024-06-28 01:51:48,882 INFO L125 PetriNetUnfolderBase]: For 104367/104379 co-relation queries the response was YES. [2024-06-28 01:51:48,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20675 conditions, 3846 events. 1963/3846 cut-off events. For 104367/104379 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 29405 event pairs, 665 based on Foata normal form. 20/3787 useless extension candidates. Maximal degree in co-relation 20530. Up to 3140 conditions per place. [2024-06-28 01:51:48,929 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 274 selfloop transitions, 37 changer transitions 0/321 dead transitions. [2024-06-28 01:51:48,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 321 transitions, 4041 flow [2024-06-28 01:51:48,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:51:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:51:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2024-06-28 01:51:48,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110565110565111 [2024-06-28 01:51:48,930 INFO L175 Difference]: Start difference. First operand has 303 places, 278 transitions, 3173 flow. Second operand 11 states and 208 transitions. [2024-06-28 01:51:48,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 321 transitions, 4041 flow [2024-06-28 01:51:49,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 321 transitions, 3954 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:51:49,407 INFO L231 Difference]: Finished difference. Result has 305 places, 278 transitions, 3164 flow [2024-06-28 01:51:49,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3086, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3164, PETRI_PLACES=305, PETRI_TRANSITIONS=278} [2024-06-28 01:51:49,408 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 264 predicate places. [2024-06-28 01:51:49,408 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 278 transitions, 3164 flow [2024-06-28 01:51:49,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:49,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:49,408 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:51:49,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-28 01:51:49,408 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:49,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:49,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2087216425, now seen corresponding path program 4 times [2024-06-28 01:51:49,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:49,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934998161] [2024-06-28 01:51:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:49,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:50,718 INFO 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:51:50,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934998161] [2024-06-28 01:51:50,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934998161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:50,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:50,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:51:50,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968424384] [2024-06-28 01:51:50,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:50,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:51:50,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:50,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:51:50,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:51:50,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:50,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 278 transitions, 3164 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:50,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:50,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:50,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:51,892 INFO L124 PetriNetUnfolderBase]: 1979/3891 cut-off events. [2024-06-28 01:51:51,892 INFO L125 PetriNetUnfolderBase]: For 91241/91253 co-relation queries the response was YES. [2024-06-28 01:51:51,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20605 conditions, 3891 events. 1979/3891 cut-off events. For 91241/91253 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 29990 event pairs, 647 based on Foata normal form. 20/3826 useless extension candidates. Maximal degree in co-relation 20459. Up to 3060 conditions per place. [2024-06-28 01:51:51,944 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 247 selfloop transitions, 67 changer transitions 0/324 dead transitions. [2024-06-28 01:51:51,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 324 transitions, 4118 flow [2024-06-28 01:51:51,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:51:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:51:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2024-06-28 01:51:51,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110565110565111 [2024-06-28 01:51:51,945 INFO L175 Difference]: Start difference. First operand has 305 places, 278 transitions, 3164 flow. Second operand 11 states and 208 transitions. [2024-06-28 01:51:51,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 324 transitions, 4118 flow [2024-06-28 01:51:52,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 324 transitions, 4046 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:51:52,433 INFO L231 Difference]: Finished difference. Result has 308 places, 280 transitions, 3300 flow [2024-06-28 01:51:52,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3092, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3300, PETRI_PLACES=308, PETRI_TRANSITIONS=280} [2024-06-28 01:51:52,433 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 267 predicate places. [2024-06-28 01:51:52,433 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 280 transitions, 3300 flow [2024-06-28 01:51:52,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:52,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:52,434 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:51:52,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-28 01:51:52,434 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:52,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:52,434 INFO L85 PathProgramCache]: Analyzing trace with hash -381945797, now seen corresponding path program 11 times [2024-06-28 01:51:52,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:52,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905876411] [2024-06-28 01:51:52,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:52,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:53,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:51:53,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:53,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905876411] [2024-06-28 01:51:53,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905876411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:53,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:53,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:53,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37692019] [2024-06-28 01:51:53,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:53,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:53,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:53,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:53,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:53,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:53,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 280 transitions, 3300 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:53,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:53,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:53,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:54,655 INFO L124 PetriNetUnfolderBase]: 1995/3838 cut-off events. [2024-06-28 01:51:54,655 INFO L125 PetriNetUnfolderBase]: For 79941/79963 co-relation queries the response was YES. [2024-06-28 01:51:54,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21038 conditions, 3838 events. 1995/3838 cut-off events. For 79941/79963 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28918 event pairs, 544 based on Foata normal form. 24/3804 useless extension candidates. Maximal degree in co-relation 20890. Up to 3166 conditions per place. [2024-06-28 01:51:54,700 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 247 selfloop transitions, 57 changer transitions 0/314 dead transitions. [2024-06-28 01:51:54,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 314 transitions, 4096 flow [2024-06-28 01:51:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-28 01:51:54,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162162162162162 [2024-06-28 01:51:54,701 INFO L175 Difference]: Start difference. First operand has 308 places, 280 transitions, 3300 flow. Second operand 10 states and 191 transitions. [2024-06-28 01:51:54,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 314 transitions, 4096 flow [2024-06-28 01:51:55,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 314 transitions, 3926 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-28 01:51:55,270 INFO L231 Difference]: Finished difference. Result has 310 places, 281 transitions, 3280 flow [2024-06-28 01:51:55,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3130, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3280, PETRI_PLACES=310, PETRI_TRANSITIONS=281} [2024-06-28 01:51:55,271 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 269 predicate places. [2024-06-28 01:51:55,271 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 281 transitions, 3280 flow [2024-06-28 01:51:55,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:55,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:55,271 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:51:55,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-28 01:51:55,271 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:55,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:55,272 INFO L85 PathProgramCache]: Analyzing trace with hash -382153187, now seen corresponding path program 12 times [2024-06-28 01:51:55,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:55,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753253028] [2024-06-28 01:51:55,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:55,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:56,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:51:56,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:56,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753253028] [2024-06-28 01:51:56,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753253028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:56,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:56,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:56,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823497131] [2024-06-28 01:51:56,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:56,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:56,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:56,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:56,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:56,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:56,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 281 transitions, 3280 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:56,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:56,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:56,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:57,256 INFO L124 PetriNetUnfolderBase]: 2030/3901 cut-off events. [2024-06-28 01:51:57,257 INFO L125 PetriNetUnfolderBase]: For 90120/90142 co-relation queries the response was YES. [2024-06-28 01:51:57,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21833 conditions, 3901 events. 2030/3901 cut-off events. For 90120/90142 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 29458 event pairs, 537 based on Foata normal form. 24/3866 useless extension candidates. Maximal degree in co-relation 21684. Up to 3185 conditions per place. [2024-06-28 01:51:57,305 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 257 selfloop transitions, 51 changer transitions 0/318 dead transitions. [2024-06-28 01:51:57,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 318 transitions, 4280 flow [2024-06-28 01:51:57,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:51:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:51:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-28 01:51:57,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162162162162162 [2024-06-28 01:51:57,306 INFO L175 Difference]: Start difference. First operand has 310 places, 281 transitions, 3280 flow. Second operand 10 states and 191 transitions. [2024-06-28 01:51:57,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 318 transitions, 4280 flow [2024-06-28 01:51:57,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 318 transitions, 4140 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-28 01:51:57,825 INFO L231 Difference]: Finished difference. Result has 312 places, 283 transitions, 3313 flow [2024-06-28 01:51:57,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3140, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3313, PETRI_PLACES=312, PETRI_TRANSITIONS=283} [2024-06-28 01:51:57,825 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 271 predicate places. [2024-06-28 01:51:57,825 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 283 transitions, 3313 flow [2024-06-28 01:51:57,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:57,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:51:57,826 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:51:57,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-28 01:51:57,826 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:51:57,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:51:57,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1491713755, now seen corresponding path program 13 times [2024-06-28 01:51:57,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:51:57,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130561485] [2024-06-28 01:51:57,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:51:57,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:51:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:51:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:51:58,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:51:58,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130561485] [2024-06-28 01:51:58,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130561485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:51:58,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:51:58,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:51:58,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452062394] [2024-06-28 01:51:58,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:51:58,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:51:58,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:51:58,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:51:58,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:51:58,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:51:58,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 283 transitions, 3313 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:51:58,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:51:58,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:51:58,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:51:59,947 INFO L124 PetriNetUnfolderBase]: 2027/3928 cut-off events. [2024-06-28 01:51:59,947 INFO L125 PetriNetUnfolderBase]: For 84861/84883 co-relation queries the response was YES. [2024-06-28 01:51:59,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21580 conditions, 3928 events. 2027/3928 cut-off events. For 84861/84883 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 29798 event pairs, 547 based on Foata normal form. 24/3887 useless extension candidates. Maximal degree in co-relation 21430. Up to 3277 conditions per place. [2024-06-28 01:51:59,999 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 255 selfloop transitions, 51 changer transitions 0/316 dead transitions. [2024-06-28 01:51:59,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 316 transitions, 4083 flow [2024-06-28 01:52:00,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:52:00,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:52:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-28 01:52:00,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081081081081081 [2024-06-28 01:52:00,000 INFO L175 Difference]: Start difference. First operand has 312 places, 283 transitions, 3313 flow. Second operand 10 states and 188 transitions. [2024-06-28 01:52:00,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 316 transitions, 4083 flow [2024-06-28 01:52:00,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 316 transitions, 3963 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-28 01:52:00,456 INFO L231 Difference]: Finished difference. Result has 316 places, 283 transitions, 3299 flow [2024-06-28 01:52:00,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3193, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3299, PETRI_PLACES=316, PETRI_TRANSITIONS=283} [2024-06-28 01:52:00,457 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 275 predicate places. [2024-06-28 01:52:00,457 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 283 transitions, 3299 flow [2024-06-28 01:52:00,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:00,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:00,457 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:52:00,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-28 01:52:00,457 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:00,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:00,458 INFO L85 PathProgramCache]: Analyzing trace with hash -543370563, now seen corresponding path program 14 times [2024-06-28 01:52:00,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:00,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824748852] [2024-06-28 01:52:00,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:00,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:01,473 INFO 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:52:01,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:01,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824748852] [2024-06-28 01:52:01,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824748852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:01,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:01,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:52:01,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125057808] [2024-06-28 01:52:01,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:01,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:52:01,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:01,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:52:01,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:52:01,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:01,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 283 transitions, 3299 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:01,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:01,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:01,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:02,541 INFO L124 PetriNetUnfolderBase]: 2095/4056 cut-off events. [2024-06-28 01:52:02,541 INFO L125 PetriNetUnfolderBase]: For 113022/113040 co-relation queries the response was YES. [2024-06-28 01:52:02,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22298 conditions, 4056 events. 2095/4056 cut-off events. For 113022/113040 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 31018 event pairs, 462 based on Foata normal form. 28/4022 useless extension candidates. Maximal degree in co-relation 22146. Up to 2891 conditions per place. [2024-06-28 01:52:02,589 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 222 selfloop transitions, 89 changer transitions 0/321 dead transitions. [2024-06-28 01:52:02,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 321 transitions, 4181 flow [2024-06-28 01:52:02,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:52:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:52:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2024-06-28 01:52:02,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5378378378378378 [2024-06-28 01:52:02,590 INFO L175 Difference]: Start difference. First operand has 316 places, 283 transitions, 3299 flow. Second operand 10 states and 199 transitions. [2024-06-28 01:52:02,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 321 transitions, 4181 flow [2024-06-28 01:52:03,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 321 transitions, 4071 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-28 01:52:03,101 INFO L231 Difference]: Finished difference. Result has 317 places, 284 transitions, 3409 flow [2024-06-28 01:52:03,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3189, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3409, PETRI_PLACES=317, PETRI_TRANSITIONS=284} [2024-06-28 01:52:03,102 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 276 predicate places. [2024-06-28 01:52:03,102 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 284 transitions, 3409 flow [2024-06-28 01:52:03,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:03,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:03,102 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:52:03,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-28 01:52:03,102 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:03,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1534962499, now seen corresponding path program 15 times [2024-06-28 01:52:03,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:03,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542233913] [2024-06-28 01:52:03,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:03,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:04,189 INFO 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:52:04,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:04,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542233913] [2024-06-28 01:52:04,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542233913] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:04,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:04,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:52:04,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300189755] [2024-06-28 01:52:04,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:04,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:52:04,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:04,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:52:04,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:52:04,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:04,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 284 transitions, 3409 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:04,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:04,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:04,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:05,359 INFO L124 PetriNetUnfolderBase]: 2147/4048 cut-off events. [2024-06-28 01:52:05,359 INFO L125 PetriNetUnfolderBase]: For 109567/109592 co-relation queries the response was YES. [2024-06-28 01:52:05,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22991 conditions, 4048 events. 2147/4048 cut-off events. For 109567/109592 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 30440 event pairs, 513 based on Foata normal form. 33/4041 useless extension candidates. Maximal degree in co-relation 22838. Up to 3243 conditions per place. [2024-06-28 01:52:05,407 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 249 selfloop transitions, 68 changer transitions 0/327 dead transitions. [2024-06-28 01:52:05,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 327 transitions, 4380 flow [2024-06-28 01:52:05,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:52:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:52:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-28 01:52:05,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216216216216216 [2024-06-28 01:52:05,408 INFO L175 Difference]: Start difference. First operand has 317 places, 284 transitions, 3409 flow. Second operand 10 states and 193 transitions. [2024-06-28 01:52:05,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 327 transitions, 4380 flow [2024-06-28 01:52:05,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 327 transitions, 4178 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-28 01:52:05,865 INFO L231 Difference]: Finished difference. Result has 320 places, 285 transitions, 3366 flow [2024-06-28 01:52:05,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3209, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3366, PETRI_PLACES=320, PETRI_TRANSITIONS=285} [2024-06-28 01:52:05,866 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 279 predicate places. [2024-06-28 01:52:05,866 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 285 transitions, 3366 flow [2024-06-28 01:52:05,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:05,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:05,866 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:52:05,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-28 01:52:05,867 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:05,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:05,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1540469029, now seen corresponding path program 16 times [2024-06-28 01:52:05,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:05,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848503753] [2024-06-28 01:52:05,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:05,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:06,905 INFO 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:52:06,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:06,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848503753] [2024-06-28 01:52:06,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848503753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:06,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:06,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:52:06,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762204276] [2024-06-28 01:52:06,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:06,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:52:06,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:06,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:52:06,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:52:07,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:07,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 285 transitions, 3366 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:07,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:07,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:07,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:08,000 INFO L124 PetriNetUnfolderBase]: 2163/4076 cut-off events. [2024-06-28 01:52:08,000 INFO L125 PetriNetUnfolderBase]: For 92480/92505 co-relation queries the response was YES. [2024-06-28 01:52:08,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22959 conditions, 4076 events. 2163/4076 cut-off events. For 92480/92505 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 30670 event pairs, 547 based on Foata normal form. 27/4063 useless extension candidates. Maximal degree in co-relation 22804. Up to 3509 conditions per place. [2024-06-28 01:52:08,054 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 244 selfloop transitions, 66 changer transitions 0/320 dead transitions. [2024-06-28 01:52:08,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 320 transitions, 4182 flow [2024-06-28 01:52:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:52:08,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:52:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-28 01:52:08,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972972972972973 [2024-06-28 01:52:08,055 INFO L175 Difference]: Start difference. First operand has 320 places, 285 transitions, 3366 flow. Second operand 10 states and 184 transitions. [2024-06-28 01:52:08,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 320 transitions, 4182 flow [2024-06-28 01:52:08,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 320 transitions, 4055 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 01:52:08,535 INFO L231 Difference]: Finished difference. Result has 323 places, 286 transitions, 3413 flow [2024-06-28 01:52:08,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3239, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3413, PETRI_PLACES=323, PETRI_TRANSITIONS=286} [2024-06-28 01:52:08,536 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 282 predicate places. [2024-06-28 01:52:08,536 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 286 transitions, 3413 flow [2024-06-28 01:52:08,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:08,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:08,537 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:52:08,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-28 01:52:08,537 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:08,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:08,537 INFO L85 PathProgramCache]: Analyzing trace with hash -800072883, now seen corresponding path program 17 times [2024-06-28 01:52:08,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:08,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441946639] [2024-06-28 01:52:08,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:09,568 INFO 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:52:09,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:09,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441946639] [2024-06-28 01:52:09,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441946639] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:09,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:09,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:52:09,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108912139] [2024-06-28 01:52:09,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:09,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:52:09,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:09,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:52:09,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:52:09,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:09,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 286 transitions, 3413 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:09,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:09,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:09,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:10,759 INFO L124 PetriNetUnfolderBase]: 2179/4220 cut-off events. [2024-06-28 01:52:10,759 INFO L125 PetriNetUnfolderBase]: For 97173/97191 co-relation queries the response was YES. [2024-06-28 01:52:10,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23545 conditions, 4220 events. 2179/4220 cut-off events. For 97173/97191 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 32562 event pairs, 487 based on Foata normal form. 20/4178 useless extension candidates. Maximal degree in co-relation 23389. Up to 3379 conditions per place. [2024-06-28 01:52:10,815 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 244 selfloop transitions, 67 changer transitions 0/321 dead transitions. [2024-06-28 01:52:10,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 321 transitions, 4237 flow [2024-06-28 01:52:10,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:52:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:52:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-28 01:52:10,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162162162162162 [2024-06-28 01:52:10,816 INFO L175 Difference]: Start difference. First operand has 323 places, 286 transitions, 3413 flow. Second operand 10 states and 191 transitions. [2024-06-28 01:52:10,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 321 transitions, 4237 flow [2024-06-28 01:52:11,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 321 transitions, 4073 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-28 01:52:11,377 INFO L231 Difference]: Finished difference. Result has 325 places, 287 transitions, 3427 flow [2024-06-28 01:52:11,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3249, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3427, PETRI_PLACES=325, PETRI_TRANSITIONS=287} [2024-06-28 01:52:11,377 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 284 predicate places. [2024-06-28 01:52:11,377 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 287 transitions, 3427 flow [2024-06-28 01:52:11,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:11,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:11,377 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:52:11,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-28 01:52:11,378 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:11,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:11,378 INFO L85 PathProgramCache]: Analyzing trace with hash -800078463, now seen corresponding path program 18 times [2024-06-28 01:52:11,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:11,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082259940] [2024-06-28 01:52:11,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:11,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:12,338 INFO 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:52:12,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082259940] [2024-06-28 01:52:12,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082259940] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:12,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:12,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:52:12,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162132132] [2024-06-28 01:52:12,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:12,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:52:12,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:12,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:52:12,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:52:12,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:12,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 287 transitions, 3427 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:12,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:12,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:12,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:13,599 INFO L124 PetriNetUnfolderBase]: 2199/4248 cut-off events. [2024-06-28 01:52:13,599 INFO L125 PetriNetUnfolderBase]: For 100732/100750 co-relation queries the response was YES. [2024-06-28 01:52:13,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23916 conditions, 4248 events. 2199/4248 cut-off events. For 100732/100750 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 32740 event pairs, 479 based on Foata normal form. 20/4206 useless extension candidates. Maximal degree in co-relation 23759. Up to 3318 conditions per place. [2024-06-28 01:52:13,660 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 245 selfloop transitions, 70 changer transitions 0/325 dead transitions. [2024-06-28 01:52:13,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 325 transitions, 4475 flow [2024-06-28 01:52:13,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:52:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:52:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-28 01:52:13,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216216216216216 [2024-06-28 01:52:13,661 INFO L175 Difference]: Start difference. First operand has 325 places, 287 transitions, 3427 flow. Second operand 10 states and 193 transitions. [2024-06-28 01:52:13,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 325 transitions, 4475 flow [2024-06-28 01:52:14,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 325 transitions, 4307 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-28 01:52:14,201 INFO L231 Difference]: Finished difference. Result has 327 places, 289 transitions, 3485 flow [2024-06-28 01:52:14,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3259, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3485, PETRI_PLACES=327, PETRI_TRANSITIONS=289} [2024-06-28 01:52:14,201 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 286 predicate places. [2024-06-28 01:52:14,201 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 289 transitions, 3485 flow [2024-06-28 01:52:14,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:14,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:14,202 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:52:14,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-28 01:52:14,202 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:14,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:14,202 INFO L85 PathProgramCache]: Analyzing trace with hash 273878747, now seen corresponding path program 19 times [2024-06-28 01:52:14,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:14,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312721290] [2024-06-28 01:52:14,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:14,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:15,144 INFO 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:52:15,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:15,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312721290] [2024-06-28 01:52:15,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312721290] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:15,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:15,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:52:15,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554393189] [2024-06-28 01:52:15,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:15,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:52:15,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:15,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:52:15,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:52:15,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:15,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 289 transitions, 3485 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:15,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:15,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:15,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:16,242 INFO L124 PetriNetUnfolderBase]: 2196/4285 cut-off events. [2024-06-28 01:52:16,242 INFO L125 PetriNetUnfolderBase]: For 93799/93815 co-relation queries the response was YES. [2024-06-28 01:52:16,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23680 conditions, 4285 events. 2196/4285 cut-off events. For 93799/93815 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 33451 event pairs, 707 based on Foata normal form. 18/4234 useless extension candidates. Maximal degree in co-relation 23522. Up to 3741 conditions per place. [2024-06-28 01:52:16,299 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 295 selfloop transitions, 19 changer transitions 0/324 dead transitions. [2024-06-28 01:52:16,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 324 transitions, 4283 flow [2024-06-28 01:52:16,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:52:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:52:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-28 01:52:16,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2024-06-28 01:52:16,300 INFO L175 Difference]: Start difference. First operand has 327 places, 289 transitions, 3485 flow. Second operand 10 states and 183 transitions. [2024-06-28 01:52:16,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 324 transitions, 4283 flow [2024-06-28 01:52:16,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 324 transitions, 4116 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-28 01:52:16,933 INFO L231 Difference]: Finished difference. Result has 331 places, 289 transitions, 3360 flow [2024-06-28 01:52:16,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3318, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3360, PETRI_PLACES=331, PETRI_TRANSITIONS=289} [2024-06-28 01:52:16,934 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 290 predicate places. [2024-06-28 01:52:16,934 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 289 transitions, 3360 flow [2024-06-28 01:52:16,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:16,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:16,934 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:52:16,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-28 01:52:16,934 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:16,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1235221181, now seen corresponding path program 5 times [2024-06-28 01:52:16,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:16,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207978513] [2024-06-28 01:52:16,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:16,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:18,569 INFO 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:52:18,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:18,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207978513] [2024-06-28 01:52:18,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207978513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:18,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:18,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:52:18,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136710292] [2024-06-28 01:52:18,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:18,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:52:18,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:18,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:52:18,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:52:18,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:18,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 289 transitions, 3360 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:18,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:18,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:18,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:19,913 INFO L124 PetriNetUnfolderBase]: 2248/4352 cut-off events. [2024-06-28 01:52:19,913 INFO L125 PetriNetUnfolderBase]: For 112940/112962 co-relation queries the response was YES. [2024-06-28 01:52:19,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23740 conditions, 4352 events. 2248/4352 cut-off events. For 112940/112962 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 33771 event pairs, 633 based on Foata normal form. 30/4312 useless extension candidates. Maximal degree in co-relation 23580. Up to 3591 conditions per place. [2024-06-28 01:52:19,970 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 270 selfloop transitions, 50 changer transitions 0/330 dead transitions. [2024-06-28 01:52:19,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 330 transitions, 4246 flow [2024-06-28 01:52:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:52:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:52:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2024-06-28 01:52:19,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:52:19,971 INFO L175 Difference]: Start difference. First operand has 331 places, 289 transitions, 3360 flow. Second operand 11 states and 209 transitions. [2024-06-28 01:52:19,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 330 transitions, 4246 flow [2024-06-28 01:52:20,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 330 transitions, 4206 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 01:52:20,544 INFO L231 Difference]: Finished difference. Result has 334 places, 289 transitions, 3424 flow [2024-06-28 01:52:20,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3320, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3424, PETRI_PLACES=334, PETRI_TRANSITIONS=289} [2024-06-28 01:52:20,544 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 293 predicate places. [2024-06-28 01:52:20,544 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 289 transitions, 3424 flow [2024-06-28 01:52:20,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:20,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:20,545 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:52:20,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-28 01:52:20,545 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:20,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:20,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1501244891, now seen corresponding path program 6 times [2024-06-28 01:52:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745745680] [2024-06-28 01:52:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:21,880 INFO 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:52:21,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:21,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745745680] [2024-06-28 01:52:21,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745745680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:21,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:21,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:52:21,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535266755] [2024-06-28 01:52:21,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:21,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:52:21,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:21,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:52:21,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:52:22,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:22,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 289 transitions, 3424 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:22,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:22,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:22,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:23,255 INFO L124 PetriNetUnfolderBase]: 2382/4564 cut-off events. [2024-06-28 01:52:23,255 INFO L125 PetriNetUnfolderBase]: For 140206/140230 co-relation queries the response was YES. [2024-06-28 01:52:23,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25886 conditions, 4564 events. 2382/4564 cut-off events. For 140206/140230 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 35564 event pairs, 610 based on Foata normal form. 30/4540 useless extension candidates. Maximal degree in co-relation 25725. Up to 3382 conditions per place. [2024-06-28 01:52:23,315 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 239 selfloop transitions, 86 changer transitions 0/335 dead transitions. [2024-06-28 01:52:23,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 335 transitions, 4550 flow [2024-06-28 01:52:23,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:52:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:52:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2024-06-28 01:52:23,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233415233415234 [2024-06-28 01:52:23,316 INFO L175 Difference]: Start difference. First operand has 334 places, 289 transitions, 3424 flow. Second operand 11 states and 213 transitions. [2024-06-28 01:52:23,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 335 transitions, 4550 flow [2024-06-28 01:52:24,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 335 transitions, 4452 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:52:24,293 INFO L231 Difference]: Finished difference. Result has 336 places, 289 transitions, 3501 flow [2024-06-28 01:52:24,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3326, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3501, PETRI_PLACES=336, PETRI_TRANSITIONS=289} [2024-06-28 01:52:24,294 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 295 predicate places. [2024-06-28 01:52:24,294 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 289 transitions, 3501 flow [2024-06-28 01:52:24,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:24,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:24,294 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:52:24,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-28 01:52:24,295 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:24,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:24,295 INFO L85 PathProgramCache]: Analyzing trace with hash -534156557, now seen corresponding path program 7 times [2024-06-28 01:52:24,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:24,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340958586] [2024-06-28 01:52:24,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:24,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:52:25,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:25,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340958586] [2024-06-28 01:52:25,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340958586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:25,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:25,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:52:25,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562265773] [2024-06-28 01:52:25,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:25,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:52:25,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:25,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:52:25,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:52:26,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:26,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 289 transitions, 3501 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:26,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:26,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:26,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:27,434 INFO L124 PetriNetUnfolderBase]: 2480/4726 cut-off events. [2024-06-28 01:52:27,435 INFO L125 PetriNetUnfolderBase]: For 180370/180390 co-relation queries the response was YES. [2024-06-28 01:52:27,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27846 conditions, 4726 events. 2480/4726 cut-off events. For 180370/180390 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 37149 event pairs, 495 based on Foata normal form. 26/4710 useless extension candidates. Maximal degree in co-relation 27684. Up to 3430 conditions per place. [2024-06-28 01:52:27,491 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 219 selfloop transitions, 107 changer transitions 0/336 dead transitions. [2024-06-28 01:52:27,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 336 transitions, 4637 flow [2024-06-28 01:52:27,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:52:27,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:52:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-06-28 01:52:27,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5331695331695332 [2024-06-28 01:52:27,492 INFO L175 Difference]: Start difference. First operand has 336 places, 289 transitions, 3501 flow. Second operand 11 states and 217 transitions. [2024-06-28 01:52:27,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 336 transitions, 4637 flow [2024-06-28 01:52:28,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 336 transitions, 4454 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 01:52:28,457 INFO L231 Difference]: Finished difference. Result has 339 places, 289 transitions, 3535 flow [2024-06-28 01:52:28,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3318, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3535, PETRI_PLACES=339, PETRI_TRANSITIONS=289} [2024-06-28 01:52:28,458 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 298 predicate places. [2024-06-28 01:52:28,458 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 289 transitions, 3535 flow [2024-06-28 01:52:28,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:28,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:28,458 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:52:28,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-28 01:52:28,458 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:28,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:28,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1500918461, now seen corresponding path program 8 times [2024-06-28 01:52:28,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:28,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965571151] [2024-06-28 01:52:28,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:28,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:29,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:52:29,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:29,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965571151] [2024-06-28 01:52:29,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965571151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:29,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:29,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:52:29,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081157013] [2024-06-28 01:52:29,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:29,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:52:29,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:29,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:52:29,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:52:29,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:29,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 289 transitions, 3535 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:29,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:29,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:29,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:31,139 INFO L124 PetriNetUnfolderBase]: 2532/4960 cut-off events. [2024-06-28 01:52:31,139 INFO L125 PetriNetUnfolderBase]: For 196705/196727 co-relation queries the response was YES. [2024-06-28 01:52:31,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28729 conditions, 4960 events. 2532/4960 cut-off events. For 196705/196727 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 39958 event pairs, 782 based on Foata normal form. 30/4908 useless extension candidates. Maximal degree in co-relation 28567. Up to 4099 conditions per place. [2024-06-28 01:52:31,206 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 261 selfloop transitions, 59 changer transitions 0/330 dead transitions. [2024-06-28 01:52:31,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 330 transitions, 4421 flow [2024-06-28 01:52:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:52:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:52:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2024-06-28 01:52:31,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:52:31,207 INFO L175 Difference]: Start difference. First operand has 339 places, 289 transitions, 3535 flow. Second operand 11 states and 209 transitions. [2024-06-28 01:52:31,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 330 transitions, 4421 flow [2024-06-28 01:52:32,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 330 transitions, 4213 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-28 01:52:32,208 INFO L231 Difference]: Finished difference. Result has 341 places, 289 transitions, 3449 flow [2024-06-28 01:52:32,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3327, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3449, PETRI_PLACES=341, PETRI_TRANSITIONS=289} [2024-06-28 01:52:32,209 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 300 predicate places. [2024-06-28 01:52:32,209 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 289 transitions, 3449 flow [2024-06-28 01:52:32,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:32,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:32,209 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:52:32,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-28 01:52:32,209 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:32,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1242371021, now seen corresponding path program 9 times [2024-06-28 01:52:32,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:32,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354114449] [2024-06-28 01:52:32,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:32,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:33,640 INFO 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:52:33,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:33,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354114449] [2024-06-28 01:52:33,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354114449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:33,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:33,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:52:33,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508400751] [2024-06-28 01:52:33,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:33,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:52:33,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:33,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:52:33,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:52:33,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:33,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 289 transitions, 3449 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:33,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:33,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:33,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:34,901 INFO L124 PetriNetUnfolderBase]: 2496/4890 cut-off events. [2024-06-28 01:52:34,901 INFO L125 PetriNetUnfolderBase]: For 156281/156303 co-relation queries the response was YES. [2024-06-28 01:52:34,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26600 conditions, 4890 events. 2496/4890 cut-off events. For 156281/156303 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 39258 event pairs, 758 based on Foata normal form. 36/4846 useless extension candidates. Maximal degree in co-relation 26438. Up to 3973 conditions per place. [2024-06-28 01:52:34,969 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 268 selfloop transitions, 52 changer transitions 0/330 dead transitions. [2024-06-28 01:52:34,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 330 transitions, 4335 flow [2024-06-28 01:52:34,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:52:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:52:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2024-06-28 01:52:34,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-28 01:52:34,970 INFO L175 Difference]: Start difference. First operand has 341 places, 289 transitions, 3449 flow. Second operand 11 states and 209 transitions. [2024-06-28 01:52:34,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 330 transitions, 4335 flow [2024-06-28 01:52:35,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 330 transitions, 4204 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-28 01:52:35,822 INFO L231 Difference]: Finished difference. Result has 342 places, 289 transitions, 3427 flow [2024-06-28 01:52:35,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3318, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3427, PETRI_PLACES=342, PETRI_TRANSITIONS=289} [2024-06-28 01:52:35,823 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 301 predicate places. [2024-06-28 01:52:35,823 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 289 transitions, 3427 flow [2024-06-28 01:52:35,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:35,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:35,823 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:52:35,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-28 01:52:35,823 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:35,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:35,824 INFO L85 PathProgramCache]: Analyzing trace with hash -543362627, now seen corresponding path program 10 times [2024-06-28 01:52:35,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:35,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817844546] [2024-06-28 01:52:35,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:35,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:37,096 INFO 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:52:37,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:37,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817844546] [2024-06-28 01:52:37,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817844546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:37,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:37,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:52:37,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133183436] [2024-06-28 01:52:37,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:37,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:52:37,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:37,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:52:37,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:52:37,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:37,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 289 transitions, 3427 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:37,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:37,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:37,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:38,493 INFO L124 PetriNetUnfolderBase]: 2548/4955 cut-off events. [2024-06-28 01:52:38,493 INFO L125 PetriNetUnfolderBase]: For 136250/136268 co-relation queries the response was YES. [2024-06-28 01:52:38,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27122 conditions, 4955 events. 2548/4955 cut-off events. For 136250/136268 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 39886 event pairs, 615 based on Foata normal form. 26/4919 useless extension candidates. Maximal degree in co-relation 26959. Up to 3654 conditions per place. [2024-06-28 01:52:38,559 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 231 selfloop transitions, 90 changer transitions 0/331 dead transitions. [2024-06-28 01:52:38,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 331 transitions, 4321 flow [2024-06-28 01:52:38,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:52:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:52:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-06-28 01:52:38,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5331695331695332 [2024-06-28 01:52:38,560 INFO L175 Difference]: Start difference. First operand has 342 places, 289 transitions, 3427 flow. Second operand 11 states and 217 transitions. [2024-06-28 01:52:38,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 331 transitions, 4321 flow [2024-06-28 01:52:39,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 331 transitions, 4216 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-28 01:52:39,341 INFO L231 Difference]: Finished difference. Result has 343 places, 289 transitions, 3510 flow [2024-06-28 01:52:39,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3322, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3510, PETRI_PLACES=343, PETRI_TRANSITIONS=289} [2024-06-28 01:52:39,341 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 302 predicate places. [2024-06-28 01:52:39,342 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 289 transitions, 3510 flow [2024-06-28 01:52:39,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:39,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:39,342 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:52:39,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-28 01:52:39,342 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:39,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:39,342 INFO L85 PathProgramCache]: Analyzing trace with hash -660762549, now seen corresponding path program 11 times [2024-06-28 01:52:39,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:39,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548944146] [2024-06-28 01:52:39,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:39,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:41,355 INFO 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:52:41,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:41,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548944146] [2024-06-28 01:52:41,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548944146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:41,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:41,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:52:41,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682491835] [2024-06-28 01:52:41,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:41,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:52:41,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:41,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:52:41,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:52:41,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:41,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 289 transitions, 3510 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:41,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:41,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:41,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:42,860 INFO L124 PetriNetUnfolderBase]: 2600/5063 cut-off events. [2024-06-28 01:52:42,860 INFO L125 PetriNetUnfolderBase]: For 139644/139662 co-relation queries the response was YES. [2024-06-28 01:52:42,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27986 conditions, 5063 events. 2600/5063 cut-off events. For 139644/139662 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 41058 event pairs, 626 based on Foata normal form. 26/5027 useless extension candidates. Maximal degree in co-relation 27823. Up to 4063 conditions per place. [2024-06-28 01:52:42,933 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 253 selfloop transitions, 68 changer transitions 0/331 dead transitions. [2024-06-28 01:52:42,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 331 transitions, 4404 flow [2024-06-28 01:52:42,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:52:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:52:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-28 01:52:42,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208845208845209 [2024-06-28 01:52:42,934 INFO L175 Difference]: Start difference. First operand has 343 places, 289 transitions, 3510 flow. Second operand 11 states and 212 transitions. [2024-06-28 01:52:42,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 331 transitions, 4404 flow [2024-06-28 01:52:43,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 331 transitions, 4224 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-28 01:52:43,719 INFO L231 Difference]: Finished difference. Result has 344 places, 289 transitions, 3471 flow [2024-06-28 01:52:43,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3330, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3471, PETRI_PLACES=344, PETRI_TRANSITIONS=289} [2024-06-28 01:52:43,720 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 303 predicate places. [2024-06-28 01:52:43,720 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 289 transitions, 3471 flow [2024-06-28 01:52:43,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:43,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:43,720 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:52:43,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-28 01:52:43,720 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:43,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:43,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1979510955, now seen corresponding path program 12 times [2024-06-28 01:52:43,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:43,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074833853] [2024-06-28 01:52:43,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:43,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:52:44,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:44,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074833853] [2024-06-28 01:52:44,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074833853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:44,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:44,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:52:44,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561955539] [2024-06-28 01:52:44,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:44,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:52:44,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:44,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:52:44,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:52:45,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:45,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 289 transitions, 3471 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:45,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:45,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:45,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:46,348 INFO L124 PetriNetUnfolderBase]: 2683/5279 cut-off events. [2024-06-28 01:52:46,348 INFO L125 PetriNetUnfolderBase]: For 158146/158162 co-relation queries the response was YES. [2024-06-28 01:52:46,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29354 conditions, 5279 events. 2683/5279 cut-off events. For 158146/158162 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 43533 event pairs, 900 based on Foata normal form. 22/5233 useless extension candidates. Maximal degree in co-relation 29190. Up to 4260 conditions per place. [2024-06-28 01:52:46,422 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 304 selfloop transitions, 28 changer transitions 0/342 dead transitions. [2024-06-28 01:52:46,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 342 transitions, 4653 flow [2024-06-28 01:52:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:52:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:52:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 229 transitions. [2024-06-28 01:52:46,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157657657657657 [2024-06-28 01:52:46,423 INFO L175 Difference]: Start difference. First operand has 344 places, 289 transitions, 3471 flow. Second operand 12 states and 229 transitions. [2024-06-28 01:52:46,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 342 transitions, 4653 flow [2024-06-28 01:52:47,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 342 transitions, 4520 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:52:47,301 INFO L231 Difference]: Finished difference. Result has 347 places, 289 transitions, 3397 flow [2024-06-28 01:52:47,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3338, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3397, PETRI_PLACES=347, PETRI_TRANSITIONS=289} [2024-06-28 01:52:47,301 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 306 predicate places. [2024-06-28 01:52:47,301 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 289 transitions, 3397 flow [2024-06-28 01:52:47,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:47,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:47,302 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:52:47,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-28 01:52:47,302 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:47,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:47,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1990552845, now seen corresponding path program 13 times [2024-06-28 01:52:47,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:47,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328627465] [2024-06-28 01:52:47,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:47,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:48,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:52:48,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:48,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328627465] [2024-06-28 01:52:48,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328627465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:48,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:48,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:52:48,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894159705] [2024-06-28 01:52:48,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:48,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:52:48,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:48,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:52:48,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:52:48,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:48,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 289 transitions, 3397 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:48,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:48,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:48,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:49,965 INFO L124 PetriNetUnfolderBase]: 2719/5346 cut-off events. [2024-06-28 01:52:49,965 INFO L125 PetriNetUnfolderBase]: For 161464/161480 co-relation queries the response was YES. [2024-06-28 01:52:50,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29632 conditions, 5346 events. 2719/5346 cut-off events. For 161464/161480 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 44290 event pairs, 918 based on Foata normal form. 22/5299 useless extension candidates. Maximal degree in co-relation 29467. Up to 4394 conditions per place. [2024-06-28 01:52:50,043 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 302 selfloop transitions, 29 changer transitions 0/341 dead transitions. [2024-06-28 01:52:50,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 341 transitions, 4577 flow [2024-06-28 01:52:50,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:52:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:52:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 227 transitions. [2024-06-28 01:52:50,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5112612612612613 [2024-06-28 01:52:50,044 INFO L175 Difference]: Start difference. First operand has 347 places, 289 transitions, 3397 flow. Second operand 12 states and 227 transitions. [2024-06-28 01:52:50,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 341 transitions, 4577 flow [2024-06-28 01:52:50,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 341 transitions, 4529 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-28 01:52:50,807 INFO L231 Difference]: Finished difference. Result has 349 places, 289 transitions, 3411 flow [2024-06-28 01:52:50,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3349, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3411, PETRI_PLACES=349, PETRI_TRANSITIONS=289} [2024-06-28 01:52:50,807 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 308 predicate places. [2024-06-28 01:52:50,807 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 289 transitions, 3411 flow [2024-06-28 01:52:50,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:50,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:50,808 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:52:50,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-28 01:52:50,808 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:50,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:50,808 INFO L85 PathProgramCache]: Analyzing trace with hash 283083453, now seen corresponding path program 14 times [2024-06-28 01:52:50,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:50,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976745108] [2024-06-28 01:52:50,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:50,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:52,340 INFO 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:52:52,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976745108] [2024-06-28 01:52:52,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976745108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:52,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:52,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:52:52,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200680218] [2024-06-28 01:52:52,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:52,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:52:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:52:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:52:52,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:52,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 289 transitions, 3411 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:52,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:52,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:52,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:53,861 INFO L124 PetriNetUnfolderBase]: 2771/5455 cut-off events. [2024-06-28 01:52:53,861 INFO L125 PetriNetUnfolderBase]: For 177806/177822 co-relation queries the response was YES. [2024-06-28 01:52:53,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30272 conditions, 5455 events. 2771/5455 cut-off events. For 177806/177822 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 45464 event pairs, 948 based on Foata normal form. 24/5411 useless extension candidates. Maximal degree in co-relation 30107. Up to 4743 conditions per place. [2024-06-28 01:52:53,934 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 299 selfloop transitions, 23 changer transitions 0/332 dead transitions. [2024-06-28 01:52:53,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 332 transitions, 4313 flow [2024-06-28 01:52:53,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:52:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:52:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2024-06-28 01:52:53,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036855036855037 [2024-06-28 01:52:53,937 INFO L175 Difference]: Start difference. First operand has 349 places, 289 transitions, 3411 flow. Second operand 11 states and 205 transitions. [2024-06-28 01:52:53,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 332 transitions, 4313 flow [2024-06-28 01:52:54,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 332 transitions, 4256 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-28 01:52:54,787 INFO L231 Difference]: Finished difference. Result has 350 places, 289 transitions, 3404 flow [2024-06-28 01:52:54,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3354, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3404, PETRI_PLACES=350, PETRI_TRANSITIONS=289} [2024-06-28 01:52:54,787 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 309 predicate places. [2024-06-28 01:52:54,787 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 289 transitions, 3404 flow [2024-06-28 01:52:54,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:54,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:54,787 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:52:54,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-28 01:52:54,787 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:54,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:54,788 INFO L85 PathProgramCache]: Analyzing trace with hash 273886683, now seen corresponding path program 15 times [2024-06-28 01:52:54,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:54,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609286182] [2024-06-28 01:52:54,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:54,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:52:56,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:56,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609286182] [2024-06-28 01:52:56,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609286182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:56,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:56,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:52:56,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254266603] [2024-06-28 01:52:56,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:56,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:52:56,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:56,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:52:56,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:52:56,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:52:56,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 289 transitions, 3404 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:56,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:56,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:52:56,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:57,447 INFO L124 PetriNetUnfolderBase]: 2761/5443 cut-off events. [2024-06-28 01:52:57,447 INFO L125 PetriNetUnfolderBase]: For 143663/143679 co-relation queries the response was YES. [2024-06-28 01:52:57,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29411 conditions, 5443 events. 2761/5443 cut-off events. For 143663/143679 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 45402 event pairs, 941 based on Foata normal form. 24/5397 useless extension candidates. Maximal degree in co-relation 29245. Up to 4546 conditions per place. [2024-06-28 01:52:57,517 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 293 selfloop transitions, 29 changer transitions 0/332 dead transitions. [2024-06-28 01:52:57,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 332 transitions, 4306 flow [2024-06-28 01:52:57,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:52:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:52:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-28 01:52:57,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085995085995086 [2024-06-28 01:52:57,518 INFO L175 Difference]: Start difference. First operand has 350 places, 289 transitions, 3404 flow. Second operand 11 states and 207 transitions. [2024-06-28 01:52:57,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 332 transitions, 4306 flow [2024-06-28 01:52:58,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 332 transitions, 4265 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:52:58,296 INFO L231 Difference]: Finished difference. Result has 353 places, 289 transitions, 3431 flow [2024-06-28 01:52:58,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3363, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3431, PETRI_PLACES=353, PETRI_TRANSITIONS=289} [2024-06-28 01:52:58,297 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 312 predicate places. [2024-06-28 01:52:58,297 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 289 transitions, 3431 flow [2024-06-28 01:52:58,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:58,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:58,297 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:52:58,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-28 01:52:58,297 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:58,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:58,298 INFO L85 PathProgramCache]: Analyzing trace with hash -374103982, now seen corresponding path program 1 times [2024-06-28 01:52:58,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:58,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307574227] [2024-06-28 01:52:58,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:58,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:52:58,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:52:58,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:52:58,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307574227] [2024-06-28 01:52:58,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307574227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:52:58,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:52:58,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:52:58,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393835563] [2024-06-28 01:52:58,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:52:58,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:52:58,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:52:58,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:52:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:52:58,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-28 01:52:58,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 289 transitions, 3431 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:58,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:52:58,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-28 01:52:58,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:52:59,312 INFO L124 PetriNetUnfolderBase]: 2265/5638 cut-off events. [2024-06-28 01:52:59,312 INFO L125 PetriNetUnfolderBase]: For 107203/107247 co-relation queries the response was YES. [2024-06-28 01:52:59,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26599 conditions, 5638 events. 2265/5638 cut-off events. For 107203/107247 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 53819 event pairs, 361 based on Foata normal form. 367/5699 useless extension candidates. Maximal degree in co-relation 26433. Up to 2398 conditions per place. [2024-06-28 01:52:59,388 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 146 selfloop transitions, 79 changer transitions 0/284 dead transitions. [2024-06-28 01:52:59,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 284 transitions, 3785 flow [2024-06-28 01:52:59,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:52:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:52:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-06-28 01:52:59,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6959459459459459 [2024-06-28 01:52:59,389 INFO L175 Difference]: Start difference. First operand has 353 places, 289 transitions, 3431 flow. Second operand 4 states and 103 transitions. [2024-06-28 01:52:59,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 284 transitions, 3785 flow [2024-06-28 01:52:59,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 284 transitions, 3404 flow, removed 15 selfloop flow, removed 44 redundant places. [2024-06-28 01:52:59,937 INFO L231 Difference]: Finished difference. Result has 314 places, 248 transitions, 2968 flow [2024-06-28 01:52:59,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2646, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2968, PETRI_PLACES=314, PETRI_TRANSITIONS=248} [2024-06-28 01:52:59,937 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 273 predicate places. [2024-06-28 01:52:59,937 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 248 transitions, 2968 flow [2024-06-28 01:52:59,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:52:59,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:52:59,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:52:59,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-28 01:52:59,938 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:52:59,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:52:59,938 INFO L85 PathProgramCache]: Analyzing trace with hash 476886025, now seen corresponding path program 1 times [2024-06-28 01:52:59,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:52:59,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275256771] [2024-06-28 01:52:59,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:52:59,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:52:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:53:02,946 INFO 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:53:02,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:53:02,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275256771] [2024-06-28 01:53:02,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275256771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:53:02,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:53:02,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:53:02,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440219516] [2024-06-28 01:53:02,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:53:02,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:53:02,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:53:02,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:53:02,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:53:03,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:53:03,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 248 transitions, 2968 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:03,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:53:03,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:53:03,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:53:04,412 INFO L124 PetriNetUnfolderBase]: 2460/5796 cut-off events. [2024-06-28 01:53:04,412 INFO L125 PetriNetUnfolderBase]: For 126786/126788 co-relation queries the response was YES. [2024-06-28 01:53:04,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27304 conditions, 5796 events. 2460/5796 cut-off events. For 126786/126788 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 54054 event pairs, 1215 based on Foata normal form. 8/5427 useless extension candidates. Maximal degree in co-relation 27155. Up to 4473 conditions per place. [2024-06-28 01:53:04,473 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 246 selfloop transitions, 25 changer transitions 0/282 dead transitions. [2024-06-28 01:53:04,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 282 transitions, 3666 flow [2024-06-28 01:53:04,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:53:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:53:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 194 transitions. [2024-06-28 01:53:04,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47665847665847666 [2024-06-28 01:53:04,474 INFO L175 Difference]: Start difference. First operand has 314 places, 248 transitions, 2968 flow. Second operand 11 states and 194 transitions. [2024-06-28 01:53:04,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 282 transitions, 3666 flow [2024-06-28 01:53:05,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 282 transitions, 3586 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:53:05,251 INFO L231 Difference]: Finished difference. Result has 323 places, 248 transitions, 2941 flow [2024-06-28 01:53:05,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2888, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2941, PETRI_PLACES=323, PETRI_TRANSITIONS=248} [2024-06-28 01:53:05,251 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 282 predicate places. [2024-06-28 01:53:05,251 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 248 transitions, 2941 flow [2024-06-28 01:53:05,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:05,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:53:05,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:05,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-28 01:53:05,251 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:53:05,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:53:05,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1421870047, now seen corresponding path program 2 times [2024-06-28 01:53:05,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:53:05,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789604078] [2024-06-28 01:53:05,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:53:05,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:53:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:53:06,617 INFO 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:53:06,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:53:06,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789604078] [2024-06-28 01:53:06,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789604078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:53:06,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:53:06,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:53:06,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798381744] [2024-06-28 01:53:06,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:53:06,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:53:06,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:53:06,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:53:06,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:53:06,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:53:06,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 248 transitions, 2941 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:06,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:53:06,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:53:06,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:53:07,897 INFO L124 PetriNetUnfolderBase]: 2497/5865 cut-off events. [2024-06-28 01:53:07,897 INFO L125 PetriNetUnfolderBase]: For 127540/127542 co-relation queries the response was YES. [2024-06-28 01:53:07,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27647 conditions, 5865 events. 2497/5865 cut-off events. For 127540/127542 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 54772 event pairs, 1247 based on Foata normal form. 8/5492 useless extension candidates. Maximal degree in co-relation 27496. Up to 4516 conditions per place. [2024-06-28 01:53:07,970 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 227 selfloop transitions, 42 changer transitions 0/280 dead transitions. [2024-06-28 01:53:07,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 280 transitions, 3629 flow [2024-06-28 01:53:07,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:53:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:53:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-06-28 01:53:07,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837837837837838 [2024-06-28 01:53:07,971 INFO L175 Difference]: Start difference. First operand has 323 places, 248 transitions, 2941 flow. Second operand 10 states and 179 transitions. [2024-06-28 01:53:07,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 280 transitions, 3629 flow [2024-06-28 01:53:08,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 280 transitions, 3580 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:53:08,767 INFO L231 Difference]: Finished difference. Result has 324 places, 248 transitions, 2979 flow [2024-06-28 01:53:08,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2892, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2979, PETRI_PLACES=324, PETRI_TRANSITIONS=248} [2024-06-28 01:53:08,767 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 283 predicate places. [2024-06-28 01:53:08,767 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 248 transitions, 2979 flow [2024-06-28 01:53:08,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:08,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:53:08,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:08,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-28 01:53:08,768 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:53:08,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:53:08,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1562245531, now seen corresponding path program 3 times [2024-06-28 01:53:08,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:53:08,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538816675] [2024-06-28 01:53:08,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:53:08,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:53:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:53:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:53:10,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:53:10,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538816675] [2024-06-28 01:53:10,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538816675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:53:10,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:53:10,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:53:10,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660265945] [2024-06-28 01:53:10,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:53:10,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:53:10,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:53:10,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:53:10,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:53:10,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:53:10,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 248 transitions, 2979 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:10,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:53:10,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:53:10,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:53:11,460 INFO L124 PetriNetUnfolderBase]: 2534/5954 cut-off events. [2024-06-28 01:53:11,460 INFO L125 PetriNetUnfolderBase]: For 129501/129503 co-relation queries the response was YES. [2024-06-28 01:53:11,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28023 conditions, 5954 events. 2534/5954 cut-off events. For 129501/129503 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 55795 event pairs, 1294 based on Foata normal form. 8/5581 useless extension candidates. Maximal degree in co-relation 27871. Up to 4584 conditions per place. [2024-06-28 01:53:11,534 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 238 selfloop transitions, 33 changer transitions 0/282 dead transitions. [2024-06-28 01:53:11,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 282 transitions, 3679 flow [2024-06-28 01:53:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:53:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:53:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-06-28 01:53:11,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48402948402948404 [2024-06-28 01:53:11,535 INFO L175 Difference]: Start difference. First operand has 324 places, 248 transitions, 2979 flow. Second operand 11 states and 197 transitions. [2024-06-28 01:53:11,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 282 transitions, 3679 flow [2024-06-28 01:53:12,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 282 transitions, 3596 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:53:12,421 INFO L231 Difference]: Finished difference. Result has 327 places, 248 transitions, 2965 flow [2024-06-28 01:53:12,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2896, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2965, PETRI_PLACES=327, PETRI_TRANSITIONS=248} [2024-06-28 01:53:12,421 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 286 predicate places. [2024-06-28 01:53:12,421 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 248 transitions, 2965 flow [2024-06-28 01:53:12,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:12,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:53:12,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:12,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-28 01:53:12,422 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:53:12,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:53:12,422 INFO L85 PathProgramCache]: Analyzing trace with hash 930255839, now seen corresponding path program 4 times [2024-06-28 01:53:12,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:53:12,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737752194] [2024-06-28 01:53:12,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:53:12,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:53:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:53:13,971 INFO 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:53:13,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:53:13,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737752194] [2024-06-28 01:53:13,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737752194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:53:13,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:53:13,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:53:13,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033803441] [2024-06-28 01:53:13,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:53:13,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:53:13,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:53:13,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:53:13,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:53:14,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:53:14,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 248 transitions, 2965 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:14,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:53:14,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:53:14,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:53:15,391 INFO L124 PetriNetUnfolderBase]: 2571/6049 cut-off events. [2024-06-28 01:53:15,391 INFO L125 PetriNetUnfolderBase]: For 130998/131000 co-relation queries the response was YES. [2024-06-28 01:53:15,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28390 conditions, 6049 events. 2571/6049 cut-off events. For 130998/131000 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 56936 event pairs, 1356 based on Foata normal form. 8/5668 useless extension candidates. Maximal degree in co-relation 28237. Up to 4736 conditions per place. [2024-06-28 01:53:15,467 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 235 selfloop transitions, 32 changer transitions 0/278 dead transitions. [2024-06-28 01:53:15,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 278 transitions, 3641 flow [2024-06-28 01:53:15,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:53:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:53:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2024-06-28 01:53:15,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47174447174447176 [2024-06-28 01:53:15,468 INFO L175 Difference]: Start difference. First operand has 327 places, 248 transitions, 2965 flow. Second operand 11 states and 192 transitions. [2024-06-28 01:53:15,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 278 transitions, 3641 flow [2024-06-28 01:53:16,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 278 transitions, 3576 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:53:16,254 INFO L231 Difference]: Finished difference. Result has 329 places, 248 transitions, 2967 flow [2024-06-28 01:53:16,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2900, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2967, PETRI_PLACES=329, PETRI_TRANSITIONS=248} [2024-06-28 01:53:16,254 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 288 predicate places. [2024-06-28 01:53:16,254 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 248 transitions, 2967 flow [2024-06-28 01:53:16,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:16,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:53:16,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:16,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-28 01:53:16,254 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:53:16,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:53:16,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1522902985, now seen corresponding path program 5 times [2024-06-28 01:53:16,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:53:16,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890616171] [2024-06-28 01:53:16,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:53:16,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:53:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:53:17,317 INFO 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:53:17,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:53:17,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890616171] [2024-06-28 01:53:17,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890616171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:53:17,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:53:17,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:53:17,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313567003] [2024-06-28 01:53:17,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:53:17,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:53:17,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:53:17,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:53:17,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:53:17,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:53:17,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 248 transitions, 2967 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:17,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:53:17,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:53:17,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:53:18,670 INFO L124 PetriNetUnfolderBase]: 2608/6159 cut-off events. [2024-06-28 01:53:18,670 INFO L125 PetriNetUnfolderBase]: For 132492/132494 co-relation queries the response was YES. [2024-06-28 01:53:18,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28728 conditions, 6159 events. 2608/6159 cut-off events. For 132492/132494 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 58266 event pairs, 1374 based on Foata normal form. 8/5776 useless extension candidates. Maximal degree in co-relation 28574. Up to 4467 conditions per place. [2024-06-28 01:53:18,751 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 218 selfloop transitions, 52 changer transitions 0/281 dead transitions. [2024-06-28 01:53:18,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 281 transitions, 3705 flow [2024-06-28 01:53:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:53:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:53:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-28 01:53:18,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972972972972973 [2024-06-28 01:53:18,752 INFO L175 Difference]: Start difference. First operand has 329 places, 248 transitions, 2967 flow. Second operand 10 states and 184 transitions. [2024-06-28 01:53:18,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 281 transitions, 3705 flow [2024-06-28 01:53:19,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 281 transitions, 3634 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-28 01:53:19,538 INFO L231 Difference]: Finished difference. Result has 329 places, 248 transitions, 3008 flow [2024-06-28 01:53:19,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2896, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3008, PETRI_PLACES=329, PETRI_TRANSITIONS=248} [2024-06-28 01:53:19,538 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 288 predicate places. [2024-06-28 01:53:19,539 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 248 transitions, 3008 flow [2024-06-28 01:53:19,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:19,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:53:19,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:19,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-28 01:53:19,539 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:53:19,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:53:19,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1307984609, now seen corresponding path program 6 times [2024-06-28 01:53:19,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:53:19,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573326637] [2024-06-28 01:53:19,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:53:19,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:53:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:53:21,058 INFO 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:53:21,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:53:21,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573326637] [2024-06-28 01:53:21,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573326637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:53:21,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:53:21,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:53:21,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95415593] [2024-06-28 01:53:21,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:53:21,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:53:21,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:53:21,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:53:21,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:53:21,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:53:21,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 248 transitions, 3008 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:21,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:53:21,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:53:21,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:53:22,675 INFO L124 PetriNetUnfolderBase]: 2645/6214 cut-off events. [2024-06-28 01:53:22,675 INFO L125 PetriNetUnfolderBase]: For 134648/134650 co-relation queries the response was YES. [2024-06-28 01:53:22,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29106 conditions, 6214 events. 2645/6214 cut-off events. For 134648/134650 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 58770 event pairs, 1448 based on Foata normal form. 8/5831 useless extension candidates. Maximal degree in co-relation 28951. Up to 4934 conditions per place. [2024-06-28 01:53:22,750 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 247 selfloop transitions, 18 changer transitions 0/276 dead transitions. [2024-06-28 01:53:22,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 276 transitions, 3674 flow [2024-06-28 01:53:22,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:53:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:53:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2024-06-28 01:53:22,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.457002457002457 [2024-06-28 01:53:22,751 INFO L175 Difference]: Start difference. First operand has 329 places, 248 transitions, 3008 flow. Second operand 11 states and 186 transitions. [2024-06-28 01:53:22,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 276 transitions, 3674 flow [2024-06-28 01:53:23,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 276 transitions, 3576 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:53:23,635 INFO L231 Difference]: Finished difference. Result has 332 places, 248 transitions, 2949 flow [2024-06-28 01:53:23,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2910, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2949, PETRI_PLACES=332, PETRI_TRANSITIONS=248} [2024-06-28 01:53:23,635 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 291 predicate places. [2024-06-28 01:53:23,635 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 248 transitions, 2949 flow [2024-06-28 01:53:23,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:23,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:53:23,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:23,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-28 01:53:23,636 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:53:23,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:53:23,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1691843699, now seen corresponding path program 7 times [2024-06-28 01:53:23,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:53:23,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578040684] [2024-06-28 01:53:23,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:53:23,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:53:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:53:25,010 INFO 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:53:25,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:53:25,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578040684] [2024-06-28 01:53:25,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578040684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:53:25,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:53:25,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:53:25,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740499712] [2024-06-28 01:53:25,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:53:25,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:53:25,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:53:25,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:53:25,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:53:25,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:53:25,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 248 transitions, 2949 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:25,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:53:25,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:53:25,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:53:26,448 INFO L124 PetriNetUnfolderBase]: 2682/6299 cut-off events. [2024-06-28 01:53:26,449 INFO L125 PetriNetUnfolderBase]: For 135825/135827 co-relation queries the response was YES. [2024-06-28 01:53:26,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29367 conditions, 6299 events. 2682/6299 cut-off events. For 135825/135827 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 59830 event pairs, 1480 based on Foata normal form. 8/5908 useless extension candidates. Maximal degree in co-relation 29211. Up to 4866 conditions per place. [2024-06-28 01:53:26,532 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 202 selfloop transitions, 62 changer transitions 0/275 dead transitions. [2024-06-28 01:53:26,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 275 transitions, 3607 flow [2024-06-28 01:53:26,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:53:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:53:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2024-06-28 01:53:26,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47911547911547914 [2024-06-28 01:53:26,533 INFO L175 Difference]: Start difference. First operand has 332 places, 248 transitions, 2949 flow. Second operand 11 states and 195 transitions. [2024-06-28 01:53:26,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 275 transitions, 3607 flow [2024-06-28 01:53:27,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 275 transitions, 3572 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:53:27,424 INFO L231 Difference]: Finished difference. Result has 334 places, 248 transitions, 3041 flow [2024-06-28 01:53:27,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2914, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3041, PETRI_PLACES=334, PETRI_TRANSITIONS=248} [2024-06-28 01:53:27,424 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 293 predicate places. [2024-06-28 01:53:27,424 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 248 transitions, 3041 flow [2024-06-28 01:53:27,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:27,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:53:27,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:27,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-28 01:53:27,425 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:53:27,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:53:27,425 INFO L85 PathProgramCache]: Analyzing trace with hash -363094275, now seen corresponding path program 8 times [2024-06-28 01:53:27,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:53:27,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106532146] [2024-06-28 01:53:27,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:53:27,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:53:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:53:28,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:53:28,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:53:28,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106532146] [2024-06-28 01:53:28,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106532146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:53:28,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:53:28,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:53:28,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970946966] [2024-06-28 01:53:28,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:53:28,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:53:28,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:53:28,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:53:28,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:53:28,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:53:28,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 248 transitions, 3041 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:28,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:53:28,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:53:28,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:53:30,428 INFO L124 PetriNetUnfolderBase]: 2719/6369 cut-off events. [2024-06-28 01:53:30,429 INFO L125 PetriNetUnfolderBase]: For 138172/138174 co-relation queries the response was YES. [2024-06-28 01:53:30,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29818 conditions, 6369 events. 2719/6369 cut-off events. For 138172/138174 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 60535 event pairs, 1529 based on Foata normal form. 8/5975 useless extension candidates. Maximal degree in co-relation 29661. Up to 5003 conditions per place. [2024-06-28 01:53:30,499 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 210 selfloop transitions, 54 changer transitions 0/275 dead transitions. [2024-06-28 01:53:30,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 275 transitions, 3697 flow [2024-06-28 01:53:30,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:53:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:53:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2024-06-28 01:53:30,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47911547911547914 [2024-06-28 01:53:30,500 INFO L175 Difference]: Start difference. First operand has 334 places, 248 transitions, 3041 flow. Second operand 11 states and 195 transitions. [2024-06-28 01:53:30,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 275 transitions, 3697 flow [2024-06-28 01:53:31,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 275 transitions, 3572 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:53:31,303 INFO L231 Difference]: Finished difference. Result has 336 places, 248 transitions, 3027 flow [2024-06-28 01:53:31,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2916, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3027, PETRI_PLACES=336, PETRI_TRANSITIONS=248} [2024-06-28 01:53:31,304 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 295 predicate places. [2024-06-28 01:53:31,304 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 248 transitions, 3027 flow [2024-06-28 01:53:31,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:31,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:53:31,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:31,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-28 01:53:31,304 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:53:31,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:53:31,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1919917829, now seen corresponding path program 9 times [2024-06-28 01:53:31,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:53:31,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506485096] [2024-06-28 01:53:31,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:53:31,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:53:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:53:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:53:32,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:53:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506485096] [2024-06-28 01:53:32,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506485096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:53:32,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:53:32,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:53:32,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273840538] [2024-06-28 01:53:32,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:53:32,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:53:32,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:53:32,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:53:32,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:53:33,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:53:33,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 248 transitions, 3027 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:33,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:53:33,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:53:33,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:53:34,569 INFO L124 PetriNetUnfolderBase]: 2756/6471 cut-off events. [2024-06-28 01:53:34,569 INFO L125 PetriNetUnfolderBase]: For 139807/139809 co-relation queries the response was YES. [2024-06-28 01:53:34,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30144 conditions, 6471 events. 2756/6471 cut-off events. For 139807/139809 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 61755 event pairs, 1515 based on Foata normal form. 8/6073 useless extension candidates. Maximal degree in co-relation 29986. Up to 4930 conditions per place. [2024-06-28 01:53:34,655 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 202 selfloop transitions, 66 changer transitions 0/279 dead transitions. [2024-06-28 01:53:34,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 279 transitions, 3709 flow [2024-06-28 01:53:34,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:53:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:53:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-06-28 01:53:34,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-28 01:53:34,656 INFO L175 Difference]: Start difference. First operand has 336 places, 248 transitions, 3027 flow. Second operand 11 states and 198 transitions. [2024-06-28 01:53:34,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 279 transitions, 3709 flow [2024-06-28 01:53:35,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 279 transitions, 3602 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:53:35,666 INFO L231 Difference]: Finished difference. Result has 338 places, 248 transitions, 3055 flow [2024-06-28 01:53:35,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2920, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3055, PETRI_PLACES=338, PETRI_TRANSITIONS=248} [2024-06-28 01:53:35,667 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 297 predicate places. [2024-06-28 01:53:35,667 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 248 transitions, 3055 flow [2024-06-28 01:53:35,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:35,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:53:35,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:35,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-28 01:53:35,667 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:53:35,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:53:35,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1254976217, now seen corresponding path program 10 times [2024-06-28 01:53:35,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:53:35,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140682710] [2024-06-28 01:53:35,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:53:35,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:53:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:53:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:53:36,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:53:36,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140682710] [2024-06-28 01:53:36,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140682710] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:53:36,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:53:36,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:53:36,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078906561] [2024-06-28 01:53:36,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:53:36,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:53:36,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:53:36,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:53:36,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:53:37,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:53:37,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 248 transitions, 3055 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:37,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:53:37,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:53:37,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:53:38,597 INFO L124 PetriNetUnfolderBase]: 2793/6583 cut-off events. [2024-06-28 01:53:38,597 INFO L125 PetriNetUnfolderBase]: For 141760/141762 co-relation queries the response was YES. [2024-06-28 01:53:38,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30616 conditions, 6583 events. 2793/6583 cut-off events. For 141760/141762 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 63073 event pairs, 1594 based on Foata normal form. 8/6186 useless extension candidates. Maximal degree in co-relation 30457. Up to 4525 conditions per place. [2024-06-28 01:53:38,685 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 219 selfloop transitions, 52 changer transitions 0/282 dead transitions. [2024-06-28 01:53:38,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 282 transitions, 3799 flow [2024-06-28 01:53:38,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:53:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:53:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2024-06-28 01:53:38,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963144963144963 [2024-06-28 01:53:38,686 INFO L175 Difference]: Start difference. First operand has 338 places, 248 transitions, 3055 flow. Second operand 11 states and 202 transitions. [2024-06-28 01:53:38,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 282 transitions, 3799 flow [2024-06-28 01:53:39,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 282 transitions, 3668 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 01:53:39,722 INFO L231 Difference]: Finished difference. Result has 340 places, 248 transitions, 3031 flow [2024-06-28 01:53:39,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2924, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3031, PETRI_PLACES=340, PETRI_TRANSITIONS=248} [2024-06-28 01:53:39,722 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 299 predicate places. [2024-06-28 01:53:39,722 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 248 transitions, 3031 flow [2024-06-28 01:53:39,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:39,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:53:39,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:39,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-28 01:53:39,723 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:53:39,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:53:39,723 INFO L85 PathProgramCache]: Analyzing trace with hash 897778401, now seen corresponding path program 11 times [2024-06-28 01:53:39,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:53:39,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139443039] [2024-06-28 01:53:39,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:53:39,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:53:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:53:41,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:53:41,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:53:41,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139443039] [2024-06-28 01:53:41,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139443039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:53:41,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:53:41,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:53:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955389503] [2024-06-28 01:53:41,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:53:41,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:53:41,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:53:41,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:53:41,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:53:41,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-28 01:53:41,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 248 transitions, 3031 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:41,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:53:41,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-28 01:53:41,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:53:42,699 INFO L124 PetriNetUnfolderBase]: 2794/6551 cut-off events. [2024-06-28 01:53:42,699 INFO L125 PetriNetUnfolderBase]: For 111120/111122 co-relation queries the response was YES. [2024-06-28 01:53:42,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29915 conditions, 6551 events. 2794/6551 cut-off events. For 111120/111122 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 62685 event pairs, 1583 based on Foata normal form. 8/6146 useless extension candidates. Maximal degree in co-relation 29755. Up to 5159 conditions per place. [2024-06-28 01:53:42,768 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 235 selfloop transitions, 35 changer transitions 0/281 dead transitions. [2024-06-28 01:53:42,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 281 transitions, 3515 flow [2024-06-28 01:53:42,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:53:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:53:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-06-28 01:53:42,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742014742014742 [2024-06-28 01:53:42,769 INFO L175 Difference]: Start difference. First operand has 340 places, 248 transitions, 3031 flow. Second operand 11 states and 193 transitions. [2024-06-28 01:53:42,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 281 transitions, 3515 flow [2024-06-28 01:53:43,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 281 transitions, 3172 flow, removed 8 selfloop flow, removed 78 redundant places. [2024-06-28 01:53:43,126 INFO L231 Difference]: Finished difference. Result has 271 places, 247 transitions, 2550 flow [2024-06-28 01:53:43,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2480, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2550, PETRI_PLACES=271, PETRI_TRANSITIONS=247} [2024-06-28 01:53:43,126 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 230 predicate places. [2024-06-28 01:53:43,126 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 247 transitions, 2550 flow [2024-06-28 01:53:43,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:43,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:53:43,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:43,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-28 01:53:43,127 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:53:43,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:53:43,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2060995368, now seen corresponding path program 1 times [2024-06-28 01:53:43,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:53:43,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542002812] [2024-06-28 01:53:43,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:53:43,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:53:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:53:43,192 INFO 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:53:43,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:53:43,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542002812] [2024-06-28 01:53:43,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542002812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:53:43,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:53:43,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:53:43,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480008229] [2024-06-28 01:53:43,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:53:43,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:53:43,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:53:43,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:53:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:53:43,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-28 01:53:43,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 247 transitions, 2550 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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:53:43,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:53:43,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-28 01:53:43,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:53:43,749 INFO L124 PetriNetUnfolderBase]: 1837/4741 cut-off events. [2024-06-28 01:53:43,750 INFO L125 PetriNetUnfolderBase]: For 37577/37582 co-relation queries the response was YES. [2024-06-28 01:53:43,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18983 conditions, 4741 events. 1837/4741 cut-off events. For 37577/37582 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 44029 event pairs, 349 based on Foata normal form. 308/4853 useless extension candidates. Maximal degree in co-relation 18893. Up to 1287 conditions per place. [2024-06-28 01:53:43,785 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 114 selfloop transitions, 81 changer transitions 0/251 dead transitions. [2024-06-28 01:53:43,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 251 transitions, 2887 flow [2024-06-28 01:53:43,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:53:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:53:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-06-28 01:53:43,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6324324324324324 [2024-06-28 01:53:43,786 INFO L175 Difference]: Start difference. First operand has 271 places, 247 transitions, 2550 flow. Second operand 5 states and 117 transitions. [2024-06-28 01:53:43,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 251 transitions, 2887 flow [2024-06-28 01:53:43,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 251 transitions, 2553 flow, removed 10 selfloop flow, removed 36 redundant places. [2024-06-28 01:53:43,930 INFO L231 Difference]: Finished difference. Result has 240 places, 243 transitions, 2395 flow [2024-06-28 01:53:43,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2141, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2395, PETRI_PLACES=240, PETRI_TRANSITIONS=243} [2024-06-28 01:53:43,930 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 199 predicate places. [2024-06-28 01:53:43,930 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 243 transitions, 2395 flow [2024-06-28 01:53:43,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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:53:43,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:53:43,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:43,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-28 01:53:43,931 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:53:43,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:53:43,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1981197415, now seen corresponding path program 1 times [2024-06-28 01:53:43,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:53:43,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957421880] [2024-06-28 01:53:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:53:43,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:53:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:53:44,024 INFO 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:53:44,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:53:44,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957421880] [2024-06-28 01:53:44,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957421880] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:53:44,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:53:44,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:53:44,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977626290] [2024-06-28 01:53:44,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:53:44,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:53:44,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:53:44,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:53:44,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:53:44,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-06-28 01:53:44,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 243 transitions, 2395 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:44,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:53:44,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-06-28 01:53:44,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:53:44,481 INFO L124 PetriNetUnfolderBase]: 1506/3865 cut-off events. [2024-06-28 01:53:44,482 INFO L125 PetriNetUnfolderBase]: For 19735/19744 co-relation queries the response was YES. [2024-06-28 01:53:44,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14760 conditions, 3865 events. 1506/3865 cut-off events. For 19735/19744 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 34947 event pairs, 472 based on Foata normal form. 0/3592 useless extension candidates. Maximal degree in co-relation 14694. Up to 1596 conditions per place. [2024-06-28 01:53:44,503 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 29 selfloop transitions, 3 changer transitions 206/261 dead transitions. [2024-06-28 01:53:44,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 261 transitions, 2778 flow [2024-06-28 01:53:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:53:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:53:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-06-28 01:53:44,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.555984555984556 [2024-06-28 01:53:44,504 INFO L175 Difference]: Start difference. First operand has 240 places, 243 transitions, 2395 flow. Second operand 7 states and 144 transitions. [2024-06-28 01:53:44,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 261 transitions, 2778 flow [2024-06-28 01:53:44,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 261 transitions, 2572 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-28 01:53:44,580 INFO L231 Difference]: Finished difference. Result has 244 places, 53 transitions, 368 flow [2024-06-28 01:53:44,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2189, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=244, PETRI_TRANSITIONS=53} [2024-06-28 01:53:44,580 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 203 predicate places. [2024-06-28 01:53:44,581 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 53 transitions, 368 flow [2024-06-28 01:53:44,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:44,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:53:44,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:44,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-28 01:53:44,581 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:53:44,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:53:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash 574791765, now seen corresponding path program 2 times [2024-06-28 01:53:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:53:44,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126034154] [2024-06-28 01:53:44,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:53:44,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:53:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:53:45,040 INFO 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:53:45,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:53:45,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126034154] [2024-06-28 01:53:45,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126034154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:53:45,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:53:45,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:53:45,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997432710] [2024-06-28 01:53:45,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:53:45,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:53:45,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:53:45,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:53:45,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:53:45,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-06-28 01:53:45,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 53 transitions, 368 flow. Second operand has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:45,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:53:45,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-06-28 01:53:45,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:53:45,315 INFO L124 PetriNetUnfolderBase]: 207/626 cut-off events. [2024-06-28 01:53:45,316 INFO L125 PetriNetUnfolderBase]: For 1988/1988 co-relation queries the response was YES. [2024-06-28 01:53:45,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2180 conditions, 626 events. 207/626 cut-off events. For 1988/1988 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4004 event pairs, 77 based on Foata normal form. 16/590 useless extension candidates. Maximal degree in co-relation 2125. Up to 164 conditions per place. [2024-06-28 01:53:45,319 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 22 selfloop transitions, 13 changer transitions 10/71 dead transitions. [2024-06-28 01:53:45,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 71 transitions, 506 flow [2024-06-28 01:53:45,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:53:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:53:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2024-06-28 01:53:45,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44717444717444715 [2024-06-28 01:53:45,320 INFO L175 Difference]: Start difference. First operand has 244 places, 53 transitions, 368 flow. Second operand 11 states and 182 transitions. [2024-06-28 01:53:45,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 71 transitions, 506 flow [2024-06-28 01:53:45,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 71 transitions, 393 flow, removed 19 selfloop flow, removed 33 redundant places. [2024-06-28 01:53:45,324 INFO L231 Difference]: Finished difference. Result has 102 places, 53 transitions, 298 flow [2024-06-28 01:53:45,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=298, PETRI_PLACES=102, PETRI_TRANSITIONS=53} [2024-06-28 01:53:45,324 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2024-06-28 01:53:45,324 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 53 transitions, 298 flow [2024-06-28 01:53:45,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:53:45,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:53:45,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:45,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-28 01:53:45,325 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:53:45,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:53:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1414885797, now seen corresponding path program 3 times [2024-06-28 01:53:45,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:53:45,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984417027] [2024-06-28 01:53:45,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:53:45,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:53:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:53:45,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-28 01:53:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:53:45,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-28 01:53:45,383 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-28 01:53:45,384 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-28 01:53:45,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-28 01:53:45,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-28 01:53:45,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-28 01:53:45,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-28 01:53:45,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-28 01:53:45,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-28 01:53:45,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-28 01:53:45,390 INFO L445 BasicCegarLoop]: Path program histogram: [19, 15, 12, 11, 11, 8, 6, 5, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:53:45,395 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 01:53:45,396 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 01:53:45,453 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 01:53:45,458 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 01:53:45,460 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 01:53:45 BasicIcfg [2024-06-28 01:53:45,460 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 01:53:45,460 INFO L158 Benchmark]: Toolchain (without parser) took 251153.99ms. Allocated memory was 172.0MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 140.9MB in the beginning and 1.1GB in the end (delta: -926.0MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-06-28 01:53:45,460 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:53:45,461 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 132.1MB. Free memory was 103.6MB in the beginning and 103.6MB in the end (delta: 26.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:53:45,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.26ms. Allocated memory is still 172.0MB. Free memory was 139.9MB in the beginning and 105.2MB in the end (delta: 34.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-06-28 01:53:45,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.35ms. Allocated memory is still 172.0MB. Free memory was 105.2MB in the beginning and 102.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 01:53:45,461 INFO L158 Benchmark]: Boogie Preprocessor took 56.78ms. Allocated memory is still 172.0MB. Free memory was 102.2MB in the beginning and 98.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 01:53:45,461 INFO L158 Benchmark]: RCFGBuilder took 544.00ms. Allocated memory is still 172.0MB. Free memory was 98.9MB in the beginning and 132.1MB in the end (delta: -33.2MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2024-06-28 01:53:45,462 INFO L158 Benchmark]: TraceAbstraction took 249983.91ms. Allocated memory was 172.0MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 132.1MB in the beginning and 1.1GB in the end (delta: -934.8MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-06-28 01:53:45,463 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 132.1MB. Free memory was 103.6MB in the beginning and 103.6MB in the end (delta: 26.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.26ms. Allocated memory is still 172.0MB. Free memory was 139.9MB in the beginning and 105.2MB in the end (delta: 34.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.35ms. Allocated memory is still 172.0MB. Free memory was 105.2MB in the beginning and 102.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.78ms. Allocated memory is still 172.0MB. Free memory was 102.2MB in the beginning and 98.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 544.00ms. Allocated memory is still 172.0MB. Free memory was 98.9MB in the beginning and 132.1MB in the end (delta: -33.2MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. * TraceAbstraction took 249983.91ms. Allocated memory was 172.0MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 132.1MB in the beginning and 1.1GB in the end (delta: -934.8MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1761; [L824] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L824] FCALL, FORK 0 pthread_create(&t1761, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L825] 0 pthread_t t1762; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L826] 0 //@ assert ((((((((((((((((!multithreaded || (y$read_delayed_var == 0)) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || ((((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))); [L826] FCALL, FORK 0 pthread_create(&t1762, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-2, t1762=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L827] 0 //@ assert ((((((((((((((((!multithreaded || (y$read_delayed_var == 0)) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || ((((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761=-2, t1762=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y$w_buff1 = y$w_buff0 [L772] 2 y$w_buff0 = 1 [L773] 2 y$w_buff1_used = y$w_buff0_used [L774] 2 y$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 y$flush_delayed = weak$$choice2 [L785] 2 y$mem_tmp = y [L786] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L787] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L788] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L789] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L790] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L792] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = y [L794] 2 y = y$flush_delayed ? y$mem_tmp : y [L795] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L798] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 y$flush_delayed = weak$$choice2 [L749] 1 y$mem_tmp = y [L750] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L751] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L752] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L753] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L754] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L756] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = y [L758] 1 y = y$flush_delayed ? y$mem_tmp : y [L759] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=-2, t1762=-1, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=-2, t1762=-1, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761=-2, t1762=-1, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 56 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 249.8s, OverallIterations: 119, TraceHistogramMax: 1, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.0s, AutomataDifference: 130.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8371 SdHoareTripleChecker+Valid, 36.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7224 mSDsluCounter, 4045 SdHoareTripleChecker+Invalid, 31.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3593 mSDsCounter, 1574 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58920 IncrementalHoareTripleChecker+Invalid, 60494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1574 mSolverCounterUnsat, 452 mSDtfsCounter, 58920 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1257 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2224 ImplicationChecksByTransitivity, 35.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3535occurred in iteration=95, InterpolantAutomatonStates: 1095, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 117.8s InterpolantComputationTime, 1982 NumberOfCodeBlocks, 1982 NumberOfCodeBlocksAsserted, 119 NumberOfCheckSat, 1837 ConstructedInterpolants, 0 QuantifiedInterpolants, 90099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 118 InterpolantComputations, 118 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-28 01:53:45,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE