./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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:57:07,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:57:07,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:57:07,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:57:07,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:57:07,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:57:07,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:57:07,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:57:07,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:57:07,941 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:57:07,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:57:07,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:57:07,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:57:07,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:57:07,944 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:57:07,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:57:07,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:57:07,944 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:57:07,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:57:07,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:57:07,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:57:07,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:57:07,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:57:07,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:57:07,946 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:57:07,946 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:57:07,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:57:07,946 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:57:07,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:57:07,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:57:07,948 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:57:07,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:57:07,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:57:07,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:57:07,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:57:07,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:57:07,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:57:07,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:57:07,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:57:07,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:57:07,964 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:57:07,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:57:07,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:57:07,965 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:57:08,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:57:08,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:57:08,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:57:08,186 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:57:08,186 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:57:08,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 01:57:09,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:57:09,314 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:57:09,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 01:57:09,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b38c526e/d376cb56eb314a638ee8bc6a29a619d6/FLAG0047342cc [2024-06-28 01:57:09,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b38c526e/d376cb56eb314a638ee8bc6a29a619d6 [2024-06-28 01:57:09,339 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:57:09,339 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:57:09,340 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-28 01:57:09,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:57:09,464 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:57:09,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:57:09,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:57:09,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:57:09,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:57:09" (1/2) ... [2024-06-28 01:57:09,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7158c6c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:57:09, skipping insertion in model container [2024-06-28 01:57:09,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:57:09" (1/2) ... [2024-06-28 01:57:09,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@63f9f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:57:09, skipping insertion in model container [2024-06-28 01:57:09,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:57:09" (2/2) ... [2024-06-28 01:57:09,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7158c6c4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:57:09, skipping insertion in model container [2024-06-28 01:57:09,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:57:09" (2/2) ... [2024-06-28 01:57:09,477 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:57:09,569 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:57:09,571 INFO L97 edCorrectnessWitness]: Location invariant before [L796-L796] (((((((((((((! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 01:57:09,571 INFO L97 edCorrectnessWitness]: Location invariant before [L795-L795] (((((((((((((! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 01:57:09,571 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:57:09,571 INFO L106 edCorrectnessWitness]: ghost_update [L793-L793] multithreaded = 1; [2024-06-28 01:57:09,608 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:57:09,767 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-06-28 01:57:09,904 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:57:09,912 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:57:09,947 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:57:10,035 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:57:10,066 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:57:10,067 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:57:10 WrapperNode [2024-06-28 01:57:10,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:57:10,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:57:10,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:57:10,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:57:10,073 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:57:10" (1/1) ... [2024-06-28 01:57:10,082 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:57:10" (1/1) ... [2024-06-28 01:57:10,107 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-06-28 01:57:10,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:57:10,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:57:10,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:57:10,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:57:10,116 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:57:10" (1/1) ... [2024-06-28 01:57:10,116 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:57:10" (1/1) ... [2024-06-28 01:57:10,119 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:57:10" (1/1) ... [2024-06-28 01:57:10,130 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:57:10,130 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:57:10" (1/1) ... [2024-06-28 01:57:10,131 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:57:10" (1/1) ... [2024-06-28 01:57:10,136 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:57:10" (1/1) ... [2024-06-28 01:57:10,137 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:57:10" (1/1) ... [2024-06-28 01:57:10,138 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:57:10" (1/1) ... [2024-06-28 01:57:10,139 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:57:10" (1/1) ... [2024-06-28 01:57:10,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:57:10,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:57:10,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:57:10,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:57:10,142 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:57:10" (1/1) ... [2024-06-28 01:57:10,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:57:10,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:57:10,164 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:57:10,182 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:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:57:10,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:57:10,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:57:10,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:57:10,194 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:57:10,326 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:57:10,329 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:57:10,643 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:57:10,644 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:57:10,814 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:57:10,814 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:57:10,815 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:57:10 BoogieIcfgContainer [2024-06-28 01:57:10,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:57:10,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:57:10,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:57:10,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:57:10,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:57:09" (1/4) ... [2024-06-28 01:57:10,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7724126d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:57:10, skipping insertion in model container [2024-06-28 01:57:10,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:57:09" (2/4) ... [2024-06-28 01:57:10,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7724126d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:57:10, skipping insertion in model container [2024-06-28 01:57:10,822 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:57:10" (3/4) ... [2024-06-28 01:57:10,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7724126d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:57:10, skipping insertion in model container [2024-06-28 01:57:10,823 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:57:10" (4/4) ... [2024-06-28 01:57:10,824 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 01:57:10,837 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:57:10,837 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-28 01:57:10,837 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:57:10,875 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:57:10,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-28 01:57:10,934 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-28 01:57:10,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:57:10,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-06-28 01:57:10,937 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-28 01:57:10,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 33 transitions, 72 flow [2024-06-28 01:57:10,953 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:57:10,961 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;@4fa927bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:57:10,961 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-28 01:57:10,967 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:57:10,967 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:57:10,967 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:57:10,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:10,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:57:10,969 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:10,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:10,975 INFO L85 PathProgramCache]: Analyzing trace with hash 306675205, now seen corresponding path program 1 times [2024-06-28 01:57:10,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:10,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838271608] [2024-06-28 01:57:10,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:10,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:11,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:11,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838271608] [2024-06-28 01:57:11,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838271608] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:11,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:11,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:57:11,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628495529] [2024-06-28 01:57:11,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:11,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:57:11,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:11,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:57:11,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:57:11,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 01:57:11,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:11,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:11,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 01:57:11,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:11,983 INFO L124 PetriNetUnfolderBase]: 449/867 cut-off events. [2024-06-28 01:57:11,983 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-28 01:57:11,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 867 events. 449/867 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4512 event pairs, 318 based on Foata normal form. 36/816 useless extension candidates. Maximal degree in co-relation 1632. Up to 746 conditions per place. [2024-06-28 01:57:11,992 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 31 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-28 01:57:11,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 167 flow [2024-06-28 01:57:11,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:57:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:57:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-06-28 01:57:12,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-06-28 01:57:12,003 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 72 transitions. [2024-06-28 01:57:12,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 167 flow [2024-06-28 01:57:12,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:57:12,007 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 96 flow [2024-06-28 01:57:12,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2024-06-28 01:57:12,011 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-06-28 01:57:12,011 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 96 flow [2024-06-28 01:57:12,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:12,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:12,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:57:12,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:57:12,013 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:12,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:12,013 INFO L85 PathProgramCache]: Analyzing trace with hash 306676041, now seen corresponding path program 1 times [2024-06-28 01:57:12,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:12,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007289123] [2024-06-28 01:57:12,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:12,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:12,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:12,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007289123] [2024-06-28 01:57:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007289123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:12,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:12,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:57:12,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610529166] [2024-06-28 01:57:12,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:12,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:57:12,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:12,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:57:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:57:12,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2024-06-28 01:57:12,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:12,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:12,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2024-06-28 01:57:12,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:12,166 INFO L124 PetriNetUnfolderBase]: 129/311 cut-off events. [2024-06-28 01:57:12,166 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-28 01:57:12,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 311 events. 129/311 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1535 event pairs, 41 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 605. Up to 195 conditions per place. [2024-06-28 01:57:12,169 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 23 selfloop transitions, 3 changer transitions 2/44 dead transitions. [2024-06-28 01:57:12,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 167 flow [2024-06-28 01:57:12,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:57:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:57:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-28 01:57:12,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7523809523809524 [2024-06-28 01:57:12,171 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 96 flow. Second operand 3 states and 79 transitions. [2024-06-28 01:57:12,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 167 flow [2024-06-28 01:57:12,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:57:12,173 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 88 flow [2024-06-28 01:57:12,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-06-28 01:57:12,174 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-06-28 01:57:12,174 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 88 flow [2024-06-28 01:57:12,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:12,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:12,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:12,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:57:12,176 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:12,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:12,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1637834109, now seen corresponding path program 1 times [2024-06-28 01:57:12,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:12,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485203775] [2024-06-28 01:57:12,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:12,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:12,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:12,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485203775] [2024-06-28 01:57:12,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485203775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:12,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:12,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:57:12,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762949074] [2024-06-28 01:57:12,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:12,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:57:12,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:12,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:57:12,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:57:12,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 01:57:12,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:12,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:12,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 01:57:12,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:12,718 INFO L124 PetriNetUnfolderBase]: 333/666 cut-off events. [2024-06-28 01:57:12,719 INFO L125 PetriNetUnfolderBase]: For 162/165 co-relation queries the response was YES. [2024-06-28 01:57:12,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 666 events. 333/666 cut-off events. For 162/165 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3300 event pairs, 167 based on Foata normal form. 4/637 useless extension candidates. Maximal degree in co-relation 1389. Up to 547 conditions per place. [2024-06-28 01:57:12,723 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 35 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2024-06-28 01:57:12,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 218 flow [2024-06-28 01:57:12,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:57:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:57:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-06-28 01:57:12,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2024-06-28 01:57:12,726 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 88 flow. Second operand 4 states and 85 transitions. [2024-06-28 01:57:12,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 218 flow [2024-06-28 01:57:12,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:57:12,729 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 131 flow [2024-06-28 01:57:12,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-28 01:57:12,730 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2024-06-28 01:57:12,730 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 131 flow [2024-06-28 01:57:12,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:12,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:12,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:12,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:57:12,731 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:12,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash 766751430, now seen corresponding path program 1 times [2024-06-28 01:57:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:12,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655811551] [2024-06-28 01:57:12,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:12,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:13,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:13,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655811551] [2024-06-28 01:57:13,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655811551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:13,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:13,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:57:13,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35909189] [2024-06-28 01:57:13,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:13,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:57:13,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:13,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:57:13,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:57:13,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 01:57:13,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:13,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:13,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 01:57:13,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:13,283 INFO L124 PetriNetUnfolderBase]: 407/804 cut-off events. [2024-06-28 01:57:13,284 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2024-06-28 01:57:13,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 804 events. 407/804 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4119 event pairs, 168 based on Foata normal form. 2/767 useless extension candidates. Maximal degree in co-relation 1828. Up to 648 conditions per place. [2024-06-28 01:57:13,287 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 49 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2024-06-28 01:57:13,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 323 flow [2024-06-28 01:57:13,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:57:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:57:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2024-06-28 01:57:13,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5828571428571429 [2024-06-28 01:57:13,289 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 131 flow. Second operand 5 states and 102 transitions. [2024-06-28 01:57:13,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 323 flow [2024-06-28 01:57:13,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 314 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 01:57:13,291 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 188 flow [2024-06-28 01:57:13,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2024-06-28 01:57:13,292 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2024-06-28 01:57:13,292 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 188 flow [2024-06-28 01:57:13,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:13,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:13,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:13,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:57:13,292 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:13,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:13,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2000508158, now seen corresponding path program 1 times [2024-06-28 01:57:13,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:13,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92136878] [2024-06-28 01:57:13,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:13,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:13,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:13,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92136878] [2024-06-28 01:57:13,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92136878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:13,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:13,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:57:13,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441001898] [2024-06-28 01:57:13,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:13,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:57:13,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:13,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:57:13,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:57:13,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 01:57:13,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:13,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:13,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 01:57:13,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:14,029 INFO L124 PetriNetUnfolderBase]: 409/807 cut-off events. [2024-06-28 01:57:14,029 INFO L125 PetriNetUnfolderBase]: For 543/543 co-relation queries the response was YES. [2024-06-28 01:57:14,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2009 conditions, 807 events. 409/807 cut-off events. For 543/543 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4113 event pairs, 172 based on Foata normal form. 2/770 useless extension candidates. Maximal degree in co-relation 1990. Up to 635 conditions per place. [2024-06-28 01:57:14,033 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 56 selfloop transitions, 11 changer transitions 0/75 dead transitions. [2024-06-28 01:57:14,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 75 transitions, 400 flow [2024-06-28 01:57:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:57:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:57:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-28 01:57:14,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2024-06-28 01:57:14,034 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 188 flow. Second operand 6 states and 122 transitions. [2024-06-28 01:57:14,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 75 transitions, 400 flow [2024-06-28 01:57:14,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 01:57:14,036 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 232 flow [2024-06-28 01:57:14,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-06-28 01:57:14,037 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 15 predicate places. [2024-06-28 01:57:14,037 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 232 flow [2024-06-28 01:57:14,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:14,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:14,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:14,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:57:14,038 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:14,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:14,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1886209435, now seen corresponding path program 1 times [2024-06-28 01:57:14,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:14,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397732673] [2024-06-28 01:57:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:14,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:14,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:14,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397732673] [2024-06-28 01:57:14,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397732673] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:14,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:14,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:57:14,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844848712] [2024-06-28 01:57:14,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:14,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:57:14,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:14,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:57:14,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:57:14,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 01:57:14,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:14,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:14,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 01:57:14,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:14,931 INFO L124 PetriNetUnfolderBase]: 405/802 cut-off events. [2024-06-28 01:57:14,931 INFO L125 PetriNetUnfolderBase]: For 791/791 co-relation queries the response was YES. [2024-06-28 01:57:14,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2186 conditions, 802 events. 405/802 cut-off events. For 791/791 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4126 event pairs, 79 based on Foata normal form. 4/766 useless extension candidates. Maximal degree in co-relation 2164. Up to 605 conditions per place. [2024-06-28 01:57:14,936 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 61 selfloop transitions, 24 changer transitions 0/93 dead transitions. [2024-06-28 01:57:14,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 574 flow [2024-06-28 01:57:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:57:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:57:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-28 01:57:14,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2024-06-28 01:57:14,938 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 232 flow. Second operand 7 states and 135 transitions. [2024-06-28 01:57:14,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 574 flow [2024-06-28 01:57:14,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 93 transitions, 543 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-28 01:57:14,941 INFO L231 Difference]: Finished difference. Result has 60 places, 66 transitions, 409 flow [2024-06-28 01:57:14,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=409, PETRI_PLACES=60, PETRI_TRANSITIONS=66} [2024-06-28 01:57:14,941 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2024-06-28 01:57:14,942 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 66 transitions, 409 flow [2024-06-28 01:57:14,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:14,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:14,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:14,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:57:14,942 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:14,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:14,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1333938479, now seen corresponding path program 1 times [2024-06-28 01:57:14,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:14,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835072184] [2024-06-28 01:57:14,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:14,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:15,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:15,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835072184] [2024-06-28 01:57:15,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835072184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:15,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:15,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:57:15,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567933858] [2024-06-28 01:57:15,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:15,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:57:15,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:15,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:57:15,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:57:15,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:15,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 66 transitions, 409 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:15,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:15,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:15,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:15,622 INFO L124 PetriNetUnfolderBase]: 461/892 cut-off events. [2024-06-28 01:57:15,622 INFO L125 PetriNetUnfolderBase]: For 1293/1293 co-relation queries the response was YES. [2024-06-28 01:57:15,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2728 conditions, 892 events. 461/892 cut-off events. For 1293/1293 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4497 event pairs, 141 based on Foata normal form. 2/854 useless extension candidates. Maximal degree in co-relation 2700. Up to 735 conditions per place. [2024-06-28 01:57:15,628 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 64 selfloop transitions, 13 changer transitions 0/83 dead transitions. [2024-06-28 01:57:15,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 621 flow [2024-06-28 01:57:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:57:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:57:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2024-06-28 01:57:15,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742857142857143 [2024-06-28 01:57:15,629 INFO L175 Difference]: Start difference. First operand has 60 places, 66 transitions, 409 flow. Second operand 5 states and 83 transitions. [2024-06-28 01:57:15,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 83 transitions, 621 flow [2024-06-28 01:57:15,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 83 transitions, 601 flow, removed 10 selfloop flow, removed 0 redundant places. [2024-06-28 01:57:15,634 INFO L231 Difference]: Finished difference. Result has 66 places, 72 transitions, 473 flow [2024-06-28 01:57:15,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=473, PETRI_PLACES=66, PETRI_TRANSITIONS=72} [2024-06-28 01:57:15,636 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 27 predicate places. [2024-06-28 01:57:15,636 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 72 transitions, 473 flow [2024-06-28 01:57:15,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:15,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:15,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:15,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:57:15,636 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:15,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2074249079, now seen corresponding path program 1 times [2024-06-28 01:57:15,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:15,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311249062] [2024-06-28 01:57:15,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:15,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:16,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:16,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311249062] [2024-06-28 01:57:16,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311249062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:16,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:16,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:57:16,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744097603] [2024-06-28 01:57:16,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:16,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:57:16,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:16,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:57:16,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:57:16,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:16,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 72 transitions, 473 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:16,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:16,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:16,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:16,395 INFO L124 PetriNetUnfolderBase]: 479/926 cut-off events. [2024-06-28 01:57:16,395 INFO L125 PetriNetUnfolderBase]: For 1654/1654 co-relation queries the response was YES. [2024-06-28 01:57:16,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3007 conditions, 926 events. 479/926 cut-off events. For 1654/1654 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4796 event pairs, 109 based on Foata normal form. 1/885 useless extension candidates. Maximal degree in co-relation 2974. Up to 705 conditions per place. [2024-06-28 01:57:16,401 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 84 selfloop transitions, 19 changer transitions 0/109 dead transitions. [2024-06-28 01:57:16,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 109 transitions, 817 flow [2024-06-28 01:57:16,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:57:16,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:57:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-28 01:57:16,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020408163265306 [2024-06-28 01:57:16,402 INFO L175 Difference]: Start difference. First operand has 66 places, 72 transitions, 473 flow. Second operand 7 states and 123 transitions. [2024-06-28 01:57:16,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 109 transitions, 817 flow [2024-06-28 01:57:16,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 109 transitions, 807 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-28 01:57:16,407 INFO L231 Difference]: Finished difference. Result has 72 places, 76 transitions, 535 flow [2024-06-28 01:57:16,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=535, PETRI_PLACES=72, PETRI_TRANSITIONS=76} [2024-06-28 01:57:16,407 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2024-06-28 01:57:16,408 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 76 transitions, 535 flow [2024-06-28 01:57:16,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:16,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:16,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:16,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:57:16,408 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:16,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:16,409 INFO L85 PathProgramCache]: Analyzing trace with hash -415793867, now seen corresponding path program 1 times [2024-06-28 01:57:16,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:16,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148300546] [2024-06-28 01:57:16,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:16,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:16,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:16,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148300546] [2024-06-28 01:57:16,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148300546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:16,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:16,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:57:16,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741230272] [2024-06-28 01:57:16,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:16,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:57:16,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:16,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:57:16,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:57:16,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:16,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 76 transitions, 535 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:16,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:16,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:16,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:17,123 INFO L124 PetriNetUnfolderBase]: 511/971 cut-off events. [2024-06-28 01:57:17,123 INFO L125 PetriNetUnfolderBase]: For 2219/2219 co-relation queries the response was YES. [2024-06-28 01:57:17,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3353 conditions, 971 events. 511/971 cut-off events. For 2219/2219 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4956 event pairs, 110 based on Foata normal form. 2/931 useless extension candidates. Maximal degree in co-relation 3317. Up to 726 conditions per place. [2024-06-28 01:57:17,129 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 82 selfloop transitions, 28 changer transitions 0/116 dead transitions. [2024-06-28 01:57:17,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 116 transitions, 927 flow [2024-06-28 01:57:17,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:57:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:57:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-28 01:57:17,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49795918367346936 [2024-06-28 01:57:17,130 INFO L175 Difference]: Start difference. First operand has 72 places, 76 transitions, 535 flow. Second operand 7 states and 122 transitions. [2024-06-28 01:57:17,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 116 transitions, 927 flow [2024-06-28 01:57:17,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 116 transitions, 901 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 01:57:17,136 INFO L231 Difference]: Finished difference. Result has 77 places, 88 transitions, 672 flow [2024-06-28 01:57:17,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=672, PETRI_PLACES=77, PETRI_TRANSITIONS=88} [2024-06-28 01:57:17,136 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 38 predicate places. [2024-06-28 01:57:17,136 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 88 transitions, 672 flow [2024-06-28 01:57:17,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:17,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:17,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:17,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:57:17,137 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:17,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:17,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2074369049, now seen corresponding path program 2 times [2024-06-28 01:57:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:17,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275004120] [2024-06-28 01:57:17,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:17,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:17,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:17,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275004120] [2024-06-28 01:57:17,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275004120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:17,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:17,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:57:17,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727150220] [2024-06-28 01:57:17,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:17,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:57:17,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:17,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:57:17,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:57:17,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:17,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 88 transitions, 672 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:17,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:17,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:17,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:17,924 INFO L124 PetriNetUnfolderBase]: 527/1002 cut-off events. [2024-06-28 01:57:17,925 INFO L125 PetriNetUnfolderBase]: For 2764/2764 co-relation queries the response was YES. [2024-06-28 01:57:17,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3724 conditions, 1002 events. 527/1002 cut-off events. For 2764/2764 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5165 event pairs, 110 based on Foata normal form. 1/960 useless extension candidates. Maximal degree in co-relation 3685. Up to 805 conditions per place. [2024-06-28 01:57:17,931 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 94 selfloop transitions, 20 changer transitions 0/120 dead transitions. [2024-06-28 01:57:17,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 120 transitions, 1028 flow [2024-06-28 01:57:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:57:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:57:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-28 01:57:17,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816326530612245 [2024-06-28 01:57:17,932 INFO L175 Difference]: Start difference. First operand has 77 places, 88 transitions, 672 flow. Second operand 7 states and 118 transitions. [2024-06-28 01:57:17,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 120 transitions, 1028 flow [2024-06-28 01:57:17,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 120 transitions, 968 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-28 01:57:17,939 INFO L231 Difference]: Finished difference. Result has 81 places, 92 transitions, 704 flow [2024-06-28 01:57:17,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=704, PETRI_PLACES=81, PETRI_TRANSITIONS=92} [2024-06-28 01:57:17,939 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 42 predicate places. [2024-06-28 01:57:17,939 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 92 transitions, 704 flow [2024-06-28 01:57:17,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:17,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:17,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:17,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 01:57:17,940 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:17,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash 337732599, now seen corresponding path program 3 times [2024-06-28 01:57:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:17,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560605737] [2024-06-28 01:57:17,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:17,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:18,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:18,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560605737] [2024-06-28 01:57:18,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560605737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:18,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:18,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:57:18,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582911926] [2024-06-28 01:57:18,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:18,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:57:18,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:18,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:57:18,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:57:18,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:18,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 92 transitions, 704 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:18,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:18,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:18,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:18,722 INFO L124 PetriNetUnfolderBase]: 525/1002 cut-off events. [2024-06-28 01:57:18,722 INFO L125 PetriNetUnfolderBase]: For 2870/2870 co-relation queries the response was YES. [2024-06-28 01:57:18,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3730 conditions, 1002 events. 525/1002 cut-off events. For 2870/2870 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5173 event pairs, 116 based on Foata normal form. 1/959 useless extension candidates. Maximal degree in co-relation 3690. Up to 796 conditions per place. [2024-06-28 01:57:18,729 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 92 selfloop transitions, 20 changer transitions 0/118 dead transitions. [2024-06-28 01:57:18,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 118 transitions, 1010 flow [2024-06-28 01:57:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:57:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:57:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-28 01:57:18,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-06-28 01:57:18,730 INFO L175 Difference]: Start difference. First operand has 81 places, 92 transitions, 704 flow. Second operand 6 states and 106 transitions. [2024-06-28 01:57:18,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 118 transitions, 1010 flow [2024-06-28 01:57:18,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 118 transitions, 962 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-28 01:57:18,737 INFO L231 Difference]: Finished difference. Result has 83 places, 92 transitions, 708 flow [2024-06-28 01:57:18,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=708, PETRI_PLACES=83, PETRI_TRANSITIONS=92} [2024-06-28 01:57:18,738 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 44 predicate places. [2024-06-28 01:57:18,738 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 92 transitions, 708 flow [2024-06-28 01:57:18,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:18,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:18,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:18,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 01:57:18,738 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:18,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:18,739 INFO L85 PathProgramCache]: Analyzing trace with hash 337998765, now seen corresponding path program 2 times [2024-06-28 01:57:18,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:18,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289680548] [2024-06-28 01:57:18,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:18,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:19,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:19,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289680548] [2024-06-28 01:57:19,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289680548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:19,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:19,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:57:19,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553946490] [2024-06-28 01:57:19,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:19,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:57:19,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:19,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:57:19,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:57:19,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:19,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 92 transitions, 708 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:19,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:19,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:19,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:19,420 INFO L124 PetriNetUnfolderBase]: 547/1032 cut-off events. [2024-06-28 01:57:19,420 INFO L125 PetriNetUnfolderBase]: For 3330/3330 co-relation queries the response was YES. [2024-06-28 01:57:19,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3868 conditions, 1032 events. 547/1032 cut-off events. For 3330/3330 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5269 event pairs, 143 based on Foata normal form. 2/991 useless extension candidates. Maximal degree in co-relation 3827. Up to 847 conditions per place. [2024-06-28 01:57:19,427 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 89 selfloop transitions, 20 changer transitions 0/115 dead transitions. [2024-06-28 01:57:19,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 115 transitions, 1002 flow [2024-06-28 01:57:19,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:57:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:57:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-28 01:57:19,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 01:57:19,429 INFO L175 Difference]: Start difference. First operand has 83 places, 92 transitions, 708 flow. Second operand 6 states and 100 transitions. [2024-06-28 01:57:19,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 115 transitions, 1002 flow [2024-06-28 01:57:19,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 115 transitions, 954 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 01:57:19,436 INFO L231 Difference]: Finished difference. Result has 85 places, 99 transitions, 760 flow [2024-06-28 01:57:19,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=760, PETRI_PLACES=85, PETRI_TRANSITIONS=99} [2024-06-28 01:57:19,437 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 46 predicate places. [2024-06-28 01:57:19,437 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 99 transitions, 760 flow [2024-06-28 01:57:19,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:19,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:19,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:19,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:57:19,438 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:19,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash 337732785, now seen corresponding path program 3 times [2024-06-28 01:57:19,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:19,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396431983] [2024-06-28 01:57:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:19,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:19,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:57:19,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:19,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396431983] [2024-06-28 01:57:19,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396431983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:19,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:19,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:57:19,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138265401] [2024-06-28 01:57:19,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:19,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:57:19,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:19,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:57:19,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:57:19,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:19,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 99 transitions, 760 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:19,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:19,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:19,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:20,120 INFO L124 PetriNetUnfolderBase]: 557/1047 cut-off events. [2024-06-28 01:57:20,120 INFO L125 PetriNetUnfolderBase]: For 3626/3626 co-relation queries the response was YES. [2024-06-28 01:57:20,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4066 conditions, 1047 events. 557/1047 cut-off events. For 3626/3626 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5384 event pairs, 111 based on Foata normal form. 2/1005 useless extension candidates. Maximal degree in co-relation 4023. Up to 778 conditions per place. [2024-06-28 01:57:20,128 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 84 selfloop transitions, 36 changer transitions 0/126 dead transitions. [2024-06-28 01:57:20,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 126 transitions, 1131 flow [2024-06-28 01:57:20,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:57:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:57:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-28 01:57:20,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2024-06-28 01:57:20,129 INFO L175 Difference]: Start difference. First operand has 85 places, 99 transitions, 760 flow. Second operand 6 states and 107 transitions. [2024-06-28 01:57:20,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 126 transitions, 1131 flow [2024-06-28 01:57:20,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 126 transitions, 1103 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-28 01:57:20,139 INFO L231 Difference]: Finished difference. Result has 90 places, 104 transitions, 886 flow [2024-06-28 01:57:20,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=886, PETRI_PLACES=90, PETRI_TRANSITIONS=104} [2024-06-28 01:57:20,140 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 51 predicate places. [2024-06-28 01:57:20,140 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 104 transitions, 886 flow [2024-06-28 01:57:20,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:20,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:20,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:20,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 01:57:20,141 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:20,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:20,141 INFO L85 PathProgramCache]: Analyzing trace with hash 338008654, now seen corresponding path program 1 times [2024-06-28 01:57:20,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:20,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238809196] [2024-06-28 01:57:20,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:20,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:20,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:20,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238809196] [2024-06-28 01:57:20,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238809196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:20,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:20,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:57:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903544673] [2024-06-28 01:57:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:20,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:57:20,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:57:20,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:57:20,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:20,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 104 transitions, 886 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:57:20,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:20,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:20,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:21,074 INFO L124 PetriNetUnfolderBase]: 554/1042 cut-off events. [2024-06-28 01:57:21,076 INFO L125 PetriNetUnfolderBase]: For 4379/4379 co-relation queries the response was YES. [2024-06-28 01:57:21,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4254 conditions, 1042 events. 554/1042 cut-off events. For 4379/4379 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5296 event pairs, 135 based on Foata normal form. 2/1001 useless extension candidates. Maximal degree in co-relation 4208. Up to 857 conditions per place. [2024-06-28 01:57:21,082 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 99 selfloop transitions, 17 changer transitions 0/122 dead transitions. [2024-06-28 01:57:21,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 122 transitions, 1176 flow [2024-06-28 01:57:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:57:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:57:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-28 01:57:21,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-28 01:57:21,084 INFO L175 Difference]: Start difference. First operand has 90 places, 104 transitions, 886 flow. Second operand 6 states and 98 transitions. [2024-06-28 01:57:21,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 122 transitions, 1176 flow [2024-06-28 01:57:21,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 122 transitions, 1114 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-28 01:57:21,092 INFO L231 Difference]: Finished difference. Result has 92 places, 106 transitions, 881 flow [2024-06-28 01:57:21,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=881, PETRI_PLACES=92, PETRI_TRANSITIONS=106} [2024-06-28 01:57:21,093 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 53 predicate places. [2024-06-28 01:57:21,093 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 106 transitions, 881 flow [2024-06-28 01:57:21,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:57:21,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:21,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:21,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:57:21,094 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:21,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:21,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1736466611, now seen corresponding path program 1 times [2024-06-28 01:57:21,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:21,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935309118] [2024-06-28 01:57:21,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:21,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:21,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:21,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935309118] [2024-06-28 01:57:21,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935309118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:21,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:21,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:57:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259895485] [2024-06-28 01:57:21,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:21,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:57:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:21,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:57:21,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:57:21,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:21,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 106 transitions, 881 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:21,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:21,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:21,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:21,998 INFO L124 PetriNetUnfolderBase]: 588/1093 cut-off events. [2024-06-28 01:57:21,998 INFO L125 PetriNetUnfolderBase]: For 4508/4508 co-relation queries the response was YES. [2024-06-28 01:57:22,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4405 conditions, 1093 events. 588/1093 cut-off events. For 4508/4508 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5607 event pairs, 101 based on Foata normal form. 1/1050 useless extension candidates. Maximal degree in co-relation 4359. Up to 634 conditions per place. [2024-06-28 01:57:22,006 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 102 selfloop transitions, 54 changer transitions 0/162 dead transitions. [2024-06-28 01:57:22,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 162 transitions, 1511 flow [2024-06-28 01:57:22,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:57:22,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:57:22,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-28 01:57:22,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-06-28 01:57:22,008 INFO L175 Difference]: Start difference. First operand has 92 places, 106 transitions, 881 flow. Second operand 8 states and 150 transitions. [2024-06-28 01:57:22,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 162 transitions, 1511 flow [2024-06-28 01:57:22,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 162 transitions, 1470 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-28 01:57:22,017 INFO L231 Difference]: Finished difference. Result has 98 places, 119 transitions, 1112 flow [2024-06-28 01:57:22,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1112, PETRI_PLACES=98, PETRI_TRANSITIONS=119} [2024-06-28 01:57:22,017 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 59 predicate places. [2024-06-28 01:57:22,017 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 119 transitions, 1112 flow [2024-06-28 01:57:22,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:22,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:22,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:22,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 01:57:22,018 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:22,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash -122787153, now seen corresponding path program 2 times [2024-06-28 01:57:22,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:22,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757341288] [2024-06-28 01:57:22,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:22,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:22,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:22,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:22,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757341288] [2024-06-28 01:57:22,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757341288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:22,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:22,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:57:22,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315188435] [2024-06-28 01:57:22,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:22,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:57:22,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:22,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:57:22,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:57:22,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:22,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 119 transitions, 1112 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:22,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:22,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:22,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:22,983 INFO L124 PetriNetUnfolderBase]: 646/1181 cut-off events. [2024-06-28 01:57:22,984 INFO L125 PetriNetUnfolderBase]: For 6483/6483 co-relation queries the response was YES. [2024-06-28 01:57:22,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5354 conditions, 1181 events. 646/1181 cut-off events. For 6483/6483 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6090 event pairs, 104 based on Foata normal form. 3/1140 useless extension candidates. Maximal degree in co-relation 5305. Up to 744 conditions per place. [2024-06-28 01:57:22,993 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 112 selfloop transitions, 50 changer transitions 0/168 dead transitions. [2024-06-28 01:57:22,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 168 transitions, 1751 flow [2024-06-28 01:57:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:57:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:57:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-28 01:57:22,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-28 01:57:22,994 INFO L175 Difference]: Start difference. First operand has 98 places, 119 transitions, 1112 flow. Second operand 8 states and 148 transitions. [2024-06-28 01:57:22,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 168 transitions, 1751 flow [2024-06-28 01:57:23,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 168 transitions, 1662 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-28 01:57:23,011 INFO L231 Difference]: Finished difference. Result has 103 places, 126 transitions, 1219 flow [2024-06-28 01:57:23,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1219, PETRI_PLACES=103, PETRI_TRANSITIONS=126} [2024-06-28 01:57:23,012 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 64 predicate places. [2024-06-28 01:57:23,012 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 126 transitions, 1219 flow [2024-06-28 01:57:23,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:23,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:23,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:23,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 01:57:23,012 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:23,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:23,013 INFO L85 PathProgramCache]: Analyzing trace with hash -122786998, now seen corresponding path program 1 times [2024-06-28 01:57:23,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:23,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276969136] [2024-06-28 01:57:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:23,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:23,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:23,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276969136] [2024-06-28 01:57:23,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276969136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:23,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:23,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:57:23,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132851124] [2024-06-28 01:57:23,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:23,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:57:23,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:23,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:57:23,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:57:23,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:23,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 126 transitions, 1219 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:23,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:23,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:23,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:23,773 INFO L124 PetriNetUnfolderBase]: 660/1201 cut-off events. [2024-06-28 01:57:23,773 INFO L125 PetriNetUnfolderBase]: For 6933/6933 co-relation queries the response was YES. [2024-06-28 01:57:23,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5589 conditions, 1201 events. 660/1201 cut-off events. For 6933/6933 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6180 event pairs, 107 based on Foata normal form. 4/1161 useless extension candidates. Maximal degree in co-relation 5538. Up to 655 conditions per place. [2024-06-28 01:57:23,784 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 104 selfloop transitions, 65 changer transitions 0/175 dead transitions. [2024-06-28 01:57:23,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 175 transitions, 1852 flow [2024-06-28 01:57:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:57:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:57:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 01:57:23,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2024-06-28 01:57:23,786 INFO L175 Difference]: Start difference. First operand has 103 places, 126 transitions, 1219 flow. Second operand 8 states and 149 transitions. [2024-06-28 01:57:23,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 175 transitions, 1852 flow [2024-06-28 01:57:23,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 175 transitions, 1721 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-28 01:57:23,808 INFO L231 Difference]: Finished difference. Result has 107 places, 136 transitions, 1362 flow [2024-06-28 01:57:23,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1362, PETRI_PLACES=107, PETRI_TRANSITIONS=136} [2024-06-28 01:57:23,809 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 68 predicate places. [2024-06-28 01:57:23,809 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 136 transitions, 1362 flow [2024-06-28 01:57:23,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:23,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:23,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:23,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 01:57:23,810 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:23,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash -119067928, now seen corresponding path program 2 times [2024-06-28 01:57:23,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:23,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703225086] [2024-06-28 01:57:23,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:23,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:24,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:24,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703225086] [2024-06-28 01:57:24,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703225086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:24,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:24,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:57:24,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804065939] [2024-06-28 01:57:24,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:24,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:57:24,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:24,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:57:24,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:57:24,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:24,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 136 transitions, 1362 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:24,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:24,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:24,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:24,678 INFO L124 PetriNetUnfolderBase]: 764/1358 cut-off events. [2024-06-28 01:57:24,678 INFO L125 PetriNetUnfolderBase]: For 8701/8701 co-relation queries the response was YES. [2024-06-28 01:57:24,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6675 conditions, 1358 events. 764/1358 cut-off events. For 8701/8701 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7055 event pairs, 109 based on Foata normal form. 4/1318 useless extension candidates. Maximal degree in co-relation 6622. Up to 965 conditions per place. [2024-06-28 01:57:24,689 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 130 selfloop transitions, 48 changer transitions 0/184 dead transitions. [2024-06-28 01:57:24,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 184 transitions, 2053 flow [2024-06-28 01:57:24,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:57:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:57:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-28 01:57:24,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-28 01:57:24,691 INFO L175 Difference]: Start difference. First operand has 107 places, 136 transitions, 1362 flow. Second operand 8 states and 144 transitions. [2024-06-28 01:57:24,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 184 transitions, 2053 flow [2024-06-28 01:57:24,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 184 transitions, 1974 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-28 01:57:24,713 INFO L231 Difference]: Finished difference. Result has 113 places, 150 transitions, 1589 flow [2024-06-28 01:57:24,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1589, PETRI_PLACES=113, PETRI_TRANSITIONS=150} [2024-06-28 01:57:24,715 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 74 predicate places. [2024-06-28 01:57:24,715 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 150 transitions, 1589 flow [2024-06-28 01:57:24,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:24,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:24,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:24,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 01:57:24,715 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:24,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:24,716 INFO L85 PathProgramCache]: Analyzing trace with hash -921469876, now seen corresponding path program 3 times [2024-06-28 01:57:24,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:24,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032932884] [2024-06-28 01:57:24,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:24,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:25,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:25,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032932884] [2024-06-28 01:57:25,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032932884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:25,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:25,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:57:25,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932630006] [2024-06-28 01:57:25,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:25,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:57:25,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:25,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:57:25,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:57:25,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:25,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 150 transitions, 1589 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:25,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:25,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:25,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:25,602 INFO L124 PetriNetUnfolderBase]: 760/1352 cut-off events. [2024-06-28 01:57:25,603 INFO L125 PetriNetUnfolderBase]: For 9033/9033 co-relation queries the response was YES. [2024-06-28 01:57:25,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6907 conditions, 1352 events. 760/1352 cut-off events. For 9033/9033 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7021 event pairs, 107 based on Foata normal form. 2/1310 useless extension candidates. Maximal degree in co-relation 6851. Up to 964 conditions per place. [2024-06-28 01:57:25,612 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 137 selfloop transitions, 52 changer transitions 0/195 dead transitions. [2024-06-28 01:57:25,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 195 transitions, 2203 flow [2024-06-28 01:57:25,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:57:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:57:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-28 01:57:25,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2024-06-28 01:57:25,614 INFO L175 Difference]: Start difference. First operand has 113 places, 150 transitions, 1589 flow. Second operand 10 states and 174 transitions. [2024-06-28 01:57:25,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 195 transitions, 2203 flow [2024-06-28 01:57:25,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 195 transitions, 2120 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-28 01:57:25,637 INFO L231 Difference]: Finished difference. Result has 119 places, 152 transitions, 1648 flow [2024-06-28 01:57:25,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1648, PETRI_PLACES=119, PETRI_TRANSITIONS=152} [2024-06-28 01:57:25,638 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 80 predicate places. [2024-06-28 01:57:25,638 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 152 transitions, 1648 flow [2024-06-28 01:57:25,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:25,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:25,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:25,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 01:57:25,638 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:25,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:25,639 INFO L85 PathProgramCache]: Analyzing trace with hash -119068083, now seen corresponding path program 3 times [2024-06-28 01:57:25,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:25,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230548644] [2024-06-28 01:57:25,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:25,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:26,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:57:26,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:26,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230548644] [2024-06-28 01:57:26,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230548644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:26,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:26,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:57:26,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433628124] [2024-06-28 01:57:26,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:26,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:57:26,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:26,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:57:26,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:57:26,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:26,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 152 transitions, 1648 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:26,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:26,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:26,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:26,677 INFO L124 PetriNetUnfolderBase]: 752/1339 cut-off events. [2024-06-28 01:57:26,677 INFO L125 PetriNetUnfolderBase]: For 9025/9025 co-relation queries the response was YES. [2024-06-28 01:57:26,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6932 conditions, 1339 events. 752/1339 cut-off events. For 9025/9025 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6945 event pairs, 107 based on Foata normal form. 3/1298 useless extension candidates. Maximal degree in co-relation 6874. Up to 975 conditions per place. [2024-06-28 01:57:26,685 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 132 selfloop transitions, 47 changer transitions 0/185 dead transitions. [2024-06-28 01:57:26,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 185 transitions, 2154 flow [2024-06-28 01:57:26,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:57:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:57:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-28 01:57:26,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2024-06-28 01:57:26,687 INFO L175 Difference]: Start difference. First operand has 119 places, 152 transitions, 1648 flow. Second operand 8 states and 142 transitions. [2024-06-28 01:57:26,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 185 transitions, 2154 flow [2024-06-28 01:57:26,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 185 transitions, 2008 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-28 01:57:26,711 INFO L231 Difference]: Finished difference. Result has 120 places, 153 transitions, 1636 flow [2024-06-28 01:57:26,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1636, PETRI_PLACES=120, PETRI_TRANSITIONS=153} [2024-06-28 01:57:26,712 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 81 predicate places. [2024-06-28 01:57:26,712 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 153 transitions, 1636 flow [2024-06-28 01:57:26,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:26,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:26,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:26,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 01:57:26,713 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:26,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:26,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1879782550, now seen corresponding path program 4 times [2024-06-28 01:57:26,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:26,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078608186] [2024-06-28 01:57:26,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:26,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:27,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:27,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078608186] [2024-06-28 01:57:27,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078608186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:27,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:27,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:57:27,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740478543] [2024-06-28 01:57:27,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:27,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:57:27,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:27,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:57:27,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:57:27,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:27,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 153 transitions, 1636 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:27,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:27,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:27,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:27,553 INFO L124 PetriNetUnfolderBase]: 796/1405 cut-off events. [2024-06-28 01:57:27,554 INFO L125 PetriNetUnfolderBase]: For 10361/10361 co-relation queries the response was YES. [2024-06-28 01:57:27,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7354 conditions, 1405 events. 796/1405 cut-off events. For 10361/10361 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7305 event pairs, 124 based on Foata normal form. 2/1363 useless extension candidates. Maximal degree in co-relation 7294. Up to 962 conditions per place. [2024-06-28 01:57:27,563 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 132 selfloop transitions, 51 changer transitions 0/189 dead transitions. [2024-06-28 01:57:27,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 189 transitions, 2271 flow [2024-06-28 01:57:27,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:57:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:57:27,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-28 01:57:27,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2024-06-28 01:57:27,565 INFO L175 Difference]: Start difference. First operand has 120 places, 153 transitions, 1636 flow. Second operand 7 states and 128 transitions. [2024-06-28 01:57:27,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 189 transitions, 2271 flow [2024-06-28 01:57:27,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 189 transitions, 2193 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 01:57:27,593 INFO L231 Difference]: Finished difference. Result has 123 places, 161 transitions, 1819 flow [2024-06-28 01:57:27,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1819, PETRI_PLACES=123, PETRI_TRANSITIONS=161} [2024-06-28 01:57:27,594 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 84 predicate places. [2024-06-28 01:57:27,594 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 161 transitions, 1819 flow [2024-06-28 01:57:27,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:27,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:27,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:27,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 01:57:27,594 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:27,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:27,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1879776970, now seen corresponding path program 5 times [2024-06-28 01:57:27,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:27,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198024757] [2024-06-28 01:57:27,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:27,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:28,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:28,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198024757] [2024-06-28 01:57:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198024757] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:28,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:28,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:57:28,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072308406] [2024-06-28 01:57:28,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:28,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:57:28,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:28,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:57:28,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:57:28,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:28,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 161 transitions, 1819 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:28,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:28,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:28,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:28,455 INFO L124 PetriNetUnfolderBase]: 790/1397 cut-off events. [2024-06-28 01:57:28,455 INFO L125 PetriNetUnfolderBase]: For 11124/11124 co-relation queries the response was YES. [2024-06-28 01:57:28,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7474 conditions, 1397 events. 790/1397 cut-off events. For 11124/11124 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7273 event pairs, 114 based on Foata normal form. 4/1357 useless extension candidates. Maximal degree in co-relation 7412. Up to 961 conditions per place. [2024-06-28 01:57:28,465 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 133 selfloop transitions, 53 changer transitions 0/192 dead transitions. [2024-06-28 01:57:28,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 192 transitions, 2359 flow [2024-06-28 01:57:28,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:57:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:57:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-28 01:57:28,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2024-06-28 01:57:28,466 INFO L175 Difference]: Start difference. First operand has 123 places, 161 transitions, 1819 flow. Second operand 7 states and 131 transitions. [2024-06-28 01:57:28,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 192 transitions, 2359 flow [2024-06-28 01:57:28,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 192 transitions, 2217 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-28 01:57:28,499 INFO L231 Difference]: Finished difference. Result has 126 places, 161 transitions, 1794 flow [2024-06-28 01:57:28,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1677, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1794, PETRI_PLACES=126, PETRI_TRANSITIONS=161} [2024-06-28 01:57:28,500 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 87 predicate places. [2024-06-28 01:57:28,500 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 161 transitions, 1794 flow [2024-06-28 01:57:28,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:28,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:28,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:28,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 01:57:28,501 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:28,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:28,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1803189717, now seen corresponding path program 4 times [2024-06-28 01:57:28,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:28,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124440486] [2024-06-28 01:57:28,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:28,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:29,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:29,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:29,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124440486] [2024-06-28 01:57:29,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124440486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:29,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:29,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:57:29,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949371789] [2024-06-28 01:57:29,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:29,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:57:29,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:29,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:57:29,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:57:29,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:29,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 161 transitions, 1794 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:29,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:29,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:29,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:29,503 INFO L124 PetriNetUnfolderBase]: 791/1398 cut-off events. [2024-06-28 01:57:29,503 INFO L125 PetriNetUnfolderBase]: For 10387/10387 co-relation queries the response was YES. [2024-06-28 01:57:29,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7328 conditions, 1398 events. 791/1398 cut-off events. For 10387/10387 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7279 event pairs, 119 based on Foata normal form. 1/1356 useless extension candidates. Maximal degree in co-relation 7266. Up to 1165 conditions per place. [2024-06-28 01:57:29,513 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 161 selfloop transitions, 33 changer transitions 0/200 dead transitions. [2024-06-28 01:57:29,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 200 transitions, 2413 flow [2024-06-28 01:57:29,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:57:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:57:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-28 01:57:29,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-28 01:57:29,514 INFO L175 Difference]: Start difference. First operand has 126 places, 161 transitions, 1794 flow. Second operand 7 states and 126 transitions. [2024-06-28 01:57:29,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 200 transitions, 2413 flow [2024-06-28 01:57:29,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 200 transitions, 2242 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-28 01:57:29,542 INFO L231 Difference]: Finished difference. Result has 127 places, 166 transitions, 1810 flow [2024-06-28 01:57:29,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1810, PETRI_PLACES=127, PETRI_TRANSITIONS=166} [2024-06-28 01:57:29,542 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 88 predicate places. [2024-06-28 01:57:29,542 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 166 transitions, 1810 flow [2024-06-28 01:57:29,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:29,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:29,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:29,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 01:57:29,543 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:29,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:29,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1802974515, now seen corresponding path program 1 times [2024-06-28 01:57:29,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:29,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640874621] [2024-06-28 01:57:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:29,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:30,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:30,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640874621] [2024-06-28 01:57:30,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640874621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:30,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:30,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:57:30,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130220861] [2024-06-28 01:57:30,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:30,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:57:30,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:30,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:57:30,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:57:30,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:30,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 166 transitions, 1810 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:30,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:30,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:30,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:30,533 INFO L124 PetriNetUnfolderBase]: 789/1392 cut-off events. [2024-06-28 01:57:30,534 INFO L125 PetriNetUnfolderBase]: For 10860/10860 co-relation queries the response was YES. [2024-06-28 01:57:30,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7134 conditions, 1392 events. 789/1392 cut-off events. For 10860/10860 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7168 event pairs, 174 based on Foata normal form. 1/1351 useless extension candidates. Maximal degree in co-relation 7072. Up to 1199 conditions per place. [2024-06-28 01:57:30,542 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 157 selfloop transitions, 21 changer transitions 0/184 dead transitions. [2024-06-28 01:57:30,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 184 transitions, 2243 flow [2024-06-28 01:57:30,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:57:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:57:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-28 01:57:30,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-28 01:57:30,544 INFO L175 Difference]: Start difference. First operand has 127 places, 166 transitions, 1810 flow. Second operand 6 states and 99 transitions. [2024-06-28 01:57:30,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 184 transitions, 2243 flow [2024-06-28 01:57:30,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 184 transitions, 2161 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-28 01:57:30,571 INFO L231 Difference]: Finished difference. Result has 129 places, 168 transitions, 1815 flow [2024-06-28 01:57:30,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1730, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1815, PETRI_PLACES=129, PETRI_TRANSITIONS=168} [2024-06-28 01:57:30,572 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 90 predicate places. [2024-06-28 01:57:30,572 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 168 transitions, 1815 flow [2024-06-28 01:57:30,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:30,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:30,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:30,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 01:57:30,573 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:30,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:30,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1879984360, now seen corresponding path program 6 times [2024-06-28 01:57:30,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:30,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388744487] [2024-06-28 01:57:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:30,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:30,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:30,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388744487] [2024-06-28 01:57:30,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388744487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:30,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:30,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:57:30,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805497233] [2024-06-28 01:57:30,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:30,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:57:30,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:30,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:57:30,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:57:31,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:31,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 168 transitions, 1815 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:31,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:31,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:31,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:31,388 INFO L124 PetriNetUnfolderBase]: 799/1407 cut-off events. [2024-06-28 01:57:31,388 INFO L125 PetriNetUnfolderBase]: For 11402/11402 co-relation queries the response was YES. [2024-06-28 01:57:31,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7204 conditions, 1407 events. 799/1407 cut-off events. For 11402/11402 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7250 event pairs, 171 based on Foata normal form. 2/1367 useless extension candidates. Maximal degree in co-relation 7140. Up to 1202 conditions per place. [2024-06-28 01:57:31,398 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 163 selfloop transitions, 23 changer transitions 0/192 dead transitions. [2024-06-28 01:57:31,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 192 transitions, 2293 flow [2024-06-28 01:57:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:57:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:57:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-28 01:57:31,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47346938775510206 [2024-06-28 01:57:31,399 INFO L175 Difference]: Start difference. First operand has 129 places, 168 transitions, 1815 flow. Second operand 7 states and 116 transitions. [2024-06-28 01:57:31,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 192 transitions, 2293 flow [2024-06-28 01:57:31,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 192 transitions, 2247 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-28 01:57:31,432 INFO L231 Difference]: Finished difference. Result has 132 places, 171 transitions, 1871 flow [2024-06-28 01:57:31,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1871, PETRI_PLACES=132, PETRI_TRANSITIONS=171} [2024-06-28 01:57:31,432 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 93 predicate places. [2024-06-28 01:57:31,432 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 171 transitions, 1871 flow [2024-06-28 01:57:31,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:31,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:31,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:31,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 01:57:31,433 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:31,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash -264247688, now seen corresponding path program 1 times [2024-06-28 01:57:31,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:31,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228449301] [2024-06-28 01:57:31,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:31,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:32,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:32,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228449301] [2024-06-28 01:57:32,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228449301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:32,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:32,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:32,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10700563] [2024-06-28 01:57:32,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:32,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:32,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:32,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:32,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:32,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:32,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 171 transitions, 1871 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:32,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:32,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:32,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:32,521 INFO L124 PetriNetUnfolderBase]: 841/1480 cut-off events. [2024-06-28 01:57:32,521 INFO L125 PetriNetUnfolderBase]: For 12583/12583 co-relation queries the response was YES. [2024-06-28 01:57:32,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7726 conditions, 1480 events. 841/1480 cut-off events. For 12583/12583 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7845 event pairs, 82 based on Foata normal form. 2/1440 useless extension candidates. Maximal degree in co-relation 7661. Up to 1066 conditions per place. [2024-06-28 01:57:32,532 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 176 selfloop transitions, 57 changer transitions 0/239 dead transitions. [2024-06-28 01:57:32,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 239 transitions, 2788 flow [2024-06-28 01:57:32,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-28 01:57:32,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-28 01:57:32,537 INFO L175 Difference]: Start difference. First operand has 132 places, 171 transitions, 1871 flow. Second operand 9 states and 160 transitions. [2024-06-28 01:57:32,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 239 transitions, 2788 flow [2024-06-28 01:57:32,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 239 transitions, 2726 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-28 01:57:32,570 INFO L231 Difference]: Finished difference. Result has 138 places, 189 transitions, 2210 flow [2024-06-28 01:57:32,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2210, PETRI_PLACES=138, PETRI_TRANSITIONS=189} [2024-06-28 01:57:32,571 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 99 predicate places. [2024-06-28 01:57:32,571 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 189 transitions, 2210 flow [2024-06-28 01:57:32,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:32,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:32,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:32,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 01:57:32,572 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:32,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:32,572 INFO L85 PathProgramCache]: Analyzing trace with hash 485769912, now seen corresponding path program 2 times [2024-06-28 01:57:32,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:32,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376372727] [2024-06-28 01:57:32,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:32,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:33,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:33,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376372727] [2024-06-28 01:57:33,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376372727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:33,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:33,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:33,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446762298] [2024-06-28 01:57:33,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:33,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:33,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:33,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:33,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:33,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 189 transitions, 2210 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:33,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:33,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:33,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:33,737 INFO L124 PetriNetUnfolderBase]: 863/1530 cut-off events. [2024-06-28 01:57:33,737 INFO L125 PetriNetUnfolderBase]: For 14666/14666 co-relation queries the response was YES. [2024-06-28 01:57:33,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8368 conditions, 1530 events. 863/1530 cut-off events. For 14666/14666 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8240 event pairs, 126 based on Foata normal form. 2/1486 useless extension candidates. Maximal degree in co-relation 8300. Up to 1185 conditions per place. [2024-06-28 01:57:33,747 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 182 selfloop transitions, 58 changer transitions 0/246 dead transitions. [2024-06-28 01:57:33,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 246 transitions, 2979 flow [2024-06-28 01:57:33,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:57:33,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:57:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-28 01:57:33,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2024-06-28 01:57:33,750 INFO L175 Difference]: Start difference. First operand has 138 places, 189 transitions, 2210 flow. Second operand 10 states and 174 transitions. [2024-06-28 01:57:33,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 246 transitions, 2979 flow [2024-06-28 01:57:33,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 246 transitions, 2849 flow, removed 45 selfloop flow, removed 4 redundant places. [2024-06-28 01:57:33,793 INFO L231 Difference]: Finished difference. Result has 144 places, 193 transitions, 2290 flow [2024-06-28 01:57:33,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2290, PETRI_PLACES=144, PETRI_TRANSITIONS=193} [2024-06-28 01:57:33,794 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 105 predicate places. [2024-06-28 01:57:33,794 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 193 transitions, 2290 flow [2024-06-28 01:57:33,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:33,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:33,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:33,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 01:57:33,795 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:33,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:33,795 INFO L85 PathProgramCache]: Analyzing trace with hash 603857592, now seen corresponding path program 3 times [2024-06-28 01:57:33,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:33,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661778748] [2024-06-28 01:57:33,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:34,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:34,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661778748] [2024-06-28 01:57:34,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661778748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:34,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:34,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:34,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522612354] [2024-06-28 01:57:34,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:34,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:34,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:34,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:34,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:34,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:34,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 193 transitions, 2290 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:34,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:34,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:34,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:35,080 INFO L124 PetriNetUnfolderBase]: 882/1551 cut-off events. [2024-06-28 01:57:35,080 INFO L125 PetriNetUnfolderBase]: For 13064/13064 co-relation queries the response was YES. [2024-06-28 01:57:35,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8354 conditions, 1551 events. 882/1551 cut-off events. For 13064/13064 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8306 event pairs, 135 based on Foata normal form. 2/1511 useless extension candidates. Maximal degree in co-relation 8284. Up to 1321 conditions per place. [2024-06-28 01:57:35,089 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 198 selfloop transitions, 30 changer transitions 0/234 dead transitions. [2024-06-28 01:57:35,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 234 transitions, 2913 flow [2024-06-28 01:57:35,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-28 01:57:35,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 01:57:35,090 INFO L175 Difference]: Start difference. First operand has 144 places, 193 transitions, 2290 flow. Second operand 9 states and 150 transitions. [2024-06-28 01:57:35,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 234 transitions, 2913 flow [2024-06-28 01:57:35,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 234 transitions, 2776 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-28 01:57:35,131 INFO L231 Difference]: Finished difference. Result has 146 places, 195 transitions, 2251 flow [2024-06-28 01:57:35,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2153, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2251, PETRI_PLACES=146, PETRI_TRANSITIONS=195} [2024-06-28 01:57:35,131 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 107 predicate places. [2024-06-28 01:57:35,131 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 195 transitions, 2251 flow [2024-06-28 01:57:35,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:35,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:35,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:35,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 01:57:35,132 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:35,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash 604042290, now seen corresponding path program 1 times [2024-06-28 01:57:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:35,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008739155] [2024-06-28 01:57:35,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:35,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:35,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:35,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008739155] [2024-06-28 01:57:35,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008739155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:35,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:35,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:35,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71424332] [2024-06-28 01:57:35,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:35,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:35,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:35,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:35,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:35,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:35,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 195 transitions, 2251 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:35,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:35,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:35,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:36,357 INFO L124 PetriNetUnfolderBase]: 897/1576 cut-off events. [2024-06-28 01:57:36,357 INFO L125 PetriNetUnfolderBase]: For 13423/13423 co-relation queries the response was YES. [2024-06-28 01:57:36,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8348 conditions, 1576 events. 897/1576 cut-off events. For 13423/13423 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8493 event pairs, 123 based on Foata normal form. 2/1535 useless extension candidates. Maximal degree in co-relation 8277. Up to 1293 conditions per place. [2024-06-28 01:57:36,367 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 181 selfloop transitions, 40 changer transitions 0/227 dead transitions. [2024-06-28 01:57:36,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 227 transitions, 2805 flow [2024-06-28 01:57:36,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:57:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:57:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-28 01:57:36,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-28 01:57:36,369 INFO L175 Difference]: Start difference. First operand has 146 places, 195 transitions, 2251 flow. Second operand 8 states and 136 transitions. [2024-06-28 01:57:36,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 227 transitions, 2805 flow [2024-06-28 01:57:36,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 227 transitions, 2707 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-28 01:57:36,410 INFO L231 Difference]: Finished difference. Result has 147 places, 197 transitions, 2264 flow [2024-06-28 01:57:36,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2153, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2264, PETRI_PLACES=147, PETRI_TRANSITIONS=197} [2024-06-28 01:57:36,411 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 108 predicate places. [2024-06-28 01:57:36,411 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 197 transitions, 2264 flow [2024-06-28 01:57:36,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:36,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:36,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:36,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 01:57:36,412 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:36,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:36,412 INFO L85 PathProgramCache]: Analyzing trace with hash -64305510, now seen corresponding path program 4 times [2024-06-28 01:57:36,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:36,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729111448] [2024-06-28 01:57:36,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:36,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:36,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:36,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729111448] [2024-06-28 01:57:36,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729111448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:36,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:36,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:36,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320355240] [2024-06-28 01:57:36,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:36,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:36,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:36,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:36,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:37,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:37,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 197 transitions, 2264 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:37,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:37,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:37,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:37,553 INFO L124 PetriNetUnfolderBase]: 961/1697 cut-off events. [2024-06-28 01:57:37,553 INFO L125 PetriNetUnfolderBase]: For 17242/17242 co-relation queries the response was YES. [2024-06-28 01:57:37,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8711 conditions, 1697 events. 961/1697 cut-off events. For 17242/17242 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9359 event pairs, 95 based on Foata normal form. 14/1668 useless extension candidates. Maximal degree in co-relation 8639. Up to 1098 conditions per place. [2024-06-28 01:57:37,565 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 167 selfloop transitions, 69 changer transitions 0/242 dead transitions. [2024-06-28 01:57:37,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 242 transitions, 2985 flow [2024-06-28 01:57:37,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:57:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:57:37,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-28 01:57:37,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-06-28 01:57:37,567 INFO L175 Difference]: Start difference. First operand has 147 places, 197 transitions, 2264 flow. Second operand 8 states and 154 transitions. [2024-06-28 01:57:37,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 242 transitions, 2985 flow [2024-06-28 01:57:37,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 242 transitions, 2860 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-28 01:57:37,616 INFO L231 Difference]: Finished difference. Result has 150 places, 200 transitions, 2379 flow [2024-06-28 01:57:37,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2147, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2379, PETRI_PLACES=150, PETRI_TRANSITIONS=200} [2024-06-28 01:57:37,616 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 111 predicate places. [2024-06-28 01:57:37,617 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 200 transitions, 2379 flow [2024-06-28 01:57:37,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:37,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:37,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:37,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 01:57:37,617 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:37,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:37,618 INFO L85 PathProgramCache]: Analyzing trace with hash -64120812, now seen corresponding path program 2 times [2024-06-28 01:57:37,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:37,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061754439] [2024-06-28 01:57:37,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:37,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:38,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:38,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061754439] [2024-06-28 01:57:38,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061754439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:38,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:38,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:38,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982777501] [2024-06-28 01:57:38,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:38,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:38,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:38,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:38,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:38,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:38,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 200 transitions, 2379 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:38,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:38,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:38,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:38,726 INFO L124 PetriNetUnfolderBase]: 976/1722 cut-off events. [2024-06-28 01:57:38,726 INFO L125 PetriNetUnfolderBase]: For 14822/14822 co-relation queries the response was YES. [2024-06-28 01:57:38,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9005 conditions, 1722 events. 976/1722 cut-off events. For 14822/14822 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9566 event pairs, 142 based on Foata normal form. 2/1681 useless extension candidates. Maximal degree in co-relation 8931. Up to 1421 conditions per place. [2024-06-28 01:57:38,739 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 180 selfloop transitions, 42 changer transitions 0/228 dead transitions. [2024-06-28 01:57:38,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 228 transitions, 2929 flow [2024-06-28 01:57:38,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:57:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:57:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-28 01:57:38,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49387755102040815 [2024-06-28 01:57:38,753 INFO L175 Difference]: Start difference. First operand has 150 places, 200 transitions, 2379 flow. Second operand 7 states and 121 transitions. [2024-06-28 01:57:38,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 228 transitions, 2929 flow [2024-06-28 01:57:38,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 228 transitions, 2723 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-28 01:57:38,816 INFO L231 Difference]: Finished difference. Result has 150 places, 202 transitions, 2297 flow [2024-06-28 01:57:38,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2173, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2297, PETRI_PLACES=150, PETRI_TRANSITIONS=202} [2024-06-28 01:57:38,817 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 111 predicate places. [2024-06-28 01:57:38,817 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 202 transitions, 2297 flow [2024-06-28 01:57:38,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:38,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:38,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:38,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 01:57:38,817 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:38,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1600668532, now seen corresponding path program 3 times [2024-06-28 01:57:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:38,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925147204] [2024-06-28 01:57:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:39,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:39,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925147204] [2024-06-28 01:57:39,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925147204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:39,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:39,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:39,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239219108] [2024-06-28 01:57:39,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:39,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:39,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:39,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:39,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:39,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:39,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 202 transitions, 2297 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:39,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:39,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:39,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:39,894 INFO L124 PetriNetUnfolderBase]: 991/1746 cut-off events. [2024-06-28 01:57:39,894 INFO L125 PetriNetUnfolderBase]: For 15426/15426 co-relation queries the response was YES. [2024-06-28 01:57:39,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8930 conditions, 1746 events. 991/1746 cut-off events. For 15426/15426 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9642 event pairs, 225 based on Foata normal form. 2/1706 useless extension candidates. Maximal degree in co-relation 8856. Up to 1547 conditions per place. [2024-06-28 01:57:39,906 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 197 selfloop transitions, 26 changer transitions 0/229 dead transitions. [2024-06-28 01:57:39,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 229 transitions, 2868 flow [2024-06-28 01:57:39,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-28 01:57:39,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-28 01:57:39,907 INFO L175 Difference]: Start difference. First operand has 150 places, 202 transitions, 2297 flow. Second operand 9 states and 138 transitions. [2024-06-28 01:57:39,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 229 transitions, 2868 flow [2024-06-28 01:57:39,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 229 transitions, 2758 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-28 01:57:39,987 INFO L231 Difference]: Finished difference. Result has 155 places, 206 transitions, 2314 flow [2024-06-28 01:57:39,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2193, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2314, PETRI_PLACES=155, PETRI_TRANSITIONS=206} [2024-06-28 01:57:39,988 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 116 predicate places. [2024-06-28 01:57:39,988 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 206 transitions, 2314 flow [2024-06-28 01:57:39,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:39,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:39,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:39,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 01:57:39,989 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:39,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:39,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1008022574, now seen corresponding path program 4 times [2024-06-28 01:57:39,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:39,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876862941] [2024-06-28 01:57:39,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:39,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:40,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:40,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:40,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876862941] [2024-06-28 01:57:40,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876862941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:40,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:40,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:40,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575029037] [2024-06-28 01:57:40,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:40,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:40,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:40,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:40,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:40,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:40,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 206 transitions, 2314 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:40,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:40,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:40,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:41,053 INFO L124 PetriNetUnfolderBase]: 1009/1777 cut-off events. [2024-06-28 01:57:41,053 INFO L125 PetriNetUnfolderBase]: For 15191/15191 co-relation queries the response was YES. [2024-06-28 01:57:41,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8962 conditions, 1777 events. 1009/1777 cut-off events. For 15191/15191 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9839 event pairs, 214 based on Foata normal form. 2/1737 useless extension candidates. Maximal degree in co-relation 8886. Up to 1574 conditions per place. [2024-06-28 01:57:41,063 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 203 selfloop transitions, 21 changer transitions 0/230 dead transitions. [2024-06-28 01:57:41,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 230 transitions, 2858 flow [2024-06-28 01:57:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:57:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:57:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-28 01:57:41,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46122448979591835 [2024-06-28 01:57:41,065 INFO L175 Difference]: Start difference. First operand has 155 places, 206 transitions, 2314 flow. Second operand 7 states and 113 transitions. [2024-06-28 01:57:41,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 230 transitions, 2858 flow [2024-06-28 01:57:41,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 230 transitions, 2780 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-28 01:57:41,116 INFO L231 Difference]: Finished difference. Result has 157 places, 211 transitions, 2343 flow [2024-06-28 01:57:41,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2236, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2343, PETRI_PLACES=157, PETRI_TRANSITIONS=211} [2024-06-28 01:57:41,116 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 118 predicate places. [2024-06-28 01:57:41,116 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 211 transitions, 2343 flow [2024-06-28 01:57:41,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:41,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:41,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:41,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 01:57:41,117 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:41,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:41,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1591500840, now seen corresponding path program 1 times [2024-06-28 01:57:41,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:41,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883558919] [2024-06-28 01:57:41,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:41,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:41,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:41,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883558919] [2024-06-28 01:57:41,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883558919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:41,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:41,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:41,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013685931] [2024-06-28 01:57:41,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:41,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:41,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:41,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:41,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:41,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:41,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 211 transitions, 2343 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:41,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:41,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:41,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:42,175 INFO L124 PetriNetUnfolderBase]: 1010/1771 cut-off events. [2024-06-28 01:57:42,175 INFO L125 PetriNetUnfolderBase]: For 15217/15217 co-relation queries the response was YES. [2024-06-28 01:57:42,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9046 conditions, 1771 events. 1010/1771 cut-off events. For 15217/15217 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9778 event pairs, 218 based on Foata normal form. 1/1730 useless extension candidates. Maximal degree in co-relation 8969. Up to 1548 conditions per place. [2024-06-28 01:57:42,187 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 201 selfloop transitions, 33 changer transitions 0/240 dead transitions. [2024-06-28 01:57:42,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 240 transitions, 3006 flow [2024-06-28 01:57:42,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:57:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:57:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-28 01:57:42,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2024-06-28 01:57:42,188 INFO L175 Difference]: Start difference. First operand has 157 places, 211 transitions, 2343 flow. Second operand 7 states and 117 transitions. [2024-06-28 01:57:42,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 240 transitions, 3006 flow [2024-06-28 01:57:42,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 240 transitions, 2908 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-28 01:57:42,246 INFO L231 Difference]: Finished difference. Result has 162 places, 221 transitions, 2489 flow [2024-06-28 01:57:42,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2489, PETRI_PLACES=162, PETRI_TRANSITIONS=221} [2024-06-28 01:57:42,247 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 123 predicate places. [2024-06-28 01:57:42,247 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 221 transitions, 2489 flow [2024-06-28 01:57:42,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:42,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:42,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:42,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 01:57:42,247 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:42,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:42,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1591500592, now seen corresponding path program 5 times [2024-06-28 01:57:42,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:42,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275234866] [2024-06-28 01:57:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:42,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:42,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:42,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275234866] [2024-06-28 01:57:42,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275234866] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:42,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:42,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:42,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650296841] [2024-06-28 01:57:42,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:42,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:42,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:42,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:42,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:42,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:42,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 221 transitions, 2489 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:42,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:42,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:42,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:43,278 INFO L124 PetriNetUnfolderBase]: 1010/1771 cut-off events. [2024-06-28 01:57:43,278 INFO L125 PetriNetUnfolderBase]: For 15657/15657 co-relation queries the response was YES. [2024-06-28 01:57:43,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9138 conditions, 1771 events. 1010/1771 cut-off events. For 15657/15657 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9758 event pairs, 223 based on Foata normal form. 2/1731 useless extension candidates. Maximal degree in co-relation 9058. Up to 1544 conditions per place. [2024-06-28 01:57:43,291 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 205 selfloop transitions, 31 changer transitions 0/242 dead transitions. [2024-06-28 01:57:43,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 242 transitions, 3057 flow [2024-06-28 01:57:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:57:43,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:57:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-28 01:57:43,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47346938775510206 [2024-06-28 01:57:43,292 INFO L175 Difference]: Start difference. First operand has 162 places, 221 transitions, 2489 flow. Second operand 7 states and 116 transitions. [2024-06-28 01:57:43,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 242 transitions, 3057 flow [2024-06-28 01:57:43,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 242 transitions, 3003 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-28 01:57:43,355 INFO L231 Difference]: Finished difference. Result has 167 places, 223 transitions, 2545 flow [2024-06-28 01:57:43,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2435, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2545, PETRI_PLACES=167, PETRI_TRANSITIONS=223} [2024-06-28 01:57:43,355 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 128 predicate places. [2024-06-28 01:57:43,355 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 223 transitions, 2545 flow [2024-06-28 01:57:43,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:43,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:43,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:43,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 01:57:43,356 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:43,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:43,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1892601141, now seen corresponding path program 1 times [2024-06-28 01:57:43,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:43,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307887711] [2024-06-28 01:57:43,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:43,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:43,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307887711] [2024-06-28 01:57:43,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307887711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:43,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:43,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:57:43,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989574881] [2024-06-28 01:57:43,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:43,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:57:43,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:43,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:57:43,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:57:43,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-28 01:57:43,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 223 transitions, 2545 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:43,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:43,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-28 01:57:43,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:43,581 INFO L124 PetriNetUnfolderBase]: 465/960 cut-off events. [2024-06-28 01:57:43,581 INFO L125 PetriNetUnfolderBase]: For 8038/8144 co-relation queries the response was YES. [2024-06-28 01:57:43,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4291 conditions, 960 events. 465/960 cut-off events. For 8038/8144 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5423 event pairs, 81 based on Foata normal form. 130/1028 useless extension candidates. Maximal degree in co-relation 4210. Up to 352 conditions per place. [2024-06-28 01:57:43,588 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 62 selfloop transitions, 31 changer transitions 0/135 dead transitions. [2024-06-28 01:57:43,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 135 transitions, 1633 flow [2024-06-28 01:57:43,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:57:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:57:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-06-28 01:57:43,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2024-06-28 01:57:43,589 INFO L175 Difference]: Start difference. First operand has 167 places, 223 transitions, 2545 flow. Second operand 4 states and 93 transitions. [2024-06-28 01:57:43,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 135 transitions, 1633 flow [2024-06-28 01:57:43,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 135 transitions, 1378 flow, removed 32 selfloop flow, removed 32 redundant places. [2024-06-28 01:57:43,615 INFO L231 Difference]: Finished difference. Result has 140 places, 123 transitions, 1264 flow [2024-06-28 01:57:43,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1264, PETRI_PLACES=140, PETRI_TRANSITIONS=123} [2024-06-28 01:57:43,616 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 101 predicate places. [2024-06-28 01:57:43,616 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 123 transitions, 1264 flow [2024-06-28 01:57:43,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:43,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:43,616 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:57:43,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 01:57:43,617 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:43,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:43,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2020617465, now seen corresponding path program 1 times [2024-06-28 01:57:43,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:43,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508105655] [2024-06-28 01:57:43,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:43,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:44,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:44,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508105655] [2024-06-28 01:57:44,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508105655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:44,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:44,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:44,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957178649] [2024-06-28 01:57:44,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:44,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:44,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:44,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:44,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:44,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:44,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 123 transitions, 1264 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:44,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:44,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:44,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:44,517 INFO L124 PetriNetUnfolderBase]: 788/1452 cut-off events. [2024-06-28 01:57:44,517 INFO L125 PetriNetUnfolderBase]: For 16605/16605 co-relation queries the response was YES. [2024-06-28 01:57:44,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6841 conditions, 1452 events. 788/1452 cut-off events. For 16605/16605 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7779 event pairs, 179 based on Foata normal form. 8/1392 useless extension candidates. Maximal degree in co-relation 6774. Up to 514 conditions per place. [2024-06-28 01:57:44,526 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 105 selfloop transitions, 53 changer transitions 0/165 dead transitions. [2024-06-28 01:57:44,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 165 transitions, 1828 flow [2024-06-28 01:57:44,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-28 01:57:44,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984126984126984 [2024-06-28 01:57:44,527 INFO L175 Difference]: Start difference. First operand has 140 places, 123 transitions, 1264 flow. Second operand 9 states and 157 transitions. [2024-06-28 01:57:44,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 165 transitions, 1828 flow [2024-06-28 01:57:44,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 165 transitions, 1796 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:57:44,565 INFO L231 Difference]: Finished difference. Result has 147 places, 125 transitions, 1388 flow [2024-06-28 01:57:44,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1388, PETRI_PLACES=147, PETRI_TRANSITIONS=125} [2024-06-28 01:57:44,565 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 108 predicate places. [2024-06-28 01:57:44,565 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 125 transitions, 1388 flow [2024-06-28 01:57:44,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:44,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:44,566 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:57:44,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 01:57:44,566 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:44,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2121000919, now seen corresponding path program 2 times [2024-06-28 01:57:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:44,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38248286] [2024-06-28 01:57:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:44,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:45,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:45,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38248286] [2024-06-28 01:57:45,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38248286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:45,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:45,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:45,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518131862] [2024-06-28 01:57:45,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:45,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:45,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:45,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:45,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:45,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:45,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 125 transitions, 1388 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:45,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:45,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:45,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:45,558 INFO L124 PetriNetUnfolderBase]: 940/1742 cut-off events. [2024-06-28 01:57:45,559 INFO L125 PetriNetUnfolderBase]: For 24811/24811 co-relation queries the response was YES. [2024-06-28 01:57:45,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8550 conditions, 1742 events. 940/1742 cut-off events. For 24811/24811 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10033 event pairs, 280 based on Foata normal form. 8/1676 useless extension candidates. Maximal degree in co-relation 8481. Up to 1030 conditions per place. [2024-06-28 01:57:45,570 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 109 selfloop transitions, 49 changer transitions 0/165 dead transitions. [2024-06-28 01:57:45,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 165 transitions, 1948 flow [2024-06-28 01:57:45,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-28 01:57:45,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-06-28 01:57:45,571 INFO L175 Difference]: Start difference. First operand has 147 places, 125 transitions, 1388 flow. Second operand 9 states and 156 transitions. [2024-06-28 01:57:45,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 165 transitions, 1948 flow [2024-06-28 01:57:45,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 165 transitions, 1873 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-28 01:57:45,619 INFO L231 Difference]: Finished difference. Result has 151 places, 127 transitions, 1465 flow [2024-06-28 01:57:45,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1313, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1465, PETRI_PLACES=151, PETRI_TRANSITIONS=127} [2024-06-28 01:57:45,619 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 112 predicate places. [2024-06-28 01:57:45,619 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 127 transitions, 1465 flow [2024-06-28 01:57:45,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:45,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:45,620 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:57:45,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 01:57:45,620 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:45,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1663732265, now seen corresponding path program 3 times [2024-06-28 01:57:45,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:45,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018036471] [2024-06-28 01:57:45,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:45,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:46,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:46,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018036471] [2024-06-28 01:57:46,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018036471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:46,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:46,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:46,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678715985] [2024-06-28 01:57:46,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:46,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:46,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:46,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:46,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:46,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:46,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 127 transitions, 1465 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:46,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:46,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:46,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:46,597 INFO L124 PetriNetUnfolderBase]: 1005/1868 cut-off events. [2024-06-28 01:57:46,598 INFO L125 PetriNetUnfolderBase]: For 27814/27814 co-relation queries the response was YES. [2024-06-28 01:57:46,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9139 conditions, 1868 events. 1005/1868 cut-off events. For 27814/27814 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11005 event pairs, 333 based on Foata normal form. 12/1804 useless extension candidates. Maximal degree in co-relation 9068. Up to 1331 conditions per place. [2024-06-28 01:57:46,609 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 102 selfloop transitions, 51 changer transitions 0/160 dead transitions. [2024-06-28 01:57:46,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 160 transitions, 1907 flow [2024-06-28 01:57:46,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-28 01:57:46,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793650793650794 [2024-06-28 01:57:46,611 INFO L175 Difference]: Start difference. First operand has 151 places, 127 transitions, 1465 flow. Second operand 9 states and 151 transitions. [2024-06-28 01:57:46,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 160 transitions, 1907 flow [2024-06-28 01:57:46,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 160 transitions, 1827 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-28 01:57:46,659 INFO L231 Difference]: Finished difference. Result has 155 places, 129 transitions, 1532 flow [2024-06-28 01:57:46,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1532, PETRI_PLACES=155, PETRI_TRANSITIONS=129} [2024-06-28 01:57:46,660 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 116 predicate places. [2024-06-28 01:57:46,660 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 129 transitions, 1532 flow [2024-06-28 01:57:46,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:46,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:46,660 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:57:46,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 01:57:46,660 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:46,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:46,661 INFO L85 PathProgramCache]: Analyzing trace with hash 486970887, now seen corresponding path program 4 times [2024-06-28 01:57:46,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:46,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817223643] [2024-06-28 01:57:46,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:46,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:47,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:47,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817223643] [2024-06-28 01:57:47,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817223643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:47,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:47,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:47,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68054954] [2024-06-28 01:57:47,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:47,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:47,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:47,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:47,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:47,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:47,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 129 transitions, 1532 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:47,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:47,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:47,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:47,693 INFO L124 PetriNetUnfolderBase]: 1051/1959 cut-off events. [2024-06-28 01:57:47,693 INFO L125 PetriNetUnfolderBase]: For 26106/26106 co-relation queries the response was YES. [2024-06-28 01:57:47,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9577 conditions, 1959 events. 1051/1959 cut-off events. For 26106/26106 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 11734 event pairs, 374 based on Foata normal form. 10/1889 useless extension candidates. Maximal degree in co-relation 9504. Up to 1527 conditions per place. [2024-06-28 01:57:47,706 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 111 selfloop transitions, 45 changer transitions 0/163 dead transitions. [2024-06-28 01:57:47,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 163 transitions, 1993 flow [2024-06-28 01:57:47,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-28 01:57:47,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.473015873015873 [2024-06-28 01:57:47,707 INFO L175 Difference]: Start difference. First operand has 155 places, 129 transitions, 1532 flow. Second operand 9 states and 149 transitions. [2024-06-28 01:57:47,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 163 transitions, 1993 flow [2024-06-28 01:57:47,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 163 transitions, 1878 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-28 01:57:47,766 INFO L231 Difference]: Finished difference. Result has 157 places, 132 transitions, 1568 flow [2024-06-28 01:57:47,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1417, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1568, PETRI_PLACES=157, PETRI_TRANSITIONS=132} [2024-06-28 01:57:47,767 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 118 predicate places. [2024-06-28 01:57:47,767 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 132 transitions, 1568 flow [2024-06-28 01:57:47,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:47,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:47,767 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:57:47,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 01:57:47,767 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:47,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:47,768 INFO L85 PathProgramCache]: Analyzing trace with hash -228399997, now seen corresponding path program 1 times [2024-06-28 01:57:47,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:47,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25262691] [2024-06-28 01:57:47,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:47,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:48,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:48,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25262691] [2024-06-28 01:57:48,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25262691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:48,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:48,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:48,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594856053] [2024-06-28 01:57:48,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:48,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:48,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:48,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:48,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:48,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:48,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 132 transitions, 1568 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:48,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:48,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:48,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:48,863 INFO L124 PetriNetUnfolderBase]: 1067/1987 cut-off events. [2024-06-28 01:57:48,864 INFO L125 PetriNetUnfolderBase]: For 22671/22671 co-relation queries the response was YES. [2024-06-28 01:57:48,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9652 conditions, 1987 events. 1067/1987 cut-off events. For 22671/22671 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11963 event pairs, 416 based on Foata normal form. 2/1908 useless extension candidates. Maximal degree in co-relation 9578. Up to 1741 conditions per place. [2024-06-28 01:57:48,877 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 122 selfloop transitions, 34 changer transitions 0/163 dead transitions. [2024-06-28 01:57:48,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 163 transitions, 1998 flow [2024-06-28 01:57:48,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:57:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:57:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2024-06-28 01:57:48,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43116883116883115 [2024-06-28 01:57:48,879 INFO L175 Difference]: Start difference. First operand has 157 places, 132 transitions, 1568 flow. Second operand 11 states and 166 transitions. [2024-06-28 01:57:48,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 163 transitions, 1998 flow [2024-06-28 01:57:48,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 163 transitions, 1902 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-28 01:57:48,947 INFO L231 Difference]: Finished difference. Result has 161 places, 134 transitions, 1585 flow [2024-06-28 01:57:48,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1585, PETRI_PLACES=161, PETRI_TRANSITIONS=134} [2024-06-28 01:57:48,948 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 122 predicate places. [2024-06-28 01:57:48,948 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 134 transitions, 1585 flow [2024-06-28 01:57:48,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:48,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:48,949 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:57:48,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 01:57:48,949 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:48,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash -234114289, now seen corresponding path program 5 times [2024-06-28 01:57:48,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:48,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420758259] [2024-06-28 01:57:48,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:48,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:49,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:57:49,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:49,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420758259] [2024-06-28 01:57:49,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420758259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:49,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:49,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:49,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284994467] [2024-06-28 01:57:49,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:49,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:49,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:49,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:49,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:49,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:49,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 134 transitions, 1585 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:49,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:49,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:49,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:49,973 INFO L124 PetriNetUnfolderBase]: 1151/2146 cut-off events. [2024-06-28 01:57:49,974 INFO L125 PetriNetUnfolderBase]: For 30247/30247 co-relation queries the response was YES. [2024-06-28 01:57:49,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10305 conditions, 2146 events. 1151/2146 cut-off events. For 30247/30247 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13213 event pairs, 437 based on Foata normal form. 12/2078 useless extension candidates. Maximal degree in co-relation 10230. Up to 1767 conditions per place. [2024-06-28 01:57:49,987 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 125 selfloop transitions, 32 changer transitions 0/164 dead transitions. [2024-06-28 01:57:49,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 2031 flow [2024-06-28 01:57:49,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-28 01:57:49,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2024-06-28 01:57:49,988 INFO L175 Difference]: Start difference. First operand has 161 places, 134 transitions, 1585 flow. Second operand 9 states and 146 transitions. [2024-06-28 01:57:49,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 2031 flow [2024-06-28 01:57:50,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 164 transitions, 1936 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-28 01:57:50,059 INFO L231 Difference]: Finished difference. Result has 161 places, 136 transitions, 1605 flow [2024-06-28 01:57:50,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1605, PETRI_PLACES=161, PETRI_TRANSITIONS=136} [2024-06-28 01:57:50,060 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 122 predicate places. [2024-06-28 01:57:50,060 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 136 transitions, 1605 flow [2024-06-28 01:57:50,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:50,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:50,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:50,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 01:57:50,060 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:50,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:50,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1539717161, now seen corresponding path program 6 times [2024-06-28 01:57:50,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:50,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723241171] [2024-06-28 01:57:50,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:50,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:50,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:50,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:50,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723241171] [2024-06-28 01:57:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723241171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:50,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:50,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:50,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356537833] [2024-06-28 01:57:50,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:50,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:50,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:50,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:50,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:50,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:50,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 136 transitions, 1605 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:50,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:50,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:50,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:51,146 INFO L124 PetriNetUnfolderBase]: 1284/2400 cut-off events. [2024-06-28 01:57:51,147 INFO L125 PetriNetUnfolderBase]: For 37389/37389 co-relation queries the response was YES. [2024-06-28 01:57:51,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11663 conditions, 2400 events. 1284/2400 cut-off events. For 37389/37389 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 15295 event pairs, 490 based on Foata normal form. 8/2330 useless extension candidates. Maximal degree in co-relation 11587. Up to 1701 conditions per place. [2024-06-28 01:57:51,163 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 132 selfloop transitions, 33 changer transitions 0/172 dead transitions. [2024-06-28 01:57:51,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 172 transitions, 2183 flow [2024-06-28 01:57:51,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-28 01:57:51,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793650793650794 [2024-06-28 01:57:51,164 INFO L175 Difference]: Start difference. First operand has 161 places, 136 transitions, 1605 flow. Second operand 9 states and 151 transitions. [2024-06-28 01:57:51,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 172 transitions, 2183 flow [2024-06-28 01:57:51,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 172 transitions, 2096 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-28 01:57:51,243 INFO L231 Difference]: Finished difference. Result has 163 places, 138 transitions, 1650 flow [2024-06-28 01:57:51,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1518, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1650, PETRI_PLACES=163, PETRI_TRANSITIONS=138} [2024-06-28 01:57:51,244 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 124 predicate places. [2024-06-28 01:57:51,244 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 138 transitions, 1650 flow [2024-06-28 01:57:51,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:51,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:51,244 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:57:51,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 01:57:51,245 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:51,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1539865031, now seen corresponding path program 7 times [2024-06-28 01:57:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:51,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002457639] [2024-06-28 01:57:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:51,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:51,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:51,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002457639] [2024-06-28 01:57:51,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002457639] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:51,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:51,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:51,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393045788] [2024-06-28 01:57:51,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:51,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:51,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:51,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:51,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:51,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:51,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 138 transitions, 1650 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:51,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:51,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:51,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:52,476 INFO L124 PetriNetUnfolderBase]: 1314/2461 cut-off events. [2024-06-28 01:57:52,477 INFO L125 PetriNetUnfolderBase]: For 37270/37270 co-relation queries the response was YES. [2024-06-28 01:57:52,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11698 conditions, 2461 events. 1314/2461 cut-off events. For 37270/37270 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 15872 event pairs, 554 based on Foata normal form. 10/2389 useless extension candidates. Maximal degree in co-relation 11621. Up to 2090 conditions per place. [2024-06-28 01:57:52,497 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 128 selfloop transitions, 32 changer transitions 0/167 dead transitions. [2024-06-28 01:57:52,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 167 transitions, 2094 flow [2024-06-28 01:57:52,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-28 01:57:52,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-28 01:57:52,498 INFO L175 Difference]: Start difference. First operand has 163 places, 138 transitions, 1650 flow. Second operand 9 states and 145 transitions. [2024-06-28 01:57:52,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 167 transitions, 2094 flow [2024-06-28 01:57:52,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 167 transitions, 2028 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-28 01:57:52,588 INFO L231 Difference]: Finished difference. Result has 167 places, 139 transitions, 1690 flow [2024-06-28 01:57:52,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1690, PETRI_PLACES=167, PETRI_TRANSITIONS=139} [2024-06-28 01:57:52,589 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 128 predicate places. [2024-06-28 01:57:52,589 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 139 transitions, 1690 flow [2024-06-28 01:57:52,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:52,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:52,591 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:57:52,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 01:57:52,592 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:52,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:52,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1545442613, now seen corresponding path program 2 times [2024-06-28 01:57:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:52,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205071818] [2024-06-28 01:57:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:53,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:53,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205071818] [2024-06-28 01:57:53,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205071818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:53,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:53,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:57:53,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185790526] [2024-06-28 01:57:53,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:53,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:57:53,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:53,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:57:53,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:57:53,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:53,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 139 transitions, 1690 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:53,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:53,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:53,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:53,907 INFO L124 PetriNetUnfolderBase]: 1330/2490 cut-off events. [2024-06-28 01:57:53,908 INFO L125 PetriNetUnfolderBase]: For 33129/33129 co-relation queries the response was YES. [2024-06-28 01:57:53,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11912 conditions, 2490 events. 1330/2490 cut-off events. For 33129/33129 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 16126 event pairs, 536 based on Foata normal form. 2/2411 useless extension candidates. Maximal degree in co-relation 11833. Up to 2046 conditions per place. [2024-06-28 01:57:53,925 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 129 selfloop transitions, 40 changer transitions 0/176 dead transitions. [2024-06-28 01:57:53,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 176 transitions, 2180 flow [2024-06-28 01:57:53,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:57:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:57:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2024-06-28 01:57:53,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44935064935064933 [2024-06-28 01:57:53,926 INFO L175 Difference]: Start difference. First operand has 167 places, 139 transitions, 1690 flow. Second operand 11 states and 173 transitions. [2024-06-28 01:57:53,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 176 transitions, 2180 flow [2024-06-28 01:57:54,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 176 transitions, 2103 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-28 01:57:54,012 INFO L231 Difference]: Finished difference. Result has 170 places, 141 transitions, 1740 flow [2024-06-28 01:57:54,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1740, PETRI_PLACES=170, PETRI_TRANSITIONS=141} [2024-06-28 01:57:54,013 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 131 predicate places. [2024-06-28 01:57:54,013 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 141 transitions, 1740 flow [2024-06-28 01:57:54,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:54,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:54,013 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:57:54,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 01:57:54,014 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:54,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1993469817, now seen corresponding path program 8 times [2024-06-28 01:57:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:54,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617294654] [2024-06-28 01:57:54,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:54,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:54,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:54,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617294654] [2024-06-28 01:57:54,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617294654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:54,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:54,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:54,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173110018] [2024-06-28 01:57:54,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:54,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:54,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:54,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:54,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:54,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:54,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 141 transitions, 1740 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:54,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:54,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:54,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:55,091 INFO L124 PetriNetUnfolderBase]: 1382/2591 cut-off events. [2024-06-28 01:57:55,092 INFO L125 PetriNetUnfolderBase]: For 37367/37367 co-relation queries the response was YES. [2024-06-28 01:57:55,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12359 conditions, 2591 events. 1382/2591 cut-off events. For 37367/37367 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 16999 event pairs, 508 based on Foata normal form. 8/2513 useless extension candidates. Maximal degree in co-relation 12280. Up to 1840 conditions per place. [2024-06-28 01:57:55,107 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 134 selfloop transitions, 36 changer transitions 0/177 dead transitions. [2024-06-28 01:57:55,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 177 transitions, 2322 flow [2024-06-28 01:57:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:57:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:57:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-28 01:57:55,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2024-06-28 01:57:55,108 INFO L175 Difference]: Start difference. First operand has 170 places, 141 transitions, 1740 flow. Second operand 8 states and 142 transitions. [2024-06-28 01:57:55,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 177 transitions, 2322 flow [2024-06-28 01:57:55,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 177 transitions, 2211 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-28 01:57:55,193 INFO L231 Difference]: Finished difference. Result has 169 places, 142 transitions, 1737 flow [2024-06-28 01:57:55,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1737, PETRI_PLACES=169, PETRI_TRANSITIONS=142} [2024-06-28 01:57:55,193 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 130 predicate places. [2024-06-28 01:57:55,193 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 142 transitions, 1737 flow [2024-06-28 01:57:55,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:55,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:55,193 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:57:55,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 01:57:55,194 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:55,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1793812395, now seen corresponding path program 3 times [2024-06-28 01:57:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:55,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905221812] [2024-06-28 01:57:55,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:55,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:55,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:55,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:55,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905221812] [2024-06-28 01:57:55,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905221812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:55,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:55,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:57:55,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784546582] [2024-06-28 01:57:55,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:55,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:57:55,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:55,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:57:55,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:57:55,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:55,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 142 transitions, 1737 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:55,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:55,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:55,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:56,468 INFO L124 PetriNetUnfolderBase]: 1398/2620 cut-off events. [2024-06-28 01:57:56,468 INFO L125 PetriNetUnfolderBase]: For 35609/35609 co-relation queries the response was YES. [2024-06-28 01:57:56,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12479 conditions, 2620 events. 1398/2620 cut-off events. For 35609/35609 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 17189 event pairs, 629 based on Foata normal form. 2/2534 useless extension candidates. Maximal degree in co-relation 12399. Up to 2461 conditions per place. [2024-06-28 01:57:56,484 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 138 selfloop transitions, 16 changer transitions 0/161 dead transitions. [2024-06-28 01:57:56,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 161 transitions, 2143 flow [2024-06-28 01:57:56,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:57:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:57:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2024-06-28 01:57:56,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2024-06-28 01:57:56,486 INFO L175 Difference]: Start difference. First operand has 169 places, 142 transitions, 1737 flow. Second operand 8 states and 118 transitions. [2024-06-28 01:57:56,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 161 transitions, 2143 flow [2024-06-28 01:57:56,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 161 transitions, 1967 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-28 01:57:56,576 INFO L231 Difference]: Finished difference. Result has 169 places, 144 transitions, 1652 flow [2024-06-28 01:57:56,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1652, PETRI_PLACES=169, PETRI_TRANSITIONS=144} [2024-06-28 01:57:56,576 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 130 predicate places. [2024-06-28 01:57:56,576 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 144 transitions, 1652 flow [2024-06-28 01:57:56,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:56,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:56,577 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:57:56,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 01:57:56,577 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:56,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:56,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1918883867, now seen corresponding path program 4 times [2024-06-28 01:57:56,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:56,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357829505] [2024-06-28 01:57:56,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:56,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:57,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:57,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357829505] [2024-06-28 01:57:57,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357829505] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:57,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:57,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:57:57,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360352754] [2024-06-28 01:57:57,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:57,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:57:57,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:57,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:57:57,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:57:57,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:57,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 144 transitions, 1652 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:57,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:57,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:57,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:57,823 INFO L124 PetriNetUnfolderBase]: 1414/2648 cut-off events. [2024-06-28 01:57:57,823 INFO L125 PetriNetUnfolderBase]: For 35144/35144 co-relation queries the response was YES. [2024-06-28 01:57:57,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12221 conditions, 2648 events. 1414/2648 cut-off events. For 35144/35144 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 17414 event pairs, 645 based on Foata normal form. 2/2563 useless extension candidates. Maximal degree in co-relation 12142. Up to 2445 conditions per place. [2024-06-28 01:57:57,841 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 139 selfloop transitions, 19 changer transitions 0/165 dead transitions. [2024-06-28 01:57:57,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 165 transitions, 2070 flow [2024-06-28 01:57:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:57:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:57:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-28 01:57:57,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2024-06-28 01:57:57,843 INFO L175 Difference]: Start difference. First operand has 169 places, 144 transitions, 1652 flow. Second operand 8 states and 122 transitions. [2024-06-28 01:57:57,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 165 transitions, 2070 flow [2024-06-28 01:57:57,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 165 transitions, 2003 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-28 01:57:57,950 INFO L231 Difference]: Finished difference. Result has 171 places, 146 transitions, 1676 flow [2024-06-28 01:57:57,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1585, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1676, PETRI_PLACES=171, PETRI_TRANSITIONS=146} [2024-06-28 01:57:57,950 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 132 predicate places. [2024-06-28 01:57:57,950 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 146 transitions, 1676 flow [2024-06-28 01:57:57,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:57,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:57,951 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:57:57,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 01:57:57,951 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:57,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1765268535, now seen corresponding path program 5 times [2024-06-28 01:57:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012615201] [2024-06-28 01:57:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:57,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:58,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:58,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012615201] [2024-06-28 01:57:58,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012615201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:58,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:58,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:58,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083626323] [2024-06-28 01:57:58,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:58,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:58,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:58,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:58,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:58,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:58,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 146 transitions, 1676 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:58,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:58,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:58,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:59,111 INFO L124 PetriNetUnfolderBase]: 1430/2676 cut-off events. [2024-06-28 01:57:59,112 INFO L125 PetriNetUnfolderBase]: For 37108/37108 co-relation queries the response was YES. [2024-06-28 01:57:59,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12428 conditions, 2676 events. 1430/2676 cut-off events. For 37108/37108 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 17640 event pairs, 637 based on Foata normal form. 2/2589 useless extension candidates. Maximal degree in co-relation 12348. Up to 2388 conditions per place. [2024-06-28 01:57:59,130 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 130 selfloop transitions, 32 changer transitions 0/169 dead transitions. [2024-06-28 01:57:59,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 169 transitions, 2112 flow [2024-06-28 01:57:59,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:57:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:57:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-28 01:57:59,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607142857142857 [2024-06-28 01:57:59,131 INFO L175 Difference]: Start difference. First operand has 171 places, 146 transitions, 1676 flow. Second operand 8 states and 129 transitions. [2024-06-28 01:57:59,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 169 transitions, 2112 flow [2024-06-28 01:57:59,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 169 transitions, 2037 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-28 01:57:59,241 INFO L231 Difference]: Finished difference. Result has 173 places, 148 transitions, 1724 flow [2024-06-28 01:57:59,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1724, PETRI_PLACES=173, PETRI_TRANSITIONS=148} [2024-06-28 01:57:59,241 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 134 predicate places. [2024-06-28 01:57:59,242 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 148 transitions, 1724 flow [2024-06-28 01:57:59,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:57:59,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:59,242 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:57:59,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 01:57:59,242 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:59,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:59,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2081786789, now seen corresponding path program 6 times [2024-06-28 01:57:59,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:59,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395122724] [2024-06-28 01:57:59,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:59,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:59,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:59,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395122724] [2024-06-28 01:57:59,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395122724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:59,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:59,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:57:59,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341250532] [2024-06-28 01:57:59,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:59,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:57:59,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:59,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:57:59,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:57:59,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:59,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 148 transitions, 1724 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:59,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:59,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:59,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:00,470 INFO L124 PetriNetUnfolderBase]: 1446/2705 cut-off events. [2024-06-28 01:58:00,470 INFO L125 PetriNetUnfolderBase]: For 39230/39230 co-relation queries the response was YES. [2024-06-28 01:58:00,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12674 conditions, 2705 events. 1446/2705 cut-off events. For 39230/39230 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 17876 event pairs, 641 based on Foata normal form. 2/2632 useless extension candidates. Maximal degree in co-relation 12593. Up to 2521 conditions per place. [2024-06-28 01:58:00,491 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 148 selfloop transitions, 15 changer transitions 0/170 dead transitions. [2024-06-28 01:58:00,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 170 transitions, 2162 flow [2024-06-28 01:58:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:58:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:58:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-28 01:58:00,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43214285714285716 [2024-06-28 01:58:00,492 INFO L175 Difference]: Start difference. First operand has 173 places, 148 transitions, 1724 flow. Second operand 8 states and 121 transitions. [2024-06-28 01:58:00,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 170 transitions, 2162 flow [2024-06-28 01:58:00,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 170 transitions, 2057 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-28 01:58:00,609 INFO L231 Difference]: Finished difference. Result has 175 places, 150 transitions, 1708 flow [2024-06-28 01:58:00,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1619, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1708, PETRI_PLACES=175, PETRI_TRANSITIONS=150} [2024-06-28 01:58:00,610 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 136 predicate places. [2024-06-28 01:58:00,610 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 150 transitions, 1708 flow [2024-06-28 01:58:00,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:00,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:00,610 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:58:00,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 01:58:00,610 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:00,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:00,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1987744365, now seen corresponding path program 7 times [2024-06-28 01:58:00,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:00,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302292703] [2024-06-28 01:58:00,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:00,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:58:01,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:01,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302292703] [2024-06-28 01:58:01,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302292703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:01,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:01,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:58:01,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31845906] [2024-06-28 01:58:01,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:01,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:58:01,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:01,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:58:01,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:58:01,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:58:01,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 150 transitions, 1708 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:01,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:01,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:58:01,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:01,869 INFO L124 PetriNetUnfolderBase]: 1524/2852 cut-off events. [2024-06-28 01:58:01,869 INFO L125 PetriNetUnfolderBase]: For 50230/50230 co-relation queries the response was YES. [2024-06-28 01:58:01,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13709 conditions, 2852 events. 1524/2852 cut-off events. For 50230/50230 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 19137 event pairs, 668 based on Foata normal form. 2/2768 useless extension candidates. Maximal degree in co-relation 13627. Up to 2344 conditions per place. [2024-06-28 01:58:01,892 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 138 selfloop transitions, 37 changer transitions 0/182 dead transitions. [2024-06-28 01:58:01,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 182 transitions, 2348 flow [2024-06-28 01:58:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:58:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:58:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-28 01:58:01,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2024-06-28 01:58:01,893 INFO L175 Difference]: Start difference. First operand has 175 places, 150 transitions, 1708 flow. Second operand 8 states and 137 transitions. [2024-06-28 01:58:01,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 182 transitions, 2348 flow [2024-06-28 01:58:02,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 182 transitions, 2275 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-28 01:58:02,014 INFO L231 Difference]: Finished difference. Result has 178 places, 154 transitions, 1841 flow [2024-06-28 01:58:02,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1841, PETRI_PLACES=178, PETRI_TRANSITIONS=154} [2024-06-28 01:58:02,015 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 139 predicate places. [2024-06-28 01:58:02,015 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 154 transitions, 1841 flow [2024-06-28 01:58:02,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:02,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:02,015 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:58:02,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 01:58:02,015 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:02,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:02,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1715530647, now seen corresponding path program 8 times [2024-06-28 01:58:02,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:02,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510423214] [2024-06-28 01:58:02,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:02,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:58:02,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:02,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510423214] [2024-06-28 01:58:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510423214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:58:02,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775787413] [2024-06-28 01:58:02,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:02,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:58:02,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:02,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:58:02,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:58:02,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:58:02,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 154 transitions, 1841 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:58:02,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:02,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:58:02,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:03,189 INFO L124 PetriNetUnfolderBase]: 1508/2824 cut-off events. [2024-06-28 01:58:03,189 INFO L125 PetriNetUnfolderBase]: For 50609/50609 co-relation queries the response was YES. [2024-06-28 01:58:03,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13241 conditions, 2824 events. 1508/2824 cut-off events. For 50609/50609 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 18880 event pairs, 670 based on Foata normal form. 12/2748 useless extension candidates. Maximal degree in co-relation 13157. Up to 2404 conditions per place. [2024-06-28 01:58:03,210 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 141 selfloop transitions, 34 changer transitions 0/182 dead transitions. [2024-06-28 01:58:03,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 182 transitions, 2285 flow [2024-06-28 01:58:03,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:58:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:58:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-28 01:58:03,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-28 01:58:03,212 INFO L175 Difference]: Start difference. First operand has 178 places, 154 transitions, 1841 flow. Second operand 8 states and 136 transitions. [2024-06-28 01:58:03,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 182 transitions, 2285 flow [2024-06-28 01:58:03,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 182 transitions, 2150 flow, removed 46 selfloop flow, removed 5 redundant places. [2024-06-28 01:58:03,346 INFO L231 Difference]: Finished difference. Result has 181 places, 154 transitions, 1781 flow [2024-06-28 01:58:03,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1706, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1781, PETRI_PLACES=181, PETRI_TRANSITIONS=154} [2024-06-28 01:58:03,346 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 142 predicate places. [2024-06-28 01:58:03,346 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 154 transitions, 1781 flow [2024-06-28 01:58:03,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:58:03,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:03,347 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:58:03,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 01:58:03,347 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:03,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:03,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1786655115, now seen corresponding path program 9 times [2024-06-28 01:58:03,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:03,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763353136] [2024-06-28 01:58:03,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:03,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:58:03,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:03,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763353136] [2024-06-28 01:58:03,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763353136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:03,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:03,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:58:03,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152624970] [2024-06-28 01:58:03,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:03,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:58:03,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:03,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:58:03,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:58:04,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:58:04,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 154 transitions, 1781 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:04,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:04,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:58:04,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:04,617 INFO L124 PetriNetUnfolderBase]: 1508/2825 cut-off events. [2024-06-28 01:58:04,617 INFO L125 PetriNetUnfolderBase]: For 38306/38306 co-relation queries the response was YES. [2024-06-28 01:58:04,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12937 conditions, 2825 events. 1508/2825 cut-off events. For 38306/38306 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 18897 event pairs, 673 based on Foata normal form. 2/2739 useless extension candidates. Maximal degree in co-relation 12852. Up to 2544 conditions per place. [2024-06-28 01:58:04,638 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 144 selfloop transitions, 27 changer transitions 0/178 dead transitions. [2024-06-28 01:58:04,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 178 transitions, 2389 flow [2024-06-28 01:58:04,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:58:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:58:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-28 01:58:04,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2024-06-28 01:58:04,640 INFO L175 Difference]: Start difference. First operand has 181 places, 154 transitions, 1781 flow. Second operand 8 states and 123 transitions. [2024-06-28 01:58:04,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 178 transitions, 2389 flow [2024-06-28 01:58:04,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 178 transitions, 2320 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 01:58:04,776 INFO L231 Difference]: Finished difference. Result has 184 places, 158 transitions, 1910 flow [2024-06-28 01:58:04,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1712, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1910, PETRI_PLACES=184, PETRI_TRANSITIONS=158} [2024-06-28 01:58:04,777 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 145 predicate places. [2024-06-28 01:58:04,777 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 158 transitions, 1910 flow [2024-06-28 01:58:04,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:04,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:04,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:58:04,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 01:58:04,777 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:04,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:04,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2091884729, now seen corresponding path program 10 times [2024-06-28 01:58:04,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:04,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487614729] [2024-06-28 01:58:04,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:04,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:58:05,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:05,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487614729] [2024-06-28 01:58:05,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487614729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:05,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:05,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:58:05,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663005218] [2024-06-28 01:58:05,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:05,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:58:05,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:05,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:58:05,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:58:05,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:58:05,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 158 transitions, 1910 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:05,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:05,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:58:05,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:06,021 INFO L124 PetriNetUnfolderBase]: 1505/2820 cut-off events. [2024-06-28 01:58:06,021 INFO L125 PetriNetUnfolderBase]: For 37925/37925 co-relation queries the response was YES. [2024-06-28 01:58:06,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12907 conditions, 2820 events. 1505/2820 cut-off events. For 37925/37925 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 18871 event pairs, 689 based on Foata normal form. 2/2732 useless extension candidates. Maximal degree in co-relation 12820. Up to 2630 conditions per place. [2024-06-28 01:58:06,040 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 147 selfloop transitions, 21 changer transitions 0/175 dead transitions. [2024-06-28 01:58:06,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 175 transitions, 2294 flow [2024-06-28 01:58:06,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:58:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:58:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2024-06-28 01:58:06,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2024-06-28 01:58:06,041 INFO L175 Difference]: Start difference. First operand has 184 places, 158 transitions, 1910 flow. Second operand 8 states and 118 transitions. [2024-06-28 01:58:06,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 175 transitions, 2294 flow [2024-06-28 01:58:06,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 175 transitions, 2177 flow, removed 49 selfloop flow, removed 4 redundant places. [2024-06-28 01:58:06,200 INFO L231 Difference]: Finished difference. Result has 188 places, 158 transitions, 1843 flow [2024-06-28 01:58:06,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1793, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1843, PETRI_PLACES=188, PETRI_TRANSITIONS=158} [2024-06-28 01:58:06,200 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 149 predicate places. [2024-06-28 01:58:06,200 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 158 transitions, 1843 flow [2024-06-28 01:58:06,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:06,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:06,201 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:58:06,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 01:58:06,201 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:06,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1365696381, now seen corresponding path program 1 times [2024-06-28 01:58:06,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:06,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328062667] [2024-06-28 01:58:06,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:06,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:58:06,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:06,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328062667] [2024-06-28 01:58:06,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328062667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:06,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:06,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:58:06,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196347164] [2024-06-28 01:58:06,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:06,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:58:06,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:06,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:58:06,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:58:07,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:58:07,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 158 transitions, 1843 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 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:58:07,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:07,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:58:07,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:07,643 INFO L124 PetriNetUnfolderBase]: 1498/2807 cut-off events. [2024-06-28 01:58:07,644 INFO L125 PetriNetUnfolderBase]: For 34810/34810 co-relation queries the response was YES. [2024-06-28 01:58:07,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12410 conditions, 2807 events. 1498/2807 cut-off events. For 34810/34810 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 18788 event pairs, 567 based on Foata normal form. 6/2725 useless extension candidates. Maximal degree in co-relation 12321. Up to 2180 conditions per place. [2024-06-28 01:58:07,662 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 137 selfloop transitions, 52 changer transitions 0/196 dead transitions. [2024-06-28 01:58:07,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 196 transitions, 2351 flow [2024-06-28 01:58:07,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:58:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:58:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-06-28 01:58:07,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47714285714285715 [2024-06-28 01:58:07,664 INFO L175 Difference]: Start difference. First operand has 188 places, 158 transitions, 1843 flow. Second operand 10 states and 167 transitions. [2024-06-28 01:58:07,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 196 transitions, 2351 flow [2024-06-28 01:58:07,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 196 transitions, 2291 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-28 01:58:07,804 INFO L231 Difference]: Finished difference. Result has 191 places, 158 transitions, 1891 flow [2024-06-28 01:58:07,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1891, PETRI_PLACES=191, PETRI_TRANSITIONS=158} [2024-06-28 01:58:07,805 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 152 predicate places. [2024-06-28 01:58:07,805 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 158 transitions, 1891 flow [2024-06-28 01:58:07,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 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:58:07,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:07,805 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:58:07,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 01:58:07,805 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:07,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:07,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1509535523, now seen corresponding path program 2 times [2024-06-28 01:58:07,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:07,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276312670] [2024-06-28 01:58:07,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:07,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:58:08,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:08,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276312670] [2024-06-28 01:58:08,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276312670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:08,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:08,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:58:08,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401267744] [2024-06-28 01:58:08,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:08,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:58:08,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:08,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:58:08,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:58:08,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:58:08,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 158 transitions, 1891 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:08,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:08,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:58:08,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:09,367 INFO L124 PetriNetUnfolderBase]: 1615/3017 cut-off events. [2024-06-28 01:58:09,367 INFO L125 PetriNetUnfolderBase]: For 37137/37137 co-relation queries the response was YES. [2024-06-28 01:58:09,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13470 conditions, 3017 events. 1615/3017 cut-off events. For 37137/37137 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 20301 event pairs, 708 based on Foata normal form. 6/2926 useless extension candidates. Maximal degree in co-relation 13380. Up to 2685 conditions per place. [2024-06-28 01:58:09,390 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 163 selfloop transitions, 31 changer transitions 0/201 dead transitions. [2024-06-28 01:58:09,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 201 transitions, 2570 flow [2024-06-28 01:58:09,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:58:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:58:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2024-06-28 01:58:09,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-28 01:58:09,392 INFO L175 Difference]: Start difference. First operand has 191 places, 158 transitions, 1891 flow. Second operand 10 states and 150 transitions. [2024-06-28 01:58:09,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 201 transitions, 2570 flow [2024-06-28 01:58:09,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 201 transitions, 2434 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-28 01:58:09,579 INFO L231 Difference]: Finished difference. Result has 196 places, 173 transitions, 2070 flow [2024-06-28 01:58:09,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1767, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2070, PETRI_PLACES=196, PETRI_TRANSITIONS=173} [2024-06-28 01:58:09,579 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 157 predicate places. [2024-06-28 01:58:09,579 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 173 transitions, 2070 flow [2024-06-28 01:58:09,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:09,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:09,580 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:58:09,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-28 01:58:09,580 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:09,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1929384473, now seen corresponding path program 3 times [2024-06-28 01:58:09,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:09,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383070192] [2024-06-28 01:58:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:58:10,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:10,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383070192] [2024-06-28 01:58:10,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383070192] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:10,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:10,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:58:10,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788980258] [2024-06-28 01:58:10,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:10,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:58:10,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:10,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:58:10,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:58:10,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:58:10,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 173 transitions, 2070 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:10,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:10,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:58:10,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:10,944 INFO L124 PetriNetUnfolderBase]: 1651/3088 cut-off events. [2024-06-28 01:58:10,944 INFO L125 PetriNetUnfolderBase]: For 38951/38951 co-relation queries the response was YES. [2024-06-28 01:58:10,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13799 conditions, 3088 events. 1651/3088 cut-off events. For 38951/38951 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 20918 event pairs, 672 based on Foata normal form. 6/2996 useless extension candidates. Maximal degree in co-relation 13704. Up to 2635 conditions per place. [2024-06-28 01:58:10,971 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 153 selfloop transitions, 48 changer transitions 0/208 dead transitions. [2024-06-28 01:58:10,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 208 transitions, 2628 flow [2024-06-28 01:58:10,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:58:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:58:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2024-06-28 01:58:10,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542857142857143 [2024-06-28 01:58:10,973 INFO L175 Difference]: Start difference. First operand has 196 places, 173 transitions, 2070 flow. Second operand 10 states and 159 transitions. [2024-06-28 01:58:10,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 208 transitions, 2628 flow [2024-06-28 01:58:11,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 208 transitions, 2557 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-28 01:58:11,203 INFO L231 Difference]: Finished difference. Result has 202 places, 175 transitions, 2167 flow [2024-06-28 01:58:11,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1999, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2167, PETRI_PLACES=202, PETRI_TRANSITIONS=175} [2024-06-28 01:58:11,204 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 163 predicate places. [2024-06-28 01:58:11,204 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 175 transitions, 2167 flow [2024-06-28 01:58:11,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:11,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:11,204 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:58:11,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-28 01:58:11,204 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:11,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1663252863, now seen corresponding path program 4 times [2024-06-28 01:58:11,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:11,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432821553] [2024-06-28 01:58:11,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:11,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:58:11,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:11,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432821553] [2024-06-28 01:58:11,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432821553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:11,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:11,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:58:11,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523041090] [2024-06-28 01:58:11,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:11,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:58:11,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:11,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:58:11,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:58:11,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:58:11,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 175 transitions, 2167 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:11,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:11,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:58:11,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:12,618 INFO L124 PetriNetUnfolderBase]: 1644/3075 cut-off events. [2024-06-28 01:58:12,618 INFO L125 PetriNetUnfolderBase]: For 33330/33330 co-relation queries the response was YES. [2024-06-28 01:58:12,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13665 conditions, 3075 events. 1644/3075 cut-off events. For 33330/33330 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 20821 event pairs, 710 based on Foata normal form. 6/2986 useless extension candidates. Maximal degree in co-relation 13568. Up to 2659 conditions per place. [2024-06-28 01:58:12,645 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 158 selfloop transitions, 39 changer transitions 0/204 dead transitions. [2024-06-28 01:58:12,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 204 transitions, 2668 flow [2024-06-28 01:58:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:58:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:58:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-28 01:58:12,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-28 01:58:12,646 INFO L175 Difference]: Start difference. First operand has 202 places, 175 transitions, 2167 flow. Second operand 8 states and 133 transitions. [2024-06-28 01:58:12,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 204 transitions, 2668 flow [2024-06-28 01:58:12,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 204 transitions, 2542 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-28 01:58:12,807 INFO L231 Difference]: Finished difference. Result has 204 places, 176 transitions, 2155 flow [2024-06-28 01:58:12,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2041, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2155, PETRI_PLACES=204, PETRI_TRANSITIONS=176} [2024-06-28 01:58:12,808 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 165 predicate places. [2024-06-28 01:58:12,808 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 176 transitions, 2155 flow [2024-06-28 01:58:12,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:12,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:12,808 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:58:12,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-28 01:58:12,809 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:12,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1111481741, now seen corresponding path program 5 times [2024-06-28 01:58:12,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:12,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840978839] [2024-06-28 01:58:12,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:58:13,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:13,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840978839] [2024-06-28 01:58:13,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840978839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:13,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:13,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:58:13,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543238224] [2024-06-28 01:58:13,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:13,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:58:13,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:13,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:58:13,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:58:13,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:58:13,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 176 transitions, 2155 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:13,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:13,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:58:13,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:14,220 INFO L124 PetriNetUnfolderBase]: 1680/3147 cut-off events. [2024-06-28 01:58:14,221 INFO L125 PetriNetUnfolderBase]: For 34005/34005 co-relation queries the response was YES. [2024-06-28 01:58:14,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13906 conditions, 3147 events. 1680/3147 cut-off events. For 34005/34005 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 21491 event pairs, 708 based on Foata normal form. 6/3061 useless extension candidates. Maximal degree in co-relation 13807. Up to 2611 conditions per place. [2024-06-28 01:58:14,245 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 152 selfloop transitions, 45 changer transitions 0/204 dead transitions. [2024-06-28 01:58:14,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 204 transitions, 2677 flow [2024-06-28 01:58:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:58:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:58:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-28 01:58:14,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-28 01:58:14,246 INFO L175 Difference]: Start difference. First operand has 204 places, 176 transitions, 2155 flow. Second operand 8 states and 132 transitions. [2024-06-28 01:58:14,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 204 transitions, 2677 flow [2024-06-28 01:58:14,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 204 transitions, 2549 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-28 01:58:14,400 INFO L231 Difference]: Finished difference. Result has 204 places, 177 transitions, 2161 flow [2024-06-28 01:58:14,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2027, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2161, PETRI_PLACES=204, PETRI_TRANSITIONS=177} [2024-06-28 01:58:14,401 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 165 predicate places. [2024-06-28 01:58:14,401 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 177 transitions, 2161 flow [2024-06-28 01:58:14,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:14,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:14,402 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:58:14,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-28 01:58:14,402 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:14,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:14,402 INFO L85 PathProgramCache]: Analyzing trace with hash -110880181, now seen corresponding path program 6 times [2024-06-28 01:58:14,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:14,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591243097] [2024-06-28 01:58:14,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:14,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:14,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:58:14,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:14,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591243097] [2024-06-28 01:58:14,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591243097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:14,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:14,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:58:14,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214267958] [2024-06-28 01:58:14,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:14,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:58:14,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:14,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:58:14,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:58:14,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:58:14,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 177 transitions, 2161 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:14,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:14,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:58:14,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:15,582 INFO L124 PetriNetUnfolderBase]: 1673/3135 cut-off events. [2024-06-28 01:58:15,584 INFO L125 PetriNetUnfolderBase]: For 27062/27062 co-relation queries the response was YES. [2024-06-28 01:58:15,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13504 conditions, 3135 events. 1673/3135 cut-off events. For 27062/27062 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 21324 event pairs, 756 based on Foata normal form. 6/3042 useless extension candidates. Maximal degree in co-relation 13406. Up to 2855 conditions per place. [2024-06-28 01:58:15,609 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 179 selfloop transitions, 20 changer transitions 0/206 dead transitions. [2024-06-28 01:58:15,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 2761 flow [2024-06-28 01:58:15,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:58:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:58:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-28 01:58:15,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2024-06-28 01:58:15,611 INFO L175 Difference]: Start difference. First operand has 204 places, 177 transitions, 2161 flow. Second operand 8 states and 127 transitions. [2024-06-28 01:58:15,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 2761 flow [2024-06-28 01:58:15,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 206 transitions, 2666 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-28 01:58:15,742 INFO L231 Difference]: Finished difference. Result has 209 places, 181 transitions, 2243 flow [2024-06-28 01:58:15,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2066, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2243, PETRI_PLACES=209, PETRI_TRANSITIONS=181} [2024-06-28 01:58:15,743 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 170 predicate places. [2024-06-28 01:58:15,743 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 181 transitions, 2243 flow [2024-06-28 01:58:15,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:15,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:15,743 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:58:15,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-28 01:58:15,743 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:15,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:15,744 INFO L85 PathProgramCache]: Analyzing trace with hash 330382811, now seen corresponding path program 7 times [2024-06-28 01:58:15,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:15,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113582496] [2024-06-28 01:58:15,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:15,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:58:16,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:16,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113582496] [2024-06-28 01:58:16,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113582496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:16,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:16,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:58:16,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188664162] [2024-06-28 01:58:16,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:16,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:58:16,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:16,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:58:16,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:58:16,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:58:16,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 181 transitions, 2243 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 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:58:16,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:16,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:58:16,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:17,513 INFO L124 PetriNetUnfolderBase]: 1766/3324 cut-off events. [2024-06-28 01:58:17,513 INFO L125 PetriNetUnfolderBase]: For 28141/28141 co-relation queries the response was YES. [2024-06-28 01:58:17,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14337 conditions, 3324 events. 1766/3324 cut-off events. For 28141/28141 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 23012 event pairs, 732 based on Foata normal form. 6/3229 useless extension candidates. Maximal degree in co-relation 14236. Up to 2918 conditions per place. [2024-06-28 01:58:17,540 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 182 selfloop transitions, 60 changer transitions 0/249 dead transitions. [2024-06-28 01:58:17,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 249 transitions, 3284 flow [2024-06-28 01:58:17,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:58:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:58:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 194 transitions. [2024-06-28 01:58:17,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42637362637362636 [2024-06-28 01:58:17,541 INFO L175 Difference]: Start difference. First operand has 209 places, 181 transitions, 2243 flow. Second operand 13 states and 194 transitions. [2024-06-28 01:58:17,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 249 transitions, 3284 flow [2024-06-28 01:58:17,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 249 transitions, 3084 flow, removed 66 selfloop flow, removed 5 redundant places. [2024-06-28 01:58:17,688 INFO L231 Difference]: Finished difference. Result has 224 places, 210 transitions, 2683 flow [2024-06-28 01:58:17,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2051, 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=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2683, PETRI_PLACES=224, PETRI_TRANSITIONS=210} [2024-06-28 01:58:17,688 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 185 predicate places. [2024-06-28 01:58:17,688 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 210 transitions, 2683 flow [2024-06-28 01:58:17,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 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:58:17,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:17,689 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:58:17,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-28 01:58:17,689 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:17,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1537876709, now seen corresponding path program 8 times [2024-06-28 01:58:17,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:17,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040040868] [2024-06-28 01:58:17,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:17,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:58:18,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:18,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040040868] [2024-06-28 01:58:18,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040040868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:18,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:18,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:58:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518659806] [2024-06-28 01:58:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:18,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:58:18,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:18,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:58:18,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:58:18,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:58:18,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 210 transitions, 2683 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 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:58:18,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:18,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:58:18,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:19,328 INFO L124 PetriNetUnfolderBase]: 1791/3376 cut-off events. [2024-06-28 01:58:19,328 INFO L125 PetriNetUnfolderBase]: For 20353/20353 co-relation queries the response was YES. [2024-06-28 01:58:19,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14490 conditions, 3376 events. 1791/3376 cut-off events. For 20353/20353 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 23548 event pairs, 766 based on Foata normal form. 6/3280 useless extension candidates. Maximal degree in co-relation 14382. Up to 2969 conditions per place. [2024-06-28 01:58:19,357 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 181 selfloop transitions, 59 changer transitions 0/247 dead transitions. [2024-06-28 01:58:19,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 247 transitions, 3226 flow [2024-06-28 01:58:19,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:58:19,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:58:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2024-06-28 01:58:19,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44415584415584414 [2024-06-28 01:58:19,359 INFO L175 Difference]: Start difference. First operand has 224 places, 210 transitions, 2683 flow. Second operand 11 states and 171 transitions. [2024-06-28 01:58:19,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 247 transitions, 3226 flow [2024-06-28 01:58:19,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 247 transitions, 2923 flow, removed 22 selfloop flow, removed 35 redundant places. [2024-06-28 01:58:19,431 INFO L231 Difference]: Finished difference. Result has 200 places, 212 transitions, 2438 flow [2024-06-28 01:58:19,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2274, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2438, PETRI_PLACES=200, PETRI_TRANSITIONS=212} [2024-06-28 01:58:19,432 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 161 predicate places. [2024-06-28 01:58:19,432 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 212 transitions, 2438 flow [2024-06-28 01:58:19,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 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:58:19,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:19,432 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] [2024-06-28 01:58:19,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-28 01:58:19,432 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:19,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:19,433 INFO L85 PathProgramCache]: Analyzing trace with hash 893738737, now seen corresponding path program 1 times [2024-06-28 01:58:19,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:19,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381303584] [2024-06-28 01:58:19,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:19,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:58:19,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:19,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381303584] [2024-06-28 01:58:19,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381303584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:19,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:19,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:58:19,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142358192] [2024-06-28 01:58:19,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:19,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:58:19,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:19,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:58:19,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:58:19,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-28 01:58:19,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 212 transitions, 2438 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:19,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:19,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-28 01:58:19,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:19,806 INFO L124 PetriNetUnfolderBase]: 1110/2379 cut-off events. [2024-06-28 01:58:19,807 INFO L125 PetriNetUnfolderBase]: For 7333/7383 co-relation queries the response was YES. [2024-06-28 01:58:19,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9268 conditions, 2379 events. 1110/2379 cut-off events. For 7333/7383 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 17711 event pairs, 210 based on Foata normal form. 219/2515 useless extension candidates. Maximal degree in co-relation 9190. Up to 797 conditions per place. [2024-06-28 01:58:19,823 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 85 selfloop transitions, 43 changer transitions 0/185 dead transitions. [2024-06-28 01:58:19,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 185 transitions, 2396 flow [2024-06-28 01:58:19,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:58:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:58:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-28 01:58:19,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057142857142858 [2024-06-28 01:58:19,824 INFO L175 Difference]: Start difference. First operand has 200 places, 212 transitions, 2438 flow. Second operand 5 states and 106 transitions. [2024-06-28 01:58:19,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 185 transitions, 2396 flow [2024-06-28 01:58:19,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 185 transitions, 1702 flow, removed 65 selfloop flow, removed 46 redundant places. [2024-06-28 01:58:19,856 INFO L231 Difference]: Finished difference. Result has 160 places, 175 transitions, 1554 flow [2024-06-28 01:58:19,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1554, PETRI_PLACES=160, PETRI_TRANSITIONS=175} [2024-06-28 01:58:19,856 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 121 predicate places. [2024-06-28 01:58:19,857 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 175 transitions, 1554 flow [2024-06-28 01:58:19,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:19,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:19,857 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] [2024-06-28 01:58:19,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-28 01:58:19,857 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:19,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash 577186048, now seen corresponding path program 1 times [2024-06-28 01:58:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:19,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836798725] [2024-06-28 01:58:19,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:19,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:58:20,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:20,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836798725] [2024-06-28 01:58:20,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836798725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:20,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:20,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-28 01:58:20,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116060060] [2024-06-28 01:58:20,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:20,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:58:20,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:20,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:58:20,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:58:20,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 01:58:20,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 175 transitions, 1554 flow. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:20,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:20,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 01:58:20,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:20,629 INFO L124 PetriNetUnfolderBase]: 1075/2681 cut-off events. [2024-06-28 01:58:20,630 INFO L125 PetriNetUnfolderBase]: For 4859/4863 co-relation queries the response was YES. [2024-06-28 01:58:20,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9070 conditions, 2681 events. 1075/2681 cut-off events. For 4859/4863 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 23143 event pairs, 199 based on Foata normal form. 6/2503 useless extension candidates. Maximal degree in co-relation 9022. Up to 1125 conditions per place. [2024-06-28 01:58:20,641 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 63 selfloop transitions, 63 changer transitions 15/221 dead transitions. [2024-06-28 01:58:20,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 221 transitions, 2044 flow [2024-06-28 01:58:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:58:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:58:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-28 01:58:20,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-28 01:58:20,643 INFO L175 Difference]: Start difference. First operand has 160 places, 175 transitions, 1554 flow. Second operand 9 states and 147 transitions. [2024-06-28 01:58:20,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 221 transitions, 2044 flow [2024-06-28 01:58:20,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 221 transitions, 1956 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-28 01:58:20,665 INFO L231 Difference]: Finished difference. Result has 169 places, 194 transitions, 1795 flow [2024-06-28 01:58:20,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1795, PETRI_PLACES=169, PETRI_TRANSITIONS=194} [2024-06-28 01:58:20,666 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 130 predicate places. [2024-06-28 01:58:20,666 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 194 transitions, 1795 flow [2024-06-28 01:58:20,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:20,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:20,666 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] [2024-06-28 01:58:20,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-28 01:58:20,666 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:20,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash -807237938, now seen corresponding path program 2 times [2024-06-28 01:58:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:20,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171437366] [2024-06-28 01:58:20,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:20,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:58:21,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:58:21,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:58:21,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171437366] [2024-06-28 01:58:21,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171437366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:58:21,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:58:21,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:58:21,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131043001] [2024-06-28 01:58:21,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:58:21,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:58:21,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:58:21,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:58:21,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:58:21,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-28 01:58:21,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 194 transitions, 1795 flow. Second operand has 11 states, 11 states have (on average 15.454545454545455) internal successors, (170), 11 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:21,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:58:21,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-28 01:58:21,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:58:21,506 INFO L124 PetriNetUnfolderBase]: 874/2358 cut-off events. [2024-06-28 01:58:21,506 INFO L125 PetriNetUnfolderBase]: For 4702/4715 co-relation queries the response was YES. [2024-06-28 01:58:21,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8211 conditions, 2358 events. 874/2358 cut-off events. For 4702/4715 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 21092 event pairs, 295 based on Foata normal form. 12/2178 useless extension candidates. Maximal degree in co-relation 8159. Up to 818 conditions per place. [2024-06-28 01:58:21,517 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 42 selfloop transitions, 52 changer transitions 46/211 dead transitions. [2024-06-28 01:58:21,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 211 transitions, 2105 flow [2024-06-28 01:58:21,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:58:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:58:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-28 01:58:21,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5392857142857143 [2024-06-28 01:58:21,518 INFO L175 Difference]: Start difference. First operand has 169 places, 194 transitions, 1795 flow. Second operand 8 states and 151 transitions. [2024-06-28 01:58:21,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 211 transitions, 2105 flow [2024-06-28 01:58:21,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 211 transitions, 2030 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 01:58:21,536 INFO L231 Difference]: Finished difference. Result has 170 places, 158 transitions, 1494 flow [2024-06-28 01:58:21,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1494, PETRI_PLACES=170, PETRI_TRANSITIONS=158} [2024-06-28 01:58:21,537 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 131 predicate places. [2024-06-28 01:58:21,537 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 158 transitions, 1494 flow [2024-06-28 01:58:21,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.454545454545455) internal successors, (170), 11 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:58:21,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:58:21,537 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] [2024-06-28 01:58:21,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-28 01:58:21,537 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:58:21,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:58:21,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2141386706, now seen corresponding path program 3 times [2024-06-28 01:58:21,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:58:21,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645217714] [2024-06-28 01:58:21,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:58:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:58:21,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-28 01:58:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:58:21,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-28 01:58:21,613 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-28 01:58:21,614 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-28 01:58:21,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-28 01:58:21,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-28 01:58:21,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-28 01:58:21,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-28 01:58:21,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-28 01:58:21,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-28 01:58:21,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-28 01:58:21,621 INFO L445 BasicCegarLoop]: Path program histogram: [10, 8, 8, 6, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:58:21,625 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 01:58:21,625 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 01:58:21,690 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 01:58:21,691 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 01:58:21,691 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 01:58:21 BasicIcfg [2024-06-28 01:58:21,691 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 01:58:21,692 INFO L158 Benchmark]: Toolchain (without parser) took 72227.55ms. Allocated memory was 113.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 53.1MB in the beginning and 842.1MB in the end (delta: -789.0MB). Peak memory consumption was 602.7MB. Max. memory is 16.1GB. [2024-06-28 01:58:21,692 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:58:21,692 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:58:21,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 601.29ms. Allocated memory was 113.2MB in the beginning and 161.5MB in the end (delta: 48.2MB). Free memory was 52.9MB in the beginning and 105.5MB in the end (delta: -52.6MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-06-28 01:58:21,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.75ms. Allocated memory is still 161.5MB. Free memory was 105.5MB in the beginning and 102.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 01:58:21,693 INFO L158 Benchmark]: Boogie Preprocessor took 33.53ms. Allocated memory is still 161.5MB. Free memory was 102.8MB in the beginning and 99.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 01:58:21,693 INFO L158 Benchmark]: RCFGBuilder took 673.40ms. Allocated memory is still 161.5MB. Free memory was 99.4MB in the beginning and 108.4MB in the end (delta: -9.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-06-28 01:58:21,693 INFO L158 Benchmark]: TraceAbstraction took 70874.47ms. Allocated memory was 161.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 107.4MB in the beginning and 842.1MB in the end (delta: -734.7MB). Peak memory consumption was 608.5MB. Max. memory is 16.1GB. [2024-06-28 01:58:21,694 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.14ms. Allocated memory is still 113.2MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 601.29ms. Allocated memory was 113.2MB in the beginning and 161.5MB in the end (delta: 48.2MB). Free memory was 52.9MB in the beginning and 105.5MB in the end (delta: -52.6MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.75ms. Allocated memory is still 161.5MB. Free memory was 105.5MB in the beginning and 102.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.53ms. Allocated memory is still 161.5MB. Free memory was 102.8MB in the beginning and 99.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 673.40ms. Allocated memory is still 161.5MB. Free memory was 99.4MB in the beginning and 108.4MB in the end (delta: -9.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 70874.47ms. Allocated memory was 161.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 107.4MB in the beginning and 842.1MB in the end (delta: -734.7MB). Peak memory consumption was 608.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-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] [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-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] [L794] 0 pthread_t t2010; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-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] [L795] 0 //@ assert ((((((((((((((!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 2)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-2, t2010=-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] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 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) [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 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 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 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}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L796] 0 //@ assert ((((((((((((((!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 2)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-2, t2010=-1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-2, t2010=-1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 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) [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 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_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-2, t2010=-1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-2, t2010=-1, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: 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: 795]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 796]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 795]: 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: 793]: 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, 52 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: 70.7s, OverallIterations: 66, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 36.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3797 SdHoareTripleChecker+Valid, 14.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3287 mSDsluCounter, 2277 SdHoareTripleChecker+Invalid, 12.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1953 mSDsCounter, 953 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21845 IncrementalHoareTripleChecker+Invalid, 22798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 953 mSolverCounterUnsat, 324 mSDtfsCounter, 21845 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 602 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 592 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2683occurred in iteration=61, InterpolantAutomatonStates: 504, 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.3s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 894 ConstructedInterpolants, 0 QuantifiedInterpolants, 36242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 65 InterpolantComputations, 65 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:58:21,727 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