./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_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/safe029_power.opt_pso.opt_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/safe029_power.opt_pso.opt_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe029_power.opt_pso.opt_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 02:11:32,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:11:32,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:11:32,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:11:32,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:11:32,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:11:32,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:11:32,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:11:32,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:11:32,495 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:11:32,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:11:32,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:11:32,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:11:32,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:11:32,496 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:11:32,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:11:32,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:11:32,497 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:11:32,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:11:32,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:11:32,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:11:32,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:11:32,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:11:32,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:11:32,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:11:32,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:11:32,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:11:32,500 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:11:32,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:11:32,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:11:32,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:11:32,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:11:32,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:11:32,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:11:32,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:11:32,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:11:32,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:11:32,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:11:32,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:11:32,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:11:32,504 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:11:32,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:11:32,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:11:32,504 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 02:11:32,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:11:32,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:11:32,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:11:32,708 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:11:32,709 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:11:32,710 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/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-28 02:11:32,823 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:11:32,823 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:11:32,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-06-28 02:11:33,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:11:34,071 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:11:34,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-06-28 02:11:34,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc50f06e4/5825c883857e491aa1e44cf4511dc438/FLAGfdabc4229 [2024-06-28 02:11:34,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc50f06e4/5825c883857e491aa1e44cf4511dc438 [2024-06-28 02:11:34,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:11:34,099 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:11:34,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:11:34,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:11:34,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:11:34,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:11:32" (1/2) ... [2024-06-28 02:11:34,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a8075f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:11:34, skipping insertion in model container [2024-06-28 02:11:34,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:11:32" (1/2) ... [2024-06-28 02:11:34,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@626438c8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:11:34, skipping insertion in model container [2024-06-28 02:11:34,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:11:34" (2/2) ... [2024-06-28 02:11:34,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a8075f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34, skipping insertion in model container [2024-06-28 02:11:34,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:11:34" (2/2) ... [2024-06-28 02:11:34,109 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:11:34,148 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:11:34,149 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] ((((((((((((! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || ((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 02:11:34,150 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] ((((((((((((! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || ((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 02:11:34,150 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:11:34,150 INFO L106 edCorrectnessWitness]: ghost_update [L791-L791] multithreaded = 1; [2024-06-28 02:11:34,182 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:11:34,322 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2024-06-28 02:11:34,458 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:11:34,475 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 02:11:34,504 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:11:34,589 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:11:34,619 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:11:34,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34 WrapperNode [2024-06-28 02:11:34,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:11:34,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:11:34,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:11:34,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:11:34,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34" (1/1) ... [2024-06-28 02:11:34,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34" (1/1) ... [2024-06-28 02:11:34,673 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2024-06-28 02:11:34,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:11:34,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:11:34,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:11:34,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:11:34,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34" (1/1) ... [2024-06-28 02:11:34,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34" (1/1) ... [2024-06-28 02:11:34,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34" (1/1) ... [2024-06-28 02:11:34,707 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 02:11:34,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34" (1/1) ... [2024-06-28 02:11:34,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34" (1/1) ... [2024-06-28 02:11:34,714 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34" (1/1) ... [2024-06-28 02:11:34,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34" (1/1) ... [2024-06-28 02:11:34,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34" (1/1) ... [2024-06-28 02:11:34,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34" (1/1) ... [2024-06-28 02:11:34,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:11:34,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:11:34,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:11:34,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:11:34,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34" (1/1) ... [2024-06-28 02:11:34,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:11:34,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:11:34,764 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 02:11:34,784 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 02:11:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:11:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:11:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 02:11:34,802 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 02:11:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 02:11:34,802 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 02:11:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:11:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:11:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:11:34,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:11:34,804 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 02:11:34,926 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:11:34,928 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:11:35,170 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:11:35,170 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:11:35,297 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:11:35,297 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 02:11:35,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:11:35 BoogieIcfgContainer [2024-06-28 02:11:35,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:11:35,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:11:35,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:11:35,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:11:35,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:11:32" (1/4) ... [2024-06-28 02:11:35,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6756b7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:11:35, skipping insertion in model container [2024-06-28 02:11:35,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:11:34" (2/4) ... [2024-06-28 02:11:35,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6756b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:11:35, skipping insertion in model container [2024-06-28 02:11:35,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:34" (3/4) ... [2024-06-28 02:11:35,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6756b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:11:35, skipping insertion in model container [2024-06-28 02:11:35,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:11:35" (4/4) ... [2024-06-28 02:11:35,304 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2024-06-28 02:11:35,346 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:11:35,347 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-28 02:11:35,347 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:11:35,381 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 02:11:35,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-28 02:11:35,440 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-28 02:11:35,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:11:35,443 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 5. Compared 45 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 02:11:35,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-28 02:11:35,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 33 transitions, 72 flow [2024-06-28 02:11:35,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:11:35,460 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;@700c2e4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:11:35,460 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-28 02:11:35,463 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:11:35,463 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 02:11:35,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:11:35,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:35,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:11:35,464 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:35,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:35,468 INFO L85 PathProgramCache]: Analyzing trace with hash 302383596, now seen corresponding path program 1 times [2024-06-28 02:11:35,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:35,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064514643] [2024-06-28 02:11:35,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:35,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:36,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:36,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064514643] [2024-06-28 02:11:36,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064514643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:36,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:36,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:11:36,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605443881] [2024-06-28 02:11:36,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:36,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:11:36,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:36,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:11:36,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:11:36,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 02:11:36,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:36,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:36,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 02:11:36,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:36,418 INFO L124 PetriNetUnfolderBase]: 543/1033 cut-off events. [2024-06-28 02:11:36,419 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-28 02:11:36,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 1033 events. 543/1033 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5477 event pairs, 424 based on Foata normal form. 43/979 useless extension candidates. Maximal degree in co-relation 1942. Up to 892 conditions per place. [2024-06-28 02:11:36,426 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 32 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-28 02:11:36,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 169 flow [2024-06-28 02:11:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:11:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:11:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-06-28 02:11:36,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-28 02:11:36,436 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 70 transitions. [2024-06-28 02:11:36,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 169 flow [2024-06-28 02:11:36,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 02:11:36,441 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 96 flow [2024-06-28 02:11:36,442 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 02:11:36,445 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-06-28 02:11:36,445 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 96 flow [2024-06-28 02:11:36,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:36,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:36,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:36,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:11:36,446 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:36,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:36,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1466614967, now seen corresponding path program 1 times [2024-06-28 02:11:36,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:36,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186664831] [2024-06-28 02:11:36,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:36,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:36,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:36,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186664831] [2024-06-28 02:11:36,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186664831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:36,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:36,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:11:36,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659671707] [2024-06-28 02:11:36,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:36,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:11:36,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:36,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:11:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:11:36,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 02:11:36,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:36,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:36,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 02:11:36,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:36,995 INFO L124 PetriNetUnfolderBase]: 539/907 cut-off events. [2024-06-28 02:11:36,995 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-06-28 02:11:36,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 907 events. 539/907 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4304 event pairs, 213 based on Foata normal form. 2/859 useless extension candidates. Maximal degree in co-relation 2028. Up to 867 conditions per place. [2024-06-28 02:11:37,002 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 41 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-28 02:11:37,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 242 flow [2024-06-28 02:11:37,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:11:37,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:11:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-06-28 02:11:37,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-06-28 02:11:37,006 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 96 flow. Second operand 4 states and 90 transitions. [2024-06-28 02:11:37,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 242 flow [2024-06-28 02:11:37,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:11:37,009 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 130 flow [2024-06-28 02:11:37,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2024-06-28 02:11:37,010 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2024-06-28 02:11:37,010 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 130 flow [2024-06-28 02:11:37,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:37,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:37,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:37,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:11:37,011 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:37,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1779577443, now seen corresponding path program 1 times [2024-06-28 02:11:37,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:37,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386626029] [2024-06-28 02:11:37,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:37,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:37,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:37,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386626029] [2024-06-28 02:11:37,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386626029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:37,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:37,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:11:37,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202971156] [2024-06-28 02:11:37,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:37,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:11:37,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:37,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:11:37,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:11:37,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 02:11:37,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 130 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 02:11:37,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:37,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 02:11:37,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:37,581 INFO L124 PetriNetUnfolderBase]: 531/1015 cut-off events. [2024-06-28 02:11:37,582 INFO L125 PetriNetUnfolderBase]: For 349/349 co-relation queries the response was YES. [2024-06-28 02:11:37,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 1015 events. 531/1015 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5408 event pairs, 173 based on Foata normal form. 4/931 useless extension candidates. Maximal degree in co-relation 2312. Up to 838 conditions per place. [2024-06-28 02:11:37,586 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 48 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-28 02:11:37,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 69 transitions, 354 flow [2024-06-28 02:11:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:11:37,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:11:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-28 02:11:37,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6114285714285714 [2024-06-28 02:11:37,588 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 130 flow. Second operand 5 states and 107 transitions. [2024-06-28 02:11:37,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 69 transitions, 354 flow [2024-06-28 02:11:37,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 328 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-28 02:11:37,590 INFO L231 Difference]: Finished difference. Result has 48 places, 50 transitions, 227 flow [2024-06-28 02:11:37,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=48, PETRI_TRANSITIONS=50} [2024-06-28 02:11:37,591 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2024-06-28 02:11:37,591 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 227 flow [2024-06-28 02:11:37,591 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 02:11:37,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:37,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:37,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:11:37,592 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:37,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:37,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1763624040, now seen corresponding path program 1 times [2024-06-28 02:11:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:37,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775715214] [2024-06-28 02:11:37,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:37,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:37,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:37,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775715214] [2024-06-28 02:11:37,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775715214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:37,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:37,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:11:37,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702399497] [2024-06-28 02:11:37,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:37,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:11:37,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:37,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:11:37,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:11:37,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2024-06-28 02:11:37,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:37,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:37,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2024-06-28 02:11:37,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:37,734 INFO L124 PetriNetUnfolderBase]: 185/485 cut-off events. [2024-06-28 02:11:37,734 INFO L125 PetriNetUnfolderBase]: For 266/292 co-relation queries the response was YES. [2024-06-28 02:11:37,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 485 events. 185/485 cut-off events. For 266/292 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2887 event pairs, 80 based on Foata normal form. 10/462 useless extension candidates. Maximal degree in co-relation 1045. Up to 286 conditions per place. [2024-06-28 02:11:37,737 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 25 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-28 02:11:37,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 266 flow [2024-06-28 02:11:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:11:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:11:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-06-28 02:11:37,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2024-06-28 02:11:37,739 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 227 flow. Second operand 3 states and 76 transitions. [2024-06-28 02:11:37,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 266 flow [2024-06-28 02:11:37,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 262 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-28 02:11:37,743 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 194 flow [2024-06-28 02:11:37,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2024-06-28 02:11:37,745 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2024-06-28 02:11:37,745 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 194 flow [2024-06-28 02:11:37,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:37,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:37,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:37,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:11:37,745 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:37,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:37,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1293255526, now seen corresponding path program 1 times [2024-06-28 02:11:37,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:37,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898864075] [2024-06-28 02:11:37,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:37,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:38,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:38,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898864075] [2024-06-28 02:11:38,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898864075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:38,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:38,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:11:38,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985168850] [2024-06-28 02:11:38,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:38,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:11:38,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:38,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:11:38,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:11:38,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 02:11:38,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 194 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 02:11:38,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:38,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 02:11:38,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:38,678 INFO L124 PetriNetUnfolderBase]: 449/863 cut-off events. [2024-06-28 02:11:38,678 INFO L125 PetriNetUnfolderBase]: For 670/670 co-relation queries the response was YES. [2024-06-28 02:11:38,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2124 conditions, 863 events. 449/863 cut-off events. For 670/670 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4372 event pairs, 96 based on Foata normal form. 4/830 useless extension candidates. Maximal degree in co-relation 2105. Up to 678 conditions per place. [2024-06-28 02:11:38,682 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 47 selfloop transitions, 12 changer transitions 1/68 dead transitions. [2024-06-28 02:11:38,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 372 flow [2024-06-28 02:11:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:11:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:11:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-28 02:11:38,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5619047619047619 [2024-06-28 02:11:38,683 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 194 flow. Second operand 6 states and 118 transitions. [2024-06-28 02:11:38,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 372 flow [2024-06-28 02:11:38,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 02:11:38,685 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 215 flow [2024-06-28 02:11:38,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-06-28 02:11:38,685 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2024-06-28 02:11:38,686 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 215 flow [2024-06-28 02:11:38,686 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 02:11:38,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:38,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:38,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:11:38,686 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:38,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1670383745, now seen corresponding path program 1 times [2024-06-28 02:11:38,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:38,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339912099] [2024-06-28 02:11:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:39,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:39,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339912099] [2024-06-28 02:11:39,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339912099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:39,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:39,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:11:39,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92735932] [2024-06-28 02:11:39,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:39,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:11:39,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:39,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:11:39,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:11:39,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:39,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:39,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:39,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:39,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:39,181 INFO L124 PetriNetUnfolderBase]: 452/867 cut-off events. [2024-06-28 02:11:39,182 INFO L125 PetriNetUnfolderBase]: For 769/769 co-relation queries the response was YES. [2024-06-28 02:11:39,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 867 events. 452/867 cut-off events. For 769/769 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4262 event pairs, 186 based on Foata normal form. 1/831 useless extension candidates. Maximal degree in co-relation 2215. Up to 738 conditions per place. [2024-06-28 02:11:39,186 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 48 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2024-06-28 02:11:39,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 384 flow [2024-06-28 02:11:39,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:11:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:11:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-06-28 02:11:39,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2024-06-28 02:11:39,188 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 215 flow. Second operand 5 states and 81 transitions. [2024-06-28 02:11:39,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 384 flow [2024-06-28 02:11:39,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 351 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-28 02:11:39,192 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 244 flow [2024-06-28 02:11:39,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2024-06-28 02:11:39,194 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2024-06-28 02:11:39,194 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 244 flow [2024-06-28 02:11:39,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:39,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:39,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:39,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:11:39,195 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:39,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:39,196 INFO L85 PathProgramCache]: Analyzing trace with hash -242287912, now seen corresponding path program 1 times [2024-06-28 02:11:39,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:39,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451417399] [2024-06-28 02:11:39,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:39,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:39,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:39,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451417399] [2024-06-28 02:11:39,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451417399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:39,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:39,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:11:39,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121700261] [2024-06-28 02:11:39,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:39,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:11:39,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:39,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:11:39,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:11:39,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:39,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 244 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 02:11:39,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:39,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:39,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:39,852 INFO L124 PetriNetUnfolderBase]: 479/921 cut-off events. [2024-06-28 02:11:39,853 INFO L125 PetriNetUnfolderBase]: For 1008/1017 co-relation queries the response was YES. [2024-06-28 02:11:39,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 921 events. 479/921 cut-off events. For 1008/1017 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4692 event pairs, 174 based on Foata normal form. 8/888 useless extension candidates. Maximal degree in co-relation 2449. Up to 709 conditions per place. [2024-06-28 02:11:39,857 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 57 selfloop transitions, 14 changer transitions 0/77 dead transitions. [2024-06-28 02:11:39,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 489 flow [2024-06-28 02:11:39,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:11:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:11:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-28 02:11:39,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-28 02:11:39,859 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 244 flow. Second operand 6 states and 102 transitions. [2024-06-28 02:11:39,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 489 flow [2024-06-28 02:11:39,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-28 02:11:39,863 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 338 flow [2024-06-28 02:11:39,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2024-06-28 02:11:39,865 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 20 predicate places. [2024-06-28 02:11:39,865 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 338 flow [2024-06-28 02:11:39,865 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 02:11:39,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:39,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:39,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:11:39,866 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:39,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:39,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1070861662, now seen corresponding path program 1 times [2024-06-28 02:11:39,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:39,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729361015] [2024-06-28 02:11:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:39,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:40,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:40,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729361015] [2024-06-28 02:11:40,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729361015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:40,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:40,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:11:40,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267078289] [2024-06-28 02:11:40,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:40,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:11:40,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:40,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:11:40,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:11:40,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:40,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 338 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 02:11:40,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:40,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:40,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:40,440 INFO L124 PetriNetUnfolderBase]: 501/964 cut-off events. [2024-06-28 02:11:40,440 INFO L125 PetriNetUnfolderBase]: For 1596/1596 co-relation queries the response was YES. [2024-06-28 02:11:40,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 964 events. 501/964 cut-off events. For 1596/1596 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4916 event pairs, 191 based on Foata normal form. 1/922 useless extension candidates. Maximal degree in co-relation 2966. Up to 798 conditions per place. [2024-06-28 02:11:40,445 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 64 selfloop transitions, 15 changer transitions 0/85 dead transitions. [2024-06-28 02:11:40,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 598 flow [2024-06-28 02:11:40,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-28 02:11:40,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46122448979591835 [2024-06-28 02:11:40,446 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 338 flow. Second operand 7 states and 113 transitions. [2024-06-28 02:11:40,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 598 flow [2024-06-28 02:11:40,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 85 transitions, 590 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-28 02:11:40,449 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 427 flow [2024-06-28 02:11:40,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=427, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2024-06-28 02:11:40,449 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 27 predicate places. [2024-06-28 02:11:40,449 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 427 flow [2024-06-28 02:11:40,449 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 02:11:40,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:40,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:40,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:11:40,450 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:40,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:40,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1073257374, now seen corresponding path program 2 times [2024-06-28 02:11:40,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:40,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705337162] [2024-06-28 02:11:40,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:40,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:40,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 02:11:40,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:40,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705337162] [2024-06-28 02:11:40,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705337162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:40,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:40,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:11:40,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096276016] [2024-06-28 02:11:40,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:40,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:11:40,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:40,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:11:40,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:11:40,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:40,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 427 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 02:11:40,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:40,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:40,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:40,987 INFO L124 PetriNetUnfolderBase]: 514/987 cut-off events. [2024-06-28 02:11:40,987 INFO L125 PetriNetUnfolderBase]: For 2114/2114 co-relation queries the response was YES. [2024-06-28 02:11:40,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3253 conditions, 987 events. 514/987 cut-off events. For 2114/2114 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5060 event pairs, 190 based on Foata normal form. 1/944 useless extension candidates. Maximal degree in co-relation 3221. Up to 808 conditions per place. [2024-06-28 02:11:40,993 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 63 selfloop transitions, 15 changer transitions 0/84 dead transitions. [2024-06-28 02:11:40,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 656 flow [2024-06-28 02:11:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:11:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:11:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-28 02:11:40,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-28 02:11:40,994 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 427 flow. Second operand 6 states and 98 transitions. [2024-06-28 02:11:40,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 656 flow [2024-06-28 02:11:40,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 623 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-28 02:11:41,001 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 455 flow [2024-06-28 02:11:41,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2024-06-28 02:11:41,003 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 29 predicate places. [2024-06-28 02:11:41,003 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 455 flow [2024-06-28 02:11:41,003 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 02:11:41,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:41,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:41,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 02:11:41,005 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:41,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:41,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1560639004, now seen corresponding path program 3 times [2024-06-28 02:11:41,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:41,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663839709] [2024-06-28 02:11:41,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:41,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:41,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:41,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663839709] [2024-06-28 02:11:41,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663839709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:41,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:41,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:11:41,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620493321] [2024-06-28 02:11:41,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:41,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:11:41,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:41,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:11:41,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:11:41,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:41,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 455 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 02:11:41,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:41,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:41,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:41,619 INFO L124 PetriNetUnfolderBase]: 509/984 cut-off events. [2024-06-28 02:11:41,620 INFO L125 PetriNetUnfolderBase]: For 2427/2427 co-relation queries the response was YES. [2024-06-28 02:11:41,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3294 conditions, 984 events. 509/984 cut-off events. For 2427/2427 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5069 event pairs, 252 based on Foata normal form. 2/943 useless extension candidates. Maximal degree in co-relation 3262. Up to 724 conditions per place. [2024-06-28 02:11:41,625 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 59 selfloop transitions, 22 changer transitions 0/87 dead transitions. [2024-06-28 02:11:41,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 709 flow [2024-06-28 02:11:41,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-28 02:11:41,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4530612244897959 [2024-06-28 02:11:41,626 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 455 flow. Second operand 7 states and 111 transitions. [2024-06-28 02:11:41,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 709 flow [2024-06-28 02:11:41,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 87 transitions, 669 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-28 02:11:41,631 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 492 flow [2024-06-28 02:11:41,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=492, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2024-06-28 02:11:41,632 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2024-06-28 02:11:41,632 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 492 flow [2024-06-28 02:11:41,632 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 02:11:41,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:41,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:41,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 02:11:41,633 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:41,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:41,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1079009982, now seen corresponding path program 1 times [2024-06-28 02:11:41,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:41,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908187268] [2024-06-28 02:11:41,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:41,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:42,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:42,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908187268] [2024-06-28 02:11:42,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908187268] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:42,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:42,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:42,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216770235] [2024-06-28 02:11:42,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:42,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:42,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:42,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:42,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:42,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:42,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 492 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 02:11:42,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:42,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:42,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:42,436 INFO L124 PetriNetUnfolderBase]: 525/999 cut-off events. [2024-06-28 02:11:42,436 INFO L125 PetriNetUnfolderBase]: For 2380/2380 co-relation queries the response was YES. [2024-06-28 02:11:42,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3394 conditions, 999 events. 525/999 cut-off events. For 2380/2380 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5080 event pairs, 173 based on Foata normal form. 2/957 useless extension candidates. Maximal degree in co-relation 3360. Up to 725 conditions per place. [2024-06-28 02:11:42,441 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 63 selfloop transitions, 26 changer transitions 0/95 dead transitions. [2024-06-28 02:11:42,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 95 transitions, 766 flow [2024-06-28 02:11:42,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-28 02:11:42,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816326530612245 [2024-06-28 02:11:42,443 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 492 flow. Second operand 7 states and 118 transitions. [2024-06-28 02:11:42,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 95 transitions, 766 flow [2024-06-28 02:11:42,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 95 transitions, 723 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-28 02:11:42,447 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 538 flow [2024-06-28 02:11:42,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=538, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2024-06-28 02:11:42,448 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 36 predicate places. [2024-06-28 02:11:42,448 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 538 flow [2024-06-28 02:11:42,448 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 02:11:42,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:42,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:42,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 02:11:42,448 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:42,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1490012732, now seen corresponding path program 1 times [2024-06-28 02:11:42,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:42,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941812502] [2024-06-28 02:11:42,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:42,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:42,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:42,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941812502] [2024-06-28 02:11:42,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941812502] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:42,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:42,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:42,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280803649] [2024-06-28 02:11:42,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:42,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:42,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:42,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:42,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:42,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:42,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 538 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 02:11:42,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:42,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:42,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:43,088 INFO L124 PetriNetUnfolderBase]: 547/1043 cut-off events. [2024-06-28 02:11:43,089 INFO L125 PetriNetUnfolderBase]: For 2822/2822 co-relation queries the response was YES. [2024-06-28 02:11:43,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3715 conditions, 1043 events. 547/1043 cut-off events. For 2822/2822 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5387 event pairs, 140 based on Foata normal form. 2/999 useless extension candidates. Maximal degree in co-relation 3679. Up to 820 conditions per place. [2024-06-28 02:11:43,095 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 73 selfloop transitions, 25 changer transitions 0/104 dead transitions. [2024-06-28 02:11:43,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 104 transitions, 848 flow [2024-06-28 02:11:43,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:43,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-28 02:11:43,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-28 02:11:43,096 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 538 flow. Second operand 7 states and 120 transitions. [2024-06-28 02:11:43,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 104 transitions, 848 flow [2024-06-28 02:11:43,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 104 transitions, 787 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-28 02:11:43,102 INFO L231 Difference]: Finished difference. Result has 78 places, 80 transitions, 587 flow [2024-06-28 02:11:43,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=587, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2024-06-28 02:11:43,103 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 39 predicate places. [2024-06-28 02:11:43,103 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 587 flow [2024-06-28 02:11:43,103 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 02:11:43,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:43,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:43,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 02:11:43,104 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:43,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash 188507402, now seen corresponding path program 2 times [2024-06-28 02:11:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:43,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530545684] [2024-06-28 02:11:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:43,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:43,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530545684] [2024-06-28 02:11:43,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530545684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:43,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:43,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:43,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194356104] [2024-06-28 02:11:43,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:43,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:43,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:43,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:43,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:43,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:43,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 587 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 02:11:43,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:43,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:43,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:43,732 INFO L124 PetriNetUnfolderBase]: 583/1085 cut-off events. [2024-06-28 02:11:43,733 INFO L125 PetriNetUnfolderBase]: For 3530/3530 co-relation queries the response was YES. [2024-06-28 02:11:43,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4113 conditions, 1085 events. 583/1085 cut-off events. For 3530/3530 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5467 event pairs, 134 based on Foata normal form. 2/1045 useless extension candidates. Maximal degree in co-relation 4075. Up to 821 conditions per place. [2024-06-28 02:11:43,739 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 79 selfloop transitions, 30 changer transitions 0/115 dead transitions. [2024-06-28 02:11:43,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 115 transitions, 1003 flow [2024-06-28 02:11:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-28 02:11:43,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-28 02:11:43,741 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 587 flow. Second operand 7 states and 120 transitions. [2024-06-28 02:11:43,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 115 transitions, 1003 flow [2024-06-28 02:11:43,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 115 transitions, 964 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:43,748 INFO L231 Difference]: Finished difference. Result has 83 places, 91 transitions, 738 flow [2024-06-28 02:11:43,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=738, PETRI_PLACES=83, PETRI_TRANSITIONS=91} [2024-06-28 02:11:43,748 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 44 predicate places. [2024-06-28 02:11:43,749 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 91 transitions, 738 flow [2024-06-28 02:11:43,749 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 02:11:43,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:43,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:43,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 02:11:43,749 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:43,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:43,749 INFO L85 PathProgramCache]: Analyzing trace with hash -910705280, now seen corresponding path program 3 times [2024-06-28 02:11:43,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:43,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876318450] [2024-06-28 02:11:43,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:43,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:44,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:44,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876318450] [2024-06-28 02:11:44,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876318450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:44,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:44,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:44,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21852440] [2024-06-28 02:11:44,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:44,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:44,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:44,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:44,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:44,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:44,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 91 transitions, 738 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 02:11:44,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:44,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:44,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:44,384 INFO L124 PetriNetUnfolderBase]: 649/1185 cut-off events. [2024-06-28 02:11:44,384 INFO L125 PetriNetUnfolderBase]: For 5156/5156 co-relation queries the response was YES. [2024-06-28 02:11:44,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4769 conditions, 1185 events. 649/1185 cut-off events. For 5156/5156 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6021 event pairs, 111 based on Foata normal form. 6/1148 useless extension candidates. Maximal degree in co-relation 4729. Up to 647 conditions per place. [2024-06-28 02:11:44,394 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 98 selfloop transitions, 41 changer transitions 0/145 dead transitions. [2024-06-28 02:11:44,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 145 transitions, 1363 flow [2024-06-28 02:11:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-28 02:11:44,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2024-06-28 02:11:44,396 INFO L175 Difference]: Start difference. First operand has 83 places, 91 transitions, 738 flow. Second operand 7 states and 128 transitions. [2024-06-28 02:11:44,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 145 transitions, 1363 flow [2024-06-28 02:11:44,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 145 transitions, 1303 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-28 02:11:44,405 INFO L231 Difference]: Finished difference. Result has 88 places, 111 transitions, 984 flow [2024-06-28 02:11:44,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=984, PETRI_PLACES=88, PETRI_TRANSITIONS=111} [2024-06-28 02:11:44,406 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2024-06-28 02:11:44,406 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 111 transitions, 984 flow [2024-06-28 02:11:44,406 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 02:11:44,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:44,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:44,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 02:11:44,407 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:44,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:44,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1773465285, now seen corresponding path program 1 times [2024-06-28 02:11:44,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:44,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378171327] [2024-06-28 02:11:44,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:44,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:45,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:45,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378171327] [2024-06-28 02:11:45,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378171327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:45,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:45,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:45,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809038435] [2024-06-28 02:11:45,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:45,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:45,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:45,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:45,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:45,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:45,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 111 transitions, 984 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 02:11:45,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:45,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:45,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:45,451 INFO L124 PetriNetUnfolderBase]: 672/1221 cut-off events. [2024-06-28 02:11:45,451 INFO L125 PetriNetUnfolderBase]: For 6215/6215 co-relation queries the response was YES. [2024-06-28 02:11:45,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5486 conditions, 1221 events. 672/1221 cut-off events. For 6215/6215 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6262 event pairs, 120 based on Foata normal form. 4/1183 useless extension candidates. Maximal degree in co-relation 5443. Up to 905 conditions per place. [2024-06-28 02:11:45,469 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 100 selfloop transitions, 38 changer transitions 0/144 dead transitions. [2024-06-28 02:11:45,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 144 transitions, 1437 flow [2024-06-28 02:11:45,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-28 02:11:45,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-28 02:11:45,472 INFO L175 Difference]: Start difference. First operand has 88 places, 111 transitions, 984 flow. Second operand 8 states and 135 transitions. [2024-06-28 02:11:45,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 144 transitions, 1437 flow [2024-06-28 02:11:45,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 144 transitions, 1386 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-28 02:11:45,489 INFO L231 Difference]: Finished difference. Result has 94 places, 114 transitions, 1060 flow [2024-06-28 02:11:45,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1060, PETRI_PLACES=94, PETRI_TRANSITIONS=114} [2024-06-28 02:11:45,490 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 55 predicate places. [2024-06-28 02:11:45,490 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 114 transitions, 1060 flow [2024-06-28 02:11:45,490 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 02:11:45,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:45,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:45,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 02:11:45,491 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:45,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:45,492 INFO L85 PathProgramCache]: Analyzing trace with hash -108683429, now seen corresponding path program 1 times [2024-06-28 02:11:45,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:45,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251992239] [2024-06-28 02:11:45,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:45,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:46,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:46,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251992239] [2024-06-28 02:11:46,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251992239] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:46,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:46,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:46,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314650677] [2024-06-28 02:11:46,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:46,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:46,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:46,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:46,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:46,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:46,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 114 transitions, 1060 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 02:11:46,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:46,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:46,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:46,521 INFO L124 PetriNetUnfolderBase]: 670/1229 cut-off events. [2024-06-28 02:11:46,521 INFO L125 PetriNetUnfolderBase]: For 6095/6095 co-relation queries the response was YES. [2024-06-28 02:11:46,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5603 conditions, 1229 events. 670/1229 cut-off events. For 6095/6095 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6325 event pairs, 146 based on Foata normal form. 1/1186 useless extension candidates. Maximal degree in co-relation 5558. Up to 1001 conditions per place. [2024-06-28 02:11:46,531 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 107 selfloop transitions, 26 changer transitions 0/139 dead transitions. [2024-06-28 02:11:46,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 139 transitions, 1431 flow [2024-06-28 02:11:46,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-28 02:11:46,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-28 02:11:46,532 INFO L175 Difference]: Start difference. First operand has 94 places, 114 transitions, 1060 flow. Second operand 7 states and 119 transitions. [2024-06-28 02:11:46,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 139 transitions, 1431 flow [2024-06-28 02:11:46,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 139 transitions, 1312 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-28 02:11:46,550 INFO L231 Difference]: Finished difference. Result has 95 places, 116 transitions, 1032 flow [2024-06-28 02:11:46,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1032, PETRI_PLACES=95, PETRI_TRANSITIONS=116} [2024-06-28 02:11:46,550 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 56 predicate places. [2024-06-28 02:11:46,550 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 116 transitions, 1032 flow [2024-06-28 02:11:46,550 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 02:11:46,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:46,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:46,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 02:11:46,551 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:46,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:46,551 INFO L85 PathProgramCache]: Analyzing trace with hash 604450939, now seen corresponding path program 1 times [2024-06-28 02:11:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:46,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947291414] [2024-06-28 02:11:46,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:46,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:46,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:46,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947291414] [2024-06-28 02:11:46,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947291414] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:46,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:46,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:46,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067965796] [2024-06-28 02:11:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:46,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:46,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:46,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:46,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:46,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:46,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 116 transitions, 1032 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 02:11:46,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:46,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:46,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:47,235 INFO L124 PetriNetUnfolderBase]: 690/1255 cut-off events. [2024-06-28 02:11:47,236 INFO L125 PetriNetUnfolderBase]: For 6403/6403 co-relation queries the response was YES. [2024-06-28 02:11:47,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5526 conditions, 1255 events. 690/1255 cut-off events. For 6403/6403 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6458 event pairs, 149 based on Foata normal form. 2/1213 useless extension candidates. Maximal degree in co-relation 5480. Up to 1019 conditions per place. [2024-06-28 02:11:47,243 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 111 selfloop transitions, 26 changer transitions 0/143 dead transitions. [2024-06-28 02:11:47,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 143 transitions, 1428 flow [2024-06-28 02:11:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-28 02:11:47,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-28 02:11:47,244 INFO L175 Difference]: Start difference. First operand has 95 places, 116 transitions, 1032 flow. Second operand 7 states and 119 transitions. [2024-06-28 02:11:47,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 143 transitions, 1428 flow [2024-06-28 02:11:47,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 143 transitions, 1382 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-28 02:11:47,257 INFO L231 Difference]: Finished difference. Result has 97 places, 119 transitions, 1080 flow [2024-06-28 02:11:47,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1080, PETRI_PLACES=97, PETRI_TRANSITIONS=119} [2024-06-28 02:11:47,258 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 58 predicate places. [2024-06-28 02:11:47,258 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 119 transitions, 1080 flow [2024-06-28 02:11:47,258 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 02:11:47,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:47,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:47,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 02:11:47,258 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:47,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:47,259 INFO L85 PathProgramCache]: Analyzing trace with hash -108505613, now seen corresponding path program 2 times [2024-06-28 02:11:47,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:47,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140551242] [2024-06-28 02:11:47,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:47,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:47,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:47,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140551242] [2024-06-28 02:11:47,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140551242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:47,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:47,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:47,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030516530] [2024-06-28 02:11:47,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:47,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:47,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:47,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:47,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:47,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:47,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 119 transitions, 1080 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 02:11:47,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:47,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:47,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:47,987 INFO L124 PetriNetUnfolderBase]: 748/1343 cut-off events. [2024-06-28 02:11:47,987 INFO L125 PetriNetUnfolderBase]: For 7736/7736 co-relation queries the response was YES. [2024-06-28 02:11:47,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6123 conditions, 1343 events. 748/1343 cut-off events. For 7736/7736 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7028 event pairs, 120 based on Foata normal form. 2/1301 useless extension candidates. Maximal degree in co-relation 6076. Up to 729 conditions per place. [2024-06-28 02:11:47,995 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 101 selfloop transitions, 52 changer transitions 0/159 dead transitions. [2024-06-28 02:11:47,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 159 transitions, 1686 flow [2024-06-28 02:11:47,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-28 02:11:47,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-06-28 02:11:47,997 INFO L175 Difference]: Start difference. First operand has 97 places, 119 transitions, 1080 flow. Second operand 7 states and 125 transitions. [2024-06-28 02:11:47,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 159 transitions, 1686 flow [2024-06-28 02:11:48,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 159 transitions, 1620 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-28 02:11:48,011 INFO L231 Difference]: Finished difference. Result has 101 places, 129 transitions, 1290 flow [2024-06-28 02:11:48,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1290, PETRI_PLACES=101, PETRI_TRANSITIONS=129} [2024-06-28 02:11:48,012 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 62 predicate places. [2024-06-28 02:11:48,012 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 129 transitions, 1290 flow [2024-06-28 02:11:48,012 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 02:11:48,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:48,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:48,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 02:11:48,012 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:48,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:48,013 INFO L85 PathProgramCache]: Analyzing trace with hash -108499103, now seen corresponding path program 3 times [2024-06-28 02:11:48,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:48,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520909079] [2024-06-28 02:11:48,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:48,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:48,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:48,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520909079] [2024-06-28 02:11:48,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520909079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:48,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:48,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:48,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381330911] [2024-06-28 02:11:48,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:48,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:48,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:48,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:48,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:48,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:48,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 129 transitions, 1290 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 02:11:48,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:48,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:48,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:48,706 INFO L124 PetriNetUnfolderBase]: 740/1331 cut-off events. [2024-06-28 02:11:48,707 INFO L125 PetriNetUnfolderBase]: For 8909/8909 co-relation queries the response was YES. [2024-06-28 02:11:48,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6579 conditions, 1331 events. 740/1331 cut-off events. For 8909/8909 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6947 event pairs, 119 based on Foata normal form. 4/1291 useless extension candidates. Maximal degree in co-relation 6529. Up to 725 conditions per place. [2024-06-28 02:11:48,715 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 98 selfloop transitions, 58 changer transitions 0/162 dead transitions. [2024-06-28 02:11:48,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 162 transitions, 1852 flow [2024-06-28 02:11:48,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-28 02:11:48,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-06-28 02:11:48,717 INFO L175 Difference]: Start difference. First operand has 101 places, 129 transitions, 1290 flow. Second operand 7 states and 127 transitions. [2024-06-28 02:11:48,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 162 transitions, 1852 flow [2024-06-28 02:11:48,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 162 transitions, 1761 flow, removed 22 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:48,757 INFO L231 Difference]: Finished difference. Result has 107 places, 133 transitions, 1445 flow [2024-06-28 02:11:48,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1200, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1445, PETRI_PLACES=107, PETRI_TRANSITIONS=133} [2024-06-28 02:11:48,758 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 68 predicate places. [2024-06-28 02:11:48,758 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 133 transitions, 1445 flow [2024-06-28 02:11:48,758 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 02:11:48,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:48,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:48,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 02:11:48,759 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:48,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1693792825, now seen corresponding path program 1 times [2024-06-28 02:11:48,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:48,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188946154] [2024-06-28 02:11:48,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:48,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:49,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:49,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188946154] [2024-06-28 02:11:49,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188946154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:49,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:49,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:49,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134227025] [2024-06-28 02:11:49,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:49,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:49,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:49,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:49,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:49,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:49,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 133 transitions, 1445 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 02:11:49,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:49,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:49,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:49,619 INFO L124 PetriNetUnfolderBase]: 741/1336 cut-off events. [2024-06-28 02:11:49,619 INFO L125 PetriNetUnfolderBase]: For 9585/9585 co-relation queries the response was YES. [2024-06-28 02:11:49,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6882 conditions, 1336 events. 741/1336 cut-off events. For 9585/9585 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6952 event pairs, 134 based on Foata normal form. 1/1291 useless extension candidates. Maximal degree in co-relation 6829. Up to 1037 conditions per place. [2024-06-28 02:11:49,628 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 122 selfloop transitions, 39 changer transitions 0/167 dead transitions. [2024-06-28 02:11:49,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 167 transitions, 1992 flow [2024-06-28 02:11:49,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-28 02:11:49,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2024-06-28 02:11:49,631 INFO L175 Difference]: Start difference. First operand has 107 places, 133 transitions, 1445 flow. Second operand 8 states and 134 transitions. [2024-06-28 02:11:49,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 167 transitions, 1992 flow [2024-06-28 02:11:49,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 167 transitions, 1902 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-28 02:11:49,653 INFO L231 Difference]: Finished difference. Result has 111 places, 138 transitions, 1525 flow [2024-06-28 02:11:49,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1525, PETRI_PLACES=111, PETRI_TRANSITIONS=138} [2024-06-28 02:11:49,653 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 72 predicate places. [2024-06-28 02:11:49,653 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 138 transitions, 1525 flow [2024-06-28 02:11:49,654 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 02:11:49,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:49,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:49,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 02:11:49,654 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:49,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:49,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1675253435, now seen corresponding path program 1 times [2024-06-28 02:11:49,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:49,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589263096] [2024-06-28 02:11:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:50,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:50,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589263096] [2024-06-28 02:11:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589263096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:50,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:50,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:11:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409566975] [2024-06-28 02:11:50,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:50,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:11:50,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:50,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:11:50,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:11:50,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:50,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 138 transitions, 1525 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 02:11:50,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:50,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:50,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:50,829 INFO L124 PetriNetUnfolderBase]: 759/1362 cut-off events. [2024-06-28 02:11:50,829 INFO L125 PetriNetUnfolderBase]: For 10481/10481 co-relation queries the response was YES. [2024-06-28 02:11:50,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7008 conditions, 1362 events. 759/1362 cut-off events. For 10481/10481 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7086 event pairs, 106 based on Foata normal form. 2/1321 useless extension candidates. Maximal degree in co-relation 6954. Up to 1115 conditions per place. [2024-06-28 02:11:50,838 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 139 selfloop transitions, 25 changer transitions 0/170 dead transitions. [2024-06-28 02:11:50,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 170 transitions, 1987 flow [2024-06-28 02:11:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-28 02:11:50,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-28 02:11:50,840 INFO L175 Difference]: Start difference. First operand has 111 places, 138 transitions, 1525 flow. Second operand 8 states and 133 transitions. [2024-06-28 02:11:50,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 170 transitions, 1987 flow [2024-06-28 02:11:50,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 170 transitions, 1891 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-28 02:11:50,862 INFO L231 Difference]: Finished difference. Result has 114 places, 143 transitions, 1544 flow [2024-06-28 02:11:50,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1544, PETRI_PLACES=114, PETRI_TRANSITIONS=143} [2024-06-28 02:11:50,863 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 75 predicate places. [2024-06-28 02:11:50,863 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 143 transitions, 1544 flow [2024-06-28 02:11:50,863 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 02:11:50,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:50,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:50,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 02:11:50,864 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:50,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:50,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1555279295, now seen corresponding path program 2 times [2024-06-28 02:11:50,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:50,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925588149] [2024-06-28 02:11:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:50,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:51,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:51,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925588149] [2024-06-28 02:11:51,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925588149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:51,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:51,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:11:51,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591588488] [2024-06-28 02:11:51,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:51,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:11:51,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:51,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:11:51,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:11:51,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:51,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 143 transitions, 1544 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 02:11:51,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:51,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:51,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:51,869 INFO L124 PetriNetUnfolderBase]: 778/1393 cut-off events. [2024-06-28 02:11:51,869 INFO L125 PetriNetUnfolderBase]: For 11417/11417 co-relation queries the response was YES. [2024-06-28 02:11:51,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7279 conditions, 1393 events. 778/1393 cut-off events. For 11417/11417 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7292 event pairs, 146 based on Foata normal form. 2/1352 useless extension candidates. Maximal degree in co-relation 7223. Up to 1147 conditions per place. [2024-06-28 02:11:51,877 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 140 selfloop transitions, 33 changer transitions 0/179 dead transitions. [2024-06-28 02:11:51,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 179 transitions, 2111 flow [2024-06-28 02:11:51,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-28 02:11:51,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-28 02:11:51,879 INFO L175 Difference]: Start difference. First operand has 114 places, 143 transitions, 1544 flow. Second operand 8 states and 136 transitions. [2024-06-28 02:11:51,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 179 transitions, 2111 flow [2024-06-28 02:11:51,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 179 transitions, 2031 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-28 02:11:51,904 INFO L231 Difference]: Finished difference. Result has 119 places, 152 transitions, 1694 flow [2024-06-28 02:11:51,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1694, PETRI_PLACES=119, PETRI_TRANSITIONS=152} [2024-06-28 02:11:51,905 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 80 predicate places. [2024-06-28 02:11:51,905 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 152 transitions, 1694 flow [2024-06-28 02:11:51,906 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 02:11:51,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:51,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:51,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 02:11:51,906 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:51,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1555279450, now seen corresponding path program 1 times [2024-06-28 02:11:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:51,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091256417] [2024-06-28 02:11:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:52,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:52,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091256417] [2024-06-28 02:11:52,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091256417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:52,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:52,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:52,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85612541] [2024-06-28 02:11:52,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:52,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:52,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:52,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:52,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:52,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:52,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 152 transitions, 1694 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:52,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:52,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:52,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:52,719 INFO L124 PetriNetUnfolderBase]: 778/1397 cut-off events. [2024-06-28 02:11:52,720 INFO L125 PetriNetUnfolderBase]: For 12531/12531 co-relation queries the response was YES. [2024-06-28 02:11:52,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7409 conditions, 1397 events. 778/1397 cut-off events. For 12531/12531 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7357 event pairs, 145 based on Foata normal form. 1/1352 useless extension candidates. Maximal degree in co-relation 7350. Up to 1138 conditions per place. [2024-06-28 02:11:52,729 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 136 selfloop transitions, 35 changer transitions 0/177 dead transitions. [2024-06-28 02:11:52,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 177 transitions, 2166 flow [2024-06-28 02:11:52,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-28 02:11:52,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-28 02:11:52,730 INFO L175 Difference]: Start difference. First operand has 119 places, 152 transitions, 1694 flow. Second operand 7 states and 120 transitions. [2024-06-28 02:11:52,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 177 transitions, 2166 flow [2024-06-28 02:11:52,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 177 transitions, 2102 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:52,757 INFO L231 Difference]: Finished difference. Result has 123 places, 155 transitions, 1760 flow [2024-06-28 02:11:52,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1760, PETRI_PLACES=123, PETRI_TRANSITIONS=155} [2024-06-28 02:11:52,757 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 84 predicate places. [2024-06-28 02:11:52,758 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 155 transitions, 1760 flow [2024-06-28 02:11:52,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:52,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:52,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:52,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 02:11:52,758 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:52,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:52,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1678146107, now seen corresponding path program 1 times [2024-06-28 02:11:52,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:52,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188476618] [2024-06-28 02:11:52,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:52,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:53,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:53,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188476618] [2024-06-28 02:11:53,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188476618] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:53,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:53,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:53,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923664912] [2024-06-28 02:11:53,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:53,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:53,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:53,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:53,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:53,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:53,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 155 transitions, 1760 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:53,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:53,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:53,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:53,686 INFO L124 PetriNetUnfolderBase]: 798/1425 cut-off events. [2024-06-28 02:11:53,687 INFO L125 PetriNetUnfolderBase]: For 13587/13587 co-relation queries the response was YES. [2024-06-28 02:11:53,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7641 conditions, 1425 events. 798/1425 cut-off events. For 13587/13587 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7473 event pairs, 152 based on Foata normal form. 2/1382 useless extension candidates. Maximal degree in co-relation 7581. Up to 1163 conditions per place. [2024-06-28 02:11:53,697 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 148 selfloop transitions, 32 changer transitions 0/186 dead transitions. [2024-06-28 02:11:53,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 186 transitions, 2283 flow [2024-06-28 02:11:53,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-28 02:11:53,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-28 02:11:53,699 INFO L175 Difference]: Start difference. First operand has 123 places, 155 transitions, 1760 flow. Second operand 8 states and 135 transitions. [2024-06-28 02:11:53,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 186 transitions, 2283 flow [2024-06-28 02:11:53,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 186 transitions, 2203 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-28 02:11:53,732 INFO L231 Difference]: Finished difference. Result has 126 places, 158 transitions, 1803 flow [2024-06-28 02:11:53,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1680, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1803, PETRI_PLACES=126, PETRI_TRANSITIONS=158} [2024-06-28 02:11:53,733 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 87 predicate places. [2024-06-28 02:11:53,733 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 158 transitions, 1803 flow [2024-06-28 02:11:53,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:53,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:53,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:53,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 02:11:53,733 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:53,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1794331007, now seen corresponding path program 2 times [2024-06-28 02:11:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:53,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443610908] [2024-06-28 02:11:53,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:53,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:54,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:54,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443610908] [2024-06-28 02:11:54,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443610908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:54,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:54,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:54,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636613176] [2024-06-28 02:11:54,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:54,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:54,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:54,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:54,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:54,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:54,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 158 transitions, 1803 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:54,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:54,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:54,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:54,517 INFO L124 PetriNetUnfolderBase]: 794/1418 cut-off events. [2024-06-28 02:11:54,517 INFO L125 PetriNetUnfolderBase]: For 13542/13542 co-relation queries the response was YES. [2024-06-28 02:11:54,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7615 conditions, 1418 events. 794/1418 cut-off events. For 13542/13542 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7454 event pairs, 109 based on Foata normal form. 2/1375 useless extension candidates. Maximal degree in co-relation 7554. Up to 882 conditions per place. [2024-06-28 02:11:54,526 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 112 selfloop transitions, 79 changer transitions 0/197 dead transitions. [2024-06-28 02:11:54,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 197 transitions, 2503 flow [2024-06-28 02:11:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-28 02:11:54,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-28 02:11:54,527 INFO L175 Difference]: Start difference. First operand has 126 places, 158 transitions, 1803 flow. Second operand 8 states and 136 transitions. [2024-06-28 02:11:54,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 197 transitions, 2503 flow [2024-06-28 02:11:54,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 197 transitions, 2383 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-28 02:11:54,581 INFO L231 Difference]: Finished difference. Result has 131 places, 173 transitions, 2144 flow [2024-06-28 02:11:54,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1703, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2144, PETRI_PLACES=131, PETRI_TRANSITIONS=173} [2024-06-28 02:11:54,581 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 92 predicate places. [2024-06-28 02:11:54,581 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 173 transitions, 2144 flow [2024-06-28 02:11:54,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:54,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:54,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:54,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 02:11:54,582 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:54,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:54,583 INFO L85 PathProgramCache]: Analyzing trace with hash -976889921, now seen corresponding path program 3 times [2024-06-28 02:11:54,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:54,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210705971] [2024-06-28 02:11:54,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:54,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:55,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:55,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210705971] [2024-06-28 02:11:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210705971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:55,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:55,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:11:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639280894] [2024-06-28 02:11:55,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:55,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:11:55,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:55,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:11:55,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:11:55,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:55,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 173 transitions, 2144 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 02:11:55,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:55,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:55,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:55,660 INFO L124 PetriNetUnfolderBase]: 893/1564 cut-off events. [2024-06-28 02:11:55,660 INFO L125 PetriNetUnfolderBase]: For 17602/17602 co-relation queries the response was YES. [2024-06-28 02:11:55,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9302 conditions, 1564 events. 893/1564 cut-off events. For 17602/17602 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8213 event pairs, 154 based on Foata normal form. 2/1526 useless extension candidates. Maximal degree in co-relation 9237. Up to 1279 conditions per place. [2024-06-28 02:11:55,671 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 176 selfloop transitions, 53 changer transitions 0/235 dead transitions. [2024-06-28 02:11:55,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 235 transitions, 3239 flow [2024-06-28 02:11:55,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:11:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:11:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-28 02:11:55,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-06-28 02:11:55,673 INFO L175 Difference]: Start difference. First operand has 131 places, 173 transitions, 2144 flow. Second operand 9 states and 152 transitions. [2024-06-28 02:11:55,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 235 transitions, 3239 flow [2024-06-28 02:11:55,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 235 transitions, 3144 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-28 02:11:55,713 INFO L231 Difference]: Finished difference. Result has 141 places, 201 transitions, 2725 flow [2024-06-28 02:11:55,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2067, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2725, PETRI_PLACES=141, PETRI_TRANSITIONS=201} [2024-06-28 02:11:55,713 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 102 predicate places. [2024-06-28 02:11:55,713 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 201 transitions, 2725 flow [2024-06-28 02:11:55,713 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 02:11:55,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:55,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:55,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 02:11:55,714 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:55,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:55,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1045871447, now seen corresponding path program 4 times [2024-06-28 02:11:55,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:55,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401316170] [2024-06-28 02:11:55,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:55,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:56,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:56,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401316170] [2024-06-28 02:11:56,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401316170] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:56,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:56,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:11:56,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150072170] [2024-06-28 02:11:56,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:56,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:11:56,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:56,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:11:56,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:11:56,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:56,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 201 transitions, 2725 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 02:11:56,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:56,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:56,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:56,747 INFO L124 PetriNetUnfolderBase]: 908/1589 cut-off events. [2024-06-28 02:11:56,748 INFO L125 PetriNetUnfolderBase]: For 19549/19549 co-relation queries the response was YES. [2024-06-28 02:11:56,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9853 conditions, 1589 events. 908/1589 cut-off events. For 19549/19549 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8385 event pairs, 135 based on Foata normal form. 2/1551 useless extension candidates. Maximal degree in co-relation 9782. Up to 1228 conditions per place. [2024-06-28 02:11:56,756 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 155 selfloop transitions, 68 changer transitions 0/229 dead transitions. [2024-06-28 02:11:56,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 229 transitions, 3325 flow [2024-06-28 02:11:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-28 02:11:56,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2024-06-28 02:11:56,757 INFO L175 Difference]: Start difference. First operand has 141 places, 201 transitions, 2725 flow. Second operand 8 states and 134 transitions. [2024-06-28 02:11:56,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 229 transitions, 3325 flow [2024-06-28 02:11:56,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 229 transitions, 3233 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:56,808 INFO L231 Difference]: Finished difference. Result has 146 places, 203 transitions, 2823 flow [2024-06-28 02:11:56,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2633, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2823, PETRI_PLACES=146, PETRI_TRANSITIONS=203} [2024-06-28 02:11:56,808 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 107 predicate places. [2024-06-28 02:11:56,808 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 203 transitions, 2823 flow [2024-06-28 02:11:56,808 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 02:11:56,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:56,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:56,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 02:11:56,809 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:56,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:56,809 INFO L85 PathProgramCache]: Analyzing trace with hash 985568575, now seen corresponding path program 5 times [2024-06-28 02:11:56,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:56,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291941220] [2024-06-28 02:11:56,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:56,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:57,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:57,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291941220] [2024-06-28 02:11:57,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291941220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:57,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:57,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:11:57,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089737873] [2024-06-28 02:11:57,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:57,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:11:57,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:57,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:11:57,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:11:57,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:57,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 203 transitions, 2823 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 02:11:57,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:57,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:57,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:57,830 INFO L124 PetriNetUnfolderBase]: 988/1733 cut-off events. [2024-06-28 02:11:57,831 INFO L125 PetriNetUnfolderBase]: For 24227/24227 co-relation queries the response was YES. [2024-06-28 02:11:57,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10475 conditions, 1733 events. 988/1733 cut-off events. For 24227/24227 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9406 event pairs, 154 based on Foata normal form. 14/1702 useless extension candidates. Maximal degree in co-relation 10403. Up to 872 conditions per place. [2024-06-28 02:11:57,841 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 136 selfloop transitions, 95 changer transitions 0/237 dead transitions. [2024-06-28 02:11:57,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 237 transitions, 3539 flow [2024-06-28 02:11:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-28 02:11:57,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-28 02:11:57,843 INFO L175 Difference]: Start difference. First operand has 146 places, 203 transitions, 2823 flow. Second operand 8 states and 147 transitions. [2024-06-28 02:11:57,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 237 transitions, 3539 flow [2024-06-28 02:11:57,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 237 transitions, 3363 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-28 02:11:57,892 INFO L231 Difference]: Finished difference. Result has 148 places, 206 transitions, 2913 flow [2024-06-28 02:11:57,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2653, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2913, PETRI_PLACES=148, PETRI_TRANSITIONS=206} [2024-06-28 02:11:57,892 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 109 predicate places. [2024-06-28 02:11:57,892 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 206 transitions, 2913 flow [2024-06-28 02:11:57,892 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 02:11:57,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:57,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:57,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 02:11:57,893 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:57,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:57,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1242276847, now seen corresponding path program 3 times [2024-06-28 02:11:57,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:57,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244325891] [2024-06-28 02:11:57,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:58,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:58,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244325891] [2024-06-28 02:11:58,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244325891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:58,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:58,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:58,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682581280] [2024-06-28 02:11:58,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:58,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:58,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:58,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:58,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:58,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:58,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 206 transitions, 2913 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:58,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:58,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:58,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:58,737 INFO L124 PetriNetUnfolderBase]: 984/1730 cut-off events. [2024-06-28 02:11:58,737 INFO L125 PetriNetUnfolderBase]: For 20442/20442 co-relation queries the response was YES. [2024-06-28 02:11:58,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10489 conditions, 1730 events. 984/1730 cut-off events. For 20442/20442 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9429 event pairs, 153 based on Foata normal form. 2/1686 useless extension candidates. Maximal degree in co-relation 10416. Up to 1025 conditions per place. [2024-06-28 02:11:58,748 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 133 selfloop transitions, 94 changer transitions 0/233 dead transitions. [2024-06-28 02:11:58,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 233 transitions, 3521 flow [2024-06-28 02:11:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:58,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-28 02:11:58,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 02:11:58,750 INFO L175 Difference]: Start difference. First operand has 148 places, 206 transitions, 2913 flow. Second operand 8 states and 140 transitions. [2024-06-28 02:11:58,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 233 transitions, 3521 flow [2024-06-28 02:11:58,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 233 transitions, 3263 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-28 02:11:58,802 INFO L231 Difference]: Finished difference. Result has 150 places, 208 transitions, 2883 flow [2024-06-28 02:11:58,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2667, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2883, PETRI_PLACES=150, PETRI_TRANSITIONS=208} [2024-06-28 02:11:58,803 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 111 predicate places. [2024-06-28 02:11:58,803 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 208 transitions, 2883 flow [2024-06-28 02:11:58,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:58,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:58,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:58,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 02:11:58,804 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:58,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1242284566, now seen corresponding path program 1 times [2024-06-28 02:11:58,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:58,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347824784] [2024-06-28 02:11:58,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:58,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:59,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:59,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347824784] [2024-06-28 02:11:59,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347824784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:59,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:59,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:59,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608957138] [2024-06-28 02:11:59,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:59,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:59,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:59,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:59,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:59,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:59,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 208 transitions, 2883 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:59,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:59,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:59,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:59,699 INFO L124 PetriNetUnfolderBase]: 1016/1789 cut-off events. [2024-06-28 02:11:59,699 INFO L125 PetriNetUnfolderBase]: For 20159/20159 co-relation queries the response was YES. [2024-06-28 02:11:59,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10592 conditions, 1789 events. 1016/1789 cut-off events. For 20159/20159 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9857 event pairs, 162 based on Foata normal form. 2/1745 useless extension candidates. Maximal degree in co-relation 10518. Up to 1493 conditions per place. [2024-06-28 02:11:59,710 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 204 selfloop transitions, 36 changer transitions 0/246 dead transitions. [2024-06-28 02:11:59,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 246 transitions, 3664 flow [2024-06-28 02:11:59,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-28 02:11:59,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-28 02:11:59,712 INFO L175 Difference]: Start difference. First operand has 150 places, 208 transitions, 2883 flow. Second operand 8 states and 133 transitions. [2024-06-28 02:11:59,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 246 transitions, 3664 flow [2024-06-28 02:11:59,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 246 transitions, 3454 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 02:11:59,783 INFO L231 Difference]: Finished difference. Result has 153 places, 215 transitions, 2873 flow [2024-06-28 02:11:59,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2689, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2873, PETRI_PLACES=153, PETRI_TRANSITIONS=215} [2024-06-28 02:11:59,784 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 114 predicate places. [2024-06-28 02:11:59,784 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 215 transitions, 2873 flow [2024-06-28 02:11:59,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:59,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:59,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:59,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 02:11:59,784 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:59,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:59,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1251807766, now seen corresponding path program 2 times [2024-06-28 02:11:59,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:59,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118862996] [2024-06-28 02:11:59,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:59,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:00,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:00,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118862996] [2024-06-28 02:12:00,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118862996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:00,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:00,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:00,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433931807] [2024-06-28 02:12:00,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:00,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:00,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:00,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:00,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:00,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:00,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 215 transitions, 2873 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:00,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:00,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:00,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:00,762 INFO L124 PetriNetUnfolderBase]: 1042/1823 cut-off events. [2024-06-28 02:12:00,762 INFO L125 PetriNetUnfolderBase]: For 20851/20851 co-relation queries the response was YES. [2024-06-28 02:12:00,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10781 conditions, 1823 events. 1042/1823 cut-off events. For 20851/20851 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10017 event pairs, 153 based on Foata normal form. 2/1783 useless extension candidates. Maximal degree in co-relation 10705. Up to 1397 conditions per place. [2024-06-28 02:12:00,774 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 199 selfloop transitions, 47 changer transitions 0/252 dead transitions. [2024-06-28 02:12:00,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 252 transitions, 3707 flow [2024-06-28 02:12:00,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-28 02:12:00,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-28 02:12:00,775 INFO L175 Difference]: Start difference. First operand has 153 places, 215 transitions, 2873 flow. Second operand 8 states and 135 transitions. [2024-06-28 02:12:00,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 252 transitions, 3707 flow [2024-06-28 02:12:00,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 252 transitions, 3610 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-28 02:12:00,829 INFO L231 Difference]: Finished difference. Result has 156 places, 219 transitions, 2967 flow [2024-06-28 02:12:00,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2776, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2967, PETRI_PLACES=156, PETRI_TRANSITIONS=219} [2024-06-28 02:12:00,830 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 117 predicate places. [2024-06-28 02:12:00,830 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 219 transitions, 2967 flow [2024-06-28 02:12:00,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:00,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:00,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:00,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 02:12:00,831 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:00,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:00,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1251481336, now seen corresponding path program 3 times [2024-06-28 02:12:00,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:00,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107964919] [2024-06-28 02:12:00,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:00,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:01,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:01,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107964919] [2024-06-28 02:12:01,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107964919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:01,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:01,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:01,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931136426] [2024-06-28 02:12:01,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:01,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:01,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:01,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:01,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:01,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:01,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 219 transitions, 2967 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:01,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:01,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:01,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:01,841 INFO L124 PetriNetUnfolderBase]: 1039/1836 cut-off events. [2024-06-28 02:12:01,841 INFO L125 PetriNetUnfolderBase]: For 20482/20482 co-relation queries the response was YES. [2024-06-28 02:12:01,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10743 conditions, 1836 events. 1039/1836 cut-off events. For 20482/20482 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10170 event pairs, 165 based on Foata normal form. 2/1790 useless extension candidates. Maximal degree in co-relation 10666. Up to 1474 conditions per place. [2024-06-28 02:12:01,852 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 199 selfloop transitions, 50 changer transitions 0/255 dead transitions. [2024-06-28 02:12:01,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 255 transitions, 3689 flow [2024-06-28 02:12:01,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-28 02:12:01,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 02:12:01,853 INFO L175 Difference]: Start difference. First operand has 156 places, 219 transitions, 2967 flow. Second operand 9 states and 150 transitions. [2024-06-28 02:12:01,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 255 transitions, 3689 flow [2024-06-28 02:12:01,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 255 transitions, 3571 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-06-28 02:12:01,911 INFO L231 Difference]: Finished difference. Result has 161 places, 219 transitions, 2959 flow [2024-06-28 02:12:01,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2849, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2959, PETRI_PLACES=161, PETRI_TRANSITIONS=219} [2024-06-28 02:12:01,912 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 122 predicate places. [2024-06-28 02:12:01,912 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 219 transitions, 2959 flow [2024-06-28 02:12:01,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:01,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:01,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:01,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 02:12:01,912 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:01,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:01,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1982873384, now seen corresponding path program 1 times [2024-06-28 02:12:01,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:01,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449952163] [2024-06-28 02:12:01,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:01,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:01,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:01,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449952163] [2024-06-28 02:12:01,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449952163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:01,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:01,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:12:01,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573183605] [2024-06-28 02:12:01,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:01,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:12:01,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:01,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:12:01,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:12:01,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-28 02:12:01,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 219 transitions, 2959 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 02:12:01,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:01,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-28 02:12:01,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:02,171 INFO L124 PetriNetUnfolderBase]: 540/1110 cut-off events. [2024-06-28 02:12:02,172 INFO L125 PetriNetUnfolderBase]: For 11234/11326 co-relation queries the response was YES. [2024-06-28 02:12:02,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5568 conditions, 1110 events. 540/1110 cut-off events. For 11234/11326 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6376 event pairs, 97 based on Foata normal form. 130/1177 useless extension candidates. Maximal degree in co-relation 5490. Up to 383 conditions per place. [2024-06-28 02:12:02,177 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 61 selfloop transitions, 29 changer transitions 0/138 dead transitions. [2024-06-28 02:12:02,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 138 transitions, 1888 flow [2024-06-28 02:12:02,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:12:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:12:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-06-28 02:12:02,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2024-06-28 02:12:02,178 INFO L175 Difference]: Start difference. First operand has 161 places, 219 transitions, 2959 flow. Second operand 4 states and 93 transitions. [2024-06-28 02:12:02,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 138 transitions, 1888 flow [2024-06-28 02:12:02,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 1571 flow, removed 7 selfloop flow, removed 28 redundant places. [2024-06-28 02:12:02,205 INFO L231 Difference]: Finished difference. Result has 138 places, 126 transitions, 1445 flow [2024-06-28 02:12:02,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1445, PETRI_PLACES=138, PETRI_TRANSITIONS=126} [2024-06-28 02:12:02,206 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 99 predicate places. [2024-06-28 02:12:02,206 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 126 transitions, 1445 flow [2024-06-28 02:12:02,206 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 02:12:02,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:02,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:02,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 02:12:02,206 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:02,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1067967068, now seen corresponding path program 1 times [2024-06-28 02:12:02,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:02,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319439056] [2024-06-28 02:12:02,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:02,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:02,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:02,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:02,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319439056] [2024-06-28 02:12:02,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319439056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:02,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:02,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:02,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133088055] [2024-06-28 02:12:02,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:02,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:02,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:02,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:02,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:02,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:02,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 126 transitions, 1445 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 02:12:02,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:02,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:02,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:03,169 INFO L124 PetriNetUnfolderBase]: 712/1310 cut-off events. [2024-06-28 02:12:03,169 INFO L125 PetriNetUnfolderBase]: For 11618/11618 co-relation queries the response was YES. [2024-06-28 02:12:03,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6761 conditions, 1310 events. 712/1310 cut-off events. For 11618/11618 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6686 event pairs, 119 based on Foata normal form. 2/1248 useless extension candidates. Maximal degree in co-relation 6692. Up to 1085 conditions per place. [2024-06-28 02:12:03,178 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 122 selfloop transitions, 21 changer transitions 0/150 dead transitions. [2024-06-28 02:12:03,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 150 transitions, 1861 flow [2024-06-28 02:12:03,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-28 02:12:03,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-28 02:12:03,181 INFO L175 Difference]: Start difference. First operand has 138 places, 126 transitions, 1445 flow. Second operand 8 states and 124 transitions. [2024-06-28 02:12:03,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 150 transitions, 1861 flow [2024-06-28 02:12:03,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 150 transitions, 1831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 02:12:03,217 INFO L231 Difference]: Finished difference. Result has 144 places, 128 transitions, 1508 flow [2024-06-28 02:12:03,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1415, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1508, PETRI_PLACES=144, PETRI_TRANSITIONS=128} [2024-06-28 02:12:03,218 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 105 predicate places. [2024-06-28 02:12:03,218 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 128 transitions, 1508 flow [2024-06-28 02:12:03,218 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 02:12:03,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:03,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:03,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 02:12:03,219 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:03,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:03,219 INFO L85 PathProgramCache]: Analyzing trace with hash 395156994, now seen corresponding path program 2 times [2024-06-28 02:12:03,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:03,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737959965] [2024-06-28 02:12:03,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:03,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:03,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737959965] [2024-06-28 02:12:03,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737959965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:03,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:03,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:03,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784346831] [2024-06-28 02:12:03,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:03,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:03,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:03,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:03,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:03,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:03,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 128 transitions, 1508 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 02:12:03,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:03,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:03,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:04,122 INFO L124 PetriNetUnfolderBase]: 728/1338 cut-off events. [2024-06-28 02:12:04,122 INFO L125 PetriNetUnfolderBase]: For 12601/12601 co-relation queries the response was YES. [2024-06-28 02:12:04,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7078 conditions, 1338 events. 728/1338 cut-off events. For 12601/12601 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6894 event pairs, 182 based on Foata normal form. 2/1270 useless extension candidates. Maximal degree in co-relation 7007. Up to 1116 conditions per place. [2024-06-28 02:12:04,129 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 113 selfloop transitions, 29 changer transitions 0/149 dead transitions. [2024-06-28 02:12:04,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 149 transitions, 1912 flow [2024-06-28 02:12:04,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-28 02:12:04,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43214285714285716 [2024-06-28 02:12:04,130 INFO L175 Difference]: Start difference. First operand has 144 places, 128 transitions, 1508 flow. Second operand 8 states and 121 transitions. [2024-06-28 02:12:04,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 149 transitions, 1912 flow [2024-06-28 02:12:04,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 149 transitions, 1835 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:04,161 INFO L231 Difference]: Finished difference. Result has 146 places, 130 transitions, 1545 flow [2024-06-28 02:12:04,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1431, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1545, PETRI_PLACES=146, PETRI_TRANSITIONS=130} [2024-06-28 02:12:04,162 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 107 predicate places. [2024-06-28 02:12:04,162 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 130 transitions, 1545 flow [2024-06-28 02:12:04,162 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 02:12:04,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:04,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:04,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 02:12:04,162 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:04,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash 395152344, now seen corresponding path program 3 times [2024-06-28 02:12:04,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:04,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570635122] [2024-06-28 02:12:04,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:04,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:04,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 02:12:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:04,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570635122] [2024-06-28 02:12:04,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570635122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:04,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:04,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:04,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572065874] [2024-06-28 02:12:04,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:04,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:04,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:04,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:04,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:04,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:04,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 130 transitions, 1545 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 02:12:04,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:04,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:04,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:05,186 INFO L124 PetriNetUnfolderBase]: 823/1496 cut-off events. [2024-06-28 02:12:05,186 INFO L125 PetriNetUnfolderBase]: For 15483/15483 co-relation queries the response was YES. [2024-06-28 02:12:05,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8164 conditions, 1496 events. 823/1496 cut-off events. For 15483/15483 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7882 event pairs, 193 based on Foata normal form. 2/1421 useless extension candidates. Maximal degree in co-relation 8092. Up to 1207 conditions per place. [2024-06-28 02:12:05,195 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 129 selfloop transitions, 34 changer transitions 0/170 dead transitions. [2024-06-28 02:12:05,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 170 transitions, 2290 flow [2024-06-28 02:12:05,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2024-06-28 02:12:05,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43492063492063493 [2024-06-28 02:12:05,196 INFO L175 Difference]: Start difference. First operand has 146 places, 130 transitions, 1545 flow. Second operand 9 states and 137 transitions. [2024-06-28 02:12:05,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 170 transitions, 2290 flow [2024-06-28 02:12:05,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 170 transitions, 2130 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:05,240 INFO L231 Difference]: Finished difference. Result has 151 places, 145 transitions, 1787 flow [2024-06-28 02:12:05,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1787, PETRI_PLACES=151, PETRI_TRANSITIONS=145} [2024-06-28 02:12:05,240 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 112 predicate places. [2024-06-28 02:12:05,240 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 145 transitions, 1787 flow [2024-06-28 02:12:05,240 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 02:12:05,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:05,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:05,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 02:12:05,241 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:05,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:05,241 INFO L85 PathProgramCache]: Analyzing trace with hash -955205958, now seen corresponding path program 4 times [2024-06-28 02:12:05,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:05,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502562241] [2024-06-28 02:12:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:05,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:05,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:05,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502562241] [2024-06-28 02:12:05,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502562241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:05,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:05,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:05,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735102493] [2024-06-28 02:12:05,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:05,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:05,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:05,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:05,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:05,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:05,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 145 transitions, 1787 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 02:12:05,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:05,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:05,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:06,157 INFO L124 PetriNetUnfolderBase]: 882/1605 cut-off events. [2024-06-28 02:12:06,157 INFO L125 PetriNetUnfolderBase]: For 17237/17237 co-relation queries the response was YES. [2024-06-28 02:12:06,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8846 conditions, 1605 events. 882/1605 cut-off events. For 17237/17237 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8665 event pairs, 200 based on Foata normal form. 2/1526 useless extension candidates. Maximal degree in co-relation 8771. Up to 1294 conditions per place. [2024-06-28 02:12:06,166 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 134 selfloop transitions, 48 changer transitions 0/189 dead transitions. [2024-06-28 02:12:06,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 189 transitions, 2608 flow [2024-06-28 02:12:06,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2024-06-28 02:12:06,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44126984126984126 [2024-06-28 02:12:06,168 INFO L175 Difference]: Start difference. First operand has 151 places, 145 transitions, 1787 flow. Second operand 9 states and 139 transitions. [2024-06-28 02:12:06,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 189 transitions, 2608 flow [2024-06-28 02:12:06,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 189 transitions, 2466 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-28 02:12:06,219 INFO L231 Difference]: Finished difference. Result has 159 places, 163 transitions, 2152 flow [2024-06-28 02:12:06,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1702, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2152, PETRI_PLACES=159, PETRI_TRANSITIONS=163} [2024-06-28 02:12:06,220 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 120 predicate places. [2024-06-28 02:12:06,220 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 163 transitions, 2152 flow [2024-06-28 02:12:06,220 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 02:12:06,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:06,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:06,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 02:12:06,220 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:06,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:06,221 INFO L85 PathProgramCache]: Analyzing trace with hash 482922458, now seen corresponding path program 1 times [2024-06-28 02:12:06,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:06,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602311247] [2024-06-28 02:12:06,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:06,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:06,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:06,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:06,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602311247] [2024-06-28 02:12:06,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602311247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:06,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:06,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:06,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578052504] [2024-06-28 02:12:06,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:06,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:06,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:06,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:06,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:06,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:06,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 163 transitions, 2152 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 02:12:06,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:06,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:06,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:07,303 INFO L124 PetriNetUnfolderBase]: 992/1811 cut-off events. [2024-06-28 02:12:07,303 INFO L125 PetriNetUnfolderBase]: For 23350/23351 co-relation queries the response was YES. [2024-06-28 02:12:07,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9955 conditions, 1811 events. 992/1811 cut-off events. For 23350/23351 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10211 event pairs, 252 based on Foata normal form. 11/1737 useless extension candidates. Maximal degree in co-relation 9876. Up to 1382 conditions per place. [2024-06-28 02:12:07,316 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 149 selfloop transitions, 43 changer transitions 0/199 dead transitions. [2024-06-28 02:12:07,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 199 transitions, 2778 flow [2024-06-28 02:12:07,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-28 02:12:07,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-28 02:12:07,319 INFO L175 Difference]: Start difference. First operand has 159 places, 163 transitions, 2152 flow. Second operand 9 states and 138 transitions. [2024-06-28 02:12:07,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 199 transitions, 2778 flow [2024-06-28 02:12:07,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 199 transitions, 2640 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:07,381 INFO L231 Difference]: Finished difference. Result has 162 places, 170 transitions, 2222 flow [2024-06-28 02:12:07,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2026, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2222, PETRI_PLACES=162, PETRI_TRANSITIONS=170} [2024-06-28 02:12:07,381 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 123 predicate places. [2024-06-28 02:12:07,381 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 170 transitions, 2222 flow [2024-06-28 02:12:07,381 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 02:12:07,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:07,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:07,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 02:12:07,382 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:07,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:07,382 INFO L85 PathProgramCache]: Analyzing trace with hash -203817818, now seen corresponding path program 2 times [2024-06-28 02:12:07,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:07,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143427052] [2024-06-28 02:12:07,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:07,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:07,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:07,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143427052] [2024-06-28 02:12:07,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143427052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:07,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:07,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:07,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776468460] [2024-06-28 02:12:07,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:07,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:07,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:07,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:07,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:07,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:07,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 170 transitions, 2222 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:07,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:07,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:07,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:08,284 INFO L124 PetriNetUnfolderBase]: 1144/2099 cut-off events. [2024-06-28 02:12:08,285 INFO L125 PetriNetUnfolderBase]: For 32432/32432 co-relation queries the response was YES. [2024-06-28 02:12:08,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11728 conditions, 2099 events. 1144/2099 cut-off events. For 32432/32432 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12386 event pairs, 274 based on Foata normal form. 8/2026 useless extension candidates. Maximal degree in co-relation 11649. Up to 984 conditions per place. [2024-06-28 02:12:08,295 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 119 selfloop transitions, 75 changer transitions 0/201 dead transitions. [2024-06-28 02:12:08,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 201 transitions, 2904 flow [2024-06-28 02:12:08,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-28 02:12:08,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2024-06-28 02:12:08,297 INFO L175 Difference]: Start difference. First operand has 162 places, 170 transitions, 2222 flow. Second operand 8 states and 138 transitions. [2024-06-28 02:12:08,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 201 transitions, 2904 flow [2024-06-28 02:12:08,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 201 transitions, 2808 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-28 02:12:08,362 INFO L231 Difference]: Finished difference. Result has 163 places, 172 transitions, 2354 flow [2024-06-28 02:12:08,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2354, PETRI_PLACES=163, PETRI_TRANSITIONS=172} [2024-06-28 02:12:08,363 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 124 predicate places. [2024-06-28 02:12:08,363 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 172 transitions, 2354 flow [2024-06-28 02:12:08,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:08,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:08,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:08,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 02:12:08,363 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:08,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:08,364 INFO L85 PathProgramCache]: Analyzing trace with hash -203826188, now seen corresponding path program 3 times [2024-06-28 02:12:08,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:08,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073232195] [2024-06-28 02:12:08,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:08,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:08,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073232195] [2024-06-28 02:12:08,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073232195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:08,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:08,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:08,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969835027] [2024-06-28 02:12:08,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:08,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:08,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:08,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:08,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:08,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:08,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 172 transitions, 2354 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:08,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:08,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:08,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:09,263 INFO L124 PetriNetUnfolderBase]: 1228/2259 cut-off events. [2024-06-28 02:12:09,263 INFO L125 PetriNetUnfolderBase]: For 38510/38510 co-relation queries the response was YES. [2024-06-28 02:12:09,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12676 conditions, 2259 events. 1228/2259 cut-off events. For 38510/38510 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 13696 event pairs, 360 based on Foata normal form. 12/2176 useless extension candidates. Maximal degree in co-relation 12596. Up to 1622 conditions per place. [2024-06-28 02:12:09,274 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 121 selfloop transitions, 68 changer transitions 0/196 dead transitions. [2024-06-28 02:12:09,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 196 transitions, 2900 flow [2024-06-28 02:12:09,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:09,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-28 02:12:09,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-28 02:12:09,275 INFO L175 Difference]: Start difference. First operand has 163 places, 172 transitions, 2354 flow. Second operand 8 states and 132 transitions. [2024-06-28 02:12:09,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 196 transitions, 2900 flow [2024-06-28 02:12:09,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 196 transitions, 2784 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-28 02:12:09,360 INFO L231 Difference]: Finished difference. Result has 167 places, 174 transitions, 2447 flow [2024-06-28 02:12:09,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2238, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2447, PETRI_PLACES=167, PETRI_TRANSITIONS=174} [2024-06-28 02:12:09,360 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 128 predicate places. [2024-06-28 02:12:09,361 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 174 transitions, 2447 flow [2024-06-28 02:12:09,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:09,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:09,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:09,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 02:12:09,361 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:09,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:09,361 INFO L85 PathProgramCache]: Analyzing trace with hash -265537136, now seen corresponding path program 5 times [2024-06-28 02:12:09,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:09,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004996665] [2024-06-28 02:12:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:09,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:09,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:09,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004996665] [2024-06-28 02:12:09,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004996665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:09,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:09,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:09,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826118042] [2024-06-28 02:12:09,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:09,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:09,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:09,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:09,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:09,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:09,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 174 transitions, 2447 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 02:12:09,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:09,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:09,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:10,441 INFO L124 PetriNetUnfolderBase]: 1225/2254 cut-off events. [2024-06-28 02:12:10,441 INFO L125 PetriNetUnfolderBase]: For 32728/32728 co-relation queries the response was YES. [2024-06-28 02:12:10,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12759 conditions, 2254 events. 1225/2254 cut-off events. For 32728/32728 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13669 event pairs, 366 based on Foata normal form. 2/2158 useless extension candidates. Maximal degree in co-relation 12677. Up to 1747 conditions per place. [2024-06-28 02:12:10,454 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 122 selfloop transitions, 65 changer transitions 0/194 dead transitions. [2024-06-28 02:12:10,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 194 transitions, 2969 flow [2024-06-28 02:12:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-28 02:12:10,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-28 02:12:10,455 INFO L175 Difference]: Start difference. First operand has 167 places, 174 transitions, 2447 flow. Second operand 8 states and 126 transitions. [2024-06-28 02:12:10,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 194 transitions, 2969 flow [2024-06-28 02:12:10,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 194 transitions, 2790 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:10,547 INFO L231 Difference]: Finished difference. Result has 169 places, 176 transitions, 2473 flow [2024-06-28 02:12:10,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2268, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2473, PETRI_PLACES=169, PETRI_TRANSITIONS=176} [2024-06-28 02:12:10,548 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 130 predicate places. [2024-06-28 02:12:10,549 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 176 transitions, 2473 flow [2024-06-28 02:12:10,549 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 02:12:10,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:10,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:10,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 02:12:10,549 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:10,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:10,549 INFO L85 PathProgramCache]: Analyzing trace with hash -210312938, now seen corresponding path program 4 times [2024-06-28 02:12:10,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:10,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987139264] [2024-06-28 02:12:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:10,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:11,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:11,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987139264] [2024-06-28 02:12:11,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987139264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:11,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:11,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:11,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974117352] [2024-06-28 02:12:11,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:11,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:11,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:11,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:11,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:11,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:11,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 176 transitions, 2473 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 02:12:11,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:11,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:11,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:11,833 INFO L124 PetriNetUnfolderBase]: 1306/2404 cut-off events. [2024-06-28 02:12:11,833 INFO L125 PetriNetUnfolderBase]: For 38419/38419 co-relation queries the response was YES. [2024-06-28 02:12:11,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13327 conditions, 2404 events. 1306/2404 cut-off events. For 38419/38419 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14894 event pairs, 392 based on Foata normal form. 10/2313 useless extension candidates. Maximal degree in co-relation 13244. Up to 1745 conditions per place. [2024-06-28 02:12:11,848 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 130 selfloop transitions, 67 changer transitions 0/204 dead transitions. [2024-06-28 02:12:11,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 204 transitions, 3063 flow [2024-06-28 02:12:11,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-28 02:12:11,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45396825396825397 [2024-06-28 02:12:11,850 INFO L175 Difference]: Start difference. First operand has 169 places, 176 transitions, 2473 flow. Second operand 9 states and 143 transitions. [2024-06-28 02:12:11,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 204 transitions, 3063 flow [2024-06-28 02:12:11,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 204 transitions, 2872 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:11,938 INFO L231 Difference]: Finished difference. Result has 172 places, 179 transitions, 2501 flow [2024-06-28 02:12:11,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2286, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2501, PETRI_PLACES=172, PETRI_TRANSITIONS=179} [2024-06-28 02:12:11,938 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 133 predicate places. [2024-06-28 02:12:11,939 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 179 transitions, 2501 flow [2024-06-28 02:12:11,939 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 02:12:11,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:11,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:11,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 02:12:11,939 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:11,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash -210497512, now seen corresponding path program 6 times [2024-06-28 02:12:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:11,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835847159] [2024-06-28 02:12:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:12,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:12,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835847159] [2024-06-28 02:12:12,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835847159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:12,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:12,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:12,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023300995] [2024-06-28 02:12:12,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:12,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:12,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:12,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:12,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:12,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 179 transitions, 2501 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:12,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:12,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:12,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:12,959 INFO L124 PetriNetUnfolderBase]: 1306/2403 cut-off events. [2024-06-28 02:12:12,959 INFO L125 PetriNetUnfolderBase]: For 33092/33092 co-relation queries the response was YES. [2024-06-28 02:12:12,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13157 conditions, 2403 events. 1306/2403 cut-off events. For 33092/33092 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 14867 event pairs, 383 based on Foata normal form. 2/2313 useless extension candidates. Maximal degree in co-relation 13073. Up to 1487 conditions per place. [2024-06-28 02:12:12,974 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 122 selfloop transitions, 78 changer transitions 0/207 dead transitions. [2024-06-28 02:12:12,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 207 transitions, 3098 flow [2024-06-28 02:12:12,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:12,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-28 02:12:12,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-28 02:12:12,975 INFO L175 Difference]: Start difference. First operand has 172 places, 179 transitions, 2501 flow. Second operand 9 states and 145 transitions. [2024-06-28 02:12:12,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 207 transitions, 3098 flow [2024-06-28 02:12:13,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 207 transitions, 2981 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-28 02:12:13,074 INFO L231 Difference]: Finished difference. Result has 176 places, 181 transitions, 2617 flow [2024-06-28 02:12:13,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2384, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2617, PETRI_PLACES=176, PETRI_TRANSITIONS=181} [2024-06-28 02:12:13,074 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 137 predicate places. [2024-06-28 02:12:13,075 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 181 transitions, 2617 flow [2024-06-28 02:12:13,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:13,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:13,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:13,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 02:12:13,075 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:13,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash -212375164, now seen corresponding path program 5 times [2024-06-28 02:12:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:13,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64229063] [2024-06-28 02:12:13,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:13,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:13,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64229063] [2024-06-28 02:12:13,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64229063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:13,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:13,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:13,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71712163] [2024-06-28 02:12:13,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:13,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:13,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:13,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:13,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:13,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:13,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 181 transitions, 2617 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 02:12:13,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:13,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:13,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:14,155 INFO L124 PetriNetUnfolderBase]: 1362/2512 cut-off events. [2024-06-28 02:12:14,155 INFO L125 PetriNetUnfolderBase]: For 38871/38871 co-relation queries the response was YES. [2024-06-28 02:12:14,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13743 conditions, 2512 events. 1362/2512 cut-off events. For 38871/38871 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15763 event pairs, 402 based on Foata normal form. 10/2419 useless extension candidates. Maximal degree in co-relation 13658. Up to 1718 conditions per place. [2024-06-28 02:12:14,169 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 130 selfloop transitions, 72 changer transitions 0/209 dead transitions. [2024-06-28 02:12:14,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 209 transitions, 3221 flow [2024-06-28 02:12:14,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-28 02:12:14,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-28 02:12:14,171 INFO L175 Difference]: Start difference. First operand has 176 places, 181 transitions, 2617 flow. Second operand 9 states and 145 transitions. [2024-06-28 02:12:14,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 209 transitions, 3221 flow [2024-06-28 02:12:14,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 209 transitions, 3004 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-28 02:12:14,283 INFO L231 Difference]: Finished difference. Result has 178 places, 184 transitions, 2635 flow [2024-06-28 02:12:14,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2404, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2635, PETRI_PLACES=178, PETRI_TRANSITIONS=184} [2024-06-28 02:12:14,284 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 139 predicate places. [2024-06-28 02:12:14,284 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 184 transitions, 2635 flow [2024-06-28 02:12:14,284 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 02:12:14,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:14,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:14,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 02:12:14,284 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:14,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash 715941108, now seen corresponding path program 6 times [2024-06-28 02:12:14,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:14,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245848132] [2024-06-28 02:12:14,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:14,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:14,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:14,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245848132] [2024-06-28 02:12:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245848132] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:14,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:14,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:14,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563581652] [2024-06-28 02:12:14,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:14,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:14,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:14,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:14,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:14,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:14,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 184 transitions, 2635 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 02:12:14,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:14,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:14,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:15,369 INFO L124 PetriNetUnfolderBase]: 1430/2640 cut-off events. [2024-06-28 02:12:15,369 INFO L125 PetriNetUnfolderBase]: For 40852/40852 co-relation queries the response was YES. [2024-06-28 02:12:15,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14184 conditions, 2640 events. 1430/2640 cut-off events. For 40852/40852 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 16841 event pairs, 470 based on Foata normal form. 10/2547 useless extension candidates. Maximal degree in co-relation 14098. Up to 1828 conditions per place. [2024-06-28 02:12:15,383 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 136 selfloop transitions, 66 changer transitions 0/209 dead transitions. [2024-06-28 02:12:15,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 209 transitions, 3195 flow [2024-06-28 02:12:15,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-28 02:12:15,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-28 02:12:15,384 INFO L175 Difference]: Start difference. First operand has 178 places, 184 transitions, 2635 flow. Second operand 9 states and 145 transitions. [2024-06-28 02:12:15,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 209 transitions, 3195 flow [2024-06-28 02:12:15,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 209 transitions, 3054 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-28 02:12:15,496 INFO L231 Difference]: Finished difference. Result has 182 places, 185 transitions, 2678 flow [2024-06-28 02:12:15,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2494, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2678, PETRI_PLACES=182, PETRI_TRANSITIONS=185} [2024-06-28 02:12:15,496 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 143 predicate places. [2024-06-28 02:12:15,496 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 185 transitions, 2678 flow [2024-06-28 02:12:15,496 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 02:12:15,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:15,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:15,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 02:12:15,497 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:15,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:15,497 INFO L85 PathProgramCache]: Analyzing trace with hash -143883704, now seen corresponding path program 7 times [2024-06-28 02:12:15,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:15,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744278657] [2024-06-28 02:12:15,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:15,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:15,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:15,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744278657] [2024-06-28 02:12:15,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744278657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:15,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:15,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:15,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566480638] [2024-06-28 02:12:15,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:15,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:15,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:15,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:15,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:15,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:15,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 185 transitions, 2678 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:15,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:15,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:15,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:16,444 INFO L124 PetriNetUnfolderBase]: 1482/2740 cut-off events. [2024-06-28 02:12:16,445 INFO L125 PetriNetUnfolderBase]: For 40757/40757 co-relation queries the response was YES. [2024-06-28 02:12:16,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14625 conditions, 2740 events. 1482/2740 cut-off events. For 40757/40757 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 17664 event pairs, 473 based on Foata normal form. 8/2648 useless extension candidates. Maximal degree in co-relation 14538. Up to 1776 conditions per place. [2024-06-28 02:12:16,464 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 139 selfloop transitions, 67 changer transitions 0/213 dead transitions. [2024-06-28 02:12:16,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 213 transitions, 3264 flow [2024-06-28 02:12:16,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-28 02:12:16,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2024-06-28 02:12:16,465 INFO L175 Difference]: Start difference. First operand has 182 places, 185 transitions, 2678 flow. Second operand 8 states and 137 transitions. [2024-06-28 02:12:16,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 213 transitions, 3264 flow [2024-06-28 02:12:16,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 213 transitions, 3112 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-28 02:12:16,615 INFO L231 Difference]: Finished difference. Result has 183 places, 186 transitions, 2709 flow [2024-06-28 02:12:16,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2526, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2709, PETRI_PLACES=183, PETRI_TRANSITIONS=186} [2024-06-28 02:12:16,616 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 144 predicate places. [2024-06-28 02:12:16,616 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 186 transitions, 2709 flow [2024-06-28 02:12:16,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:16,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:16,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 02:12:16,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 02:12:16,616 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:16,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash 151335496, now seen corresponding path program 8 times [2024-06-28 02:12:16,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:16,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729636855] [2024-06-28 02:12:16,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:16,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:17,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:17,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729636855] [2024-06-28 02:12:17,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729636855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:17,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:17,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:17,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988999232] [2024-06-28 02:12:17,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:17,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:17,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:17,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:17,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:17,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:17,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 186 transitions, 2709 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:17,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:17,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:17,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:17,650 INFO L124 PetriNetUnfolderBase]: 1539/2859 cut-off events. [2024-06-28 02:12:17,650 INFO L125 PetriNetUnfolderBase]: For 44599/44599 co-relation queries the response was YES. [2024-06-28 02:12:17,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15206 conditions, 2859 events. 1539/2859 cut-off events. For 44599/44599 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 18677 event pairs, 508 based on Foata normal form. 8/2778 useless extension candidates. Maximal degree in co-relation 15118. Up to 1795 conditions per place. [2024-06-28 02:12:17,672 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 124 selfloop transitions, 87 changer transitions 0/218 dead transitions. [2024-06-28 02:12:17,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 218 transitions, 3443 flow [2024-06-28 02:12:17,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-28 02:12:17,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2024-06-28 02:12:17,674 INFO L175 Difference]: Start difference. First operand has 183 places, 186 transitions, 2709 flow. Second operand 8 states and 138 transitions. [2024-06-28 02:12:17,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 218 transitions, 3443 flow [2024-06-28 02:12:17,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 218 transitions, 3278 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:17,814 INFO L231 Difference]: Finished difference. Result has 185 places, 188 transitions, 2812 flow [2024-06-28 02:12:17,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2544, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2812, PETRI_PLACES=185, PETRI_TRANSITIONS=188} [2024-06-28 02:12:17,814 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 146 predicate places. [2024-06-28 02:12:17,814 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 188 transitions, 2812 flow [2024-06-28 02:12:17,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:17,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:17,814 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 02:12:17,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 02:12:17,815 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:17,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:17,815 INFO L85 PathProgramCache]: Analyzing trace with hash -694164742, now seen corresponding path program 1 times [2024-06-28 02:12:17,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:17,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691010337] [2024-06-28 02:12:17,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:18,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:18,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691010337] [2024-06-28 02:12:18,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691010337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:18,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:18,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233763801] [2024-06-28 02:12:18,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:18,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:18,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:18,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:18,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:18,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:18,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 188 transitions, 2812 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:18,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:18,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:18,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:18,942 INFO L124 PetriNetUnfolderBase]: 1532/2846 cut-off events. [2024-06-28 02:12:18,942 INFO L125 PetriNetUnfolderBase]: For 38474/38474 co-relation queries the response was YES. [2024-06-28 02:12:18,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14935 conditions, 2846 events. 1532/2846 cut-off events. For 38474/38474 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 18566 event pairs, 563 based on Foata normal form. 6/2763 useless extension candidates. Maximal degree in co-relation 14846. Up to 2489 conditions per place. [2024-06-28 02:12:18,962 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 180 selfloop transitions, 30 changer transitions 0/217 dead transitions. [2024-06-28 02:12:18,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 217 transitions, 3492 flow [2024-06-28 02:12:18,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:18,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-28 02:12:18,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2024-06-28 02:12:18,963 INFO L175 Difference]: Start difference. First operand has 185 places, 188 transitions, 2812 flow. Second operand 8 states and 127 transitions. [2024-06-28 02:12:18,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 217 transitions, 3492 flow [2024-06-28 02:12:19,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 217 transitions, 3363 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-28 02:12:19,087 INFO L231 Difference]: Finished difference. Result has 191 places, 192 transitions, 2908 flow [2024-06-28 02:12:19,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2699, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2908, PETRI_PLACES=191, PETRI_TRANSITIONS=192} [2024-06-28 02:12:19,088 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 152 predicate places. [2024-06-28 02:12:19,088 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 192 transitions, 2908 flow [2024-06-28 02:12:19,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:19,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:19,088 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 02:12:19,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 02:12:19,089 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:19,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:19,089 INFO L85 PathProgramCache]: Analyzing trace with hash -635034412, now seen corresponding path program 2 times [2024-06-28 02:12:19,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:19,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119323549] [2024-06-28 02:12:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:19,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:19,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119323549] [2024-06-28 02:12:19,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119323549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:19,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:19,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:19,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646381626] [2024-06-28 02:12:19,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:19,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:19,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:19,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:19,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:19,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:19,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 192 transitions, 2908 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 02:12:19,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:19,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:19,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:20,376 INFO L124 PetriNetUnfolderBase]: 1640/3062 cut-off events. [2024-06-28 02:12:20,376 INFO L125 PetriNetUnfolderBase]: For 38274/38274 co-relation queries the response was YES. [2024-06-28 02:12:20,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15783 conditions, 3062 events. 1640/3062 cut-off events. For 38274/38274 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 20628 event pairs, 549 based on Foata normal form. 6/2966 useless extension candidates. Maximal degree in co-relation 15690. Up to 2256 conditions per place. [2024-06-28 02:12:20,400 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 131 selfloop transitions, 82 changer transitions 0/220 dead transitions. [2024-06-28 02:12:20,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 220 transitions, 3553 flow [2024-06-28 02:12:20,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-06-28 02:12:20,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-28 02:12:20,401 INFO L175 Difference]: Start difference. First operand has 191 places, 192 transitions, 2908 flow. Second operand 9 states and 140 transitions. [2024-06-28 02:12:20,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 220 transitions, 3553 flow [2024-06-28 02:12:20,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 220 transitions, 3323 flow, removed 72 selfloop flow, removed 5 redundant places. [2024-06-28 02:12:20,544 INFO L231 Difference]: Finished difference. Result has 196 places, 196 transitions, 2989 flow [2024-06-28 02:12:20,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2682, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2989, PETRI_PLACES=196, PETRI_TRANSITIONS=196} [2024-06-28 02:12:20,544 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 157 predicate places. [2024-06-28 02:12:20,544 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 196 transitions, 2989 flow [2024-06-28 02:12:20,545 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 02:12:20,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:20,545 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 02:12:20,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 02:12:20,545 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:20,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:20,547 INFO L85 PathProgramCache]: Analyzing trace with hash 453387036, now seen corresponding path program 3 times [2024-06-28 02:12:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:20,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260850727] [2024-06-28 02:12:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:20,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:21,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:21,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260850727] [2024-06-28 02:12:21,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260850727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:21,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:21,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:21,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633289465] [2024-06-28 02:12:21,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:21,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:21,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:21,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:21,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:21,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:21,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 196 transitions, 2989 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:21,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:21,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:21,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:21,726 INFO L124 PetriNetUnfolderBase]: 1633/3050 cut-off events. [2024-06-28 02:12:21,727 INFO L125 PetriNetUnfolderBase]: For 34361/34361 co-relation queries the response was YES. [2024-06-28 02:12:21,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15571 conditions, 3050 events. 1633/3050 cut-off events. For 34361/34361 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 20508 event pairs, 554 based on Foata normal form. 6/2960 useless extension candidates. Maximal degree in co-relation 15477. Up to 2165 conditions per place. [2024-06-28 02:12:21,750 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 128 selfloop transitions, 86 changer transitions 0/221 dead transitions. [2024-06-28 02:12:21,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 221 transitions, 3544 flow [2024-06-28 02:12:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-28 02:12:21,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607142857142857 [2024-06-28 02:12:21,751 INFO L175 Difference]: Start difference. First operand has 196 places, 196 transitions, 2989 flow. Second operand 8 states and 129 transitions. [2024-06-28 02:12:21,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 221 transitions, 3544 flow [2024-06-28 02:12:21,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 221 transitions, 3359 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:21,891 INFO L231 Difference]: Finished difference. Result has 199 places, 197 transitions, 3048 flow [2024-06-28 02:12:21,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2804, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3048, PETRI_PLACES=199, PETRI_TRANSITIONS=197} [2024-06-28 02:12:21,892 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 160 predicate places. [2024-06-28 02:12:21,892 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 197 transitions, 3048 flow [2024-06-28 02:12:21,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:21,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:21,892 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 02:12:21,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 02:12:21,893 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:21,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:21,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1941594758, now seen corresponding path program 4 times [2024-06-28 02:12:21,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:21,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583392463] [2024-06-28 02:12:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:21,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:22,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:22,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583392463] [2024-06-28 02:12:22,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583392463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:22,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:22,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:22,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929446816] [2024-06-28 02:12:22,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:22,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:22,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:22,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:22,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:22,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:22,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 197 transitions, 3048 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:22,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:22,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:22,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:23,138 INFO L124 PetriNetUnfolderBase]: 1623/3031 cut-off events. [2024-06-28 02:12:23,138 INFO L125 PetriNetUnfolderBase]: For 28976/28976 co-relation queries the response was YES. [2024-06-28 02:12:23,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15422 conditions, 3031 events. 1623/3031 cut-off events. For 28976/28976 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 20272 event pairs, 558 based on Foata normal form. 8/2940 useless extension candidates. Maximal degree in co-relation 15326. Up to 2047 conditions per place. [2024-06-28 02:12:23,159 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 133 selfloop transitions, 78 changer transitions 0/218 dead transitions. [2024-06-28 02:12:23,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 218 transitions, 3486 flow [2024-06-28 02:12:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-28 02:12:23,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46785714285714286 [2024-06-28 02:12:23,160 INFO L175 Difference]: Start difference. First operand has 199 places, 197 transitions, 3048 flow. Second operand 8 states and 131 transitions. [2024-06-28 02:12:23,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 218 transitions, 3486 flow [2024-06-28 02:12:23,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 218 transitions, 3027 flow, removed 50 selfloop flow, removed 25 redundant places. [2024-06-28 02:12:23,253 INFO L231 Difference]: Finished difference. Result has 180 places, 196 transitions, 2657 flow [2024-06-28 02:12:23,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2501, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2657, PETRI_PLACES=180, PETRI_TRANSITIONS=196} [2024-06-28 02:12:23,254 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 141 predicate places. [2024-06-28 02:12:23,254 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 196 transitions, 2657 flow [2024-06-28 02:12:23,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:23,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:23,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:23,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 02:12:23,254 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:23,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1236289910, now seen corresponding path program 1 times [2024-06-28 02:12:23,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:23,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751198395] [2024-06-28 02:12:23,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:23,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:23,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:23,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751198395] [2024-06-28 02:12:23,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751198395] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:23,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:23,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:12:23,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136904537] [2024-06-28 02:12:23,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:23,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:12:23,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:23,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:12:23,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:12:23,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-28 02:12:23,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 196 transitions, 2657 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:23,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:23,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-28 02:12:23,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:23,645 INFO L124 PetriNetUnfolderBase]: 1026/2196 cut-off events. [2024-06-28 02:12:23,645 INFO L125 PetriNetUnfolderBase]: For 12190/12261 co-relation queries the response was YES. [2024-06-28 02:12:23,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9757 conditions, 2196 events. 1026/2196 cut-off events. For 12190/12261 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 15811 event pairs, 202 based on Foata normal form. 195/2306 useless extension candidates. Maximal degree in co-relation 9681. Up to 803 conditions per place. [2024-06-28 02:12:23,660 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 78 selfloop transitions, 45 changer transitions 0/170 dead transitions. [2024-06-28 02:12:23,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 170 transitions, 2571 flow [2024-06-28 02:12:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:12:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:12:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-28 02:12:23,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057142857142858 [2024-06-28 02:12:23,661 INFO L175 Difference]: Start difference. First operand has 180 places, 196 transitions, 2657 flow. Second operand 5 states and 106 transitions. [2024-06-28 02:12:23,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 170 transitions, 2571 flow [2024-06-28 02:12:23,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 170 transitions, 1863 flow, removed 56 selfloop flow, removed 41 redundant places. [2024-06-28 02:12:23,699 INFO L231 Difference]: Finished difference. Result has 145 places, 161 transitions, 1737 flow [2024-06-28 02:12:23,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1737, PETRI_PLACES=145, PETRI_TRANSITIONS=161} [2024-06-28 02:12:23,699 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 106 predicate places. [2024-06-28 02:12:23,699 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 161 transitions, 1737 flow [2024-06-28 02:12:23,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:23,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:23,700 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 02:12:23,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 02:12:23,700 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:23,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:23,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1806647256, now seen corresponding path program 1 times [2024-06-28 02:12:23,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:23,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791262758] [2024-06-28 02:12:23,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:23,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:24,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:24,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791262758] [2024-06-28 02:12:24,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791262758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:24,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:24,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-06-28 02:12:24,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931560624] [2024-06-28 02:12:24,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:24,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-28 02:12:24,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:24,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-28 02:12:24,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-06-28 02:12:24,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:12:24,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 161 transitions, 1737 flow. Second operand has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 13 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:24,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:24,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:12:24,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:24,825 INFO L124 PetriNetUnfolderBase]: 1103/2567 cut-off events. [2024-06-28 02:12:24,825 INFO L125 PetriNetUnfolderBase]: For 10334/10344 co-relation queries the response was YES. [2024-06-28 02:12:24,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10091 conditions, 2567 events. 1103/2567 cut-off events. For 10334/10344 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 20572 event pairs, 368 based on Foata normal form. 8/2412 useless extension candidates. Maximal degree in co-relation 10044. Up to 1033 conditions per place. [2024-06-28 02:12:24,837 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 84 selfloop transitions, 70 changer transitions 35/239 dead transitions. [2024-06-28 02:12:24,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 239 transitions, 2674 flow [2024-06-28 02:12:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 02:12:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 02:12:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 196 transitions. [2024-06-28 02:12:24,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-28 02:12:24,839 INFO L175 Difference]: Start difference. First operand has 145 places, 161 transitions, 1737 flow. Second operand 14 states and 196 transitions. [2024-06-28 02:12:24,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 239 transitions, 2674 flow [2024-06-28 02:12:24,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 239 transitions, 2584 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-28 02:12:24,873 INFO L231 Difference]: Finished difference. Result has 162 places, 183 transitions, 2113 flow [2024-06-28 02:12:24,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2113, PETRI_PLACES=162, PETRI_TRANSITIONS=183} [2024-06-28 02:12:24,874 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 123 predicate places. [2024-06-28 02:12:24,874 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 183 transitions, 2113 flow [2024-06-28 02:12:24,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 13 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:24,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:24,874 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 02:12:24,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 02:12:24,874 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:24,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash -880081092, now seen corresponding path program 2 times [2024-06-28 02:12:24,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:24,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578022326] [2024-06-28 02:12:24,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:24,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:25,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:25,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578022326] [2024-06-28 02:12:25,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578022326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:25,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:25,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 02:12:25,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631645646] [2024-06-28 02:12:25,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:25,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:12:25,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:25,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:12:25,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:12:25,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-06-28 02:12:25,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 183 transitions, 2113 flow. Second operand has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:25,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:25,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-06-28 02:12:25,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:25,657 INFO L124 PetriNetUnfolderBase]: 799/1973 cut-off events. [2024-06-28 02:12:25,657 INFO L125 PetriNetUnfolderBase]: For 8592/8597 co-relation queries the response was YES. [2024-06-28 02:12:25,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8157 conditions, 1973 events. 799/1973 cut-off events. For 8592/8597 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 15577 event pairs, 204 based on Foata normal form. 6/1872 useless extension candidates. Maximal degree in co-relation 8104. Up to 770 conditions per place. [2024-06-28 02:12:25,666 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 27 selfloop transitions, 13 changer transitions 177/236 dead transitions. [2024-06-28 02:12:25,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 236 transitions, 2833 flow [2024-06-28 02:12:25,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 02:12:25,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 02:12:25,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 223 transitions. [2024-06-28 02:12:25,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.530952380952381 [2024-06-28 02:12:25,667 INFO L175 Difference]: Start difference. First operand has 162 places, 183 transitions, 2113 flow. Second operand 12 states and 223 transitions. [2024-06-28 02:12:25,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 236 transitions, 2833 flow [2024-06-28 02:12:25,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 236 transitions, 2797 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:25,698 INFO L231 Difference]: Finished difference. Result has 170 places, 54 transitions, 410 flow [2024-06-28 02:12:25,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2079, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=410, PETRI_PLACES=170, PETRI_TRANSITIONS=54} [2024-06-28 02:12:25,699 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 131 predicate places. [2024-06-28 02:12:25,699 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 54 transitions, 410 flow [2024-06-28 02:12:25,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:25,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:25,699 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 02:12:25,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 02:12:25,699 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:25,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:25,700 INFO L85 PathProgramCache]: Analyzing trace with hash 839523356, now seen corresponding path program 3 times [2024-06-28 02:12:25,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:25,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638805956] [2024-06-28 02:12:25,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:25,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 02:12:25,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-28 02:12:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 02:12:25,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-28 02:12:25,746 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-28 02:12:25,747 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-28 02:12:25,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-28 02:12:25,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-28 02:12:25,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-28 02:12:25,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-28 02:12:25,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-28 02:12:25,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-28 02:12:25,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 02:12:25,750 INFO L445 BasicCegarLoop]: Path program histogram: [8, 6, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:25,754 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 02:12:25,755 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 02:12:25,811 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 02:12:25,812 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 02:12:25,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 02:12:25 BasicIcfg [2024-06-28 02:12:25,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 02:12:25,815 INFO L158 Benchmark]: Toolchain (without parser) took 51715.44ms. Allocated memory was 121.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 61.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 701.3MB. Max. memory is 16.1GB. [2024-06-28 02:12:25,815 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 02:12:25,815 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory was 78.6MB in the beginning and 78.5MB in the end (delta: 111.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 02:12:25,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.79ms. Allocated memory was 121.6MB in the beginning and 174.1MB in the end (delta: 52.4MB). Free memory was 61.4MB in the beginning and 130.9MB in the end (delta: -69.5MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-06-28 02:12:25,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.09ms. Allocated memory is still 174.1MB. Free memory was 130.9MB in the beginning and 127.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 02:12:25,816 INFO L158 Benchmark]: Boogie Preprocessor took 51.35ms. Allocated memory is still 174.1MB. Free memory was 127.6MB in the beginning and 124.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 02:12:25,816 INFO L158 Benchmark]: RCFGBuilder took 571.62ms. Allocated memory is still 174.1MB. Free memory was 124.6MB in the beginning and 139.9MB in the end (delta: -15.3MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2024-06-28 02:12:25,816 INFO L158 Benchmark]: TraceAbstraction took 50515.03ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 138.9MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 724.7MB. Max. memory is 16.1GB. [2024-06-28 02:12:25,821 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory was 78.6MB in the beginning and 78.5MB in the end (delta: 111.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.79ms. Allocated memory was 121.6MB in the beginning and 174.1MB in the end (delta: 52.4MB). Free memory was 61.4MB in the beginning and 130.9MB in the end (delta: -69.5MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.09ms. Allocated memory is still 174.1MB. Free memory was 130.9MB in the beginning and 127.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.35ms. Allocated memory is still 174.1MB. Free memory was 127.6MB in the beginning and 124.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 571.62ms. Allocated memory is still 174.1MB. Free memory was 124.6MB in the beginning and 139.9MB in the end (delta: -15.3MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * TraceAbstraction took 50515.03ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 138.9MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 724.7MB. 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L792] 0 pthread_t t2476; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] 0 //@ assert (((((((((((((!multithreaded || (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 2)))) && (!multithreaded || (((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 2)))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L794] 0 //@ assert (((((((((((((!multithreaded || (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 2)))) && (!multithreaded || (((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 2)))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); VAL [\old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, 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: 793]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds 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. - UnprovableResult [Line: 791]: 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: 50.3s, OverallIterations: 55, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2866 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2414 mSDsluCounter, 2148 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1810 mSDsCounter, 710 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14077 IncrementalHoareTripleChecker+Invalid, 14787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 710 mSolverCounterUnsat, 338 mSDtfsCounter, 14077 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3048occurred in iteration=50, InterpolantAutomatonStates: 408, 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, 23.8s InterpolantComputationTime, 811 NumberOfCodeBlocks, 811 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 732 ConstructedInterpolants, 0 QuantifiedInterpolants, 26628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 54 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 02:12:25,850 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