./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/protection/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 19:08:04,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 19:08:05,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 19:08:05,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 19:08:05,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 19:08:05,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 19:08:05,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 19:08:05,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 19:08:05,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 19:08:05,176 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 19:08:05,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 19:08:05,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 19:08:05,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 19:08:05,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 19:08:05,177 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 19:08:05,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 19:08:05,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 19:08:05,178 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 19:08:05,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 19:08:05,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 19:08:05,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 19:08:05,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 19:08:05,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 19:08:05,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 19:08:05,184 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 19:08:05,184 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 19:08:05,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 19:08:05,185 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 19:08:05,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 19:08:05,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 19:08:05,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 19:08:05,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 19:08:05,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 19:08:05,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 19:08:05,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 19:08:05,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 19:08:05,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 19:08:05,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 19:08:05,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 19:08:05,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 19:08:05,187 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 19:08:05,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 19:08:05,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 19:08:05,188 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-27 19:08:05,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 19:08:05,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 19:08:05,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 19:08:05,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 19:08:05,422 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 19:08:05,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 19:08:06,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 19:08:06,811 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 19:08:06,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 19:08:06,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dbe0ec3d/07e17bd8e02e44fc8fc94384cbd8ed24/FLAGb20de65d3 [2024-06-27 19:08:06,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dbe0ec3d/07e17bd8e02e44fc8fc94384cbd8ed24 [2024-06-27 19:08:06,840 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 19:08:06,841 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 19:08:06,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 19:08:06,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 19:08:06,963 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 19:08:06,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 19:08:06,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 19:08:06,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 19:08:06,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 07:08:06" (1/2) ... [2024-06-27 19:08:06,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f7ea10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:08:06, skipping insertion in model container [2024-06-27 19:08:06,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 07:08:06" (1/2) ... [2024-06-27 19:08:06,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5bb315d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:08:06, skipping insertion in model container [2024-06-27 19:08:06,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:08:06" (2/2) ... [2024-06-27 19:08:06,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f7ea10 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:06, skipping insertion in model container [2024-06-27 19:08:06,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:08:06" (2/2) ... [2024-06-27 19:08:06,978 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 19:08:07,064 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 19:08:07,065 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] ((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2)) [2024-06-27 19:08:07,066 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] ((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2)) [2024-06-27 19:08:07,066 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 19:08:07,066 INFO L106 edCorrectnessWitness]: ghost_update [L791-L791] multithreaded = 1; [2024-06-27 19:08:07,106 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 19:08:07,274 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.oepc_pso.oepc_rmo.oepc.i[970,983] [2024-06-27 19:08:07,473 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 19:08:07,481 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 19:08:07,508 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.oepc_pso.oepc_rmo.oepc.i[970,983] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 19:08:07,553 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 19:08:07,588 INFO L206 MainTranslator]: Completed translation [2024-06-27 19:08:07,588 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:07 WrapperNode [2024-06-27 19:08:07,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 19:08:07,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 19:08:07,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 19:08:07,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 19:08:07,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:07" (1/1) ... [2024-06-27 19:08:07,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:07" (1/1) ... [2024-06-27 19:08:07,642 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2024-06-27 19:08:07,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 19:08:07,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 19:08:07,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 19:08:07,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 19:08:07,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:07" (1/1) ... [2024-06-27 19:08:07,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:07" (1/1) ... [2024-06-27 19:08:07,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:07" (1/1) ... [2024-06-27 19:08:07,675 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-27 19:08:07,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:07" (1/1) ... [2024-06-27 19:08:07,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:07" (1/1) ... [2024-06-27 19:08:07,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:07" (1/1) ... [2024-06-27 19:08:07,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:07" (1/1) ... [2024-06-27 19:08:07,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:07" (1/1) ... [2024-06-27 19:08:07,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:07" (1/1) ... [2024-06-27 19:08:07,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 19:08:07,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 19:08:07,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 19:08:07,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 19:08:07,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:07" (1/1) ... [2024-06-27 19:08:07,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 19:08:07,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 19:08:07,748 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-27 19:08:07,798 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-27 19:08:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 19:08:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 19:08:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 19:08:07,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 19:08:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 19:08:07,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 19:08:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 19:08:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 19:08:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 19:08:07,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 19:08:07,816 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 19:08:07,912 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 19:08:07,914 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 19:08:08,120 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 19:08:08,120 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 19:08:08,227 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 19:08:08,227 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 19:08:08,228 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 07:08:08 BoogieIcfgContainer [2024-06-27 19:08:08,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 19:08:08,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 19:08:08,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 19:08:08,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 19:08:08,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 07:08:06" (1/4) ... [2024-06-27 19:08:08,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b6258a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 07:08:08, skipping insertion in model container [2024-06-27 19:08:08,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:08:06" (2/4) ... [2024-06-27 19:08:08,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b6258a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 07:08:08, skipping insertion in model container [2024-06-27 19:08:08,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:07" (3/4) ... [2024-06-27 19:08:08,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b6258a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 07:08:08, skipping insertion in model container [2024-06-27 19:08:08,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 07:08:08" (4/4) ... [2024-06-27 19:08:08,234 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 19:08:08,247 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 19:08:08,247 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 19:08:08,247 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 19:08:08,276 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 19:08:08,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 19:08:08,365 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-27 19:08:08,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 19:08:08,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 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-27 19:08:08,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 19:08:08,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 33 transitions, 72 flow [2024-06-27 19:08:08,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 19:08:08,381 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;@28c3104b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 19:08:08,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 19:08:08,384 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 19:08:08,384 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 19:08:08,385 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 19:08:08,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:08,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 19:08:08,386 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:08,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash 304230639, now seen corresponding path program 1 times [2024-06-27 19:08:08,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:08,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863880386] [2024-06-27 19:08:08,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:08,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:09,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:09,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863880386] [2024-06-27 19:08:09,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863880386] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:09,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:09,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 19:08:09,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716536788] [2024-06-27 19:08:09,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:09,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:08:09,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:09,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:08:09,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:08:09,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 19:08:09,146 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-27 19:08:09,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:09,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 19:08:09,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:09,359 INFO L124 PetriNetUnfolderBase]: 546/1040 cut-off events. [2024-06-27 19:08:09,359 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-27 19:08:09,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1969 conditions, 1040 events. 546/1040 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5481 event pairs, 392 based on Foata normal form. 43/982 useless extension candidates. Maximal degree in co-relation 1958. Up to 899 conditions per place. [2024-06-27 19:08:09,367 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 32 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-27 19:08:09,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 169 flow [2024-06-27 19:08:09,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:08:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:08:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-06-27 19:08:09,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-27 19:08:09,377 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 70 transitions. [2024-06-27 19:08:09,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 169 flow [2024-06-27 19:08:09,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 19:08:09,381 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 96 flow [2024-06-27 19:08:09,383 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-27 19:08:09,385 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-06-27 19:08:09,385 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 96 flow [2024-06-27 19:08:09,385 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-27 19:08:09,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:09,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 19:08:09,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 19:08:09,386 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:09,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:09,387 INFO L85 PathProgramCache]: Analyzing trace with hash 304231193, now seen corresponding path program 1 times [2024-06-27 19:08:09,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:09,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886276800] [2024-06-27 19:08:09,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:09,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:09,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:09,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886276800] [2024-06-27 19:08:09,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886276800] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:09,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:09,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 19:08:09,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128002958] [2024-06-27 19:08:09,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:09,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:08:09,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:08:09,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:08:09,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2024-06-27 19:08:09,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:09,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:09,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2024-06-27 19:08:09,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:09,507 INFO L124 PetriNetUnfolderBase]: 129/318 cut-off events. [2024-06-27 19:08:09,507 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-27 19:08:09,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 318 events. 129/318 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1620 event pairs, 41 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 612. Up to 195 conditions per place. [2024-06-27 19:08:09,511 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 23 selfloop transitions, 3 changer transitions 2/44 dead transitions. [2024-06-27 19:08:09,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 167 flow [2024-06-27 19:08:09,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:08:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:08:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-27 19:08:09,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7523809523809524 [2024-06-27 19:08:09,513 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 96 flow. Second operand 3 states and 79 transitions. [2024-06-27 19:08:09,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 167 flow [2024-06-27 19:08:09,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 19:08:09,516 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 88 flow [2024-06-27 19:08:09,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-06-27 19:08:09,517 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-06-27 19:08:09,517 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 88 flow [2024-06-27 19:08:09,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:09,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:09,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:09,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 19:08:09,519 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:09,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:09,524 INFO L85 PathProgramCache]: Analyzing trace with hash 307902317, now seen corresponding path program 1 times [2024-06-27 19:08:09,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:09,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075012929] [2024-06-27 19:08:09,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:09,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:09,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:09,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075012929] [2024-06-27 19:08:09,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075012929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:09,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:09,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 19:08:09,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769740219] [2024-06-27 19:08:09,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:09,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 19:08:09,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:09,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 19:08:09,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 19:08:09,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 19:08:09,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 88 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-27 19:08:09,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:09,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 19:08:09,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:10,059 INFO L124 PetriNetUnfolderBase]: 404/796 cut-off events. [2024-06-27 19:08:10,060 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2024-06-27 19:08:10,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 796 events. 404/796 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3947 event pairs, 265 based on Foata normal form. 2/760 useless extension candidates. Maximal degree in co-relation 1652. Up to 660 conditions per place. [2024-06-27 19:08:10,065 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 36 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2024-06-27 19:08:10,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 220 flow [2024-06-27 19:08:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 19:08:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 19:08:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2024-06-27 19:08:10,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2024-06-27 19:08:10,068 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 88 flow. Second operand 4 states and 82 transitions. [2024-06-27 19:08:10,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 220 flow [2024-06-27 19:08:10,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 19:08:10,071 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 131 flow [2024-06-27 19:08:10,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-27 19:08:10,072 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2024-06-27 19:08:10,072 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 131 flow [2024-06-27 19:08:10,072 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-27 19:08:10,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:10,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:10,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 19:08:10,073 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:10,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:10,074 INFO L85 PathProgramCache]: Analyzing trace with hash 955038400, now seen corresponding path program 1 times [2024-06-27 19:08:10,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:10,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873765463] [2024-06-27 19:08:10,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:10,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:10,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:10,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873765463] [2024-06-27 19:08:10,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873765463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:10,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:10,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:08:10,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811458178] [2024-06-27 19:08:10,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:10,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:08:10,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:10,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:08:10,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:08:10,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 19:08:10,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:10,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:10,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 19:08:10,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:10,561 INFO L124 PetriNetUnfolderBase]: 428/842 cut-off events. [2024-06-27 19:08:10,561 INFO L125 PetriNetUnfolderBase]: For 343/343 co-relation queries the response was YES. [2024-06-27 19:08:10,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 842 events. 428/842 cut-off events. For 343/343 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4402 event pairs, 168 based on Foata normal form. 3/805 useless extension candidates. Maximal degree in co-relation 1894. Up to 635 conditions per place. [2024-06-27 19:08:10,565 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 48 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-27 19:08:10,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 345 flow [2024-06-27 19:08:10,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:08:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:08:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-06-27 19:08:10,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2024-06-27 19:08:10,567 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 131 flow. Second operand 5 states and 108 transitions. [2024-06-27 19:08:10,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 69 transitions, 345 flow [2024-06-27 19:08:10,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 338 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 19:08:10,569 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 212 flow [2024-06-27 19:08:10,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2024-06-27 19:08:10,570 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2024-06-27 19:08:10,570 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 212 flow [2024-06-27 19:08:10,571 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-27 19:08:10,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:10,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:10,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 19:08:10,571 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:10,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash -458579476, now seen corresponding path program 1 times [2024-06-27 19:08:10,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:10,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488407398] [2024-06-27 19:08:10,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:10,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:10,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:10,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488407398] [2024-06-27 19:08:10,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488407398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:10,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:10,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:08:10,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3619629] [2024-06-27 19:08:10,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:10,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:08:10,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:10,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:08:10,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:08:11,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 19:08:11,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:11,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:11,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 19:08:11,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:11,250 INFO L124 PetriNetUnfolderBase]: 474/918 cut-off events. [2024-06-27 19:08:11,251 INFO L125 PetriNetUnfolderBase]: For 893/893 co-relation queries the response was YES. [2024-06-27 19:08:11,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2449 conditions, 918 events. 474/918 cut-off events. For 893/893 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4840 event pairs, 106 based on Foata normal form. 5/880 useless extension candidates. Maximal degree in co-relation 2430. Up to 575 conditions per place. [2024-06-27 19:08:11,255 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 74 selfloop transitions, 25 changer transitions 0/107 dead transitions. [2024-06-27 19:08:11,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 107 transitions, 654 flow [2024-06-27 19:08:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:08:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:08:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-27 19:08:11,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2024-06-27 19:08:11,257 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 212 flow. Second operand 6 states and 136 transitions. [2024-06-27 19:08:11,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 107 transitions, 654 flow [2024-06-27 19:08:11,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 107 transitions, 646 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-27 19:08:11,260 INFO L231 Difference]: Finished difference. Result has 57 places, 68 transitions, 424 flow [2024-06-27 19:08:11,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=424, PETRI_PLACES=57, PETRI_TRANSITIONS=68} [2024-06-27 19:08:11,261 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2024-06-27 19:08:11,261 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 68 transitions, 424 flow [2024-06-27 19:08:11,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:11,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:11,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:11,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 19:08:11,262 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:11,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:11,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1331060641, now seen corresponding path program 1 times [2024-06-27 19:08:11,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:11,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660417663] [2024-06-27 19:08:11,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:11,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:11,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:11,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660417663] [2024-06-27 19:08:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660417663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:11,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:11,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:08:11,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767573165] [2024-06-27 19:08:11,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:11,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:08:11,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:11,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:08:11,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:08:11,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 19:08:11,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 68 transitions, 424 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-27 19:08:11,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:11,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 19:08:11,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:12,082 INFO L124 PetriNetUnfolderBase]: 538/1038 cut-off events. [2024-06-27 19:08:12,082 INFO L125 PetriNetUnfolderBase]: For 1836/1836 co-relation queries the response was YES. [2024-06-27 19:08:12,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3349 conditions, 1038 events. 538/1038 cut-off events. For 1836/1836 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5716 event pairs, 71 based on Foata normal form. 16/1011 useless extension candidates. Maximal degree in co-relation 3324. Up to 543 conditions per place. [2024-06-27 19:08:12,088 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 81 selfloop transitions, 28 changer transitions 0/117 dead transitions. [2024-06-27 19:08:12,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 117 transitions, 838 flow [2024-06-27 19:08:12,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-06-27 19:08:12,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.636734693877551 [2024-06-27 19:08:12,090 INFO L175 Difference]: Start difference. First operand has 57 places, 68 transitions, 424 flow. Second operand 7 states and 156 transitions. [2024-06-27 19:08:12,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 117 transitions, 838 flow [2024-06-27 19:08:12,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 117 transitions, 830 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-27 19:08:12,095 INFO L231 Difference]: Finished difference. Result has 63 places, 70 transitions, 497 flow [2024-06-27 19:08:12,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=497, PETRI_PLACES=63, PETRI_TRANSITIONS=70} [2024-06-27 19:08:12,096 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2024-06-27 19:08:12,096 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 70 transitions, 497 flow [2024-06-27 19:08:12,096 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-27 19:08:12,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:12,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:12,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 19:08:12,097 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:12,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:12,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2033738082, now seen corresponding path program 1 times [2024-06-27 19:08:12,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:12,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200682602] [2024-06-27 19:08:12,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:12,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:12,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:12,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200682602] [2024-06-27 19:08:12,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200682602] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:12,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:12,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:08:12,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723263604] [2024-06-27 19:08:12,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:12,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:08:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:12,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:08:12,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:08:12,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:12,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 70 transitions, 497 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-27 19:08:12,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:12,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:12,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:12,604 INFO L124 PetriNetUnfolderBase]: 624/1174 cut-off events. [2024-06-27 19:08:12,604 INFO L125 PetriNetUnfolderBase]: For 2590/2590 co-relation queries the response was YES. [2024-06-27 19:08:12,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4113 conditions, 1174 events. 624/1174 cut-off events. For 2590/2590 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6272 event pairs, 189 based on Foata normal form. 1/1133 useless extension candidates. Maximal degree in co-relation 4084. Up to 1024 conditions per place. [2024-06-27 19:08:12,611 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 68 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2024-06-27 19:08:12,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 86 transitions, 723 flow [2024-06-27 19:08:12,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:08:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:08:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2024-06-27 19:08:12,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742857142857143 [2024-06-27 19:08:12,612 INFO L175 Difference]: Start difference. First operand has 63 places, 70 transitions, 497 flow. Second operand 5 states and 83 transitions. [2024-06-27 19:08:12,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 86 transitions, 723 flow [2024-06-27 19:08:12,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 656 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:12,618 INFO L231 Difference]: Finished difference. Result has 63 places, 73 transitions, 501 flow [2024-06-27 19:08:12,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=501, PETRI_PLACES=63, PETRI_TRANSITIONS=73} [2024-06-27 19:08:12,620 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2024-06-27 19:08:12,620 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 73 transitions, 501 flow [2024-06-27 19:08:12,620 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-27 19:08:12,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:12,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:12,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 19:08:12,620 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:12,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1377620479, now seen corresponding path program 1 times [2024-06-27 19:08:12,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:12,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391833704] [2024-06-27 19:08:12,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:12,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:12,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:12,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391833704] [2024-06-27 19:08:12,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391833704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:12,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:12,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:08:12,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003036771] [2024-06-27 19:08:12,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:12,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:08:12,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:12,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:08:12,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:08:13,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:13,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 73 transitions, 501 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-27 19:08:13,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:13,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:13,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:13,301 INFO L124 PetriNetUnfolderBase]: 620/1168 cut-off events. [2024-06-27 19:08:13,301 INFO L125 PetriNetUnfolderBase]: For 2478/2478 co-relation queries the response was YES. [2024-06-27 19:08:13,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3965 conditions, 1168 events. 620/1168 cut-off events. For 2478/2478 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6218 event pairs, 184 based on Foata normal form. 2/1128 useless extension candidates. Maximal degree in co-relation 3934. Up to 1006 conditions per place. [2024-06-27 19:08:13,308 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 70 selfloop transitions, 15 changer transitions 0/91 dead transitions. [2024-06-27 19:08:13,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 91 transitions, 735 flow [2024-06-27 19:08:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:08:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:08:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-27 19:08:13,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-27 19:08:13,311 INFO L175 Difference]: Start difference. First operand has 63 places, 73 transitions, 501 flow. Second operand 6 states and 97 transitions. [2024-06-27 19:08:13,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 91 transitions, 735 flow [2024-06-27 19:08:13,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 702 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 19:08:13,317 INFO L231 Difference]: Finished difference. Result has 68 places, 77 transitions, 552 flow [2024-06-27 19:08:13,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=68, PETRI_TRANSITIONS=77} [2024-06-27 19:08:13,319 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 29 predicate places. [2024-06-27 19:08:13,319 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 77 transitions, 552 flow [2024-06-27 19:08:13,319 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-27 19:08:13,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:13,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:13,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 19:08:13,320 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:13,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:13,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1618242380, now seen corresponding path program 1 times [2024-06-27 19:08:13,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:13,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358866615] [2024-06-27 19:08:13,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:13,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:13,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:13,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358866615] [2024-06-27 19:08:13,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358866615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:13,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:13,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:08:13,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225179336] [2024-06-27 19:08:13,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:13,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:08:13,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:13,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:08:13,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:08:13,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:13,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 77 transitions, 552 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-27 19:08:13,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:13,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:13,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:13,914 INFO L124 PetriNetUnfolderBase]: 631/1183 cut-off events. [2024-06-27 19:08:13,915 INFO L125 PetriNetUnfolderBase]: For 2702/2702 co-relation queries the response was YES. [2024-06-27 19:08:13,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4118 conditions, 1183 events. 631/1183 cut-off events. For 2702/2702 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6386 event pairs, 136 based on Foata normal form. 2/1144 useless extension candidates. Maximal degree in co-relation 4084. Up to 951 conditions per place. [2024-06-27 19:08:13,922 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 78 selfloop transitions, 19 changer transitions 0/103 dead transitions. [2024-06-27 19:08:13,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 103 transitions, 854 flow [2024-06-27 19:08:13,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:08:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:08:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-27 19:08:13,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 19:08:13,924 INFO L175 Difference]: Start difference. First operand has 68 places, 77 transitions, 552 flow. Second operand 6 states and 105 transitions. [2024-06-27 19:08:13,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 103 transitions, 854 flow [2024-06-27 19:08:13,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 103 transitions, 828 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 19:08:13,933 INFO L231 Difference]: Finished difference. Result has 71 places, 80 transitions, 605 flow [2024-06-27 19:08:13,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=605, PETRI_PLACES=71, PETRI_TRANSITIONS=80} [2024-06-27 19:08:13,934 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 32 predicate places. [2024-06-27 19:08:13,934 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 80 transitions, 605 flow [2024-06-27 19:08:13,934 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-27 19:08:13,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:13,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:13,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 19:08:13,936 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:13,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1586696780, now seen corresponding path program 2 times [2024-06-27 19:08:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:13,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537618329] [2024-06-27 19:08:13,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:13,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:14,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:14,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537618329] [2024-06-27 19:08:14,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537618329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:14,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:14,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:08:14,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946061069] [2024-06-27 19:08:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:14,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:08:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:14,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:08:14,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:08:14,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:14,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 80 transitions, 605 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-27 19:08:14,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:14,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:14,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:14,506 INFO L124 PetriNetUnfolderBase]: 626/1178 cut-off events. [2024-06-27 19:08:14,507 INFO L125 PetriNetUnfolderBase]: For 2905/2905 co-relation queries the response was YES. [2024-06-27 19:08:14,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4175 conditions, 1178 events. 626/1178 cut-off events. For 2905/2905 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6316 event pairs, 184 based on Foata normal form. 1/1136 useless extension candidates. Maximal degree in co-relation 4140. Up to 1024 conditions per place. [2024-06-27 19:08:14,514 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 78 selfloop transitions, 11 changer transitions 0/95 dead transitions. [2024-06-27 19:08:14,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 95 transitions, 822 flow [2024-06-27 19:08:14,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:08:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:08:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-27 19:08:14,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 19:08:14,515 INFO L175 Difference]: Start difference. First operand has 71 places, 80 transitions, 605 flow. Second operand 6 states and 95 transitions. [2024-06-27 19:08:14,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 95 transitions, 822 flow [2024-06-27 19:08:14,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 95 transitions, 799 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 19:08:14,524 INFO L231 Difference]: Finished difference. Result has 74 places, 80 transitions, 610 flow [2024-06-27 19:08:14,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=610, PETRI_PLACES=74, PETRI_TRANSITIONS=80} [2024-06-27 19:08:14,526 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 35 predicate places. [2024-06-27 19:08:14,526 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 80 transitions, 610 flow [2024-06-27 19:08:14,526 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-27 19:08:14,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:14,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:14,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 19:08:14,527 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:14,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:14,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1700404669, now seen corresponding path program 1 times [2024-06-27 19:08:14,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:14,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724955032] [2024-06-27 19:08:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:14,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:14,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:14,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:14,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724955032] [2024-06-27 19:08:14,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724955032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:14,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:14,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:14,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952483168] [2024-06-27 19:08:14,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:14,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:14,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:14,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:14,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:14,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:14,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 80 transitions, 610 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-27 19:08:14,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:14,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:14,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:15,186 INFO L124 PetriNetUnfolderBase]: 690/1276 cut-off events. [2024-06-27 19:08:15,187 INFO L125 PetriNetUnfolderBase]: For 3545/3545 co-relation queries the response was YES. [2024-06-27 19:08:15,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4494 conditions, 1276 events. 690/1276 cut-off events. For 3545/3545 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6890 event pairs, 121 based on Foata normal form. 6/1238 useless extension candidates. Maximal degree in co-relation 4458. Up to 785 conditions per place. [2024-06-27 19:08:15,193 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 83 selfloop transitions, 41 changer transitions 0/130 dead transitions. [2024-06-27 19:08:15,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 130 transitions, 1117 flow [2024-06-27 19:08:15,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-27 19:08:15,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2024-06-27 19:08:15,195 INFO L175 Difference]: Start difference. First operand has 74 places, 80 transitions, 610 flow. Second operand 7 states and 131 transitions. [2024-06-27 19:08:15,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 130 transitions, 1117 flow [2024-06-27 19:08:15,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 130 transitions, 1056 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:15,202 INFO L231 Difference]: Finished difference. Result has 77 places, 99 transitions, 823 flow [2024-06-27 19:08:15,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=823, PETRI_PLACES=77, PETRI_TRANSITIONS=99} [2024-06-27 19:08:15,202 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 38 predicate places. [2024-06-27 19:08:15,203 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 99 transitions, 823 flow [2024-06-27 19:08:15,203 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-27 19:08:15,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:15,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:15,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 19:08:15,203 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:15,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2036926257, now seen corresponding path program 2 times [2024-06-27 19:08:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:15,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452338377] [2024-06-27 19:08:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:15,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:15,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452338377] [2024-06-27 19:08:15,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452338377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:15,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:15,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:15,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931096292] [2024-06-27 19:08:15,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:15,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:15,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:15,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:15,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:15,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:15,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 99 transitions, 823 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-27 19:08:15,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:15,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:15,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:15,821 INFO L124 PetriNetUnfolderBase]: 710/1302 cut-off events. [2024-06-27 19:08:15,822 INFO L125 PetriNetUnfolderBase]: For 4170/4170 co-relation queries the response was YES. [2024-06-27 19:08:15,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5170 conditions, 1302 events. 710/1302 cut-off events. For 4170/4170 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6952 event pairs, 182 based on Foata normal form. 2/1262 useless extension candidates. Maximal degree in co-relation 5132. Up to 1086 conditions per place. [2024-06-27 19:08:15,830 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 100 selfloop transitions, 22 changer transitions 0/128 dead transitions. [2024-06-27 19:08:15,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 128 transitions, 1211 flow [2024-06-27 19:08:15,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-27 19:08:15,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2024-06-27 19:08:15,832 INFO L175 Difference]: Start difference. First operand has 77 places, 99 transitions, 823 flow. Second operand 7 states and 117 transitions. [2024-06-27 19:08:15,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 128 transitions, 1211 flow [2024-06-27 19:08:15,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 128 transitions, 1189 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-27 19:08:15,841 INFO L231 Difference]: Finished difference. Result has 83 places, 106 transitions, 935 flow [2024-06-27 19:08:15,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=935, PETRI_PLACES=83, PETRI_TRANSITIONS=106} [2024-06-27 19:08:15,841 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 44 predicate places. [2024-06-27 19:08:15,842 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 106 transitions, 935 flow [2024-06-27 19:08:15,842 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-27 19:08:15,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:15,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:15,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 19:08:15,842 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:15,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1906401529, now seen corresponding path program 3 times [2024-06-27 19:08:15,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:15,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012824640] [2024-06-27 19:08:15,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:15,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:16,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:16,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012824640] [2024-06-27 19:08:16,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012824640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:16,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:16,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:16,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325087128] [2024-06-27 19:08:16,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:16,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:16,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:16,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:16,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:16,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:16,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 106 transitions, 935 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-27 19:08:16,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:16,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:16,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:16,571 INFO L124 PetriNetUnfolderBase]: 722/1314 cut-off events. [2024-06-27 19:08:16,571 INFO L125 PetriNetUnfolderBase]: For 4728/4728 co-relation queries the response was YES. [2024-06-27 19:08:16,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5432 conditions, 1314 events. 722/1314 cut-off events. For 4728/4728 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6939 event pairs, 186 based on Foata normal form. 2/1276 useless extension candidates. Maximal degree in co-relation 5391. Up to 1139 conditions per place. [2024-06-27 19:08:16,580 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 104 selfloop transitions, 22 changer transitions 0/132 dead transitions. [2024-06-27 19:08:16,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 132 transitions, 1303 flow [2024-06-27 19:08:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-27 19:08:16,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46530612244897956 [2024-06-27 19:08:16,582 INFO L175 Difference]: Start difference. First operand has 83 places, 106 transitions, 935 flow. Second operand 7 states and 114 transitions. [2024-06-27 19:08:16,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 132 transitions, 1303 flow [2024-06-27 19:08:16,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 132 transitions, 1273 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 19:08:16,593 INFO L231 Difference]: Finished difference. Result has 88 places, 113 transitions, 1039 flow [2024-06-27 19:08:16,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1039, PETRI_PLACES=88, PETRI_TRANSITIONS=113} [2024-06-27 19:08:16,594 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2024-06-27 19:08:16,594 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 113 transitions, 1039 flow [2024-06-27 19:08:16,594 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-27 19:08:16,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:16,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:16,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 19:08:16,595 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:16,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:16,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1043374366, now seen corresponding path program 1 times [2024-06-27 19:08:16,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:16,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94825538] [2024-06-27 19:08:16,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:17,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:17,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94825538] [2024-06-27 19:08:17,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94825538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:17,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:17,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:17,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784714001] [2024-06-27 19:08:17,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:17,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:17,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:17,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:17,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:17,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:17,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 113 transitions, 1039 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-27 19:08:17,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:17,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:17,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:17,476 INFO L124 PetriNetUnfolderBase]: 719/1315 cut-off events. [2024-06-27 19:08:17,476 INFO L125 PetriNetUnfolderBase]: For 5020/5020 co-relation queries the response was YES. [2024-06-27 19:08:17,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5634 conditions, 1315 events. 719/1315 cut-off events. For 5020/5020 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7021 event pairs, 180 based on Foata normal form. 2/1275 useless extension candidates. Maximal degree in co-relation 5590. Up to 1134 conditions per place. [2024-06-27 19:08:17,489 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 109 selfloop transitions, 19 changer transitions 0/134 dead transitions. [2024-06-27 19:08:17,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 134 transitions, 1367 flow [2024-06-27 19:08:17,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-27 19:08:17,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-27 19:08:17,491 INFO L175 Difference]: Start difference. First operand has 88 places, 113 transitions, 1039 flow. Second operand 7 states and 112 transitions. [2024-06-27 19:08:17,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 134 transitions, 1367 flow [2024-06-27 19:08:17,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 134 transitions, 1335 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 19:08:17,504 INFO L231 Difference]: Finished difference. Result has 92 places, 115 transitions, 1072 flow [2024-06-27 19:08:17,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1072, PETRI_PLACES=92, PETRI_TRANSITIONS=115} [2024-06-27 19:08:17,505 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 53 predicate places. [2024-06-27 19:08:17,505 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 115 transitions, 1072 flow [2024-06-27 19:08:17,505 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-27 19:08:17,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:17,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:17,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 19:08:17,506 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:17,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:17,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1169122617, now seen corresponding path program 1 times [2024-06-27 19:08:17,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:17,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447133234] [2024-06-27 19:08:17,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:17,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:17,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:17,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447133234] [2024-06-27 19:08:17,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447133234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:17,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:17,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:17,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177217900] [2024-06-27 19:08:17,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:17,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:17,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:17,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:17,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:18,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:18,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 115 transitions, 1072 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-27 19:08:18,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:18,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:18,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:18,290 INFO L124 PetriNetUnfolderBase]: 729/1328 cut-off events. [2024-06-27 19:08:18,291 INFO L125 PetriNetUnfolderBase]: For 5530/5530 co-relation queries the response was YES. [2024-06-27 19:08:18,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5758 conditions, 1328 events. 729/1328 cut-off events. For 5530/5530 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7111 event pairs, 122 based on Foata normal form. 1/1287 useless extension candidates. Maximal degree in co-relation 5713. Up to 847 conditions per place. [2024-06-27 19:08:18,300 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 103 selfloop transitions, 42 changer transitions 0/151 dead transitions. [2024-06-27 19:08:18,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 151 transitions, 1573 flow [2024-06-27 19:08:18,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-27 19:08:18,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2024-06-27 19:08:18,302 INFO L175 Difference]: Start difference. First operand has 92 places, 115 transitions, 1072 flow. Second operand 7 states and 129 transitions. [2024-06-27 19:08:18,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 151 transitions, 1573 flow [2024-06-27 19:08:18,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 151 transitions, 1526 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:18,317 INFO L231 Difference]: Finished difference. Result has 94 places, 119 transitions, 1161 flow [2024-06-27 19:08:18,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1161, PETRI_PLACES=94, PETRI_TRANSITIONS=119} [2024-06-27 19:08:18,319 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 55 predicate places. [2024-06-27 19:08:18,319 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 119 transitions, 1161 flow [2024-06-27 19:08:18,319 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-27 19:08:18,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:18,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:18,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 19:08:18,319 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:18,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:18,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1169212827, now seen corresponding path program 2 times [2024-06-27 19:08:18,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:18,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398811951] [2024-06-27 19:08:18,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:18,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:18,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:18,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398811951] [2024-06-27 19:08:18,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398811951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:18,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:18,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:18,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115215381] [2024-06-27 19:08:18,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:18,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:18,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:18,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:18,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 119 transitions, 1161 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-27 19:08:18,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:18,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:18,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:19,111 INFO L124 PetriNetUnfolderBase]: 730/1326 cut-off events. [2024-06-27 19:08:19,111 INFO L125 PetriNetUnfolderBase]: For 5887/5887 co-relation queries the response was YES. [2024-06-27 19:08:19,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5929 conditions, 1326 events. 730/1326 cut-off events. For 5887/5887 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7079 event pairs, 138 based on Foata normal form. 1/1287 useless extension candidates. Maximal degree in co-relation 5883. Up to 1087 conditions per place. [2024-06-27 19:08:19,135 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 119 selfloop transitions, 27 changer transitions 0/152 dead transitions. [2024-06-27 19:08:19,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 152 transitions, 1626 flow [2024-06-27 19:08:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-27 19:08:19,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-27 19:08:19,137 INFO L175 Difference]: Start difference. First operand has 94 places, 119 transitions, 1161 flow. Second operand 7 states and 120 transitions. [2024-06-27 19:08:19,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 152 transitions, 1626 flow [2024-06-27 19:08:19,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 152 transitions, 1558 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-27 19:08:19,151 INFO L231 Difference]: Finished difference. Result has 98 places, 124 transitions, 1226 flow [2024-06-27 19:08:19,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1226, PETRI_PLACES=98, PETRI_TRANSITIONS=124} [2024-06-27 19:08:19,151 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 59 predicate places. [2024-06-27 19:08:19,151 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 124 transitions, 1226 flow [2024-06-27 19:08:19,151 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-27 19:08:19,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:19,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:19,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 19:08:19,152 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:19,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:19,152 INFO L85 PathProgramCache]: Analyzing trace with hash -352746022, now seen corresponding path program 1 times [2024-06-27 19:08:19,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:19,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411902625] [2024-06-27 19:08:19,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:19,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:19,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411902625] [2024-06-27 19:08:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411902625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:19,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:19,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:19,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777467258] [2024-06-27 19:08:19,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:19,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:19,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:19,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:19,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:19,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:19,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 124 transitions, 1226 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-27 19:08:19,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:19,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:19,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:19,819 INFO L124 PetriNetUnfolderBase]: 774/1398 cut-off events. [2024-06-27 19:08:19,819 INFO L125 PetriNetUnfolderBase]: For 7133/7133 co-relation queries the response was YES. [2024-06-27 19:08:19,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6304 conditions, 1398 events. 774/1398 cut-off events. For 7133/7133 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7515 event pairs, 118 based on Foata normal form. 2/1357 useless extension candidates. Maximal degree in co-relation 6257. Up to 819 conditions per place. [2024-06-27 19:08:19,830 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 94 selfloop transitions, 60 changer transitions 0/160 dead transitions. [2024-06-27 19:08:19,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 160 transitions, 1765 flow [2024-06-27 19:08:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-27 19:08:19,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2024-06-27 19:08:19,832 INFO L175 Difference]: Start difference. First operand has 98 places, 124 transitions, 1226 flow. Second operand 7 states and 128 transitions. [2024-06-27 19:08:19,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 160 transitions, 1765 flow [2024-06-27 19:08:19,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 160 transitions, 1692 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:19,849 INFO L231 Difference]: Finished difference. Result has 101 places, 132 transitions, 1402 flow [2024-06-27 19:08:19,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1402, PETRI_PLACES=101, PETRI_TRANSITIONS=132} [2024-06-27 19:08:19,850 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 62 predicate places. [2024-06-27 19:08:19,850 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 132 transitions, 1402 flow [2024-06-27 19:08:19,850 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-27 19:08:19,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:19,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:19,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 19:08:19,851 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:19,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:19,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1172932052, now seen corresponding path program 2 times [2024-06-27 19:08:19,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:19,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515084949] [2024-06-27 19:08:19,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:19,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:20,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:20,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515084949] [2024-06-27 19:08:20,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515084949] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:20,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:20,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:20,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122427644] [2024-06-27 19:08:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:20,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:20,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:20,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:20,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:20,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:20,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 132 transitions, 1402 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-27 19:08:20,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:20,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:20,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:20,566 INFO L124 PetriNetUnfolderBase]: 766/1380 cut-off events. [2024-06-27 19:08:20,566 INFO L125 PetriNetUnfolderBase]: For 8045/8045 co-relation queries the response was YES. [2024-06-27 19:08:20,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6578 conditions, 1380 events. 766/1380 cut-off events. For 8045/8045 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7382 event pairs, 123 based on Foata normal form. 4/1343 useless extension candidates. Maximal degree in co-relation 6529. Up to 815 conditions per place. [2024-06-27 19:08:20,576 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 96 selfloop transitions, 61 changer transitions 0/163 dead transitions. [2024-06-27 19:08:20,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 163 transitions, 1880 flow [2024-06-27 19:08:20,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:20,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 19:08:20,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 19:08:20,577 INFO L175 Difference]: Start difference. First operand has 101 places, 132 transitions, 1402 flow. Second operand 7 states and 133 transitions. [2024-06-27 19:08:20,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 163 transitions, 1880 flow [2024-06-27 19:08:20,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 163 transitions, 1820 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 19:08:20,601 INFO L231 Difference]: Finished difference. Result has 105 places, 132 transitions, 1475 flow [2024-06-27 19:08:20,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1475, PETRI_PLACES=105, PETRI_TRANSITIONS=132} [2024-06-27 19:08:20,602 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 66 predicate places. [2024-06-27 19:08:20,602 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 132 transitions, 1475 flow [2024-06-27 19:08:20,602 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-27 19:08:20,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:20,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:20,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 19:08:20,603 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:20,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:20,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1279585561, now seen corresponding path program 1 times [2024-06-27 19:08:20,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:20,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116962158] [2024-06-27 19:08:20,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:20,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:21,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:21,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116962158] [2024-06-27 19:08:21,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116962158] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:21,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:21,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:21,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439466208] [2024-06-27 19:08:21,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:21,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:21,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:21,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:21,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:21,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:21,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 132 transitions, 1475 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-27 19:08:21,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:21,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:21,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:21,531 INFO L124 PetriNetUnfolderBase]: 764/1379 cut-off events. [2024-06-27 19:08:21,531 INFO L125 PetriNetUnfolderBase]: For 8623/8623 co-relation queries the response was YES. [2024-06-27 19:08:21,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6678 conditions, 1379 events. 764/1379 cut-off events. For 8623/8623 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7323 event pairs, 182 based on Foata normal form. 1/1339 useless extension candidates. Maximal degree in co-relation 6628. Up to 1190 conditions per place. [2024-06-27 19:08:21,540 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 124 selfloop transitions, 23 changer transitions 0/153 dead transitions. [2024-06-27 19:08:21,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 153 transitions, 1860 flow [2024-06-27 19:08:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:21,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:21,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-27 19:08:21,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46122448979591835 [2024-06-27 19:08:21,545 INFO L175 Difference]: Start difference. First operand has 105 places, 132 transitions, 1475 flow. Second operand 7 states and 113 transitions. [2024-06-27 19:08:21,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 153 transitions, 1860 flow [2024-06-27 19:08:21,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 153 transitions, 1727 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:21,569 INFO L231 Difference]: Finished difference. Result has 107 places, 134 transitions, 1437 flow [2024-06-27 19:08:21,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1437, PETRI_PLACES=107, PETRI_TRANSITIONS=134} [2024-06-27 19:08:21,569 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 68 predicate places. [2024-06-27 19:08:21,569 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 134 transitions, 1437 flow [2024-06-27 19:08:21,570 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-27 19:08:21,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:21,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:21,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 19:08:21,571 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:21,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:21,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2015439136, now seen corresponding path program 3 times [2024-06-27 19:08:21,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:21,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292266210] [2024-06-27 19:08:21,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:21,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:21,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:21,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292266210] [2024-06-27 19:08:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292266210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:21,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:21,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:21,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857229736] [2024-06-27 19:08:21,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:21,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:21,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:21,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:21,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:21,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:21,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 134 transitions, 1437 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-27 19:08:21,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:21,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:21,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:22,176 INFO L124 PetriNetUnfolderBase]: 772/1387 cut-off events. [2024-06-27 19:08:22,176 INFO L125 PetriNetUnfolderBase]: For 8653/8653 co-relation queries the response was YES. [2024-06-27 19:08:22,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6591 conditions, 1387 events. 772/1387 cut-off events. For 8653/8653 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7343 event pairs, 190 based on Foata normal form. 2/1349 useless extension candidates. Maximal degree in co-relation 6540. Up to 1188 conditions per place. [2024-06-27 19:08:22,187 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 129 selfloop transitions, 23 changer transitions 0/158 dead transitions. [2024-06-27 19:08:22,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 158 transitions, 1845 flow [2024-06-27 19:08:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-27 19:08:22,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47346938775510206 [2024-06-27 19:08:22,190 INFO L175 Difference]: Start difference. First operand has 107 places, 134 transitions, 1437 flow. Second operand 7 states and 116 transitions. [2024-06-27 19:08:22,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 158 transitions, 1845 flow [2024-06-27 19:08:22,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 158 transitions, 1799 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:22,216 INFO L231 Difference]: Finished difference. Result has 109 places, 137 transitions, 1485 flow [2024-06-27 19:08:22,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1485, PETRI_PLACES=109, PETRI_TRANSITIONS=137} [2024-06-27 19:08:22,216 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 70 predicate places. [2024-06-27 19:08:22,216 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 137 transitions, 1485 flow [2024-06-27 19:08:22,217 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-27 19:08:22,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:22,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:22,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 19:08:22,217 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:22,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1883002816, now seen corresponding path program 1 times [2024-06-27 19:08:22,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:22,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496861898] [2024-06-27 19:08:22,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:22,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:22,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:22,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496861898] [2024-06-27 19:08:22,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496861898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:22,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:22,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:22,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926257387] [2024-06-27 19:08:22,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:22,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:22,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:22,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:22,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:22,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:22,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 137 transitions, 1485 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-27 19:08:22,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:22,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:22,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:23,186 INFO L124 PetriNetUnfolderBase]: 820/1470 cut-off events. [2024-06-27 19:08:23,186 INFO L125 PetriNetUnfolderBase]: For 9363/9363 co-relation queries the response was YES. [2024-06-27 19:08:23,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7114 conditions, 1470 events. 820/1470 cut-off events. For 9363/9363 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7963 event pairs, 96 based on Foata normal form. 2/1432 useless extension candidates. Maximal degree in co-relation 7062. Up to 1071 conditions per place. [2024-06-27 19:08:23,194 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 150 selfloop transitions, 38 changer transitions 0/194 dead transitions. [2024-06-27 19:08:23,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 194 transitions, 2261 flow [2024-06-27 19:08:23,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 19:08:23,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2024-06-27 19:08:23,196 INFO L175 Difference]: Start difference. First operand has 109 places, 137 transitions, 1485 flow. Second operand 8 states and 141 transitions. [2024-06-27 19:08:23,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 194 transitions, 2261 flow [2024-06-27 19:08:23,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 194 transitions, 2215 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:23,217 INFO L231 Difference]: Finished difference. Result has 114 places, 153 transitions, 1756 flow [2024-06-27 19:08:23,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1756, PETRI_PLACES=114, PETRI_TRANSITIONS=153} [2024-06-27 19:08:23,218 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 75 predicate places. [2024-06-27 19:08:23,218 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 153 transitions, 1756 flow [2024-06-27 19:08:23,218 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-27 19:08:23,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:23,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:23,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 19:08:23,219 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:23,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1831510248, now seen corresponding path program 2 times [2024-06-27 19:08:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:23,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026225934] [2024-06-27 19:08:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:23,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:23,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:23,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026225934] [2024-06-27 19:08:23,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026225934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:23,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:23,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:23,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834592846] [2024-06-27 19:08:23,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:23,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:23,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:23,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:23,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:23,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:23,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 153 transitions, 1756 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-27 19:08:23,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:23,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:23,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:24,286 INFO L124 PetriNetUnfolderBase]: 824/1493 cut-off events. [2024-06-27 19:08:24,287 INFO L125 PetriNetUnfolderBase]: For 10369/10369 co-relation queries the response was YES. [2024-06-27 19:08:24,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7502 conditions, 1493 events. 824/1493 cut-off events. For 10369/10369 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8214 event pairs, 139 based on Foata normal form. 2/1450 useless extension candidates. Maximal degree in co-relation 7447. Up to 1166 conditions per place. [2024-06-27 19:08:24,298 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 152 selfloop transitions, 42 changer transitions 0/200 dead transitions. [2024-06-27 19:08:24,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 200 transitions, 2395 flow [2024-06-27 19:08:24,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:08:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:08:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-27 19:08:24,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-06-27 19:08:24,300 INFO L175 Difference]: Start difference. First operand has 114 places, 153 transitions, 1756 flow. Second operand 9 states and 156 transitions. [2024-06-27 19:08:24,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 200 transitions, 2395 flow [2024-06-27 19:08:24,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 200 transitions, 2287 flow, removed 44 selfloop flow, removed 3 redundant places. [2024-06-27 19:08:24,330 INFO L231 Difference]: Finished difference. Result has 121 places, 158 transitions, 1840 flow [2024-06-27 19:08:24,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1668, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1840, PETRI_PLACES=121, PETRI_TRANSITIONS=158} [2024-06-27 19:08:24,331 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 82 predicate places. [2024-06-27 19:08:24,331 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 158 transitions, 1840 flow [2024-06-27 19:08:24,331 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-27 19:08:24,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:24,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:24,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 19:08:24,332 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:24,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:24,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1834311532, now seen corresponding path program 1 times [2024-06-27 19:08:24,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:24,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133247189] [2024-06-27 19:08:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:24,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:24,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:24,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133247189] [2024-06-27 19:08:24,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133247189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:24,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:24,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:24,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616313205] [2024-06-27 19:08:24,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:24,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:24,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:24,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:24,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:24,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:24,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 158 transitions, 1840 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-27 19:08:24,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:24,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:24,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:25,151 INFO L124 PetriNetUnfolderBase]: 820/1475 cut-off events. [2024-06-27 19:08:25,152 INFO L125 PetriNetUnfolderBase]: For 9542/9542 co-relation queries the response was YES. [2024-06-27 19:08:25,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7353 conditions, 1475 events. 820/1475 cut-off events. For 9542/9542 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8004 event pairs, 127 based on Foata normal form. 2/1435 useless extension candidates. Maximal degree in co-relation 7295. Up to 1032 conditions per place. [2024-06-27 19:08:25,164 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 125 selfloop transitions, 54 changer transitions 0/185 dead transitions. [2024-06-27 19:08:25,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 185 transitions, 2328 flow [2024-06-27 19:08:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-27 19:08:25,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-06-27 19:08:25,166 INFO L175 Difference]: Start difference. First operand has 121 places, 158 transitions, 1840 flow. Second operand 7 states and 127 transitions. [2024-06-27 19:08:25,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 185 transitions, 2328 flow [2024-06-27 19:08:25,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 185 transitions, 2206 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:25,202 INFO L231 Difference]: Finished difference. Result has 122 places, 158 transitions, 1838 flow [2024-06-27 19:08:25,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1838, PETRI_PLACES=122, PETRI_TRANSITIONS=158} [2024-06-27 19:08:25,202 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 83 predicate places. [2024-06-27 19:08:25,202 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 158 transitions, 1838 flow [2024-06-27 19:08:25,203 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-27 19:08:25,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:25,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:25,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 19:08:25,203 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:25,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:25,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2001335644, now seen corresponding path program 1 times [2024-06-27 19:08:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398538155] [2024-06-27 19:08:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:25,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:25,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:25,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398538155] [2024-06-27 19:08:25,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398538155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:25,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:25,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:25,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146000733] [2024-06-27 19:08:25,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:25,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:25,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:25,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:25,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:25,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:25,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 158 transitions, 1838 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-27 19:08:25,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:25,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:25,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:26,232 INFO L124 PetriNetUnfolderBase]: 915/1634 cut-off events. [2024-06-27 19:08:26,232 INFO L125 PetriNetUnfolderBase]: For 13619/13619 co-relation queries the response was YES. [2024-06-27 19:08:26,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7977 conditions, 1634 events. 915/1634 cut-off events. For 13619/13619 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9081 event pairs, 139 based on Foata normal form. 14/1608 useless extension candidates. Maximal degree in co-relation 7918. Up to 911 conditions per place. [2024-06-27 19:08:26,243 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 120 selfloop transitions, 71 changer transitions 0/197 dead transitions. [2024-06-27 19:08:26,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 197 transitions, 2416 flow [2024-06-27 19:08:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 19:08:26,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-06-27 19:08:26,251 INFO L175 Difference]: Start difference. First operand has 122 places, 158 transitions, 1838 flow. Second operand 8 states and 150 transitions. [2024-06-27 19:08:26,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 197 transitions, 2416 flow [2024-06-27 19:08:26,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 197 transitions, 2337 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 19:08:26,281 INFO L231 Difference]: Finished difference. Result has 126 places, 161 transitions, 1941 flow [2024-06-27 19:08:26,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1759, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1941, PETRI_PLACES=126, PETRI_TRANSITIONS=161} [2024-06-27 19:08:26,282 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 87 predicate places. [2024-06-27 19:08:26,282 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 161 transitions, 1941 flow [2024-06-27 19:08:26,282 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-27 19:08:26,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:26,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:26,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 19:08:26,282 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:26,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:26,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1826033402, now seen corresponding path program 2 times [2024-06-27 19:08:26,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:26,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122347185] [2024-06-27 19:08:26,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:26,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:26,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:26,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122347185] [2024-06-27 19:08:26,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122347185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:26,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:26,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:26,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120349563] [2024-06-27 19:08:26,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:26,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:26,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:26,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:26,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:26,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:26,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 161 transitions, 1941 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-27 19:08:26,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:26,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:26,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:27,310 INFO L124 PetriNetUnfolderBase]: 930/1664 cut-off events. [2024-06-27 19:08:27,310 INFO L125 PetriNetUnfolderBase]: For 12887/12887 co-relation queries the response was YES. [2024-06-27 19:08:27,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8276 conditions, 1664 events. 930/1664 cut-off events. For 12887/12887 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9295 event pairs, 224 based on Foata normal form. 2/1625 useless extension candidates. Maximal degree in co-relation 8216. Up to 1452 conditions per place. [2024-06-27 19:08:27,324 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 156 selfloop transitions, 25 changer transitions 0/187 dead transitions. [2024-06-27 19:08:27,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 187 transitions, 2399 flow [2024-06-27 19:08:27,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-27 19:08:27,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-27 19:08:27,326 INFO L175 Difference]: Start difference. First operand has 126 places, 161 transitions, 1941 flow. Second operand 8 states and 128 transitions. [2024-06-27 19:08:27,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 187 transitions, 2399 flow [2024-06-27 19:08:27,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 187 transitions, 2249 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:27,360 INFO L231 Difference]: Finished difference. Result has 128 places, 163 transitions, 1875 flow [2024-06-27 19:08:27,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1791, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1875, PETRI_PLACES=128, PETRI_TRANSITIONS=163} [2024-06-27 19:08:27,361 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 89 predicate places. [2024-06-27 19:08:27,361 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 163 transitions, 1875 flow [2024-06-27 19:08:27,361 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-27 19:08:27,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:27,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:27,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 19:08:27,362 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:27,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:27,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1690296864, now seen corresponding path program 3 times [2024-06-27 19:08:27,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:27,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300700901] [2024-06-27 19:08:27,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:27,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:27,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:27,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300700901] [2024-06-27 19:08:27,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300700901] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:27,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:27,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:27,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843148330] [2024-06-27 19:08:27,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:27,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:27,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:27,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:27,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:27,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:27,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 163 transitions, 1875 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-27 19:08:27,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:27,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:27,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:28,337 INFO L124 PetriNetUnfolderBase]: 945/1689 cut-off events. [2024-06-27 19:08:28,337 INFO L125 PetriNetUnfolderBase]: For 12558/12558 co-relation queries the response was YES. [2024-06-27 19:08:28,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8176 conditions, 1689 events. 945/1689 cut-off events. For 12558/12558 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9484 event pairs, 228 based on Foata normal form. 2/1650 useless extension candidates. Maximal degree in co-relation 8115. Up to 1454 conditions per place. [2024-06-27 19:08:28,348 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 154 selfloop transitions, 31 changer transitions 0/191 dead transitions. [2024-06-27 19:08:28,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 191 transitions, 2357 flow [2024-06-27 19:08:28,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-27 19:08:28,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46785714285714286 [2024-06-27 19:08:28,353 INFO L175 Difference]: Start difference. First operand has 128 places, 163 transitions, 1875 flow. Second operand 8 states and 131 transitions. [2024-06-27 19:08:28,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 191 transitions, 2357 flow [2024-06-27 19:08:28,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 191 transitions, 2291 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:28,388 INFO L231 Difference]: Finished difference. Result has 130 places, 165 transitions, 1908 flow [2024-06-27 19:08:28,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1908, PETRI_PLACES=130, PETRI_TRANSITIONS=165} [2024-06-27 19:08:28,389 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 91 predicate places. [2024-06-27 19:08:28,389 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 165 transitions, 1908 flow [2024-06-27 19:08:28,389 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-27 19:08:28,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:28,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:28,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 19:08:28,390 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:28,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1955397084, now seen corresponding path program 4 times [2024-06-27 19:08:28,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:28,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864598322] [2024-06-27 19:08:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:28,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:28,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864598322] [2024-06-27 19:08:28,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864598322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:28,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:28,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:28,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229520223] [2024-06-27 19:08:28,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:28,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:28,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:28,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:28,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:28,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:28,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 165 transitions, 1908 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-27 19:08:28,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:28,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:28,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:29,273 INFO L124 PetriNetUnfolderBase]: 948/1691 cut-off events. [2024-06-27 19:08:29,273 INFO L125 PetriNetUnfolderBase]: For 12604/12604 co-relation queries the response was YES. [2024-06-27 19:08:29,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8209 conditions, 1691 events. 948/1691 cut-off events. For 12604/12604 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9421 event pairs, 230 based on Foata normal form. 2/1653 useless extension candidates. Maximal degree in co-relation 8147. Up to 1495 conditions per place. [2024-06-27 19:08:29,284 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 165 selfloop transitions, 22 changer transitions 0/193 dead transitions. [2024-06-27 19:08:29,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 193 transitions, 2394 flow [2024-06-27 19:08:29,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:29,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-27 19:08:29,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2024-06-27 19:08:29,303 INFO L175 Difference]: Start difference. First operand has 130 places, 165 transitions, 1908 flow. Second operand 8 states and 127 transitions. [2024-06-27 19:08:29,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 193 transitions, 2394 flow [2024-06-27 19:08:29,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 193 transitions, 2311 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:29,344 INFO L231 Difference]: Finished difference. Result has 133 places, 170 transitions, 1938 flow [2024-06-27 19:08:29,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1938, PETRI_PLACES=133, PETRI_TRANSITIONS=170} [2024-06-27 19:08:29,345 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 94 predicate places. [2024-06-27 19:08:29,345 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 170 transitions, 1938 flow [2024-06-27 19:08:29,345 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-27 19:08:29,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:29,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:29,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 19:08:29,346 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:29,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:29,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1137563426, now seen corresponding path program 1 times [2024-06-27 19:08:29,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:29,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772209969] [2024-06-27 19:08:29,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:29,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:29,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:29,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772209969] [2024-06-27 19:08:29,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772209969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:29,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:29,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:29,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204947997] [2024-06-27 19:08:29,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:29,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:29,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:29,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:29,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:29,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:29,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 170 transitions, 1938 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-27 19:08:29,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:29,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:29,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:30,159 INFO L124 PetriNetUnfolderBase]: 949/1686 cut-off events. [2024-06-27 19:08:30,160 INFO L125 PetriNetUnfolderBase]: For 12746/12746 co-relation queries the response was YES. [2024-06-27 19:08:30,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8263 conditions, 1686 events. 949/1686 cut-off events. For 12746/12746 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9380 event pairs, 231 based on Foata normal form. 1/1647 useless extension candidates. Maximal degree in co-relation 8199. Up to 1469 conditions per place. [2024-06-27 19:08:30,170 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 162 selfloop transitions, 32 changer transitions 0/200 dead transitions. [2024-06-27 19:08:30,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 200 transitions, 2545 flow [2024-06-27 19:08:30,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-27 19:08:30,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2024-06-27 19:08:30,172 INFO L175 Difference]: Start difference. First operand has 133 places, 170 transitions, 1938 flow. Second operand 7 states and 117 transitions. [2024-06-27 19:08:30,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 200 transitions, 2545 flow [2024-06-27 19:08:30,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 200 transitions, 2455 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:30,213 INFO L231 Difference]: Finished difference. Result has 137 places, 180 transitions, 2108 flow [2024-06-27 19:08:30,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1853, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2108, PETRI_PLACES=137, PETRI_TRANSITIONS=180} [2024-06-27 19:08:30,213 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 98 predicate places. [2024-06-27 19:08:30,214 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 180 transitions, 2108 flow [2024-06-27 19:08:30,214 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-27 19:08:30,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:30,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:30,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 19:08:30,214 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:30,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:30,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1722823421, now seen corresponding path program 1 times [2024-06-27 19:08:30,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:30,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817332727] [2024-06-27 19:08:30,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:30,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:30,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817332727] [2024-06-27 19:08:30,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817332727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:30,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:30,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:08:30,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237284841] [2024-06-27 19:08:30,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:30,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 19:08:30,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:30,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 19:08:30,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 19:08:30,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 19:08:30,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 180 transitions, 2108 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-27 19:08:30,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:30,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 19:08:30,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:30,418 INFO L124 PetriNetUnfolderBase]: 490/1009 cut-off events. [2024-06-27 19:08:30,419 INFO L125 PetriNetUnfolderBase]: For 6132/6210 co-relation queries the response was YES. [2024-06-27 19:08:30,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 1009 events. 490/1009 cut-off events. For 6132/6210 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5802 event pairs, 76 based on Foata normal form. 109/1065 useless extension candidates. Maximal degree in co-relation 4062. Up to 426 conditions per place. [2024-06-27 19:08:30,424 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 55 selfloop transitions, 22 changer transitions 0/114 dead transitions. [2024-06-27 19:08:30,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 114 transitions, 1329 flow [2024-06-27 19:08:30,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 19:08:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 19:08:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-06-27 19:08:30,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2024-06-27 19:08:30,426 INFO L175 Difference]: Start difference. First operand has 137 places, 180 transitions, 2108 flow. Second operand 4 states and 93 transitions. [2024-06-27 19:08:30,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 114 transitions, 1329 flow [2024-06-27 19:08:30,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 114 transitions, 1034 flow, removed 15 selfloop flow, removed 29 redundant places. [2024-06-27 19:08:30,442 INFO L231 Difference]: Finished difference. Result has 113 places, 101 transitions, 914 flow [2024-06-27 19:08:30,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=914, PETRI_PLACES=113, PETRI_TRANSITIONS=101} [2024-06-27 19:08:30,443 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 74 predicate places. [2024-06-27 19:08:30,443 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 101 transitions, 914 flow [2024-06-27 19:08:30,443 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-27 19:08:30,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:30,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:30,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 19:08:30,443 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:30,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:30,444 INFO L85 PathProgramCache]: Analyzing trace with hash 684112375, now seen corresponding path program 1 times [2024-06-27 19:08:30,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:30,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212102412] [2024-06-27 19:08:30,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:30,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:30,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212102412] [2024-06-27 19:08:30,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212102412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:30,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:30,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43383983] [2024-06-27 19:08:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:30,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:30,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:30,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:30,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:30,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 101 transitions, 914 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-27 19:08:30,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:30,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:30,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:31,266 INFO L124 PetriNetUnfolderBase]: 1234/2295 cut-off events. [2024-06-27 19:08:31,266 INFO L125 PetriNetUnfolderBase]: For 16056/16056 co-relation queries the response was YES. [2024-06-27 19:08:31,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9648 conditions, 2295 events. 1234/2295 cut-off events. For 16056/16056 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 14202 event pairs, 343 based on Foata normal form. 8/2233 useless extension candidates. Maximal degree in co-relation 9593. Up to 974 conditions per place. [2024-06-27 19:08:31,279 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 135 selfloop transitions, 58 changer transitions 0/200 dead transitions. [2024-06-27 19:08:31,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 200 transitions, 2100 flow [2024-06-27 19:08:31,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:08:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:08:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-27 19:08:31,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-27 19:08:31,281 INFO L175 Difference]: Start difference. First operand has 113 places, 101 transitions, 914 flow. Second operand 9 states and 160 transitions. [2024-06-27 19:08:31,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 200 transitions, 2100 flow [2024-06-27 19:08:31,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 200 transitions, 2052 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-27 19:08:31,313 INFO L231 Difference]: Finished difference. Result has 122 places, 133 transitions, 1429 flow [2024-06-27 19:08:31,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1429, PETRI_PLACES=122, PETRI_TRANSITIONS=133} [2024-06-27 19:08:31,313 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 83 predicate places. [2024-06-27 19:08:31,314 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 133 transitions, 1429 flow [2024-06-27 19:08:31,314 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-27 19:08:31,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:31,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:31,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 19:08:31,314 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:31,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1756454217, now seen corresponding path program 2 times [2024-06-27 19:08:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:31,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070397801] [2024-06-27 19:08:31,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:31,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:31,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070397801] [2024-06-27 19:08:31,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070397801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:31,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:31,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050222877] [2024-06-27 19:08:31,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:31,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:31,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:31,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:31,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:31,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:31,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 133 transitions, 1429 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-27 19:08:31,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:31,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:31,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:32,166 INFO L124 PetriNetUnfolderBase]: 1348/2487 cut-off events. [2024-06-27 19:08:32,166 INFO L125 PetriNetUnfolderBase]: For 21305/21305 co-relation queries the response was YES. [2024-06-27 19:08:32,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11341 conditions, 2487 events. 1348/2487 cut-off events. For 21305/21305 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15601 event pairs, 398 based on Foata normal form. 8/2408 useless extension candidates. Maximal degree in co-relation 11282. Up to 1342 conditions per place. [2024-06-27 19:08:32,182 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 95 selfloop transitions, 67 changer transitions 0/169 dead transitions. [2024-06-27 19:08:32,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 169 transitions, 1983 flow [2024-06-27 19:08:32,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 19:08:32,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2024-06-27 19:08:32,184 INFO L175 Difference]: Start difference. First operand has 122 places, 133 transitions, 1429 flow. Second operand 8 states and 141 transitions. [2024-06-27 19:08:32,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 169 transitions, 1983 flow [2024-06-27 19:08:32,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 169 transitions, 1961 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 19:08:32,227 INFO L231 Difference]: Finished difference. Result has 128 places, 135 transitions, 1593 flow [2024-06-27 19:08:32,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1593, PETRI_PLACES=128, PETRI_TRANSITIONS=135} [2024-06-27 19:08:32,228 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 89 predicate places. [2024-06-27 19:08:32,228 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 135 transitions, 1593 flow [2024-06-27 19:08:32,228 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-27 19:08:32,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:32,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:32,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 19:08:32,229 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:32,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:32,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1754580267, now seen corresponding path program 3 times [2024-06-27 19:08:32,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:32,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626081358] [2024-06-27 19:08:32,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:32,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:32,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:32,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626081358] [2024-06-27 19:08:32,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626081358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:32,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:32,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:32,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414175274] [2024-06-27 19:08:32,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:32,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:32,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:32,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:32,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:32,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:32,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 135 transitions, 1593 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-27 19:08:32,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:32,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:32,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:33,287 INFO L124 PetriNetUnfolderBase]: 1614/2997 cut-off events. [2024-06-27 19:08:33,287 INFO L125 PetriNetUnfolderBase]: For 36419/36419 co-relation queries the response was YES. [2024-06-27 19:08:33,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14112 conditions, 2997 events. 1614/2997 cut-off events. For 36419/36419 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 19881 event pairs, 560 based on Foata normal form. 16/2916 useless extension candidates. Maximal degree in co-relation 14051. Up to 1562 conditions per place. [2024-06-27 19:08:33,305 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 104 selfloop transitions, 60 changer transitions 0/171 dead transitions. [2024-06-27 19:08:33,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 171 transitions, 2194 flow [2024-06-27 19:08:33,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 19:08:33,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2024-06-27 19:08:33,306 INFO L175 Difference]: Start difference. First operand has 128 places, 135 transitions, 1593 flow. Second operand 8 states and 141 transitions. [2024-06-27 19:08:33,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 171 transitions, 2194 flow [2024-06-27 19:08:33,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 171 transitions, 2116 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:33,359 INFO L231 Difference]: Finished difference. Result has 131 places, 139 transitions, 1744 flow [2024-06-27 19:08:33,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1744, PETRI_PLACES=131, PETRI_TRANSITIONS=139} [2024-06-27 19:08:33,360 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 92 predicate places. [2024-06-27 19:08:33,360 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 139 transitions, 1744 flow [2024-06-27 19:08:33,360 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-27 19:08:33,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:33,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:33,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 19:08:33,361 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:33,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:33,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1667740587, now seen corresponding path program 4 times [2024-06-27 19:08:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:33,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090231770] [2024-06-27 19:08:33,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:33,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:33,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:33,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090231770] [2024-06-27 19:08:33,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090231770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:33,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:33,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:33,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007300683] [2024-06-27 19:08:33,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:33,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:33,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:33,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:33,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:34,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:34,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 139 transitions, 1744 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-27 19:08:34,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:34,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:34,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:34,508 INFO L124 PetriNetUnfolderBase]: 1588/2948 cut-off events. [2024-06-27 19:08:34,508 INFO L125 PetriNetUnfolderBase]: For 30808/30814 co-relation queries the response was YES. [2024-06-27 19:08:34,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13744 conditions, 2948 events. 1588/2948 cut-off events. For 30808/30814 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 19481 event pairs, 621 based on Foata normal form. 26/2877 useless extension candidates. Maximal degree in co-relation 13682. Up to 2218 conditions per place. [2024-06-27 19:08:34,526 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 122 selfloop transitions, 44 changer transitions 0/173 dead transitions. [2024-06-27 19:08:34,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 173 transitions, 2228 flow [2024-06-27 19:08:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:08:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:08:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-27 19:08:34,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-27 19:08:34,528 INFO L175 Difference]: Start difference. First operand has 131 places, 139 transitions, 1744 flow. Second operand 9 states and 145 transitions. [2024-06-27 19:08:34,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 173 transitions, 2228 flow [2024-06-27 19:08:34,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 173 transitions, 2120 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-27 19:08:34,595 INFO L231 Difference]: Finished difference. Result has 136 places, 141 transitions, 1770 flow [2024-06-27 19:08:34,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1770, PETRI_PLACES=136, PETRI_TRANSITIONS=141} [2024-06-27 19:08:34,595 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 97 predicate places. [2024-06-27 19:08:34,595 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 141 transitions, 1770 flow [2024-06-27 19:08:34,595 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-27 19:08:34,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:34,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:34,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 19:08:34,596 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:34,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash 307994255, now seen corresponding path program 5 times [2024-06-27 19:08:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:34,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488084705] [2024-06-27 19:08:34,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:34,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:34,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:34,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488084705] [2024-06-27 19:08:34,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488084705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:34,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:34,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:34,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669138649] [2024-06-27 19:08:34,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:34,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:34,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:34,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:34,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:35,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:35,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 141 transitions, 1770 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-27 19:08:35,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:35,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:35,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:35,523 INFO L124 PetriNetUnfolderBase]: 1816/3386 cut-off events. [2024-06-27 19:08:35,523 INFO L125 PetriNetUnfolderBase]: For 37428/37430 co-relation queries the response was YES. [2024-06-27 19:08:35,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15981 conditions, 3386 events. 1816/3386 cut-off events. For 37428/37430 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 23347 event pairs, 566 based on Foata normal form. 18/3297 useless extension candidates. Maximal degree in co-relation 15917. Up to 1914 conditions per place. [2024-06-27 19:08:35,546 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 109 selfloop transitions, 65 changer transitions 0/181 dead transitions. [2024-06-27 19:08:35,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 181 transitions, 2420 flow [2024-06-27 19:08:35,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 19:08:35,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 19:08:35,560 INFO L175 Difference]: Start difference. First operand has 136 places, 141 transitions, 1770 flow. Second operand 8 states and 144 transitions. [2024-06-27 19:08:35,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 181 transitions, 2420 flow [2024-06-27 19:08:35,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 181 transitions, 2304 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 19:08:35,635 INFO L231 Difference]: Finished difference. Result has 136 places, 145 transitions, 1899 flow [2024-06-27 19:08:35,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1899, PETRI_PLACES=136, PETRI_TRANSITIONS=145} [2024-06-27 19:08:35,635 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 97 predicate places. [2024-06-27 19:08:35,635 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 145 transitions, 1899 flow [2024-06-27 19:08:35,635 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-27 19:08:35,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:35,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:35,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 19:08:35,637 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:35,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:35,637 INFO L85 PathProgramCache]: Analyzing trace with hash 307997975, now seen corresponding path program 6 times [2024-06-27 19:08:35,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:35,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381118616] [2024-06-27 19:08:35,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:35,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:36,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:36,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381118616] [2024-06-27 19:08:36,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381118616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:36,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:36,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:36,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874924072] [2024-06-27 19:08:36,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:36,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:36,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:36,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:36,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:36,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:36,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 145 transitions, 1899 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-27 19:08:36,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:36,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:36,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:36,657 INFO L124 PetriNetUnfolderBase]: 1908/3568 cut-off events. [2024-06-27 19:08:36,657 INFO L125 PetriNetUnfolderBase]: For 41251/41253 co-relation queries the response was YES. [2024-06-27 19:08:36,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16664 conditions, 3568 events. 1908/3568 cut-off events. For 41251/41253 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 25001 event pairs, 816 based on Foata normal form. 26/3487 useless extension candidates. Maximal degree in co-relation 16599. Up to 2750 conditions per place. [2024-06-27 19:08:36,682 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 111 selfloop transitions, 60 changer transitions 0/178 dead transitions. [2024-06-27 19:08:36,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 178 transitions, 2419 flow [2024-06-27 19:08:36,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:36,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-27 19:08:36,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2024-06-27 19:08:36,685 INFO L175 Difference]: Start difference. First operand has 136 places, 145 transitions, 1899 flow. Second operand 8 states and 138 transitions. [2024-06-27 19:08:36,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 178 transitions, 2419 flow [2024-06-27 19:08:36,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 178 transitions, 2311 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-27 19:08:36,789 INFO L231 Difference]: Finished difference. Result has 140 places, 148 transitions, 1993 flow [2024-06-27 19:08:36,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1993, PETRI_PLACES=140, PETRI_TRANSITIONS=148} [2024-06-27 19:08:36,789 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 101 predicate places. [2024-06-27 19:08:36,789 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 148 transitions, 1993 flow [2024-06-27 19:08:36,790 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-27 19:08:36,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:36,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:36,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 19:08:36,790 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:36,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:36,790 INFO L85 PathProgramCache]: Analyzing trace with hash 313712267, now seen corresponding path program 1 times [2024-06-27 19:08:36,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:36,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074632918] [2024-06-27 19:08:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:36,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:37,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:37,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074632918] [2024-06-27 19:08:37,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074632918] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:37,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:37,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436708629] [2024-06-27 19:08:37,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:37,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:37,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:37,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:37,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:37,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:37,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 148 transitions, 1993 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-27 19:08:37,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:37,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:37,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:37,978 INFO L124 PetriNetUnfolderBase]: 1931/3614 cut-off events. [2024-06-27 19:08:37,978 INFO L125 PetriNetUnfolderBase]: For 32741/32741 co-relation queries the response was YES. [2024-06-27 19:08:37,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17120 conditions, 3614 events. 1931/3614 cut-off events. For 32741/32741 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 25429 event pairs, 818 based on Foata normal form. 4/3503 useless extension candidates. Maximal degree in co-relation 17053. Up to 3051 conditions per place. [2024-06-27 19:08:38,004 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 108 selfloop transitions, 59 changer transitions 0/174 dead transitions. [2024-06-27 19:08:38,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 174 transitions, 2476 flow [2024-06-27 19:08:38,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-27 19:08:38,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607142857142857 [2024-06-27 19:08:38,005 INFO L175 Difference]: Start difference. First operand has 140 places, 148 transitions, 1993 flow. Second operand 8 states and 129 transitions. [2024-06-27 19:08:38,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 174 transitions, 2476 flow [2024-06-27 19:08:38,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 174 transitions, 2333 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:38,093 INFO L231 Difference]: Finished difference. Result has 142 places, 151 transitions, 2048 flow [2024-06-27 19:08:38,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1850, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2048, PETRI_PLACES=142, PETRI_TRANSITIONS=151} [2024-06-27 19:08:38,094 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 103 predicate places. [2024-06-27 19:08:38,094 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 151 transitions, 2048 flow [2024-06-27 19:08:38,094 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-27 19:08:38,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:38,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:38,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 19:08:38,095 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:38,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:38,095 INFO L85 PathProgramCache]: Analyzing trace with hash 313719707, now seen corresponding path program 2 times [2024-06-27 19:08:38,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:38,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64612684] [2024-06-27 19:08:38,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:38,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:38,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:38,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64612684] [2024-06-27 19:08:38,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64612684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:38,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:38,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:38,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919289726] [2024-06-27 19:08:38,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:38,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:38,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:38,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:38,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:38,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:38,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 151 transitions, 2048 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-27 19:08:38,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:38,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:38,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:39,411 INFO L124 PetriNetUnfolderBase]: 1954/3655 cut-off events. [2024-06-27 19:08:39,411 INFO L125 PetriNetUnfolderBase]: For 32560/32560 co-relation queries the response was YES. [2024-06-27 19:08:39,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17257 conditions, 3655 events. 1954/3655 cut-off events. For 32560/32560 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 25716 event pairs, 782 based on Foata normal form. 4/3564 useless extension candidates. Maximal degree in co-relation 17189. Up to 2364 conditions per place. [2024-06-27 19:08:39,432 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 103 selfloop transitions, 72 changer transitions 0/182 dead transitions. [2024-06-27 19:08:39,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 182 transitions, 2574 flow [2024-06-27 19:08:39,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-27 19:08:39,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-27 19:08:39,434 INFO L175 Difference]: Start difference. First operand has 142 places, 151 transitions, 2048 flow. Second operand 8 states and 136 transitions. [2024-06-27 19:08:39,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 182 transitions, 2574 flow [2024-06-27 19:08:39,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 182 transitions, 2413 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:39,516 INFO L231 Difference]: Finished difference. Result has 144 places, 154 transitions, 2113 flow [2024-06-27 19:08:39,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2113, PETRI_PLACES=144, PETRI_TRANSITIONS=154} [2024-06-27 19:08:39,517 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 105 predicate places. [2024-06-27 19:08:39,517 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 154 transitions, 2113 flow [2024-06-27 19:08:39,517 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-27 19:08:39,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:39,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:39,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 19:08:39,518 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:39,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash 488045669, now seen corresponding path program 3 times [2024-06-27 19:08:39,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:39,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087372701] [2024-06-27 19:08:39,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:39,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:40,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:40,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087372701] [2024-06-27 19:08:40,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087372701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:40,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:40,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:40,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077744716] [2024-06-27 19:08:40,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:40,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:40,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:40,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:40,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:40,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:40,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 154 transitions, 2113 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-27 19:08:40,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:40,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:40,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:40,804 INFO L124 PetriNetUnfolderBase]: 1980/3704 cut-off events. [2024-06-27 19:08:40,804 INFO L125 PetriNetUnfolderBase]: For 34024/34024 co-relation queries the response was YES. [2024-06-27 19:08:40,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17722 conditions, 3704 events. 1980/3704 cut-off events. For 34024/34024 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 26176 event pairs, 1063 based on Foata normal form. 2/3590 useless extension candidates. Maximal degree in co-relation 17653. Up to 3504 conditions per place. [2024-06-27 19:08:40,831 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 150 selfloop transitions, 18 changer transitions 0/175 dead transitions. [2024-06-27 19:08:40,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 175 transitions, 2588 flow [2024-06-27 19:08:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2024-06-27 19:08:40,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2024-06-27 19:08:40,833 INFO L175 Difference]: Start difference. First operand has 144 places, 154 transitions, 2113 flow. Second operand 8 states and 118 transitions. [2024-06-27 19:08:40,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 175 transitions, 2588 flow [2024-06-27 19:08:40,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 175 transitions, 2395 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:40,932 INFO L231 Difference]: Finished difference. Result has 146 places, 157 transitions, 2044 flow [2024-06-27 19:08:40,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1920, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2044, PETRI_PLACES=146, PETRI_TRANSITIONS=157} [2024-06-27 19:08:40,933 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 107 predicate places. [2024-06-27 19:08:40,933 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 157 transitions, 2044 flow [2024-06-27 19:08:40,933 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-27 19:08:40,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:40,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:40,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 19:08:40,934 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:40,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash 782551559, now seen corresponding path program 4 times [2024-06-27 19:08:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:40,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928905598] [2024-06-27 19:08:40,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:40,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:41,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:41,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928905598] [2024-06-27 19:08:41,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928905598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:41,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:41,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:41,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103446917] [2024-06-27 19:08:41,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:41,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:41,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:41,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:41,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:41,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:41,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 157 transitions, 2044 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-27 19:08:41,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:41,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:41,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:42,088 INFO L124 PetriNetUnfolderBase]: 1980/3703 cut-off events. [2024-06-27 19:08:42,089 INFO L125 PetriNetUnfolderBase]: For 33361/33361 co-relation queries the response was YES. [2024-06-27 19:08:42,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17277 conditions, 3703 events. 1980/3703 cut-off events. For 33361/33361 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 26125 event pairs, 1017 based on Foata normal form. 2/3610 useless extension candidates. Maximal degree in co-relation 17207. Up to 3494 conditions per place. [2024-06-27 19:08:42,114 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 159 selfloop transitions, 14 changer transitions 0/180 dead transitions. [2024-06-27 19:08:42,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 180 transitions, 2504 flow [2024-06-27 19:08:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:42,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-27 19:08:42,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43214285714285716 [2024-06-27 19:08:42,116 INFO L175 Difference]: Start difference. First operand has 146 places, 157 transitions, 2044 flow. Second operand 8 states and 121 transitions. [2024-06-27 19:08:42,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 180 transitions, 2504 flow [2024-06-27 19:08:42,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 180 transitions, 2417 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:42,221 INFO L231 Difference]: Finished difference. Result has 148 places, 159 transitions, 2032 flow [2024-06-27 19:08:42,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1957, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2032, PETRI_PLACES=148, PETRI_TRANSITIONS=159} [2024-06-27 19:08:42,222 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 109 predicate places. [2024-06-27 19:08:42,222 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 159 transitions, 2032 flow [2024-06-27 19:08:42,222 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-27 19:08:42,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:42,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:42,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 19:08:42,222 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:42,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:42,223 INFO L85 PathProgramCache]: Analyzing trace with hash 772461059, now seen corresponding path program 5 times [2024-06-27 19:08:42,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:42,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958177639] [2024-06-27 19:08:42,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:42,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:42,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:42,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958177639] [2024-06-27 19:08:42,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958177639] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:42,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762112461] [2024-06-27 19:08:42,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:42,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:42,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:42,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:42,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:42,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 159 transitions, 2032 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-27 19:08:42,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:42,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:42,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:43,406 INFO L124 PetriNetUnfolderBase]: 1977/3701 cut-off events. [2024-06-27 19:08:43,407 INFO L125 PetriNetUnfolderBase]: For 33048/33048 co-relation queries the response was YES. [2024-06-27 19:08:43,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17125 conditions, 3701 events. 1977/3701 cut-off events. For 33048/33048 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 26176 event pairs, 1046 based on Foata normal form. 2/3592 useless extension candidates. Maximal degree in co-relation 17054. Up to 3381 conditions per place. [2024-06-27 19:08:43,433 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 149 selfloop transitions, 30 changer transitions 0/186 dead transitions. [2024-06-27 19:08:43,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 186 transitions, 2695 flow [2024-06-27 19:08:43,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-27 19:08:43,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2024-06-27 19:08:43,434 INFO L175 Difference]: Start difference. First operand has 148 places, 159 transitions, 2032 flow. Second operand 8 states and 123 transitions. [2024-06-27 19:08:43,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 186 transitions, 2695 flow [2024-06-27 19:08:43,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 186 transitions, 2636 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:43,543 INFO L231 Difference]: Finished difference. Result has 151 places, 165 transitions, 2228 flow [2024-06-27 19:08:43,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1973, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2228, PETRI_PLACES=151, PETRI_TRANSITIONS=165} [2024-06-27 19:08:43,544 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 112 predicate places. [2024-06-27 19:08:43,544 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 165 transitions, 2228 flow [2024-06-27 19:08:43,544 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-27 19:08:43,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:43,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:43,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 19:08:43,544 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:43,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:43,545 INFO L85 PathProgramCache]: Analyzing trace with hash 772453619, now seen corresponding path program 6 times [2024-06-27 19:08:43,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:43,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692361949] [2024-06-27 19:08:43,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:43,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:44,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:44,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692361949] [2024-06-27 19:08:44,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692361949] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:44,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:44,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:44,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996705412] [2024-06-27 19:08:44,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:44,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:44,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:44,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:44,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:44,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:44,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 165 transitions, 2228 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-27 19:08:44,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:44,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:44,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:44,748 INFO L124 PetriNetUnfolderBase]: 1974/3694 cut-off events. [2024-06-27 19:08:44,748 INFO L125 PetriNetUnfolderBase]: For 33824/33824 co-relation queries the response was YES. [2024-06-27 19:08:44,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17185 conditions, 3694 events. 1974/3694 cut-off events. For 33824/33824 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 26147 event pairs, 1056 based on Foata normal form. 2/3582 useless extension candidates. Maximal degree in co-relation 17112. Up to 3455 conditions per place. [2024-06-27 19:08:44,774 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 150 selfloop transitions, 26 changer transitions 0/183 dead transitions. [2024-06-27 19:08:44,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 183 transitions, 2644 flow [2024-06-27 19:08:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2024-06-27 19:08:44,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2024-06-27 19:08:44,775 INFO L175 Difference]: Start difference. First operand has 151 places, 165 transitions, 2228 flow. Second operand 8 states and 118 transitions. [2024-06-27 19:08:44,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 183 transitions, 2644 flow [2024-06-27 19:08:44,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 183 transitions, 2504 flow, removed 59 selfloop flow, removed 4 redundant places. [2024-06-27 19:08:44,901 INFO L231 Difference]: Finished difference. Result has 155 places, 165 transitions, 2152 flow [2024-06-27 19:08:44,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2152, PETRI_PLACES=155, PETRI_TRANSITIONS=165} [2024-06-27 19:08:44,901 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 116 predicate places. [2024-06-27 19:08:44,902 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 165 transitions, 2152 flow [2024-06-27 19:08:44,902 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-27 19:08:44,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:44,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:44,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 19:08:44,902 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:44,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1034500983, now seen corresponding path program 1 times [2024-06-27 19:08:44,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:44,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856096785] [2024-06-27 19:08:44,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:44,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:45,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:45,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856096785] [2024-06-27 19:08:45,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856096785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:45,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:45,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:45,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810794323] [2024-06-27 19:08:45,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:45,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:45,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:45,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:45,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:45,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:45,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 165 transitions, 2152 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-27 19:08:45,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:45,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:45,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:46,162 INFO L124 PetriNetUnfolderBase]: 1960/3662 cut-off events. [2024-06-27 19:08:46,163 INFO L125 PetriNetUnfolderBase]: For 31410/31412 co-relation queries the response was YES. [2024-06-27 19:08:46,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16480 conditions, 3662 events. 1960/3662 cut-off events. For 31410/31412 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 25820 event pairs, 784 based on Foata normal form. 14/3564 useless extension candidates. Maximal degree in co-relation 16405. Up to 2960 conditions per place. [2024-06-27 19:08:46,190 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 139 selfloop transitions, 52 changer transitions 0/198 dead transitions. [2024-06-27 19:08:46,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 198 transitions, 2681 flow [2024-06-27 19:08:46,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:46,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-27 19:08:46,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2024-06-27 19:08:46,192 INFO L175 Difference]: Start difference. First operand has 155 places, 165 transitions, 2152 flow. Second operand 8 states and 134 transitions. [2024-06-27 19:08:46,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 198 transitions, 2681 flow [2024-06-27 19:08:46,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 198 transitions, 2598 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 19:08:46,311 INFO L231 Difference]: Finished difference. Result has 157 places, 167 transitions, 2234 flow [2024-06-27 19:08:46,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2069, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2234, PETRI_PLACES=157, PETRI_TRANSITIONS=167} [2024-06-27 19:08:46,312 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 118 predicate places. [2024-06-27 19:08:46,312 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 167 transitions, 2234 flow [2024-06-27 19:08:46,312 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-27 19:08:46,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:46,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:46,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 19:08:46,313 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:46,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash -861780453, now seen corresponding path program 2 times [2024-06-27 19:08:46,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:46,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19230674] [2024-06-27 19:08:46,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:46,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:46,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19230674] [2024-06-27 19:08:46,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19230674] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:46,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:46,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 19:08:46,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248433356] [2024-06-27 19:08:46,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:46,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 19:08:46,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:46,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 19:08:46,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 19:08:47,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:47,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 167 transitions, 2234 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:47,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:47,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:47,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:47,669 INFO L124 PetriNetUnfolderBase]: 2011/3772 cut-off events. [2024-06-27 19:08:47,670 INFO L125 PetriNetUnfolderBase]: For 30657/30657 co-relation queries the response was YES. [2024-06-27 19:08:47,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17057 conditions, 3772 events. 2011/3772 cut-off events. For 30657/30657 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 26884 event pairs, 771 based on Foata normal form. 12/3687 useless extension candidates. Maximal degree in co-relation 16980. Up to 2323 conditions per place. [2024-06-27 19:08:47,696 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 121 selfloop transitions, 76 changer transitions 0/204 dead transitions. [2024-06-27 19:08:47,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 204 transitions, 2830 flow [2024-06-27 19:08:47,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:08:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:08:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-27 19:08:47,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-06-27 19:08:47,697 INFO L175 Difference]: Start difference. First operand has 157 places, 167 transitions, 2234 flow. Second operand 9 states and 152 transitions. [2024-06-27 19:08:47,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 204 transitions, 2830 flow [2024-06-27 19:08:47,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 204 transitions, 2652 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-27 19:08:47,800 INFO L231 Difference]: Finished difference. Result has 159 places, 169 transitions, 2282 flow [2024-06-27 19:08:47,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2060, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2282, PETRI_PLACES=159, PETRI_TRANSITIONS=169} [2024-06-27 19:08:47,800 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 120 predicate places. [2024-06-27 19:08:47,801 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 169 transitions, 2282 flow [2024-06-27 19:08:47,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:47,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:47,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:47,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 19:08:47,801 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:47,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:47,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1823510471, now seen corresponding path program 3 times [2024-06-27 19:08:47,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:47,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987597115] [2024-06-27 19:08:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:48,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-27 19:08:48,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:48,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987597115] [2024-06-27 19:08:48,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987597115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:48,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:48,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 19:08:48,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527706137] [2024-06-27 19:08:48,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:48,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 19:08:48,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:48,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 19:08:48,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 19:08:48,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:48,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 169 transitions, 2282 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:48,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:48,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:48,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:49,015 INFO L124 PetriNetUnfolderBase]: 2004/3762 cut-off events. [2024-06-27 19:08:49,015 INFO L125 PetriNetUnfolderBase]: For 22591/22591 co-relation queries the response was YES. [2024-06-27 19:08:49,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16827 conditions, 3762 events. 2004/3762 cut-off events. For 22591/22591 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 26855 event pairs, 1017 based on Foata normal form. 6/3657 useless extension candidates. Maximal degree in co-relation 16750. Up to 3319 conditions per place. [2024-06-27 19:08:49,042 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 157 selfloop transitions, 32 changer transitions 0/196 dead transitions. [2024-06-27 19:08:49,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 196 transitions, 2763 flow [2024-06-27 19:08:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:08:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:08:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-27 19:08:49,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-27 19:08:49,043 INFO L175 Difference]: Start difference. First operand has 159 places, 169 transitions, 2282 flow. Second operand 9 states and 138 transitions. [2024-06-27 19:08:49,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 196 transitions, 2763 flow [2024-06-27 19:08:49,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 196 transitions, 2566 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-27 19:08:49,154 INFO L231 Difference]: Finished difference. Result has 161 places, 169 transitions, 2154 flow [2024-06-27 19:08:49,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2085, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2154, PETRI_PLACES=161, PETRI_TRANSITIONS=169} [2024-06-27 19:08:49,154 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 122 predicate places. [2024-06-27 19:08:49,154 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 169 transitions, 2154 flow [2024-06-27 19:08:49,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:49,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:49,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:49,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 19:08:49,159 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:49,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:49,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1510704971, now seen corresponding path program 4 times [2024-06-27 19:08:49,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:49,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837667734] [2024-06-27 19:08:49,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:49,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:49,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837667734] [2024-06-27 19:08:49,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837667734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:49,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:49,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 19:08:49,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981243850] [2024-06-27 19:08:49,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:49,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 19:08:49,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:49,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 19:08:49,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 19:08:49,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:49,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 169 transitions, 2154 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:49,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:49,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:49,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:50,442 INFO L124 PetriNetUnfolderBase]: 2004/3759 cut-off events. [2024-06-27 19:08:50,442 INFO L125 PetriNetUnfolderBase]: For 16475/16475 co-relation queries the response was YES. [2024-06-27 19:08:50,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16213 conditions, 3759 events. 2004/3759 cut-off events. For 16475/16475 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 26726 event pairs, 1029 based on Foata normal form. 6/3670 useless extension candidates. Maximal degree in co-relation 16135. Up to 3472 conditions per place. [2024-06-27 19:08:50,465 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 175 selfloop transitions, 15 changer transitions 0/197 dead transitions. [2024-06-27 19:08:50,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 197 transitions, 2584 flow [2024-06-27 19:08:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:08:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:08:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-27 19:08:50,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43174603174603177 [2024-06-27 19:08:50,468 INFO L175 Difference]: Start difference. First operand has 161 places, 169 transitions, 2154 flow. Second operand 9 states and 136 transitions. [2024-06-27 19:08:50,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 197 transitions, 2584 flow [2024-06-27 19:08:50,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 197 transitions, 2191 flow, removed 24 selfloop flow, removed 32 redundant places. [2024-06-27 19:08:50,521 INFO L231 Difference]: Finished difference. Result has 137 places, 169 transitions, 1739 flow [2024-06-27 19:08:50,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1681, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1739, PETRI_PLACES=137, PETRI_TRANSITIONS=169} [2024-06-27 19:08:50,523 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 98 predicate places. [2024-06-27 19:08:50,524 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 169 transitions, 1739 flow [2024-06-27 19:08:50,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:50,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:50,525 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-27 19:08:50,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 19:08:50,526 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:50,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:50,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1639438675, now seen corresponding path program 1 times [2024-06-27 19:08:50,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:50,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872011385] [2024-06-27 19:08:50,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:50,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:50,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:50,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872011385] [2024-06-27 19:08:50,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872011385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:50,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:50,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:08:50,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821737268] [2024-06-27 19:08:50,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:50,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:08:50,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:50,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:08:50,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:08:50,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 19:08:50,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 169 transitions, 1739 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:50,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:50,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 19:08:50,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:50,901 INFO L124 PetriNetUnfolderBase]: 1252/2711 cut-off events. [2024-06-27 19:08:50,902 INFO L125 PetriNetUnfolderBase]: For 6470/6535 co-relation queries the response was YES. [2024-06-27 19:08:50,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10008 conditions, 2711 events. 1252/2711 cut-off events. For 6470/6535 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 21059 event pairs, 244 based on Foata normal form. 237/2841 useless extension candidates. Maximal degree in co-relation 9954. Up to 972 conditions per place. [2024-06-27 19:08:50,916 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 66 selfloop transitions, 43 changer transitions 0/145 dead transitions. [2024-06-27 19:08:50,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 145 transitions, 1631 flow [2024-06-27 19:08:50,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:08:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:08:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-27 19:08:50,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057142857142858 [2024-06-27 19:08:50,918 INFO L175 Difference]: Start difference. First operand has 137 places, 169 transitions, 1739 flow. Second operand 5 states and 106 transitions. [2024-06-27 19:08:50,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 145 transitions, 1631 flow [2024-06-27 19:08:50,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 145 transitions, 1267 flow, removed 51 selfloop flow, removed 34 redundant places. [2024-06-27 19:08:50,944 INFO L231 Difference]: Finished difference. Result has 109 places, 135 transitions, 1159 flow [2024-06-27 19:08:50,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1159, PETRI_PLACES=109, PETRI_TRANSITIONS=135} [2024-06-27 19:08:50,945 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 70 predicate places. [2024-06-27 19:08:50,945 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 135 transitions, 1159 flow [2024-06-27 19:08:50,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:50,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:50,945 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-27 19:08:50,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 19:08:50,945 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:50,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:50,946 INFO L85 PathProgramCache]: Analyzing trace with hash 265432724, now seen corresponding path program 1 times [2024-06-27 19:08:50,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:50,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561663978] [2024-06-27 19:08:50,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:50,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:51,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:51,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561663978] [2024-06-27 19:08:51,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561663978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:51,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:51,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-06-27 19:08:51,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097982472] [2024-06-27 19:08:51,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:51,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 19:08:51,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:51,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 19:08:51,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-27 19:08:51,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-06-27 19:08:51,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 135 transitions, 1159 flow. Second operand has 13 states, 13 states have (on average 13.307692307692308) internal successors, (173), 13 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:51,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:51,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-06-27 19:08:51,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:51,728 INFO L124 PetriNetUnfolderBase]: 797/2098 cut-off events. [2024-06-27 19:08:51,729 INFO L125 PetriNetUnfolderBase]: For 4534/4556 co-relation queries the response was YES. [2024-06-27 19:08:51,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7225 conditions, 2098 events. 797/2098 cut-off events. For 4534/4556 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 17866 event pairs, 202 based on Foata normal form. 7/1923 useless extension candidates. Maximal degree in co-relation 7195. Up to 723 conditions per place. [2024-06-27 19:08:51,736 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 43 selfloop transitions, 31 changer transitions 26/160 dead transitions. [2024-06-27 19:08:51,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 160 transitions, 1418 flow [2024-06-27 19:08:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:08:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:08:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-27 19:08:51,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2024-06-27 19:08:51,737 INFO L175 Difference]: Start difference. First operand has 109 places, 135 transitions, 1159 flow. Second operand 10 states and 169 transitions. [2024-06-27 19:08:51,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 160 transitions, 1418 flow [2024-06-27 19:08:51,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 160 transitions, 1332 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 19:08:51,751 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 984 flow [2024-06-27 19:08:51,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=984, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2024-06-27 19:08:51,751 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 78 predicate places. [2024-06-27 19:08:51,751 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 984 flow [2024-06-27 19:08:51,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.307692307692308) internal successors, (173), 13 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:51,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:51,752 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-27 19:08:51,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 19:08:51,752 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:51,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:51,752 INFO L85 PathProgramCache]: Analyzing trace with hash 230808042, now seen corresponding path program 2 times [2024-06-27 19:08:51,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:51,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404752310] [2024-06-27 19:08:51,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:51,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 19:08:51,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 19:08:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 19:08:51,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 19:08:51,802 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 19:08:51,803 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 19:08:51,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 19:08:51,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-27 19:08:51,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-27 19:08:51,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 19:08:51,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 19:08:51,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 19:08:51,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 19:08:51,808 INFO L445 BasicCegarLoop]: Path program histogram: [6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:51,812 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 19:08:51,812 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 19:08:51,890 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 19:08:51,890 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 19:08:51,891 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 07:08:51 BasicIcfg [2024-06-27 19:08:51,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 19:08:51,891 INFO L158 Benchmark]: Toolchain (without parser) took 44928.36ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 64.7MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-06-27 19:08:51,892 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 19:08:51,892 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 19:08:51,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.12ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 64.5MB in the beginning and 128.7MB in the end (delta: -64.2MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-06-27 19:08:51,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.27ms. Allocated memory is still 184.5MB. Free memory was 128.7MB in the beginning and 126.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 19:08:51,892 INFO L158 Benchmark]: Boogie Preprocessor took 57.65ms. Allocated memory is still 184.5MB. Free memory was 126.5MB in the beginning and 123.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 19:08:51,893 INFO L158 Benchmark]: RCFGBuilder took 525.00ms. Allocated memory is still 184.5MB. Free memory was 123.4MB in the beginning and 77.3MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-06-27 19:08:51,893 INFO L158 Benchmark]: TraceAbstraction took 43661.86ms. Allocated memory was 184.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 76.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 19:08:51,894 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.12ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 64.5MB in the beginning and 128.7MB in the end (delta: -64.2MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.27ms. Allocated memory is still 184.5MB. Free memory was 128.7MB in the beginning and 126.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.65ms. Allocated memory is still 184.5MB. Free memory was 126.5MB in the beginning and 123.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 525.00ms. Allocated memory is still 184.5MB. Free memory was 123.4MB in the beginning and 77.3MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 43661.86ms. Allocated memory was 184.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 76.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). There was no memory consumed. 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; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L793] 0 //@ assert (((((((((((((!multithreaded || (y$read_delayed_var == 0)) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 2)))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 2)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))); [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L794] 0 //@ assert (((((((((((((!multithreaded || (y$read_delayed_var == 0)) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 2)))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 2)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))); VAL [\old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [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, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] 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 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [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=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 43.5s, OverallIterations: 48, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2484 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2093 mSDsluCounter, 1684 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1457 mSDsCounter, 596 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11902 IncrementalHoareTripleChecker+Invalid, 12498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 596 mSolverCounterUnsat, 227 mSDtfsCounter, 11902 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2282occurred in iteration=43, InterpolantAutomatonStates: 336, 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, 19.3s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 618 ConstructedInterpolants, 0 QuantifiedInterpolants, 23292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 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-27 19:08:51,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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