./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i ./goblint.2024-05-07_14-17-48.files/protection/mix054_power.oepc_power.opt_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-wip.fs.witness-ghost-b44c828-m [2024-05-12 13:27:29,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 13:27:29,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 13:27:29,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 13:27:29,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 13:27:29,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 13:27:29,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 13:27:29,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 13:27:29,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 13:27:29,937 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 13:27:29,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 13:27:29,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 13:27:29,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 13:27:29,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 13:27:29,939 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 13:27:29,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 13:27:29,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 13:27:29,940 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 13:27:29,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 13:27:29,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 13:27:29,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 13:27:29,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 13:27:29,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 13:27:29,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 13:27:29,942 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 13:27:29,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 13:27:29,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 13:27:29,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 13:27:29,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 13:27:29,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 13:27:29,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 13:27:29,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 13:27:29,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:27:29,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 13:27:29,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 13:27:29,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 13:27:29,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 13:27:29,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 13:27:29,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 13:27:29,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 13:27:29,946 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 13:27:29,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 13:27:29,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 13:27:29,946 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-05-12 13:27:30,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 13:27:30,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 13:27:30,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 13:27:30,170 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 13:27:30,170 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 13:27:30,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml [2024-05-12 13:27:30,303 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 13:27:30,303 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 13:27:30,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-05-12 13:27:31,306 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 13:27:31,560 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 13:27:31,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-05-12 13:27:31,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cd712acb/c9e42e5689f5423ea511c7f8dd203b46/FLAG7812fe0db [2024-05-12 13:27:31,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cd712acb/c9e42e5689f5423ea511c7f8dd203b46 [2024-05-12 13:27:31,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 13:27:31,590 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 13:27:31,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 13:27:31,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 13:27:31,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 13:27:31,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:27:30" (1/2) ... [2024-05-12 13:27:31,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342d9ea and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:27:31, skipping insertion in model container [2024-05-12 13:27:31,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:27:30" (1/2) ... [2024-05-12 13:27:31,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6f868651 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:27:31, skipping insertion in model container [2024-05-12 13:27:31,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:27:31" (2/2) ... [2024-05-12 13:27:31,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342d9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:31, skipping insertion in model container [2024-05-12 13:27:31,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:27:31" (2/2) ... [2024-05-12 13:27:31,601 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 13:27:31,651 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 13:27:31,652 INFO L97 edCorrectnessWitness]: Location invariant before [L809-L809] (((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) [2024-05-12 13:27:31,652 INFO L97 edCorrectnessWitness]: Location invariant before [L808-L808] (((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) [2024-05-12 13:27:31,652 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 13:27:31,652 INFO L106 edCorrectnessWitness]: ghost_update [L806-L806] multithreaded = 1; [2024-05-12 13:27:31,687 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 13:27:31,847 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2024-05-12 13:27:31,968 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:27:31,975 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 13:27:32,027 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 13:27:32,101 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:27:32,128 INFO L206 MainTranslator]: Completed translation [2024-05-12 13:27:32,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:32 WrapperNode [2024-05-12 13:27:32,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 13:27:32,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 13:27:32,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 13:27:32,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 13:27:32,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:32" (1/1) ... [2024-05-12 13:27:32,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:32" (1/1) ... [2024-05-12 13:27:32,165 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2024-05-12 13:27:32,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 13:27:32,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 13:27:32,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 13:27:32,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 13:27:32,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:32" (1/1) ... [2024-05-12 13:27:32,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:32" (1/1) ... [2024-05-12 13:27:32,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:32" (1/1) ... [2024-05-12 13:27:32,193 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 13:27:32,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:32" (1/1) ... [2024-05-12 13:27:32,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:32" (1/1) ... [2024-05-12 13:27:32,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:32" (1/1) ... [2024-05-12 13:27:32,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:32" (1/1) ... [2024-05-12 13:27:32,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:32" (1/1) ... [2024-05-12 13:27:32,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:32" (1/1) ... [2024-05-12 13:27:32,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 13:27:32,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 13:27:32,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 13:27:32,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 13:27:32,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:32" (1/1) ... [2024-05-12 13:27:32,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:27:32,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:27:32,273 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-05-12 13:27:32,279 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-05-12 13:27:32,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 13:27:32,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 13:27:32,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 13:27:32,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 13:27:32,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 13:27:32,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 13:27:32,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 13:27:32,302 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 13:27:32,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 13:27:32,302 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 13:27:32,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 13:27:32,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 13:27:32,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 13:27:32,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 13:27:32,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 13:27:32,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 13:27:32,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 13:27:32,306 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 13:27:32,427 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 13:27:32,429 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 13:27:32,689 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 13:27:32,689 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 13:27:32,833 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 13:27:32,833 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 13:27:32,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:27:32 BoogieIcfgContainer [2024-05-12 13:27:32,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 13:27:32,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 13:27:32,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 13:27:32,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 13:27:32,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:27:30" (1/4) ... [2024-05-12 13:27:32,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b200bd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:27:32, skipping insertion in model container [2024-05-12 13:27:32,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 01:27:31" (2/4) ... [2024-05-12 13:27:32,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b200bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:27:32, skipping insertion in model container [2024-05-12 13:27:32,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:27:32" (3/4) ... [2024-05-12 13:27:32,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b200bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:27:32, skipping insertion in model container [2024-05-12 13:27:32,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:27:32" (4/4) ... [2024-05-12 13:27:32,840 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-05-12 13:27:32,852 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 13:27:32,852 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 13:27:32,852 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 13:27:32,881 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 13:27:32,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 80 flow [2024-05-12 13:27:32,937 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-05-12 13:27:32,937 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:27:32,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-05-12 13:27:32,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 80 flow [2024-05-12 13:27:32,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 74 flow [2024-05-12 13:27:32,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 13:27:32,952 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;@2b5ed3c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 13:27:32,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 13:27:32,956 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 13:27:32,956 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 13:27:32,956 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:27:32,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:32,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 13:27:32,963 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-05-12 13:27:32,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:32,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1080264593, now seen corresponding path program 1 times [2024-05-12 13:27:32,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:32,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73309738] [2024-05-12 13:27:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:33,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:33,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73309738] [2024-05-12 13:27:33,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73309738] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:33,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:33,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 13:27:33,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66178095] [2024-05-12 13:27:33,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:33,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:27:33,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:33,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:27:33,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 13:27:33,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 13:27:33,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:33,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:33,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 13:27:33,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:33,966 INFO L124 PetriNetUnfolderBase]: 475/806 cut-off events. [2024-05-12 13:27:33,966 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-05-12 13:27:33,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 806 events. 475/806 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3871 event pairs, 182 based on Foata normal form. 43/796 useless extension candidates. Maximal degree in co-relation 1610. Up to 787 conditions per place. [2024-05-12 13:27:33,975 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 32 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-05-12 13:27:33,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 169 flow [2024-05-12 13:27:33,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:27:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:27:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-05-12 13:27:33,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2024-05-12 13:27:33,985 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 74 flow. Second operand 3 states and 70 transitions. [2024-05-12 13:27:33,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 169 flow [2024-05-12 13:27:33,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:27:33,991 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 98 flow [2024-05-12 13:27:33,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2024-05-12 13:27:33,994 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-05-12 13:27:33,995 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 98 flow [2024-05-12 13:27:33,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:33,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:33,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 13:27:33,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 13:27:33,996 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:27:33,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:33,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1080265258, now seen corresponding path program 1 times [2024-05-12 13:27:33,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:33,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445845105] [2024-05-12 13:27:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:33,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:34,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:34,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445845105] [2024-05-12 13:27:34,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445845105] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:34,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:34,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 13:27:34,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782296314] [2024-05-12 13:27:34,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:34,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:27:34,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:34,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:27:34,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 13:27:34,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 36 [2024-05-12 13:27:34,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:34,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:34,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 36 [2024-05-12 13:27:34,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:34,184 INFO L124 PetriNetUnfolderBase]: 152/351 cut-off events. [2024-05-12 13:27:34,184 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-05-12 13:27:34,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 351 events. 152/351 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1776 event pairs, 52 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 682. Up to 227 conditions per place. [2024-05-12 13:27:34,186 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 25 selfloop transitions, 3 changer transitions 2/45 dead transitions. [2024-05-12 13:27:34,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 173 flow [2024-05-12 13:27:34,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:27:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:27:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-05-12 13:27:34,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2024-05-12 13:27:34,188 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 98 flow. Second operand 3 states and 78 transitions. [2024-05-12 13:27:34,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 173 flow [2024-05-12 13:27:34,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 13:27:34,190 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 90 flow [2024-05-12 13:27:34,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2024-05-12 13:27:34,191 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-05-12 13:27:34,191 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 90 flow [2024-05-12 13:27:34,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:34,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:34,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:34,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 13:27:34,191 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-05-12 13:27:34,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:34,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1247789681, now seen corresponding path program 1 times [2024-05-12 13:27:34,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:34,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330897089] [2024-05-12 13:27:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:34,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:34,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:34,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330897089] [2024-05-12 13:27:34,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330897089] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:34,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:34,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 13:27:34,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954520] [2024-05-12 13:27:34,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:34,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 13:27:34,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:34,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 13:27:34,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 13:27:34,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 13:27:34,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:34,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:34,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 13:27:34,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:34,659 INFO L124 PetriNetUnfolderBase]: 342/731 cut-off events. [2024-05-12 13:27:34,659 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2024-05-12 13:27:34,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 731 events. 342/731 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3824 event pairs, 218 based on Foata normal form. 2/697 useless extension candidates. Maximal degree in co-relation 1468. Up to 562 conditions per place. [2024-05-12 13:27:34,663 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 36 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2024-05-12 13:27:34,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 220 flow [2024-05-12 13:27:34,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 13:27:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 13:27:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2024-05-12 13:27:34,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2024-05-12 13:27:34,666 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 90 flow. Second operand 4 states and 82 transitions. [2024-05-12 13:27:34,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 220 flow [2024-05-12 13:27:34,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:27:34,669 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 133 flow [2024-05-12 13:27:34,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2024-05-12 13:27:34,671 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-05-12 13:27:34,671 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 133 flow [2024-05-12 13:27:34,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:34,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:34,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:34,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 13:27:34,671 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-05-12 13:27:34,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash -26773666, now seen corresponding path program 1 times [2024-05-12 13:27:34,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:34,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465057081] [2024-05-12 13:27:34,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:34,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:35,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:35,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465057081] [2024-05-12 13:27:35,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465057081] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:35,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:35,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:27:35,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392433917] [2024-05-12 13:27:35,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:35,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 13:27:35,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:35,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 13:27:35,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 13:27:35,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 13:27:35,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:35,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:35,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 13:27:35,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:35,352 INFO L124 PetriNetUnfolderBase]: 422/849 cut-off events. [2024-05-12 13:27:35,352 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2024-05-12 13:27:35,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 849 events. 422/849 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4592 event pairs, 148 based on Foata normal form. 5/815 useless extension candidates. Maximal degree in co-relation 1882. Up to 557 conditions per place. [2024-05-12 13:27:35,356 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 51 selfloop transitions, 13 changer transitions 0/72 dead transitions. [2024-05-12 13:27:35,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 357 flow [2024-05-12 13:27:35,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:27:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:27:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-05-12 13:27:35,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2024-05-12 13:27:35,357 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 133 flow. Second operand 5 states and 111 transitions. [2024-05-12 13:27:35,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 357 flow [2024-05-12 13:27:35,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 350 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 13:27:35,359 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 216 flow [2024-05-12 13:27:35,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2024-05-12 13:27:35,360 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-05-12 13:27:35,360 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 216 flow [2024-05-12 13:27:35,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:35,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:35,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:35,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 13:27:35,360 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-05-12 13:27:35,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:35,361 INFO L85 PathProgramCache]: Analyzing trace with hash -248164604, now seen corresponding path program 1 times [2024-05-12 13:27:35,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:35,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315420041] [2024-05-12 13:27:35,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:35,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:35,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:35,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315420041] [2024-05-12 13:27:35,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315420041] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:35,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:35,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:27:35,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081323022] [2024-05-12 13:27:35,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:35,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:27:35,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:35,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:27:35,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:27:35,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 13:27:35,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:35,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:35,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 13:27:35,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:36,194 INFO L124 PetriNetUnfolderBase]: 432/783 cut-off events. [2024-05-12 13:27:36,198 INFO L125 PetriNetUnfolderBase]: For 801/801 co-relation queries the response was YES. [2024-05-12 13:27:36,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2316 conditions, 783 events. 432/783 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3938 event pairs, 92 based on Foata normal form. 3/773 useless extension candidates. Maximal degree in co-relation 2294. Up to 597 conditions per place. [2024-05-12 13:27:36,202 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 62 selfloop transitions, 21 changer transitions 0/91 dead transitions. [2024-05-12 13:27:36,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 91 transitions, 552 flow [2024-05-12 13:27:36,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:27:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:27:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2024-05-12 13:27:36,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-05-12 13:27:36,207 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 216 flow. Second operand 6 states and 128 transitions. [2024-05-12 13:27:36,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 91 transitions, 552 flow [2024-05-12 13:27:36,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 548 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-05-12 13:27:36,216 INFO L231 Difference]: Finished difference. Result has 58 places, 61 transitions, 382 flow [2024-05-12 13:27:36,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=58, PETRI_TRANSITIONS=61} [2024-05-12 13:27:36,218 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2024-05-12 13:27:36,218 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 61 transitions, 382 flow [2024-05-12 13:27:36,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:36,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:36,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:36,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 13:27:36,218 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-05-12 13:27:36,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:36,219 INFO L85 PathProgramCache]: Analyzing trace with hash 896832711, now seen corresponding path program 1 times [2024-05-12 13:27:36,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:36,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443502719] [2024-05-12 13:27:36,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:36,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:36,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-05-12 13:27:36,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:36,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443502719] [2024-05-12 13:27:36,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443502719] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:36,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:36,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:27:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401231137] [2024-05-12 13:27:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:36,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:27:36,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:36,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:27:36,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:27:36,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 13:27:36,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 382 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:36,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:36,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 13:27:36,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:37,115 INFO L124 PetriNetUnfolderBase]: 442/801 cut-off events. [2024-05-12 13:27:37,115 INFO L125 PetriNetUnfolderBase]: For 1503/1503 co-relation queries the response was YES. [2024-05-12 13:27:37,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2812 conditions, 801 events. 442/801 cut-off events. For 1503/1503 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4084 event pairs, 56 based on Foata normal form. 6/794 useless extension candidates. Maximal degree in co-relation 2784. Up to 565 conditions per place. [2024-05-12 13:27:37,120 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 65 selfloop transitions, 23 changer transitions 0/96 dead transitions. [2024-05-12 13:27:37,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 96 transitions, 674 flow [2024-05-12 13:27:37,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:27:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:27:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-05-12 13:27:37,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5674603174603174 [2024-05-12 13:27:37,121 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 382 flow. Second operand 7 states and 143 transitions. [2024-05-12 13:27:37,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 96 transitions, 674 flow [2024-05-12 13:27:37,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 664 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-05-12 13:27:37,126 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 435 flow [2024-05-12 13:27:37,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=435, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2024-05-12 13:27:37,128 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2024-05-12 13:27:37,128 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 435 flow [2024-05-12 13:27:37,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:37,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:37,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:37,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 13:27:37,129 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-05-12 13:27:37,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:37,129 INFO L85 PathProgramCache]: Analyzing trace with hash -290161238, now seen corresponding path program 1 times [2024-05-12 13:27:37,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:37,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042764454] [2024-05-12 13:27:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:37,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:37,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:37,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042764454] [2024-05-12 13:27:37,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042764454] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:37,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:37,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:27:37,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156472040] [2024-05-12 13:27:37,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:37,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:27:37,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:37,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:27:37,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:27:37,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:37,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:37,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:37,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:37,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:37,790 INFO L124 PetriNetUnfolderBase]: 515/1025 cut-off events. [2024-05-12 13:27:37,790 INFO L125 PetriNetUnfolderBase]: For 2206/2206 co-relation queries the response was YES. [2024-05-12 13:27:37,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3500 conditions, 1025 events. 515/1025 cut-off events. For 2206/2206 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5637 event pairs, 137 based on Foata normal form. 3/987 useless extension candidates. Maximal degree in co-relation 3469. Up to 815 conditions per place. [2024-05-12 13:27:37,796 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 60 selfloop transitions, 10 changer transitions 0/77 dead transitions. [2024-05-12 13:27:37,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 619 flow [2024-05-12 13:27:37,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:27:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:27:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2024-05-12 13:27:37,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-05-12 13:27:37,798 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 435 flow. Second operand 5 states and 88 transitions. [2024-05-12 13:27:37,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 619 flow [2024-05-12 13:27:37,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 564 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 13:27:37,802 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 424 flow [2024-05-12 13:27:37,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=424, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2024-05-12 13:27:37,803 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2024-05-12 13:27:37,803 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 424 flow [2024-05-12 13:27:37,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:37,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:37,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:37,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 13:27:37,804 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-05-12 13:27:37,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:37,804 INFO L85 PathProgramCache]: Analyzing trace with hash 310726630, now seen corresponding path program 1 times [2024-05-12 13:27:37,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:37,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526253976] [2024-05-12 13:27:37,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:37,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:38,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:38,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526253976] [2024-05-12 13:27:38,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526253976] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:38,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:38,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:27:38,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560304684] [2024-05-12 13:27:38,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:38,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:27:38,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:38,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:27:38,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:27:38,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:38,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 424 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:38,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:38,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:38,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:38,501 INFO L124 PetriNetUnfolderBase]: 542/1052 cut-off events. [2024-05-12 13:27:38,501 INFO L125 PetriNetUnfolderBase]: For 2248/2248 co-relation queries the response was YES. [2024-05-12 13:27:38,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3577 conditions, 1052 events. 542/1052 cut-off events. For 2248/2248 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5632 event pairs, 123 based on Foata normal form. 6/1015 useless extension candidates. Maximal degree in co-relation 3544. Up to 683 conditions per place. [2024-05-12 13:27:38,507 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 67 selfloop transitions, 18 changer transitions 0/92 dead transitions. [2024-05-12 13:27:38,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 92 transitions, 710 flow [2024-05-12 13:27:38,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:27:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:27:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-05-12 13:27:38,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2024-05-12 13:27:38,509 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 424 flow. Second operand 6 states and 113 transitions. [2024-05-12 13:27:38,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 92 transitions, 710 flow [2024-05-12 13:27:38,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 690 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-05-12 13:27:38,514 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 480 flow [2024-05-12 13:27:38,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2024-05-12 13:27:38,515 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2024-05-12 13:27:38,515 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 480 flow [2024-05-12 13:27:38,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:38,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:38,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:38,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 13:27:38,516 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-05-12 13:27:38,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:38,516 INFO L85 PathProgramCache]: Analyzing trace with hash -597290462, now seen corresponding path program 2 times [2024-05-12 13:27:38,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:38,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19152808] [2024-05-12 13:27:38,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:38,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:38,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-05-12 13:27:38,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:38,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19152808] [2024-05-12 13:27:38,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19152808] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:38,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:38,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:27:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475179554] [2024-05-12 13:27:38,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:38,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:27:38,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:38,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:27:38,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:27:38,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:38,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 480 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:38,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:38,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:38,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:39,217 INFO L124 PetriNetUnfolderBase]: 531/1056 cut-off events. [2024-05-12 13:27:39,218 INFO L125 PetriNetUnfolderBase]: For 2543/2543 co-relation queries the response was YES. [2024-05-12 13:27:39,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3657 conditions, 1056 events. 531/1056 cut-off events. For 2543/2543 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5857 event pairs, 165 based on Foata normal form. 3/1016 useless extension candidates. Maximal degree in co-relation 3623. Up to 834 conditions per place. [2024-05-12 13:27:39,223 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 65 selfloop transitions, 11 changer transitions 0/83 dead transitions. [2024-05-12 13:27:39,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 675 flow [2024-05-12 13:27:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:27:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:27:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-05-12 13:27:39,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 13:27:39,225 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 480 flow. Second operand 6 states and 102 transitions. [2024-05-12 13:27:39,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 675 flow [2024-05-12 13:27:39,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 83 transitions, 652 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 13:27:39,230 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 485 flow [2024-05-12 13:27:39,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-05-12 13:27:39,230 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2024-05-12 13:27:39,231 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 485 flow [2024-05-12 13:27:39,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:39,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:39,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:39,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 13:27:39,231 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-05-12 13:27:39,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:39,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1353108621, now seen corresponding path program 1 times [2024-05-12 13:27:39,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:39,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710817632] [2024-05-12 13:27:39,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:39,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:39,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:39,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710817632] [2024-05-12 13:27:39,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710817632] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:39,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:39,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:27:39,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658938550] [2024-05-12 13:27:39,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:39,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:27:39,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:39,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:27:39,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:27:39,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:39,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 485 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:39,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:39,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:39,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:40,234 INFO L124 PetriNetUnfolderBase]: 533/1060 cut-off events. [2024-05-12 13:27:40,234 INFO L125 PetriNetUnfolderBase]: For 2729/2729 co-relation queries the response was YES. [2024-05-12 13:27:40,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3659 conditions, 1060 events. 533/1060 cut-off events. For 2729/2729 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5866 event pairs, 133 based on Foata normal form. 2/1019 useless extension candidates. Maximal degree in co-relation 3624. Up to 831 conditions per place. [2024-05-12 13:27:40,241 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 71 selfloop transitions, 13 changer transitions 0/91 dead transitions. [2024-05-12 13:27:40,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 91 transitions, 731 flow [2024-05-12 13:27:40,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:27:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:27:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-05-12 13:27:40,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-05-12 13:27:40,242 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 485 flow. Second operand 7 states and 117 transitions. [2024-05-12 13:27:40,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 91 transitions, 731 flow [2024-05-12 13:27:40,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 679 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 13:27:40,248 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 512 flow [2024-05-12 13:27:40,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=512, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2024-05-12 13:27:40,249 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2024-05-12 13:27:40,249 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 512 flow [2024-05-12 13:27:40,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:40,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:40,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:40,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 13:27:40,249 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-05-12 13:27:40,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:40,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1050190504, now seen corresponding path program 1 times [2024-05-12 13:27:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:40,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284707145] [2024-05-12 13:27:40,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:40,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:41,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:41,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284707145] [2024-05-12 13:27:41,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284707145] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:41,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:41,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:27:41,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843612172] [2024-05-12 13:27:41,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:41,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:27:41,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:41,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:27:41,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:27:41,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:41,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 512 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:41,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:41,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:41,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:41,786 INFO L124 PetriNetUnfolderBase]: 530/1056 cut-off events. [2024-05-12 13:27:41,786 INFO L125 PetriNetUnfolderBase]: For 2612/2612 co-relation queries the response was YES. [2024-05-12 13:27:41,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3712 conditions, 1056 events. 530/1056 cut-off events. For 2612/2612 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5873 event pairs, 132 based on Foata normal form. 2/1014 useless extension candidates. Maximal degree in co-relation 3676. Up to 814 conditions per place. [2024-05-12 13:27:41,795 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 72 selfloop transitions, 15 changer transitions 0/94 dead transitions. [2024-05-12 13:27:41,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 94 transitions, 738 flow [2024-05-12 13:27:41,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:27:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:27:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-05-12 13:27:41,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2024-05-12 13:27:41,801 INFO L175 Difference]: Start difference. First operand has 72 places, 72 transitions, 512 flow. Second operand 7 states and 118 transitions. [2024-05-12 13:27:41,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 94 transitions, 738 flow [2024-05-12 13:27:41,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 94 transitions, 699 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-05-12 13:27:41,821 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 508 flow [2024-05-12 13:27:41,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=508, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2024-05-12 13:27:41,822 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2024-05-12 13:27:41,822 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 508 flow [2024-05-12 13:27:41,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:41,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:41,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:41,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 13:27:41,823 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-05-12 13:27:41,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:41,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1719354117, now seen corresponding path program 1 times [2024-05-12 13:27:41,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:41,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134582251] [2024-05-12 13:27:41,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:41,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:42,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:42,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134582251] [2024-05-12 13:27:42,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134582251] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:42,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:42,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:27:42,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998647656] [2024-05-12 13:27:42,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:42,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:27:42,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:42,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:27:42,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:27:42,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:42,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 508 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-05-12 13:27:42,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:42,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:42,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:42,720 INFO L124 PetriNetUnfolderBase]: 541/965 cut-off events. [2024-05-12 13:27:42,720 INFO L125 PetriNetUnfolderBase]: For 2787/2787 co-relation queries the response was YES. [2024-05-12 13:27:42,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3643 conditions, 965 events. 541/965 cut-off events. For 2787/2787 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4904 event pairs, 84 based on Foata normal form. 1/950 useless extension candidates. Maximal degree in co-relation 3606. Up to 721 conditions per place. [2024-05-12 13:27:42,726 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 77 selfloop transitions, 21 changer transitions 0/105 dead transitions. [2024-05-12 13:27:42,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 105 transitions, 830 flow [2024-05-12 13:27:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:27:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:27:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-05-12 13:27:42,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2024-05-12 13:27:42,727 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 508 flow. Second operand 7 states and 129 transitions. [2024-05-12 13:27:42,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 105 transitions, 830 flow [2024-05-12 13:27:42,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 105 transitions, 781 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-05-12 13:27:42,733 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 534 flow [2024-05-12 13:27:42,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=534, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2024-05-12 13:27:42,734 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2024-05-12 13:27:42,734 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 534 flow [2024-05-12 13:27:42,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-05-12 13:27:42,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:42,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:42,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 13:27:42,735 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-05-12 13:27:42,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:42,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2114449369, now seen corresponding path program 2 times [2024-05-12 13:27:42,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:42,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148319185] [2024-05-12 13:27:42,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:42,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:43,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:43,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148319185] [2024-05-12 13:27:43,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148319185] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:43,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:43,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:27:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061279014] [2024-05-12 13:27:43,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:43,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:27:43,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:27:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:27:43,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:43,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 534 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-05-12 13:27:43,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:43,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:43,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:43,568 INFO L124 PetriNetUnfolderBase]: 542/959 cut-off events. [2024-05-12 13:27:43,568 INFO L125 PetriNetUnfolderBase]: For 2765/2765 co-relation queries the response was YES. [2024-05-12 13:27:43,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 959 events. 542/959 cut-off events. For 2765/2765 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4805 event pairs, 86 based on Foata normal form. 1/946 useless extension candidates. Maximal degree in co-relation 3695. Up to 764 conditions per place. [2024-05-12 13:27:43,574 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 73 selfloop transitions, 23 changer transitions 0/103 dead transitions. [2024-05-12 13:27:43,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 103 transitions, 817 flow [2024-05-12 13:27:43,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:27:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:27:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-05-12 13:27:43,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603174603174605 [2024-05-12 13:27:43,575 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 534 flow. Second operand 7 states and 125 transitions. [2024-05-12 13:27:43,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 103 transitions, 817 flow [2024-05-12 13:27:43,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 103 transitions, 789 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 13:27:43,581 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 588 flow [2024-05-12 13:27:43,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=588, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2024-05-12 13:27:43,582 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 41 predicate places. [2024-05-12 13:27:43,582 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 588 flow [2024-05-12 13:27:43,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-05-12 13:27:43,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:43,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:43,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 13:27:43,583 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-05-12 13:27:43,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:43,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1529713370, now seen corresponding path program 1 times [2024-05-12 13:27:43,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:43,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914998612] [2024-05-12 13:27:43,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:43,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:44,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:44,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914998612] [2024-05-12 13:27:44,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914998612] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:44,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:44,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:27:44,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549561462] [2024-05-12 13:27:44,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:44,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:27:44,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:44,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:27:44,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:27:44,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:44,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 588 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-05-12 13:27:44,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:44,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:44,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:44,603 INFO L124 PetriNetUnfolderBase]: 544/1033 cut-off events. [2024-05-12 13:27:44,603 INFO L125 PetriNetUnfolderBase]: For 3086/3086 co-relation queries the response was YES. [2024-05-12 13:27:44,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3940 conditions, 1033 events. 544/1033 cut-off events. For 3086/3086 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5560 event pairs, 105 based on Foata normal form. 2/998 useless extension candidates. Maximal degree in co-relation 3901. Up to 629 conditions per place. [2024-05-12 13:27:44,609 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 75 selfloop transitions, 26 changer transitions 0/108 dead transitions. [2024-05-12 13:27:44,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 108 transitions, 903 flow [2024-05-12 13:27:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:27:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:27:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-05-12 13:27:44,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-05-12 13:27:44,610 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 588 flow. Second operand 6 states and 117 transitions. [2024-05-12 13:27:44,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 108 transitions, 903 flow [2024-05-12 13:27:44,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 108 transitions, 860 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 13:27:44,617 INFO L231 Difference]: Finished difference. Result has 83 places, 80 transitions, 632 flow [2024-05-12 13:27:44,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=632, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2024-05-12 13:27:44,617 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2024-05-12 13:27:44,617 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 632 flow [2024-05-12 13:27:44,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-05-12 13:27:44,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:44,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:44,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 13:27:44,618 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-05-12 13:27:44,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:44,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1763110962, now seen corresponding path program 1 times [2024-05-12 13:27:44,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:44,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676600616] [2024-05-12 13:27:44,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:44,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:45,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:45,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676600616] [2024-05-12 13:27:45,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676600616] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:45,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:45,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:27:45,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721712253] [2024-05-12 13:27:45,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:45,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:27:45,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:45,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:27:45,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:27:45,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:45,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 632 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:45,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:45,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:45,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:45,654 INFO L124 PetriNetUnfolderBase]: 584/1097 cut-off events. [2024-05-12 13:27:45,655 INFO L125 PetriNetUnfolderBase]: For 4074/4074 co-relation queries the response was YES. [2024-05-12 13:27:45,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4394 conditions, 1097 events. 584/1097 cut-off events. For 4074/4074 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5972 event pairs, 84 based on Foata normal form. 2/1065 useless extension candidates. Maximal degree in co-relation 4354. Up to 714 conditions per place. [2024-05-12 13:27:45,661 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 100 selfloop transitions, 22 changer transitions 0/129 dead transitions. [2024-05-12 13:27:45,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 129 transitions, 1107 flow [2024-05-12 13:27:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:27:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:27:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-05-12 13:27:45,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2024-05-12 13:27:45,663 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 632 flow. Second operand 8 states and 145 transitions. [2024-05-12 13:27:45,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 129 transitions, 1107 flow [2024-05-12 13:27:45,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 129 transitions, 1063 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 13:27:45,671 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 779 flow [2024-05-12 13:27:45,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=779, PETRI_PLACES=90, PETRI_TRANSITIONS=93} [2024-05-12 13:27:45,672 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 50 predicate places. [2024-05-12 13:27:45,672 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 779 flow [2024-05-12 13:27:45,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:45,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:45,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:45,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 13:27:45,673 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-05-12 13:27:45,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:45,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1126216632, now seen corresponding path program 1 times [2024-05-12 13:27:45,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:45,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352592325] [2024-05-12 13:27:45,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:45,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:46,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:46,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352592325] [2024-05-12 13:27:46,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352592325] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:46,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:46,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:27:46,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019130387] [2024-05-12 13:27:46,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:46,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:27:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:46,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:27:46,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:27:46,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:46,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 779 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:46,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:46,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:46,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:46,832 INFO L124 PetriNetUnfolderBase]: 606/1109 cut-off events. [2024-05-12 13:27:46,833 INFO L125 PetriNetUnfolderBase]: For 4502/4502 co-relation queries the response was YES. [2024-05-12 13:27:46,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4709 conditions, 1109 events. 606/1109 cut-off events. For 4502/4502 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5981 event pairs, 91 based on Foata normal form. 2/1086 useless extension candidates. Maximal degree in co-relation 4665. Up to 516 conditions per place. [2024-05-12 13:27:46,843 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 94 selfloop transitions, 37 changer transitions 0/138 dead transitions. [2024-05-12 13:27:46,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 138 transitions, 1235 flow [2024-05-12 13:27:46,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:27:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:27:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-05-12 13:27:46,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-05-12 13:27:46,845 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 779 flow. Second operand 8 states and 152 transitions. [2024-05-12 13:27:46,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 138 transitions, 1235 flow [2024-05-12 13:27:46,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 138 transitions, 1217 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-05-12 13:27:46,860 INFO L231 Difference]: Finished difference. Result has 97 places, 99 transitions, 917 flow [2024-05-12 13:27:46,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=917, PETRI_PLACES=97, PETRI_TRANSITIONS=99} [2024-05-12 13:27:46,860 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 57 predicate places. [2024-05-12 13:27:46,860 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 99 transitions, 917 flow [2024-05-12 13:27:46,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:46,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:46,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:46,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 13:27:46,861 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-05-12 13:27:46,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:46,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1126216756, now seen corresponding path program 2 times [2024-05-12 13:27:46,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:46,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864509848] [2024-05-12 13:27:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:47,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:47,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864509848] [2024-05-12 13:27:47,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864509848] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:47,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:47,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:27:47,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823469680] [2024-05-12 13:27:47,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:47,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:27:47,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:47,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:27:47,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:27:47,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:47,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 917 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:47,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:47,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:47,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:48,022 INFO L124 PetriNetUnfolderBase]: 751/1380 cut-off events. [2024-05-12 13:27:48,023 INFO L125 PetriNetUnfolderBase]: For 7540/7540 co-relation queries the response was YES. [2024-05-12 13:27:48,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5968 conditions, 1380 events. 751/1380 cut-off events. For 7540/7540 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7848 event pairs, 133 based on Foata normal form. 18/1366 useless extension candidates. Maximal degree in co-relation 5921. Up to 715 conditions per place. [2024-05-12 13:27:48,033 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 115 selfloop transitions, 31 changer transitions 0/153 dead transitions. [2024-05-12 13:27:48,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 153 transitions, 1454 flow [2024-05-12 13:27:48,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:27:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:27:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-05-12 13:27:48,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2024-05-12 13:27:48,035 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 917 flow. Second operand 9 states and 176 transitions. [2024-05-12 13:27:48,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 153 transitions, 1454 flow [2024-05-12 13:27:48,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 153 transitions, 1417 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-05-12 13:27:48,050 INFO L231 Difference]: Finished difference. Result has 105 places, 105 transitions, 1036 flow [2024-05-12 13:27:48,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1036, PETRI_PLACES=105, PETRI_TRANSITIONS=105} [2024-05-12 13:27:48,051 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 65 predicate places. [2024-05-12 13:27:48,051 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 105 transitions, 1036 flow [2024-05-12 13:27:48,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:48,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:48,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:48,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 13:27:48,051 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-05-12 13:27:48,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:48,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1123420122, now seen corresponding path program 2 times [2024-05-12 13:27:48,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:48,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449318235] [2024-05-12 13:27:48,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:48,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:48,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:48,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449318235] [2024-05-12 13:27:48,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449318235] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:48,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:48,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:27:48,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942536686] [2024-05-12 13:27:48,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:48,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:27:48,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:48,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:27:48,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:27:48,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:48,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 105 transitions, 1036 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:48,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:48,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:48,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:49,230 INFO L124 PetriNetUnfolderBase]: 791/1402 cut-off events. [2024-05-12 13:27:49,230 INFO L125 PetriNetUnfolderBase]: For 7312/7312 co-relation queries the response was YES. [2024-05-12 13:27:49,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6569 conditions, 1402 events. 791/1402 cut-off events. For 7312/7312 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7872 event pairs, 85 based on Foata normal form. 2/1385 useless extension candidates. Maximal degree in co-relation 6518. Up to 908 conditions per place. [2024-05-12 13:27:49,239 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 97 selfloop transitions, 44 changer transitions 0/148 dead transitions. [2024-05-12 13:27:49,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 148 transitions, 1506 flow [2024-05-12 13:27:49,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:27:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:27:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-05-12 13:27:49,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-05-12 13:27:49,240 INFO L175 Difference]: Start difference. First operand has 105 places, 105 transitions, 1036 flow. Second operand 8 states and 150 transitions. [2024-05-12 13:27:49,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 148 transitions, 1506 flow [2024-05-12 13:27:49,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 148 transitions, 1465 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-05-12 13:27:49,259 INFO L231 Difference]: Finished difference. Result has 110 places, 112 transitions, 1187 flow [2024-05-12 13:27:49,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1187, PETRI_PLACES=110, PETRI_TRANSITIONS=112} [2024-05-12 13:27:49,260 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 70 predicate places. [2024-05-12 13:27:49,260 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 112 transitions, 1187 flow [2024-05-12 13:27:49,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:49,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:49,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:49,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 13:27:49,261 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-05-12 13:27:49,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:49,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1644962708, now seen corresponding path program 3 times [2024-05-12 13:27:49,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:49,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705410688] [2024-05-12 13:27:49,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:49,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:50,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705410688] [2024-05-12 13:27:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705410688] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:50,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:50,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:27:50,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362226340] [2024-05-12 13:27:50,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:50,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:27:50,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:50,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:27:50,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:27:50,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:50,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 112 transitions, 1187 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:50,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:50,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:50,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:50,560 INFO L124 PetriNetUnfolderBase]: 813/1436 cut-off events. [2024-05-12 13:27:50,561 INFO L125 PetriNetUnfolderBase]: For 8076/8076 co-relation queries the response was YES. [2024-05-12 13:27:50,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7008 conditions, 1436 events. 813/1436 cut-off events. For 8076/8076 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8096 event pairs, 84 based on Foata normal form. 2/1419 useless extension candidates. Maximal degree in co-relation 6954. Up to 892 conditions per place. [2024-05-12 13:27:50,569 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 100 selfloop transitions, 51 changer transitions 0/158 dead transitions. [2024-05-12 13:27:50,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 158 transitions, 1694 flow [2024-05-12 13:27:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:27:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:27:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-05-12 13:27:50,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2024-05-12 13:27:50,572 INFO L175 Difference]: Start difference. First operand has 110 places, 112 transitions, 1187 flow. Second operand 8 states and 158 transitions. [2024-05-12 13:27:50,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 158 transitions, 1694 flow [2024-05-12 13:27:50,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 158 transitions, 1626 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-05-12 13:27:50,599 INFO L231 Difference]: Finished difference. Result has 116 places, 116 transitions, 1309 flow [2024-05-12 13:27:50,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1309, PETRI_PLACES=116, PETRI_TRANSITIONS=116} [2024-05-12 13:27:50,599 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 76 predicate places. [2024-05-12 13:27:50,599 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 116 transitions, 1309 flow [2024-05-12 13:27:50,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:50,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:50,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:50,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 13:27:50,600 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-05-12 13:27:50,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1008124302, now seen corresponding path program 4 times [2024-05-12 13:27:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:50,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541754432] [2024-05-12 13:27:50,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:50,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:51,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:51,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541754432] [2024-05-12 13:27:51,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541754432] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:51,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:51,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:27:51,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313932055] [2024-05-12 13:27:51,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:51,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:27:51,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:51,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:27:51,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:27:51,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:51,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 116 transitions, 1309 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:51,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:51,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:51,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:51,817 INFO L124 PetriNetUnfolderBase]: 857/1610 cut-off events. [2024-05-12 13:27:51,817 INFO L125 PetriNetUnfolderBase]: For 9284/9284 co-relation queries the response was YES. [2024-05-12 13:27:51,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7911 conditions, 1610 events. 857/1610 cut-off events. For 9284/9284 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9745 event pairs, 191 based on Foata normal form. 2/1560 useless extension candidates. Maximal degree in co-relation 7854. Up to 1176 conditions per place. [2024-05-12 13:27:51,829 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 124 selfloop transitions, 25 changer transitions 0/156 dead transitions. [2024-05-12 13:27:51,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 156 transitions, 1768 flow [2024-05-12 13:27:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:27:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:27:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-05-12 13:27:51,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2024-05-12 13:27:51,830 INFO L175 Difference]: Start difference. First operand has 116 places, 116 transitions, 1309 flow. Second operand 8 states and 149 transitions. [2024-05-12 13:27:51,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 156 transitions, 1768 flow [2024-05-12 13:27:51,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 156 transitions, 1639 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-05-12 13:27:51,857 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 1298 flow [2024-05-12 13:27:51,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1298, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2024-05-12 13:27:51,858 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 79 predicate places. [2024-05-12 13:27:51,858 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 1298 flow [2024-05-12 13:27:51,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:51,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:51,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:51,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 13:27:51,859 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-05-12 13:27:51,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:51,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1007951322, now seen corresponding path program 5 times [2024-05-12 13:27:51,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:51,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130256354] [2024-05-12 13:27:51,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:51,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:52,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:52,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130256354] [2024-05-12 13:27:52,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130256354] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:52,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:52,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:27:52,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275821230] [2024-05-12 13:27:52,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:52,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:27:52,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:52,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:27:52,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:27:52,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:52,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 1298 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:52,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:52,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:52,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:53,159 INFO L124 PetriNetUnfolderBase]: 853/1590 cut-off events. [2024-05-12 13:27:53,160 INFO L125 PetriNetUnfolderBase]: For 9358/9358 co-relation queries the response was YES. [2024-05-12 13:27:53,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7480 conditions, 1590 events. 853/1590 cut-off events. For 9358/9358 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9530 event pairs, 185 based on Foata normal form. 2/1544 useless extension candidates. Maximal degree in co-relation 7423. Up to 1170 conditions per place. [2024-05-12 13:27:53,171 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 122 selfloop transitions, 23 changer transitions 0/152 dead transitions. [2024-05-12 13:27:53,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 152 transitions, 1680 flow [2024-05-12 13:27:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:27:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:27:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-05-12 13:27:53,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965277777777778 [2024-05-12 13:27:53,172 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 1298 flow. Second operand 8 states and 143 transitions. [2024-05-12 13:27:53,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 152 transitions, 1680 flow [2024-05-12 13:27:53,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 152 transitions, 1617 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-05-12 13:27:53,195 INFO L231 Difference]: Finished difference. Result has 122 places, 120 transitions, 1286 flow [2024-05-12 13:27:53,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1286, PETRI_PLACES=122, PETRI_TRANSITIONS=120} [2024-05-12 13:27:53,196 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 82 predicate places. [2024-05-12 13:27:53,196 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 120 transitions, 1286 flow [2024-05-12 13:27:53,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:53,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:53,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:53,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 13:27:53,197 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-05-12 13:27:53,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:53,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1022526576, now seen corresponding path program 1 times [2024-05-12 13:27:53,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:53,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481262400] [2024-05-12 13:27:53,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:53,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:54,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:54,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481262400] [2024-05-12 13:27:54,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481262400] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:54,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:54,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:27:54,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195407425] [2024-05-12 13:27:54,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:54,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:27:54,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:54,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:27:54,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:27:54,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:54,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 120 transitions, 1286 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:54,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:54,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:54,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:54,655 INFO L124 PetriNetUnfolderBase]: 865/1676 cut-off events. [2024-05-12 13:27:54,655 INFO L125 PetriNetUnfolderBase]: For 10961/10961 co-relation queries the response was YES. [2024-05-12 13:27:54,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7596 conditions, 1676 events. 865/1676 cut-off events. For 10961/10961 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10443 event pairs, 452 based on Foata normal form. 2/1622 useless extension candidates. Maximal degree in co-relation 7538. Up to 1380 conditions per place. [2024-05-12 13:27:54,690 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 122 selfloop transitions, 18 changer transitions 0/147 dead transitions. [2024-05-12 13:27:54,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 147 transitions, 1675 flow [2024-05-12 13:27:54,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:27:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:27:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-05-12 13:27:54,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-05-12 13:27:54,702 INFO L175 Difference]: Start difference. First operand has 122 places, 120 transitions, 1286 flow. Second operand 8 states and 132 transitions. [2024-05-12 13:27:54,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 147 transitions, 1675 flow [2024-05-12 13:27:54,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 147 transitions, 1628 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-05-12 13:27:54,743 INFO L231 Difference]: Finished difference. Result has 128 places, 127 transitions, 1364 flow [2024-05-12 13:27:54,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1241, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1364, PETRI_PLACES=128, PETRI_TRANSITIONS=127} [2024-05-12 13:27:54,744 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 88 predicate places. [2024-05-12 13:27:54,744 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 127 transitions, 1364 flow [2024-05-12 13:27:54,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:54,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:54,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:54,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 13:27:54,752 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-05-12 13:27:54,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash -603964094, now seen corresponding path program 2 times [2024-05-12 13:27:54,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:54,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4992175] [2024-05-12 13:27:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:54,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:55,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:55,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4992175] [2024-05-12 13:27:55,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4992175] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:55,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:55,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:27:55,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87071718] [2024-05-12 13:27:55,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:55,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:27:55,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:55,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:27:55,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:27:55,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:55,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 1364 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:55,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:55,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:55,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:56,054 INFO L124 PetriNetUnfolderBase]: 885/1717 cut-off events. [2024-05-12 13:27:56,054 INFO L125 PetriNetUnfolderBase]: For 11382/11382 co-relation queries the response was YES. [2024-05-12 13:27:56,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7754 conditions, 1717 events. 885/1717 cut-off events. For 11382/11382 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10767 event pairs, 431 based on Foata normal form. 2/1662 useless extension candidates. Maximal degree in co-relation 7693. Up to 1386 conditions per place. [2024-05-12 13:27:56,079 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 131 selfloop transitions, 18 changer transitions 0/156 dead transitions. [2024-05-12 13:27:56,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 156 transitions, 1752 flow [2024-05-12 13:27:56,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:27:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:27:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-05-12 13:27:56,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-05-12 13:27:56,089 INFO L175 Difference]: Start difference. First operand has 128 places, 127 transitions, 1364 flow. Second operand 8 states and 135 transitions. [2024-05-12 13:27:56,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 156 transitions, 1752 flow [2024-05-12 13:27:56,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 156 transitions, 1724 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-05-12 13:27:56,142 INFO L231 Difference]: Finished difference. Result has 135 places, 130 transitions, 1414 flow [2024-05-12 13:27:56,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1414, PETRI_PLACES=135, PETRI_TRANSITIONS=130} [2024-05-12 13:27:56,143 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 95 predicate places. [2024-05-12 13:27:56,143 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 130 transitions, 1414 flow [2024-05-12 13:27:56,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:56,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:56,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:56,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 13:27:56,144 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-05-12 13:27:56,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:56,144 INFO L85 PathProgramCache]: Analyzing trace with hash -349321238, now seen corresponding path program 3 times [2024-05-12 13:27:56,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:56,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631246356] [2024-05-12 13:27:56,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:56,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:57,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:57,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631246356] [2024-05-12 13:27:57,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631246356] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:57,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:57,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:27:57,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237462204] [2024-05-12 13:27:57,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:57,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:27:57,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:57,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:27:57,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:27:57,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:57,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 130 transitions, 1414 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:57,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:57,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:57,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:57,516 INFO L124 PetriNetUnfolderBase]: 886/1719 cut-off events. [2024-05-12 13:27:57,516 INFO L125 PetriNetUnfolderBase]: For 11902/11902 co-relation queries the response was YES. [2024-05-12 13:27:57,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7883 conditions, 1719 events. 886/1719 cut-off events. For 11902/11902 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10814 event pairs, 477 based on Foata normal form. 2/1665 useless extension candidates. Maximal degree in co-relation 7817. Up to 1412 conditions per place. [2024-05-12 13:27:57,526 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 135 selfloop transitions, 14 changer transitions 0/156 dead transitions. [2024-05-12 13:27:57,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 156 transitions, 1808 flow [2024-05-12 13:27:57,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:27:57,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:27:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-05-12 13:27:57,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4618055555555556 [2024-05-12 13:27:57,528 INFO L175 Difference]: Start difference. First operand has 135 places, 130 transitions, 1414 flow. Second operand 8 states and 133 transitions. [2024-05-12 13:27:57,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 156 transitions, 1808 flow [2024-05-12 13:27:57,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 156 transitions, 1758 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-05-12 13:27:57,560 INFO L231 Difference]: Finished difference. Result has 138 places, 131 transitions, 1412 flow [2024-05-12 13:27:57,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1412, PETRI_PLACES=138, PETRI_TRANSITIONS=131} [2024-05-12 13:27:57,560 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 98 predicate places. [2024-05-12 13:27:57,561 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 131 transitions, 1412 flow [2024-05-12 13:27:57,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:57,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:57,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:57,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 13:27:57,561 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-05-12 13:27:57,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:57,562 INFO L85 PathProgramCache]: Analyzing trace with hash -613464478, now seen corresponding path program 6 times [2024-05-12 13:27:57,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:57,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929643015] [2024-05-12 13:27:57,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:57,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:58,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:58,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929643015] [2024-05-12 13:27:58,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929643015] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:58,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:58,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:27:58,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344754111] [2024-05-12 13:27:58,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:58,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:27:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:58,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:27:58,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:27:58,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:58,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 131 transitions, 1412 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:58,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:58,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:58,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:58,860 INFO L124 PetriNetUnfolderBase]: 906/1603 cut-off events. [2024-05-12 13:27:58,860 INFO L125 PetriNetUnfolderBase]: For 10791/10797 co-relation queries the response was YES. [2024-05-12 13:27:58,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7819 conditions, 1603 events. 906/1603 cut-off events. For 10791/10797 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9383 event pairs, 120 based on Foata normal form. 8/1589 useless extension candidates. Maximal degree in co-relation 7752. Up to 1239 conditions per place. [2024-05-12 13:27:58,871 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 117 selfloop transitions, 50 changer transitions 0/174 dead transitions. [2024-05-12 13:27:58,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 174 transitions, 1951 flow [2024-05-12 13:27:58,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:27:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:27:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-05-12 13:27:58,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2024-05-12 13:27:58,873 INFO L175 Difference]: Start difference. First operand has 138 places, 131 transitions, 1412 flow. Second operand 8 states and 154 transitions. [2024-05-12 13:27:58,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 174 transitions, 1951 flow [2024-05-12 13:27:58,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 174 transitions, 1901 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-05-12 13:27:58,909 INFO L231 Difference]: Finished difference. Result has 144 places, 139 transitions, 1635 flow [2024-05-12 13:27:58,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1635, PETRI_PLACES=144, PETRI_TRANSITIONS=139} [2024-05-12 13:27:58,910 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 104 predicate places. [2024-05-12 13:27:58,910 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 139 transitions, 1635 flow [2024-05-12 13:27:58,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-05-12 13:27:58,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:58,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:58,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 13:27:58,911 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:27:58,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:58,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1544592044, now seen corresponding path program 1 times [2024-05-12 13:27:58,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:58,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793751564] [2024-05-12 13:27:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:58,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:58,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:58,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793751564] [2024-05-12 13:27:58,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793751564] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:58,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:58,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:27:58,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962042957] [2024-05-12 13:27:58,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:58,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 13:27:58,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:58,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 13:27:58,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 13:27:58,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 13:27:58,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 139 transitions, 1635 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:58,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:58,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 13:27:58,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:27:59,126 INFO L124 PetriNetUnfolderBase]: 471/1067 cut-off events. [2024-05-12 13:27:59,126 INFO L125 PetriNetUnfolderBase]: For 5769/5844 co-relation queries the response was YES. [2024-05-12 13:27:59,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4313 conditions, 1067 events. 471/1067 cut-off events. For 5769/5844 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6547 event pairs, 102 based on Foata normal form. 95/1100 useless extension candidates. Maximal degree in co-relation 4258. Up to 353 conditions per place. [2024-05-12 13:27:59,154 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 57 selfloop transitions, 26 changer transitions 0/107 dead transitions. [2024-05-12 13:27:59,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 107 transitions, 1264 flow [2024-05-12 13:27:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 13:27:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 13:27:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-05-12 13:27:59,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-05-12 13:27:59,156 INFO L175 Difference]: Start difference. First operand has 144 places, 139 transitions, 1635 flow. Second operand 4 states and 93 transitions. [2024-05-12 13:27:59,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 107 transitions, 1264 flow [2024-05-12 13:27:59,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 107 transitions, 908 flow, removed 13 selfloop flow, removed 39 redundant places. [2024-05-12 13:27:59,169 INFO L231 Difference]: Finished difference. Result has 109 places, 92 transitions, 773 flow [2024-05-12 13:27:59,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=773, PETRI_PLACES=109, PETRI_TRANSITIONS=92} [2024-05-12 13:27:59,170 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 69 predicate places. [2024-05-12 13:27:59,170 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 92 transitions, 773 flow [2024-05-12 13:27:59,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:59,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:27:59,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:27:59,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 13:27:59,171 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-05-12 13:27:59,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:27:59,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1514109827, now seen corresponding path program 1 times [2024-05-12 13:27:59,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:27:59,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064578107] [2024-05-12 13:27:59,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:27:59,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:27:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:27:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:27:59,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:27:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064578107] [2024-05-12 13:27:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064578107] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:27:59,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:27:59,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:27:59,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082102405] [2024-05-12 13:27:59,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:27:59,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:27:59,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:27:59,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:27:59,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:27:59,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:27:59,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 92 transitions, 773 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:27:59,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:27:59,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:27:59,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:00,512 INFO L124 PetriNetUnfolderBase]: 905/1903 cut-off events. [2024-05-12 13:28:00,513 INFO L125 PetriNetUnfolderBase]: For 10865/10868 co-relation queries the response was YES. [2024-05-12 13:28:00,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7126 conditions, 1903 events. 905/1903 cut-off events. For 10865/10868 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12554 event pairs, 294 based on Foata normal form. 11/1798 useless extension candidates. Maximal degree in co-relation 7087. Up to 845 conditions per place. [2024-05-12 13:28:00,523 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 105 selfloop transitions, 49 changer transitions 0/162 dead transitions. [2024-05-12 13:28:00,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 162 transitions, 1514 flow [2024-05-12 13:28:00,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:28:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:28:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-05-12 13:28:00,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027777777777778 [2024-05-12 13:28:00,524 INFO L175 Difference]: Start difference. First operand has 109 places, 92 transitions, 773 flow. Second operand 10 states and 181 transitions. [2024-05-12 13:28:00,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 162 transitions, 1514 flow [2024-05-12 13:28:00,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 162 transitions, 1470 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-05-12 13:28:00,548 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 1059 flow [2024-05-12 13:28:00,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1059, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2024-05-12 13:28:00,549 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 80 predicate places. [2024-05-12 13:28:00,549 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 1059 flow [2024-05-12 13:28:00,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:00,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:00,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:00,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 13:28:00,550 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-05-12 13:28:00,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:00,550 INFO L85 PathProgramCache]: Analyzing trace with hash 947174653, now seen corresponding path program 2 times [2024-05-12 13:28:00,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:00,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600350219] [2024-05-12 13:28:00,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:01,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:01,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600350219] [2024-05-12 13:28:01,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600350219] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:01,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:01,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:01,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747457138] [2024-05-12 13:28:01,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:01,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:01,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:01,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:01,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:01,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:01,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 1059 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:01,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:01,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:01,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:01,983 INFO L124 PetriNetUnfolderBase]: 1578/3456 cut-off events. [2024-05-12 13:28:01,983 INFO L125 PetriNetUnfolderBase]: For 17842/17843 co-relation queries the response was YES. [2024-05-12 13:28:01,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13402 conditions, 3456 events. 1578/3456 cut-off events. For 17842/17843 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 26749 event pairs, 628 based on Foata normal form. 9/3225 useless extension candidates. Maximal degree in co-relation 13359. Up to 1492 conditions per place. [2024-05-12 13:28:02,002 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 145 selfloop transitions, 69 changer transitions 0/222 dead transitions. [2024-05-12 13:28:02,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 222 transitions, 2449 flow [2024-05-12 13:28:02,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:28:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:28:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-05-12 13:28:02,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2024-05-12 13:28:02,003 INFO L175 Difference]: Start difference. First operand has 120 places, 111 transitions, 1059 flow. Second operand 10 states and 182 transitions. [2024-05-12 13:28:02,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 222 transitions, 2449 flow [2024-05-12 13:28:02,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 222 transitions, 2379 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-05-12 13:28:02,045 INFO L231 Difference]: Finished difference. Result has 130 places, 161 transitions, 1914 flow [2024-05-12 13:28:02,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1914, PETRI_PLACES=130, PETRI_TRANSITIONS=161} [2024-05-12 13:28:02,045 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 90 predicate places. [2024-05-12 13:28:02,046 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 161 transitions, 1914 flow [2024-05-12 13:28:02,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:02,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:02,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:02,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 13:28:02,046 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:28:02,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:02,047 INFO L85 PathProgramCache]: Analyzing trace with hash 949052323, now seen corresponding path program 3 times [2024-05-12 13:28:02,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:02,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829844799] [2024-05-12 13:28:02,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:02,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:02,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:02,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829844799] [2024-05-12 13:28:02,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829844799] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:02,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:02,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:02,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491124113] [2024-05-12 13:28:02,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:02,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:02,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:02,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:02,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:02,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:02,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 161 transitions, 1914 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:02,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:02,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:02,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:03,487 INFO L124 PetriNetUnfolderBase]: 1694/3853 cut-off events. [2024-05-12 13:28:03,488 INFO L125 PetriNetUnfolderBase]: For 22482/22485 co-relation queries the response was YES. [2024-05-12 13:28:03,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15088 conditions, 3853 events. 1694/3853 cut-off events. For 22482/22485 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 31410 event pairs, 849 based on Foata normal form. 13/3582 useless extension candidates. Maximal degree in co-relation 15040. Up to 2503 conditions per place. [2024-05-12 13:28:03,510 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 133 selfloop transitions, 67 changer transitions 0/208 dead transitions. [2024-05-12 13:28:03,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 208 transitions, 2554 flow [2024-05-12 13:28:03,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:28:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:28:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-05-12 13:28:03,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-05-12 13:28:03,511 INFO L175 Difference]: Start difference. First operand has 130 places, 161 transitions, 1914 flow. Second operand 10 states and 171 transitions. [2024-05-12 13:28:03,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 208 transitions, 2554 flow [2024-05-12 13:28:03,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 208 transitions, 2520 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-05-12 13:28:03,568 INFO L231 Difference]: Finished difference. Result has 139 places, 163 transitions, 2078 flow [2024-05-12 13:28:03,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1880, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2078, PETRI_PLACES=139, PETRI_TRANSITIONS=163} [2024-05-12 13:28:03,569 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 99 predicate places. [2024-05-12 13:28:03,569 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 163 transitions, 2078 flow [2024-05-12 13:28:03,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:03,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:03,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:03,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 13:28:03,570 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-05-12 13:28:03,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1231314257, now seen corresponding path program 4 times [2024-05-12 13:28:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:03,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428135041] [2024-05-12 13:28:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:04,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:04,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428135041] [2024-05-12 13:28:04,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428135041] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:04,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:04,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:04,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676961359] [2024-05-12 13:28:04,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:04,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:04,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:04,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:04,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:04,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:04,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 163 transitions, 2078 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:04,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:04,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:04,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:05,290 INFO L124 PetriNetUnfolderBase]: 1810/4109 cut-off events. [2024-05-12 13:28:05,291 INFO L125 PetriNetUnfolderBase]: For 24701/24704 co-relation queries the response was YES. [2024-05-12 13:28:05,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16262 conditions, 4109 events. 1810/4109 cut-off events. For 24701/24704 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 33990 event pairs, 839 based on Foata normal form. 11/3825 useless extension candidates. Maximal degree in co-relation 16211. Up to 2497 conditions per place. [2024-05-12 13:28:05,310 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 141 selfloop transitions, 67 changer transitions 0/216 dead transitions. [2024-05-12 13:28:05,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 216 transitions, 2760 flow [2024-05-12 13:28:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:28:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:28:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-05-12 13:28:05,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-05-12 13:28:05,311 INFO L175 Difference]: Start difference. First operand has 139 places, 163 transitions, 2078 flow. Second operand 10 states and 178 transitions. [2024-05-12 13:28:05,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 216 transitions, 2760 flow [2024-05-12 13:28:05,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 216 transitions, 2634 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 13:28:05,380 INFO L231 Difference]: Finished difference. Result has 144 places, 164 transitions, 2106 flow [2024-05-12 13:28:05,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1952, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2106, PETRI_PLACES=144, PETRI_TRANSITIONS=164} [2024-05-12 13:28:05,381 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 104 predicate places. [2024-05-12 13:28:05,381 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 164 transitions, 2106 flow [2024-05-12 13:28:05,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:05,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:05,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:05,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 13:28:05,381 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-05-12 13:28:05,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:05,382 INFO L85 PathProgramCache]: Analyzing trace with hash -157980261, now seen corresponding path program 5 times [2024-05-12 13:28:05,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:05,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200536747] [2024-05-12 13:28:05,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:05,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:06,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:06,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200536747] [2024-05-12 13:28:06,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200536747] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:06,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:06,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:06,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821066415] [2024-05-12 13:28:06,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:06,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:06,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:06,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:06,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:06,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:06,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 164 transitions, 2106 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:06,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:06,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:06,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:07,019 INFO L124 PetriNetUnfolderBase]: 2103/4973 cut-off events. [2024-05-12 13:28:07,019 INFO L125 PetriNetUnfolderBase]: For 31232/31238 co-relation queries the response was YES. [2024-05-12 13:28:07,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19062 conditions, 4973 events. 2103/4973 cut-off events. For 31232/31238 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 43986 event pairs, 1108 based on Foata normal form. 14/4620 useless extension candidates. Maximal degree in co-relation 19009. Up to 2876 conditions per place. [2024-05-12 13:28:07,053 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 168 selfloop transitions, 51 changer transitions 0/227 dead transitions. [2024-05-12 13:28:07,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 227 transitions, 3026 flow [2024-05-12 13:28:07,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:28:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:28:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-05-12 13:28:07,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-05-12 13:28:07,054 INFO L175 Difference]: Start difference. First operand has 144 places, 164 transitions, 2106 flow. Second operand 10 states and 178 transitions. [2024-05-12 13:28:07,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 227 transitions, 3026 flow [2024-05-12 13:28:07,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 227 transitions, 2884 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 13:28:07,136 INFO L231 Difference]: Finished difference. Result has 151 places, 177 transitions, 2331 flow [2024-05-12 13:28:07,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1980, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2331, PETRI_PLACES=151, PETRI_TRANSITIONS=177} [2024-05-12 13:28:07,136 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 111 predicate places. [2024-05-12 13:28:07,136 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 177 transitions, 2331 flow [2024-05-12 13:28:07,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:07,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:07,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:07,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 13:28:07,137 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-05-12 13:28:07,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1035744133, now seen corresponding path program 6 times [2024-05-12 13:28:07,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:07,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624323842] [2024-05-12 13:28:07,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:07,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:07,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:07,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624323842] [2024-05-12 13:28:07,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624323842] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:07,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:07,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:07,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630888940] [2024-05-12 13:28:07,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:07,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:07,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:07,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:08,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:08,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 177 transitions, 2331 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:08,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:08,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:08,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:08,965 INFO L124 PetriNetUnfolderBase]: 2090/4945 cut-off events. [2024-05-12 13:28:08,966 INFO L125 PetriNetUnfolderBase]: For 30549/30555 co-relation queries the response was YES. [2024-05-12 13:28:08,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18927 conditions, 4945 events. 2090/4945 cut-off events. For 30549/30555 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 43818 event pairs, 1224 based on Foata normal form. 16/4593 useless extension candidates. Maximal degree in co-relation 18869. Up to 3412 conditions per place. [2024-05-12 13:28:08,990 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 167 selfloop transitions, 44 changer transitions 0/219 dead transitions. [2024-05-12 13:28:08,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 219 transitions, 2956 flow [2024-05-12 13:28:08,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:28:08,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:28:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-05-12 13:28:08,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 13:28:08,994 INFO L175 Difference]: Start difference. First operand has 151 places, 177 transitions, 2331 flow. Second operand 10 states and 170 transitions. [2024-05-12 13:28:08,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 219 transitions, 2956 flow [2024-05-12 13:28:09,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 219 transitions, 2882 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-05-12 13:28:09,071 INFO L231 Difference]: Finished difference. Result has 158 places, 179 transitions, 2395 flow [2024-05-12 13:28:09,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2259, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2395, PETRI_PLACES=158, PETRI_TRANSITIONS=179} [2024-05-12 13:28:09,072 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 118 predicate places. [2024-05-12 13:28:09,072 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 179 transitions, 2395 flow [2024-05-12 13:28:09,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:09,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:09,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:09,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 13:28:09,073 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-05-12 13:28:09,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:09,075 INFO L85 PathProgramCache]: Analyzing trace with hash -440465479, now seen corresponding path program 7 times [2024-05-12 13:28:09,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:09,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728595174] [2024-05-12 13:28:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:09,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:09,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:09,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728595174] [2024-05-12 13:28:09,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728595174] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:09,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:09,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:28:09,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041563257] [2024-05-12 13:28:09,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:09,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:28:09,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:09,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:28:09,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:28:09,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:09,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 179 transitions, 2395 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:09,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:09,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:09,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:10,897 INFO L124 PetriNetUnfolderBase]: 2909/7227 cut-off events. [2024-05-12 13:28:10,897 INFO L125 PetriNetUnfolderBase]: For 38539/38542 co-relation queries the response was YES. [2024-05-12 13:28:10,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25714 conditions, 7227 events. 2909/7227 cut-off events. For 38539/38542 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 71733 event pairs, 1176 based on Foata normal form. 9/6725 useless extension candidates. Maximal degree in co-relation 25653. Up to 3209 conditions per place. [2024-05-12 13:28:10,954 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 140 selfloop transitions, 97 changer transitions 0/245 dead transitions. [2024-05-12 13:28:10,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 245 transitions, 3334 flow [2024-05-12 13:28:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:28:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:28:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-05-12 13:28:10,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216049382716049 [2024-05-12 13:28:10,956 INFO L175 Difference]: Start difference. First operand has 158 places, 179 transitions, 2395 flow. Second operand 9 states and 169 transitions. [2024-05-12 13:28:10,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 245 transitions, 3334 flow [2024-05-12 13:28:11,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 245 transitions, 3281 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-05-12 13:28:11,079 INFO L231 Difference]: Finished difference. Result has 165 places, 186 transitions, 2727 flow [2024-05-12 13:28:11,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2342, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2727, PETRI_PLACES=165, PETRI_TRANSITIONS=186} [2024-05-12 13:28:11,079 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 125 predicate places. [2024-05-12 13:28:11,079 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 186 transitions, 2727 flow [2024-05-12 13:28:11,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:11,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:11,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:11,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 13:28:11,080 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-05-12 13:28:11,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1180460301, now seen corresponding path program 8 times [2024-05-12 13:28:11,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:11,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129645132] [2024-05-12 13:28:11,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:11,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:11,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129645132] [2024-05-12 13:28:11,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129645132] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:11,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:11,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:28:11,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329219412] [2024-05-12 13:28:11,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:11,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:28:11,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:11,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:28:11,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:28:11,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:11,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 186 transitions, 2727 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:11,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:11,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:11,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:13,087 INFO L124 PetriNetUnfolderBase]: 3176/7946 cut-off events. [2024-05-12 13:28:13,087 INFO L125 PetriNetUnfolderBase]: For 47972/47978 co-relation queries the response was YES. [2024-05-12 13:28:13,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28608 conditions, 7946 events. 3176/7946 cut-off events. For 47972/47978 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 80521 event pairs, 1822 based on Foata normal form. 10/7376 useless extension candidates. Maximal degree in co-relation 28543. Up to 3168 conditions per place. [2024-05-12 13:28:13,135 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 130 selfloop transitions, 110 changer transitions 0/248 dead transitions. [2024-05-12 13:28:13,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 248 transitions, 3685 flow [2024-05-12 13:28:13,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:28:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:28:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-05-12 13:28:13,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-05-12 13:28:13,136 INFO L175 Difference]: Start difference. First operand has 165 places, 186 transitions, 2727 flow. Second operand 9 states and 168 transitions. [2024-05-12 13:28:13,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 248 transitions, 3685 flow [2024-05-12 13:28:13,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 248 transitions, 3563 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-05-12 13:28:13,272 INFO L231 Difference]: Finished difference. Result has 172 places, 196 transitions, 3088 flow [2024-05-12 13:28:13,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2618, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3088, PETRI_PLACES=172, PETRI_TRANSITIONS=196} [2024-05-12 13:28:13,273 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 132 predicate places. [2024-05-12 13:28:13,273 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 196 transitions, 3088 flow [2024-05-12 13:28:13,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:13,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:13,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:13,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 13:28:13,274 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-05-12 13:28:13,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:13,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1197437451, now seen corresponding path program 9 times [2024-05-12 13:28:13,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:13,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736645367] [2024-05-12 13:28:13,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:13,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:13,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:13,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736645367] [2024-05-12 13:28:13,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736645367] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:13,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:13,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:13,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741802826] [2024-05-12 13:28:13,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:13,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:13,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:13,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:13,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:13,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:13,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 196 transitions, 3088 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:13,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:13,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:13,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:15,187 INFO L124 PetriNetUnfolderBase]: 3215/8118 cut-off events. [2024-05-12 13:28:15,188 INFO L125 PetriNetUnfolderBase]: For 47680/47681 co-relation queries the response was YES. [2024-05-12 13:28:15,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29625 conditions, 8118 events. 3215/8118 cut-off events. For 47680/47681 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 83202 event pairs, 2085 based on Foata normal form. 11/7520 useless extension candidates. Maximal degree in co-relation 29557. Up to 5262 conditions per place. [2024-05-12 13:28:15,245 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 113 selfloop transitions, 119 changer transitions 0/240 dead transitions. [2024-05-12 13:28:15,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 240 transitions, 3861 flow [2024-05-12 13:28:15,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:28:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:28:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-05-12 13:28:15,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-05-12 13:28:15,247 INFO L175 Difference]: Start difference. First operand has 172 places, 196 transitions, 3088 flow. Second operand 10 states and 172 transitions. [2024-05-12 13:28:15,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 240 transitions, 3861 flow [2024-05-12 13:28:15,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 240 transitions, 3703 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-05-12 13:28:15,403 INFO L231 Difference]: Finished difference. Result has 178 places, 202 transitions, 3346 flow [2024-05-12 13:28:15,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2940, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3346, PETRI_PLACES=178, PETRI_TRANSITIONS=202} [2024-05-12 13:28:15,404 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 138 predicate places. [2024-05-12 13:28:15,404 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 202 transitions, 3346 flow [2024-05-12 13:28:15,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:15,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:15,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:15,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 13:28:15,405 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-05-12 13:28:15,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:15,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1276692881, now seen corresponding path program 10 times [2024-05-12 13:28:15,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:15,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528728868] [2024-05-12 13:28:15,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:15,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:16,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528728868] [2024-05-12 13:28:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528728868] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:16,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174301486] [2024-05-12 13:28:16,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:16,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:16,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:16,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:16,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:16,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 202 transitions, 3346 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:16,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:16,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:16,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:17,580 INFO L124 PetriNetUnfolderBase]: 3477/8709 cut-off events. [2024-05-12 13:28:17,581 INFO L125 PetriNetUnfolderBase]: For 49390/49392 co-relation queries the response was YES. [2024-05-12 13:28:17,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32095 conditions, 8709 events. 3477/8709 cut-off events. For 49390/49392 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 90162 event pairs, 2218 based on Foata normal form. 10/8045 useless extension candidates. Maximal degree in co-relation 32027. Up to 5517 conditions per place. [2024-05-12 13:28:17,645 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 196 selfloop transitions, 75 changer transitions 0/279 dead transitions. [2024-05-12 13:28:17,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 279 transitions, 4692 flow [2024-05-12 13:28:17,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:28:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:28:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-05-12 13:28:17,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2024-05-12 13:28:17,647 INFO L175 Difference]: Start difference. First operand has 178 places, 202 transitions, 3346 flow. Second operand 10 states and 183 transitions. [2024-05-12 13:28:17,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 279 transitions, 4692 flow [2024-05-12 13:28:17,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 279 transitions, 4491 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-05-12 13:28:17,803 INFO L231 Difference]: Finished difference. Result has 186 places, 232 transitions, 3961 flow [2024-05-12 13:28:17,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3168, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3961, PETRI_PLACES=186, PETRI_TRANSITIONS=232} [2024-05-12 13:28:17,804 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 146 predicate places. [2024-05-12 13:28:17,804 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 232 transitions, 3961 flow [2024-05-12 13:28:17,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:17,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:17,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:17,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 13:28:17,804 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-05-12 13:28:17,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:17,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1276696601, now seen corresponding path program 11 times [2024-05-12 13:28:17,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:17,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18450648] [2024-05-12 13:28:17,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:17,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:18,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:18,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18450648] [2024-05-12 13:28:18,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18450648] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:18,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:18,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:18,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412052075] [2024-05-12 13:28:18,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:18,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:18,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:18,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:18,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:18,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:18,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 232 transitions, 3961 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:18,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:18,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:18,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:20,424 INFO L124 PetriNetUnfolderBase]: 3662/9324 cut-off events. [2024-05-12 13:28:20,425 INFO L125 PetriNetUnfolderBase]: For 55670/55672 co-relation queries the response was YES. [2024-05-12 13:28:20,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33829 conditions, 9324 events. 3662/9324 cut-off events. For 55670/55672 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 98740 event pairs, 2566 based on Foata normal form. 14/8604 useless extension candidates. Maximal degree in co-relation 33757. Up to 6334 conditions per place. [2024-05-12 13:28:20,476 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 205 selfloop transitions, 61 changer transitions 0/274 dead transitions. [2024-05-12 13:28:20,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 274 transitions, 4693 flow [2024-05-12 13:28:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 13:28:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 13:28:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2024-05-12 13:28:20,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47474747474747475 [2024-05-12 13:28:20,478 INFO L175 Difference]: Start difference. First operand has 186 places, 232 transitions, 3961 flow. Second operand 11 states and 188 transitions. [2024-05-12 13:28:20,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 274 transitions, 4693 flow [2024-05-12 13:28:20,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 274 transitions, 4625 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 13:28:20,692 INFO L231 Difference]: Finished difference. Result has 195 places, 235 transitions, 4086 flow [2024-05-12 13:28:20,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3893, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4086, PETRI_PLACES=195, PETRI_TRANSITIONS=235} [2024-05-12 13:28:20,692 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 155 predicate places. [2024-05-12 13:28:20,692 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 235 transitions, 4086 flow [2024-05-12 13:28:20,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:20,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:20,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:20,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 13:28:20,693 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-05-12 13:28:20,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1276840751, now seen corresponding path program 12 times [2024-05-12 13:28:20,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:20,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611670183] [2024-05-12 13:28:20,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:20,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:21,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:21,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611670183] [2024-05-12 13:28:21,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611670183] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:21,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:21,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:21,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246350165] [2024-05-12 13:28:21,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:21,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:21,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:21,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:21,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:21,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:21,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 235 transitions, 4086 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:21,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:21,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:21,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:23,032 INFO L124 PetriNetUnfolderBase]: 3820/9773 cut-off events. [2024-05-12 13:28:23,032 INFO L125 PetriNetUnfolderBase]: For 58489/58491 co-relation queries the response was YES. [2024-05-12 13:28:23,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35314 conditions, 9773 events. 3820/9773 cut-off events. For 58489/58491 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 104885 event pairs, 2727 based on Foata normal form. 12/9014 useless extension candidates. Maximal degree in co-relation 35239. Up to 6721 conditions per place. [2024-05-12 13:28:23,102 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 215 selfloop transitions, 47 changer transitions 0/270 dead transitions. [2024-05-12 13:28:23,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 270 transitions, 4765 flow [2024-05-12 13:28:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:28:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:28:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-05-12 13:28:23,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 13:28:23,104 INFO L175 Difference]: Start difference. First operand has 195 places, 235 transitions, 4086 flow. Second operand 10 states and 170 transitions. [2024-05-12 13:28:23,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 270 transitions, 4765 flow [2024-05-12 13:28:23,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 270 transitions, 4703 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 13:28:23,303 INFO L231 Difference]: Finished difference. Result has 201 places, 235 transitions, 4124 flow [2024-05-12 13:28:23,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4024, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4124, PETRI_PLACES=201, PETRI_TRANSITIONS=235} [2024-05-12 13:28:23,303 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 161 predicate places. [2024-05-12 13:28:23,303 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 235 transitions, 4124 flow [2024-05-12 13:28:23,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:23,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:23,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:23,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 13:28:23,304 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-05-12 13:28:23,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:23,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1282410893, now seen corresponding path program 1 times [2024-05-12 13:28:23,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:23,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141702461] [2024-05-12 13:28:23,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:23,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:24,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:24,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141702461] [2024-05-12 13:28:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141702461] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:24,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:24,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:24,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640588725] [2024-05-12 13:28:24,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:24,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:24,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:24,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:24,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:24,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 235 transitions, 4124 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:24,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:24,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:24,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:25,528 INFO L124 PetriNetUnfolderBase]: 3862/9873 cut-off events. [2024-05-12 13:28:25,529 INFO L125 PetriNetUnfolderBase]: For 58038/58043 co-relation queries the response was YES. [2024-05-12 13:28:25,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35855 conditions, 9873 events. 3862/9873 cut-off events. For 58038/58043 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 106065 event pairs, 2782 based on Foata normal form. 7/9101 useless extension candidates. Maximal degree in co-relation 35779. Up to 7105 conditions per place. [2024-05-12 13:28:25,620 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 215 selfloop transitions, 49 changer transitions 0/272 dead transitions. [2024-05-12 13:28:25,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 272 transitions, 4990 flow [2024-05-12 13:28:25,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:28:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:28:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-05-12 13:28:25,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660493827160494 [2024-05-12 13:28:25,621 INFO L175 Difference]: Start difference. First operand has 201 places, 235 transitions, 4124 flow. Second operand 9 states and 151 transitions. [2024-05-12 13:28:25,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 272 transitions, 4990 flow [2024-05-12 13:28:25,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 272 transitions, 4903 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 13:28:25,856 INFO L231 Difference]: Finished difference. Result has 206 places, 248 transitions, 4432 flow [2024-05-12 13:28:25,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4051, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4432, PETRI_PLACES=206, PETRI_TRANSITIONS=248} [2024-05-12 13:28:25,856 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 166 predicate places. [2024-05-12 13:28:25,856 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 248 transitions, 4432 flow [2024-05-12 13:28:25,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:25,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:25,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:25,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 13:28:25,857 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-05-12 13:28:25,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1282418333, now seen corresponding path program 2 times [2024-05-12 13:28:25,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:25,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139535553] [2024-05-12 13:28:25,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:25,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:26,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:26,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139535553] [2024-05-12 13:28:26,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139535553] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:26,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:26,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:26,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947889269] [2024-05-12 13:28:26,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:26,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:26,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:26,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:26,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:26,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:26,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 248 transitions, 4432 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:26,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:26,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:26,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:28,325 INFO L124 PetriNetUnfolderBase]: 3933/10060 cut-off events. [2024-05-12 13:28:28,325 INFO L125 PetriNetUnfolderBase]: For 60514/60519 co-relation queries the response was YES. [2024-05-12 13:28:28,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36847 conditions, 10060 events. 3933/10060 cut-off events. For 60514/60519 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 108629 event pairs, 2743 based on Foata normal form. 7/9278 useless extension candidates. Maximal degree in co-relation 36768. Up to 7024 conditions per place. [2024-05-12 13:28:28,419 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 219 selfloop transitions, 52 changer transitions 0/279 dead transitions. [2024-05-12 13:28:28,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 279 transitions, 5121 flow [2024-05-12 13:28:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:28:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:28:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-05-12 13:28:28,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2024-05-12 13:28:28,421 INFO L175 Difference]: Start difference. First operand has 206 places, 248 transitions, 4432 flow. Second operand 9 states and 154 transitions. [2024-05-12 13:28:28,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 279 transitions, 5121 flow [2024-05-12 13:28:28,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 279 transitions, 5055 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-05-12 13:28:28,633 INFO L231 Difference]: Finished difference. Result has 212 places, 252 transitions, 4535 flow [2024-05-12 13:28:28,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4366, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4535, PETRI_PLACES=212, PETRI_TRANSITIONS=252} [2024-05-12 13:28:28,635 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 172 predicate places. [2024-05-12 13:28:28,635 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 252 transitions, 4535 flow [2024-05-12 13:28:28,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:28,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:28,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:28,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 13:28:28,635 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-05-12 13:28:28,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:28,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1564468785, now seen corresponding path program 13 times [2024-05-12 13:28:28,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:28,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510028651] [2024-05-12 13:28:28,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:28,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:29,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:29,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510028651] [2024-05-12 13:28:29,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510028651] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:29,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:29,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248967461] [2024-05-12 13:28:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:29,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:29,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:29,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:29,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:29,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 252 transitions, 4535 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:29,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:29,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:29,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:30,962 INFO L124 PetriNetUnfolderBase]: 3970/10181 cut-off events. [2024-05-12 13:28:30,962 INFO L125 PetriNetUnfolderBase]: For 62107/62112 co-relation queries the response was YES. [2024-05-12 13:28:31,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37236 conditions, 10181 events. 3970/10181 cut-off events. For 62107/62112 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 110328 event pairs, 2798 based on Foata normal form. 15/9389 useless extension candidates. Maximal degree in co-relation 37155. Up to 6998 conditions per place. [2024-05-12 13:28:31,040 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 225 selfloop transitions, 52 changer transitions 0/285 dead transitions. [2024-05-12 13:28:31,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 285 transitions, 5271 flow [2024-05-12 13:28:31,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:28:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:28:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-05-12 13:28:31,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-05-12 13:28:31,041 INFO L175 Difference]: Start difference. First operand has 212 places, 252 transitions, 4535 flow. Second operand 10 states and 168 transitions. [2024-05-12 13:28:31,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 285 transitions, 5271 flow [2024-05-12 13:28:31,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 285 transitions, 5188 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-05-12 13:28:31,271 INFO L231 Difference]: Finished difference. Result has 218 places, 254 transitions, 4625 flow [2024-05-12 13:28:31,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4452, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4625, PETRI_PLACES=218, PETRI_TRANSITIONS=254} [2024-05-12 13:28:31,272 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 178 predicate places. [2024-05-12 13:28:31,272 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 254 transitions, 4625 flow [2024-05-12 13:28:31,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:31,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:31,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:31,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 13:28:31,272 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-05-12 13:28:31,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:31,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1178135903, now seen corresponding path program 14 times [2024-05-12 13:28:31,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:31,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771821307] [2024-05-12 13:28:31,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:32,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:32,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771821307] [2024-05-12 13:28:32,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771821307] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:32,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:32,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505617387] [2024-05-12 13:28:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:32,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:32,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:32,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:32,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:32,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:32,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 254 transitions, 4625 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:32,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:32,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:32,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:34,098 INFO L124 PetriNetUnfolderBase]: 4302/10742 cut-off events. [2024-05-12 13:28:34,098 INFO L125 PetriNetUnfolderBase]: For 67903/67908 co-relation queries the response was YES. [2024-05-12 13:28:34,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39642 conditions, 10742 events. 4302/10742 cut-off events. For 67903/67908 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 115825 event pairs, 2190 based on Foata normal form. 13/9994 useless extension candidates. Maximal degree in co-relation 39558. Up to 5739 conditions per place. [2024-05-12 13:28:34,211 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 153 selfloop transitions, 137 changer transitions 0/298 dead transitions. [2024-05-12 13:28:34,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 298 transitions, 5485 flow [2024-05-12 13:28:34,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:28:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:28:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-05-12 13:28:34,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030864197530864 [2024-05-12 13:28:34,212 INFO L175 Difference]: Start difference. First operand has 218 places, 254 transitions, 4625 flow. Second operand 9 states and 163 transitions. [2024-05-12 13:28:34,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 298 transitions, 5485 flow [2024-05-12 13:28:34,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 298 transitions, 5406 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 13:28:34,538 INFO L231 Difference]: Finished difference. Result has 221 places, 254 transitions, 4829 flow [2024-05-12 13:28:34,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4546, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4829, PETRI_PLACES=221, PETRI_TRANSITIONS=254} [2024-05-12 13:28:34,539 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 181 predicate places. [2024-05-12 13:28:34,539 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 254 transitions, 4829 flow [2024-05-12 13:28:34,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:34,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:34,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:34,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 13:28:34,540 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-05-12 13:28:34,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:34,540 INFO L85 PathProgramCache]: Analyzing trace with hash -552976471, now seen corresponding path program 15 times [2024-05-12 13:28:34,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:34,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618777408] [2024-05-12 13:28:34,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:34,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:35,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:35,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618777408] [2024-05-12 13:28:35,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618777408] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:35,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:35,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:35,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362924481] [2024-05-12 13:28:35,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:35,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:35,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:35,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:35,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:35,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:35,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 254 transitions, 4829 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:35,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:35,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:35,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:36,978 INFO L124 PetriNetUnfolderBase]: 4460/11544 cut-off events. [2024-05-12 13:28:36,978 INFO L125 PetriNetUnfolderBase]: For 75868/75873 co-relation queries the response was YES. [2024-05-12 13:28:37,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41745 conditions, 11544 events. 4460/11544 cut-off events. For 75868/75873 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 128509 event pairs, 2867 based on Foata normal form. 15/10655 useless extension candidates. Maximal degree in co-relation 41660. Up to 7003 conditions per place. [2024-05-12 13:28:37,097 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 133 selfloop transitions, 147 changer transitions 0/288 dead transitions. [2024-05-12 13:28:37,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 288 transitions, 5557 flow [2024-05-12 13:28:37,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:28:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:28:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-05-12 13:28:37,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2024-05-12 13:28:37,099 INFO L175 Difference]: Start difference. First operand has 221 places, 254 transitions, 4829 flow. Second operand 9 states and 155 transitions. [2024-05-12 13:28:37,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 288 transitions, 5557 flow [2024-05-12 13:28:37,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 288 transitions, 5275 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-05-12 13:28:37,410 INFO L231 Difference]: Finished difference. Result has 220 places, 254 transitions, 4855 flow [2024-05-12 13:28:37,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4547, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4855, PETRI_PLACES=220, PETRI_TRANSITIONS=254} [2024-05-12 13:28:37,410 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 180 predicate places. [2024-05-12 13:28:37,410 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 254 transitions, 4855 flow [2024-05-12 13:28:37,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:37,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:37,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:37,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 13:28:37,411 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-05-12 13:28:37,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:37,411 INFO L85 PathProgramCache]: Analyzing trace with hash -175296949, now seen corresponding path program 16 times [2024-05-12 13:28:37,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:37,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080054297] [2024-05-12 13:28:37,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:37,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:38,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:38,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080054297] [2024-05-12 13:28:38,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080054297] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:38,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:38,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:38,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001613204] [2024-05-12 13:28:38,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:38,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:38,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:38,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:38,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:38,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:38,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 254 transitions, 4855 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:38,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:38,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:38,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:39,863 INFO L124 PetriNetUnfolderBase]: 4372/11307 cut-off events. [2024-05-12 13:28:39,863 INFO L125 PetriNetUnfolderBase]: For 63051/63056 co-relation queries the response was YES. [2024-05-12 13:28:39,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40566 conditions, 11307 events. 4372/11307 cut-off events. For 63051/63056 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 125268 event pairs, 2615 based on Foata normal form. 13/10432 useless extension candidates. Maximal degree in co-relation 40483. Up to 5954 conditions per place. [2024-05-12 13:28:39,971 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 140 selfloop transitions, 146 changer transitions 0/294 dead transitions. [2024-05-12 13:28:39,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 294 transitions, 5615 flow [2024-05-12 13:28:39,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:28:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:28:39,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-05-12 13:28:39,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 13:28:39,974 INFO L175 Difference]: Start difference. First operand has 220 places, 254 transitions, 4855 flow. Second operand 9 states and 162 transitions. [2024-05-12 13:28:39,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 294 transitions, 5615 flow [2024-05-12 13:28:40,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 294 transitions, 5319 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-05-12 13:28:40,264 INFO L231 Difference]: Finished difference. Result has 221 places, 255 transitions, 4889 flow [2024-05-12 13:28:40,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4559, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4889, PETRI_PLACES=221, PETRI_TRANSITIONS=255} [2024-05-12 13:28:40,264 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 181 predicate places. [2024-05-12 13:28:40,264 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 255 transitions, 4889 flow [2024-05-12 13:28:40,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:40,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:40,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:40,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 13:28:40,269 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-05-12 13:28:40,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1892282335, now seen corresponding path program 17 times [2024-05-12 13:28:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:40,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507855763] [2024-05-12 13:28:40,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:40,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:40,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:41,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507855763] [2024-05-12 13:28:41,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507855763] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:41,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:41,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:41,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723023670] [2024-05-12 13:28:41,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:41,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:41,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:41,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:41,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:41,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:41,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 255 transitions, 4889 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:41,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:41,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:41,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:42,910 INFO L124 PetriNetUnfolderBase]: 4801/12540 cut-off events. [2024-05-12 13:28:42,910 INFO L125 PetriNetUnfolderBase]: For 73729/73737 co-relation queries the response was YES. [2024-05-12 13:28:42,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44292 conditions, 12540 events. 4801/12540 cut-off events. For 73729/73737 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 142306 event pairs, 3327 based on Foata normal form. 16/11588 useless extension candidates. Maximal degree in co-relation 44209. Up to 6657 conditions per place. [2024-05-12 13:28:43,022 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 206 selfloop transitions, 78 changer transitions 0/292 dead transitions. [2024-05-12 13:28:43,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 292 transitions, 5704 flow [2024-05-12 13:28:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:28:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:28:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-05-12 13:28:43,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2024-05-12 13:28:43,025 INFO L175 Difference]: Start difference. First operand has 221 places, 255 transitions, 4889 flow. Second operand 9 states and 158 transitions. [2024-05-12 13:28:43,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 292 transitions, 5704 flow [2024-05-12 13:28:43,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 292 transitions, 5423 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-05-12 13:28:43,304 INFO L231 Difference]: Finished difference. Result has 223 places, 255 transitions, 4768 flow [2024-05-12 13:28:43,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4608, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4768, PETRI_PLACES=223, PETRI_TRANSITIONS=255} [2024-05-12 13:28:43,305 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 183 predicate places. [2024-05-12 13:28:43,305 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 255 transitions, 4768 flow [2024-05-12 13:28:43,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:43,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:43,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:43,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 13:28:43,306 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:28:43,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1266705383, now seen corresponding path program 18 times [2024-05-12 13:28:43,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:43,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144277585] [2024-05-12 13:28:43,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:44,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:44,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144277585] [2024-05-12 13:28:44,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144277585] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:44,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:44,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:44,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010092967] [2024-05-12 13:28:44,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:44,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:44,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:44,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:44,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:44,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:44,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 255 transitions, 4768 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:44,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:44,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:44,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:45,916 INFO L124 PetriNetUnfolderBase]: 4788/12516 cut-off events. [2024-05-12 13:28:45,917 INFO L125 PetriNetUnfolderBase]: For 67083/67091 co-relation queries the response was YES. [2024-05-12 13:28:46,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43731 conditions, 12516 events. 4788/12516 cut-off events. For 67083/67091 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 142195 event pairs, 3431 based on Foata normal form. 18/11563 useless extension candidates. Maximal degree in co-relation 43648. Up to 8134 conditions per place. [2024-05-12 13:28:46,043 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 192 selfloop transitions, 87 changer transitions 0/287 dead transitions. [2024-05-12 13:28:46,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 287 transitions, 5491 flow [2024-05-12 13:28:46,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:28:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:28:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-05-12 13:28:46,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2024-05-12 13:28:46,044 INFO L175 Difference]: Start difference. First operand has 223 places, 255 transitions, 4768 flow. Second operand 9 states and 154 transitions. [2024-05-12 13:28:46,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 287 transitions, 5491 flow [2024-05-12 13:28:46,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 287 transitions, 5364 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-05-12 13:28:46,399 INFO L231 Difference]: Finished difference. Result has 226 places, 255 transitions, 4827 flow [2024-05-12 13:28:46,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4641, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4827, PETRI_PLACES=226, PETRI_TRANSITIONS=255} [2024-05-12 13:28:46,400 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 186 predicate places. [2024-05-12 13:28:46,400 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 255 transitions, 4827 flow [2024-05-12 13:28:46,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:46,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:46,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:46,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 13:28:46,400 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:28:46,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:46,401 INFO L85 PathProgramCache]: Analyzing trace with hash 545760637, now seen corresponding path program 19 times [2024-05-12 13:28:46,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:46,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360826843] [2024-05-12 13:28:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:46,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:47,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:47,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360826843] [2024-05-12 13:28:47,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360826843] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:47,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:47,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:47,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361525443] [2024-05-12 13:28:47,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:47,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:47,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:47,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:47,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:47,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:47,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 255 transitions, 4827 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:47,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:47,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:47,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:49,057 INFO L124 PetriNetUnfolderBase]: 5008/12445 cut-off events. [2024-05-12 13:28:49,057 INFO L125 PetriNetUnfolderBase]: For 70037/70039 co-relation queries the response was YES. [2024-05-12 13:28:49,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44926 conditions, 12445 events. 5008/12445 cut-off events. For 70037/70039 co-relation queries the response was YES. Maximal size of possible extension queue 923. Compared 137818 event pairs, 2794 based on Foata normal form. 10/11591 useless extension candidates. Maximal degree in co-relation 44843. Up to 6710 conditions per place. [2024-05-12 13:28:49,174 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 162 selfloop transitions, 131 changer transitions 0/301 dead transitions. [2024-05-12 13:28:49,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 301 transitions, 5724 flow [2024-05-12 13:28:49,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:28:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:28:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-05-12 13:28:49,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-05-12 13:28:49,176 INFO L175 Difference]: Start difference. First operand has 226 places, 255 transitions, 4827 flow. Second operand 9 states and 167 transitions. [2024-05-12 13:28:49,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 301 transitions, 5724 flow [2024-05-12 13:28:49,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 301 transitions, 5552 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 13:28:49,529 INFO L231 Difference]: Finished difference. Result has 227 places, 255 transitions, 4923 flow [2024-05-12 13:28:49,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4657, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4923, PETRI_PLACES=227, PETRI_TRANSITIONS=255} [2024-05-12 13:28:49,530 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 187 predicate places. [2024-05-12 13:28:49,530 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 255 transitions, 4923 flow [2024-05-12 13:28:49,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:49,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:49,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:49,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 13:28:49,531 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:28:49,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:49,531 INFO L85 PathProgramCache]: Analyzing trace with hash 545764357, now seen corresponding path program 20 times [2024-05-12 13:28:49,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:49,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029967341] [2024-05-12 13:28:49,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:49,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:50,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029967341] [2024-05-12 13:28:50,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029967341] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:50,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:50,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:50,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022039031] [2024-05-12 13:28:50,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:50,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:50,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:50,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:50,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:50,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 255 transitions, 4923 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:50,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:50,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:50,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:52,348 INFO L124 PetriNetUnfolderBase]: 5211/13721 cut-off events. [2024-05-12 13:28:52,349 INFO L125 PetriNetUnfolderBase]: For 74456/74458 co-relation queries the response was YES. [2024-05-12 13:28:52,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47475 conditions, 13721 events. 5211/13721 cut-off events. For 74456/74458 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 158790 event pairs, 3745 based on Foata normal form. 12/12675 useless extension candidates. Maximal degree in co-relation 47392. Up to 8925 conditions per place. [2024-05-12 13:28:52,510 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 165 selfloop transitions, 121 changer transitions 0/294 dead transitions. [2024-05-12 13:28:52,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 294 transitions, 5710 flow [2024-05-12 13:28:52,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:28:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:28:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-05-12 13:28:52,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2024-05-12 13:28:52,512 INFO L175 Difference]: Start difference. First operand has 227 places, 255 transitions, 4923 flow. Second operand 9 states and 161 transitions. [2024-05-12 13:28:52,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 294 transitions, 5710 flow [2024-05-12 13:28:52,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 294 transitions, 5447 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-05-12 13:28:52,870 INFO L231 Difference]: Finished difference. Result has 228 places, 255 transitions, 4914 flow [2024-05-12 13:28:52,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4660, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4914, PETRI_PLACES=228, PETRI_TRANSITIONS=255} [2024-05-12 13:28:52,871 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 188 predicate places. [2024-05-12 13:28:52,871 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 255 transitions, 4914 flow [2024-05-12 13:28:52,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:52,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:52,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:52,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 13:28:52,872 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:28:52,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:52,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1355393249, now seen corresponding path program 3 times [2024-05-12 13:28:52,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:52,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884092131] [2024-05-12 13:28:52,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:52,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:53,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-05-12 13:28:53,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:53,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884092131] [2024-05-12 13:28:53,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884092131] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:53,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:53,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:53,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521476250] [2024-05-12 13:28:53,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:53,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:53,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:53,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:53,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:53,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:53,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 255 transitions, 4914 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:53,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:53,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:53,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:55,716 INFO L124 PetriNetUnfolderBase]: 5190/13625 cut-off events. [2024-05-12 13:28:55,717 INFO L125 PetriNetUnfolderBase]: For 65735/65737 co-relation queries the response was YES. [2024-05-12 13:28:55,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47281 conditions, 13625 events. 5190/13625 cut-off events. For 65735/65737 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 157360 event pairs, 3805 based on Foata normal form. 4/12554 useless extension candidates. Maximal degree in co-relation 47198. Up to 9719 conditions per place. [2024-05-12 13:28:55,863 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 216 selfloop transitions, 73 changer transitions 0/297 dead transitions. [2024-05-12 13:28:55,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 297 transitions, 5885 flow [2024-05-12 13:28:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:28:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:28:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-05-12 13:28:55,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-05-12 13:28:55,865 INFO L175 Difference]: Start difference. First operand has 228 places, 255 transitions, 4914 flow. Second operand 8 states and 138 transitions. [2024-05-12 13:28:55,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 297 transitions, 5885 flow [2024-05-12 13:28:56,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 297 transitions, 5631 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 13:28:56,227 INFO L231 Difference]: Finished difference. Result has 232 places, 269 transitions, 5153 flow [2024-05-12 13:28:56,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4682, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5153, PETRI_PLACES=232, PETRI_TRANSITIONS=269} [2024-05-12 13:28:56,227 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 192 predicate places. [2024-05-12 13:28:56,227 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 269 transitions, 5153 flow [2024-05-12 13:28:56,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:56,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:56,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:56,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 13:28:56,228 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:28:56,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1355399201, now seen corresponding path program 21 times [2024-05-12 13:28:56,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:56,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953007556] [2024-05-12 13:28:56,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:56,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:28:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:28:57,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:28:57,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953007556] [2024-05-12 13:28:57,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953007556] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:28:57,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:28:57,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:28:57,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778815749] [2024-05-12 13:28:57,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:28:57,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:28:57,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:28:57,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:28:57,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:28:57,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:28:57,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 269 transitions, 5153 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:57,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:28:57,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:28:57,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:28:59,155 INFO L124 PetriNetUnfolderBase]: 5393/14214 cut-off events. [2024-05-12 13:28:59,155 INFO L125 PetriNetUnfolderBase]: For 73677/73679 co-relation queries the response was YES. [2024-05-12 13:28:59,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50002 conditions, 14214 events. 5393/14214 cut-off events. For 73677/73679 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 165445 event pairs, 3941 based on Foata normal form. 12/13116 useless extension candidates. Maximal degree in co-relation 49915. Up to 9436 conditions per place. [2024-05-12 13:28:59,305 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 226 selfloop transitions, 69 changer transitions 0/303 dead transitions. [2024-05-12 13:28:59,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 303 transitions, 5942 flow [2024-05-12 13:28:59,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:28:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:28:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-05-12 13:28:59,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2024-05-12 13:28:59,307 INFO L175 Difference]: Start difference. First operand has 232 places, 269 transitions, 5153 flow. Second operand 9 states and 154 transitions. [2024-05-12 13:28:59,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 303 transitions, 5942 flow [2024-05-12 13:28:59,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 303 transitions, 5875 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-05-12 13:28:59,805 INFO L231 Difference]: Finished difference. Result has 238 places, 269 transitions, 5236 flow [2024-05-12 13:28:59,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5086, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5236, PETRI_PLACES=238, PETRI_TRANSITIONS=269} [2024-05-12 13:28:59,805 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 198 predicate places. [2024-05-12 13:28:59,806 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 269 transitions, 5236 flow [2024-05-12 13:28:59,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:28:59,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:28:59,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:28:59,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 13:28:59,806 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:28:59,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:28:59,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1181511395, now seen corresponding path program 4 times [2024-05-12 13:28:59,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:28:59,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700571030] [2024-05-12 13:28:59,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:28:59,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:28:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:00,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:00,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700571030] [2024-05-12 13:29:00,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700571030] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:00,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:00,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:29:00,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237056522] [2024-05-12 13:29:00,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:00,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:29:00,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:00,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:29:00,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:29:00,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:00,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 269 transitions, 5236 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:00,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:00,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:00,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:02,720 INFO L124 PetriNetUnfolderBase]: 5420/14316 cut-off events. [2024-05-12 13:29:02,720 INFO L125 PetriNetUnfolderBase]: For 71366/71371 co-relation queries the response was YES. [2024-05-12 13:29:02,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50301 conditions, 14316 events. 5420/14316 cut-off events. For 71366/71371 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 166991 event pairs, 3949 based on Foata normal form. 7/13189 useless extension candidates. Maximal degree in co-relation 50213. Up to 10192 conditions per place. [2024-05-12 13:29:03,070 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 222 selfloop transitions, 64 changer transitions 0/294 dead transitions. [2024-05-12 13:29:03,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 294 transitions, 5963 flow [2024-05-12 13:29:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:29:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:29:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-05-12 13:29:03,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2024-05-12 13:29:03,072 INFO L175 Difference]: Start difference. First operand has 238 places, 269 transitions, 5236 flow. Second operand 8 states and 134 transitions. [2024-05-12 13:29:03,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 294 transitions, 5963 flow [2024-05-12 13:29:03,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 294 transitions, 5813 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-05-12 13:29:03,453 INFO L231 Difference]: Finished difference. Result has 237 places, 270 transitions, 5242 flow [2024-05-12 13:29:03,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5086, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5242, PETRI_PLACES=237, PETRI_TRANSITIONS=270} [2024-05-12 13:29:03,454 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 197 predicate places. [2024-05-12 13:29:03,454 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 270 transitions, 5242 flow [2024-05-12 13:29:03,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:03,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:03,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:29:03,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 13:29:03,454 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:03,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1181503955, now seen corresponding path program 5 times [2024-05-12 13:29:03,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:03,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010336141] [2024-05-12 13:29:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:03,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:04,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-05-12 13:29:04,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:04,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010336141] [2024-05-12 13:29:04,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010336141] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:04,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:04,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:29:04,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426008070] [2024-05-12 13:29:04,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:04,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:29:04,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:04,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:29:04,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:29:04,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:04,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 270 transitions, 5242 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:04,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:04,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:04,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:06,364 INFO L124 PetriNetUnfolderBase]: 5447/14384 cut-off events. [2024-05-12 13:29:06,364 INFO L125 PetriNetUnfolderBase]: For 73080/73085 co-relation queries the response was YES. [2024-05-12 13:29:06,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50802 conditions, 14384 events. 5447/14384 cut-off events. For 73080/73085 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 167877 event pairs, 3882 based on Foata normal form. 7/13265 useless extension candidates. Maximal degree in co-relation 50714. Up to 9857 conditions per place. [2024-05-12 13:29:06,500 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 228 selfloop transitions, 60 changer transitions 0/296 dead transitions. [2024-05-12 13:29:06,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 296 transitions, 5973 flow [2024-05-12 13:29:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:29:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:29:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-05-12 13:29:06,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2024-05-12 13:29:06,502 INFO L175 Difference]: Start difference. First operand has 237 places, 270 transitions, 5242 flow. Second operand 8 states and 134 transitions. [2024-05-12 13:29:06,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 296 transitions, 5973 flow [2024-05-12 13:29:06,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 296 transitions, 5864 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 13:29:06,905 INFO L231 Difference]: Finished difference. Result has 240 places, 272 transitions, 5304 flow [2024-05-12 13:29:06,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5133, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5304, PETRI_PLACES=240, PETRI_TRANSITIONS=272} [2024-05-12 13:29:06,905 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 200 predicate places. [2024-05-12 13:29:06,905 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 272 transitions, 5304 flow [2024-05-12 13:29:06,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:06,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:06,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:29:06,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 13:29:06,906 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:06,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:06,906 INFO L85 PathProgramCache]: Analyzing trace with hash -282202993, now seen corresponding path program 22 times [2024-05-12 13:29:06,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:06,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522048676] [2024-05-12 13:29:06,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:07,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:07,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522048676] [2024-05-12 13:29:07,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522048676] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:07,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:07,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:29:07,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279446762] [2024-05-12 13:29:07,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:07,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:29:07,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:07,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:29:07,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:29:07,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:07,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 272 transitions, 5304 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:07,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:07,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:07,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:10,064 INFO L124 PetriNetUnfolderBase]: 5650/14969 cut-off events. [2024-05-12 13:29:10,064 INFO L125 PetriNetUnfolderBase]: For 81312/81317 co-relation queries the response was YES. [2024-05-12 13:29:10,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52542 conditions, 14969 events. 5650/14969 cut-off events. For 81312/81317 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 176175 event pairs, 4115 based on Foata normal form. 15/13815 useless extension candidates. Maximal degree in co-relation 52453. Up to 9845 conditions per place. [2024-05-12 13:29:10,219 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 229 selfloop transitions, 65 changer transitions 0/302 dead transitions. [2024-05-12 13:29:10,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 302 transitions, 6064 flow [2024-05-12 13:29:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:29:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:29:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-05-12 13:29:10,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2024-05-12 13:29:10,224 INFO L175 Difference]: Start difference. First operand has 240 places, 272 transitions, 5304 flow. Second operand 9 states and 148 transitions. [2024-05-12 13:29:10,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 302 transitions, 6064 flow [2024-05-12 13:29:10,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 302 transitions, 5973 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-05-12 13:29:10,690 INFO L231 Difference]: Finished difference. Result has 244 places, 272 transitions, 5357 flow [2024-05-12 13:29:10,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5213, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5357, PETRI_PLACES=244, PETRI_TRANSITIONS=272} [2024-05-12 13:29:10,690 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 204 predicate places. [2024-05-12 13:29:10,690 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 272 transitions, 5357 flow [2024-05-12 13:29:10,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:10,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:10,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:29:10,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 13:29:10,691 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:10,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:10,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1183121515, now seen corresponding path program 6 times [2024-05-12 13:29:10,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:10,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505771176] [2024-05-12 13:29:10,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:10,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:11,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:11,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505771176] [2024-05-12 13:29:11,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505771176] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:11,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:11,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:29:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510273638] [2024-05-12 13:29:11,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:11,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:29:11,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:11,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:29:11,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:29:11,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:11,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 272 transitions, 5357 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:11,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:11,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:11,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:13,607 INFO L124 PetriNetUnfolderBase]: 5677/15030 cut-off events. [2024-05-12 13:29:13,607 INFO L125 PetriNetUnfolderBase]: For 75601/75606 co-relation queries the response was YES. [2024-05-12 13:29:13,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52740 conditions, 15030 events. 5677/15030 cut-off events. For 75601/75606 co-relation queries the response was YES. Maximal size of possible extension queue 1109. Compared 177031 event pairs, 4029 based on Foata normal form. 7/13854 useless extension candidates. Maximal degree in co-relation 52650. Up to 10136 conditions per place. [2024-05-12 13:29:13,793 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 214 selfloop transitions, 75 changer transitions 0/297 dead transitions. [2024-05-12 13:29:13,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 297 transitions, 6157 flow [2024-05-12 13:29:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:29:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:29:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-05-12 13:29:13,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2024-05-12 13:29:13,794 INFO L175 Difference]: Start difference. First operand has 244 places, 272 transitions, 5357 flow. Second operand 7 states and 124 transitions. [2024-05-12 13:29:13,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 297 transitions, 6157 flow [2024-05-12 13:29:14,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 297 transitions, 6031 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 13:29:14,251 INFO L231 Difference]: Finished difference. Result has 244 places, 275 transitions, 5495 flow [2024-05-12 13:29:14,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5233, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5495, PETRI_PLACES=244, PETRI_TRANSITIONS=275} [2024-05-12 13:29:14,252 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 204 predicate places. [2024-05-12 13:29:14,252 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 275 transitions, 5495 flow [2024-05-12 13:29:14,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:14,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:14,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:29:14,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 13:29:14,252 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:14,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1356503233, now seen corresponding path program 7 times [2024-05-12 13:29:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712998946] [2024-05-12 13:29:14,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:15,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:15,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712998946] [2024-05-12 13:29:15,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712998946] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:15,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:15,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:29:15,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700977360] [2024-05-12 13:29:15,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:15,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:29:15,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:15,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:29:15,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:29:15,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:15,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 275 transitions, 5495 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:15,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:15,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:15,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:17,701 INFO L124 PetriNetUnfolderBase]: 5674/14995 cut-off events. [2024-05-12 13:29:17,701 INFO L125 PetriNetUnfolderBase]: For 75976/75978 co-relation queries the response was YES. [2024-05-12 13:29:17,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53317 conditions, 14995 events. 5674/14995 cut-off events. For 75976/75978 co-relation queries the response was YES. Maximal size of possible extension queue 1104. Compared 176326 event pairs, 4103 based on Foata normal form. 4/13815 useless extension candidates. Maximal degree in co-relation 53226. Up to 10562 conditions per place. [2024-05-12 13:29:17,806 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 206 selfloop transitions, 84 changer transitions 0/298 dead transitions. [2024-05-12 13:29:17,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 298 transitions, 6204 flow [2024-05-12 13:29:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:29:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:29:17,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-05-12 13:29:17,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603174603174605 [2024-05-12 13:29:17,807 INFO L175 Difference]: Start difference. First operand has 244 places, 275 transitions, 5495 flow. Second operand 7 states and 125 transitions. [2024-05-12 13:29:17,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 298 transitions, 6204 flow [2024-05-12 13:29:18,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 298 transitions, 6042 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-05-12 13:29:18,238 INFO L231 Difference]: Finished difference. Result has 246 places, 275 transitions, 5523 flow [2024-05-12 13:29:18,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5333, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5523, PETRI_PLACES=246, PETRI_TRANSITIONS=275} [2024-05-12 13:29:18,239 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 206 predicate places. [2024-05-12 13:29:18,239 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 275 transitions, 5523 flow [2024-05-12 13:29:18,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:18,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:18,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:29:18,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 13:29:18,240 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:18,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:18,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1640917135, now seen corresponding path program 23 times [2024-05-12 13:29:18,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:18,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17028818] [2024-05-12 13:29:18,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:18,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:19,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:19,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17028818] [2024-05-12 13:29:19,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17028818] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:19,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:19,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:29:19,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494204488] [2024-05-12 13:29:19,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:19,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:29:19,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:19,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:29:19,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:29:19,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:19,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 275 transitions, 5523 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:19,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:19,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:19,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:21,471 INFO L124 PetriNetUnfolderBase]: 5727/14688 cut-off events. [2024-05-12 13:29:21,472 INFO L125 PetriNetUnfolderBase]: For 76955/76957 co-relation queries the response was YES. [2024-05-12 13:29:21,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53067 conditions, 14688 events. 5727/14688 cut-off events. For 76955/76957 co-relation queries the response was YES. Maximal size of possible extension queue 1077. Compared 169668 event pairs, 3570 based on Foata normal form. 12/13645 useless extension candidates. Maximal degree in co-relation 52976. Up to 10196 conditions per place. [2024-05-12 13:29:21,593 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 218 selfloop transitions, 85 changer transitions 0/311 dead transitions. [2024-05-12 13:29:21,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 311 transitions, 6349 flow [2024-05-12 13:29:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:29:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:29:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-05-12 13:29:21,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-05-12 13:29:21,595 INFO L175 Difference]: Start difference. First operand has 246 places, 275 transitions, 5523 flow. Second operand 8 states and 148 transitions. [2024-05-12 13:29:21,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 311 transitions, 6349 flow [2024-05-12 13:29:22,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 311 transitions, 6201 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-05-12 13:29:22,054 INFO L231 Difference]: Finished difference. Result has 249 places, 275 transitions, 5573 flow [2024-05-12 13:29:22,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5375, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5573, PETRI_PLACES=249, PETRI_TRANSITIONS=275} [2024-05-12 13:29:22,055 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 209 predicate places. [2024-05-12 13:29:22,055 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 275 transitions, 5573 flow [2024-05-12 13:29:22,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:22,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:22,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:29:22,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 13:29:22,055 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:22,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1346405293, now seen corresponding path program 8 times [2024-05-12 13:29:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:22,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808499686] [2024-05-12 13:29:22,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:22,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:22,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:22,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808499686] [2024-05-12 13:29:22,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808499686] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:22,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:22,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:29:22,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562731698] [2024-05-12 13:29:22,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:22,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:29:22,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:22,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:29:22,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:29:22,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:22,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 275 transitions, 5573 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:22,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:22,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:22,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:25,396 INFO L124 PetriNetUnfolderBase]: 5724/15166 cut-off events. [2024-05-12 13:29:25,396 INFO L125 PetriNetUnfolderBase]: For 73171/73176 co-relation queries the response was YES. [2024-05-12 13:29:25,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53671 conditions, 15166 events. 5724/15166 cut-off events. For 73171/73176 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 178949 event pairs, 4550 based on Foata normal form. 3/14010 useless extension candidates. Maximal degree in co-relation 53579. Up to 11042 conditions per place. [2024-05-12 13:29:25,569 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 273 selfloop transitions, 16 changer transitions 0/297 dead transitions. [2024-05-12 13:29:25,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 297 transitions, 6269 flow [2024-05-12 13:29:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:29:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:29:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-05-12 13:29:25,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-05-12 13:29:25,571 INFO L175 Difference]: Start difference. First operand has 249 places, 275 transitions, 5573 flow. Second operand 8 states and 128 transitions. [2024-05-12 13:29:25,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 297 transitions, 6269 flow [2024-05-12 13:29:26,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 297 transitions, 6111 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-05-12 13:29:26,083 INFO L231 Difference]: Finished difference. Result has 251 places, 279 transitions, 5499 flow [2024-05-12 13:29:26,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5415, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5499, PETRI_PLACES=251, PETRI_TRANSITIONS=279} [2024-05-12 13:29:26,084 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 211 predicate places. [2024-05-12 13:29:26,084 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 279 transitions, 5499 flow [2024-05-12 13:29:26,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:26,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:26,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:29:26,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 13:29:26,084 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:26,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:26,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1093776631, now seen corresponding path program 1 times [2024-05-12 13:29:26,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:26,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558627163] [2024-05-12 13:29:26,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:26,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:27,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:27,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558627163] [2024-05-12 13:29:27,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558627163] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:27,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:27,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:29:27,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122057230] [2024-05-12 13:29:27,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:27,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:29:27,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:27,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:29:27,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:29:27,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:27,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 279 transitions, 5499 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:27,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:27,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:27,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:29,641 INFO L124 PetriNetUnfolderBase]: 5783/15356 cut-off events. [2024-05-12 13:29:29,641 INFO L125 PetriNetUnfolderBase]: For 76485/76490 co-relation queries the response was YES. [2024-05-12 13:29:29,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54578 conditions, 15356 events. 5783/15356 cut-off events. For 76485/76490 co-relation queries the response was YES. Maximal size of possible extension queue 1134. Compared 181918 event pairs, 4220 based on Foata normal form. 11/14151 useless extension candidates. Maximal degree in co-relation 54485. Up to 10854 conditions per place. [2024-05-12 13:29:29,792 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 254 selfloop transitions, 49 changer transitions 0/311 dead transitions. [2024-05-12 13:29:29,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 311 transitions, 6243 flow [2024-05-12 13:29:29,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:29:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:29:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-05-12 13:29:29,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-05-12 13:29:29,794 INFO L175 Difference]: Start difference. First operand has 251 places, 279 transitions, 5499 flow. Second operand 10 states and 168 transitions. [2024-05-12 13:29:29,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 311 transitions, 6243 flow [2024-05-12 13:29:30,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 311 transitions, 6203 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-05-12 13:29:30,312 INFO L231 Difference]: Finished difference. Result has 258 places, 279 transitions, 5560 flow [2024-05-12 13:29:30,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5459, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5560, PETRI_PLACES=258, PETRI_TRANSITIONS=279} [2024-05-12 13:29:30,312 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 218 predicate places. [2024-05-12 13:29:30,313 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 279 transitions, 5560 flow [2024-05-12 13:29:30,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:30,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:30,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:29:30,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 13:29:30,313 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:30,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:30,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1100263381, now seen corresponding path program 2 times [2024-05-12 13:29:30,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:30,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789484763] [2024-05-12 13:29:30,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:30,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:31,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:31,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789484763] [2024-05-12 13:29:31,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789484763] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:31,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:31,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:29:31,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151502990] [2024-05-12 13:29:31,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:31,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:29:31,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:31,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:29:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:29:31,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:31,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 279 transitions, 5560 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:31,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:31,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:31,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:33,814 INFO L124 PetriNetUnfolderBase]: 5842/15483 cut-off events. [2024-05-12 13:29:33,815 INFO L125 PetriNetUnfolderBase]: For 79021/79026 co-relation queries the response was YES. [2024-05-12 13:29:33,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55086 conditions, 15483 events. 5842/15483 cut-off events. For 79021/79026 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 183583 event pairs, 4211 based on Foata normal form. 11/14289 useless extension candidates. Maximal degree in co-relation 54991. Up to 10765 conditions per place. [2024-05-12 13:29:33,984 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 253 selfloop transitions, 53 changer transitions 0/314 dead transitions. [2024-05-12 13:29:33,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 314 transitions, 6324 flow [2024-05-12 13:29:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:29:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:29:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-05-12 13:29:33,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-05-12 13:29:33,986 INFO L175 Difference]: Start difference. First operand has 258 places, 279 transitions, 5560 flow. Second operand 10 states and 171 transitions. [2024-05-12 13:29:33,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 314 transitions, 6324 flow [2024-05-12 13:29:34,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 314 transitions, 6260 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 13:29:34,498 INFO L231 Difference]: Finished difference. Result has 262 places, 279 transitions, 5605 flow [2024-05-12 13:29:34,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5496, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5605, PETRI_PLACES=262, PETRI_TRANSITIONS=279} [2024-05-12 13:29:34,499 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 222 predicate places. [2024-05-12 13:29:34,499 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 279 transitions, 5605 flow [2024-05-12 13:29:34,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:34,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:34,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:29:34,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-12 13:29:34,499 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:34,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843533, now seen corresponding path program 3 times [2024-05-12 13:29:34,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:34,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118907017] [2024-05-12 13:29:34,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:34,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:35,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:35,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118907017] [2024-05-12 13:29:35,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118907017] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:35,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:35,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:29:35,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541317858] [2024-05-12 13:29:35,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:35,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:29:35,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:35,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:29:35,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:29:35,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:35,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 279 transitions, 5605 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:35,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:35,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:35,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:38,358 INFO L124 PetriNetUnfolderBase]: 5901/15654 cut-off events. [2024-05-12 13:29:38,358 INFO L125 PetriNetUnfolderBase]: For 80691/80693 co-relation queries the response was YES. [2024-05-12 13:29:38,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55673 conditions, 15654 events. 5901/15654 cut-off events. For 80691/80693 co-relation queries the response was YES. Maximal size of possible extension queue 1161. Compared 186036 event pairs, 4316 based on Foata normal form. 8/14424 useless extension candidates. Maximal degree in co-relation 55577. Up to 11071 conditions per place. [2024-05-12 13:29:38,497 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 241 selfloop transitions, 64 changer transitions 0/313 dead transitions. [2024-05-12 13:29:38,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 313 transitions, 6370 flow [2024-05-12 13:29:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:29:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:29:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-05-12 13:29:38,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-05-12 13:29:38,499 INFO L175 Difference]: Start difference. First operand has 262 places, 279 transitions, 5605 flow. Second operand 10 states and 171 transitions. [2024-05-12 13:29:38,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 313 transitions, 6370 flow [2024-05-12 13:29:39,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 313 transitions, 6251 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 13:29:39,017 INFO L231 Difference]: Finished difference. Result has 264 places, 280 transitions, 5651 flow [2024-05-12 13:29:39,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5486, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5651, PETRI_PLACES=264, PETRI_TRANSITIONS=280} [2024-05-12 13:29:39,018 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 224 predicate places. [2024-05-12 13:29:39,018 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 280 transitions, 5651 flow [2024-05-12 13:29:39,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:39,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:39,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:29:39,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-12 13:29:39,019 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:39,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:39,019 INFO L85 PathProgramCache]: Analyzing trace with hash -256520233, now seen corresponding path program 4 times [2024-05-12 13:29:39,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:39,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152944242] [2024-05-12 13:29:39,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:39,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:39,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:39,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152944242] [2024-05-12 13:29:39,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152944242] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:39,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:39,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:29:39,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504719610] [2024-05-12 13:29:39,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:39,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:29:39,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:39,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:29:39,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:29:40,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:40,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 280 transitions, 5651 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:40,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:40,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:40,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:42,719 INFO L124 PetriNetUnfolderBase]: 5960/15826 cut-off events. [2024-05-12 13:29:42,720 INFO L125 PetriNetUnfolderBase]: For 81646/81648 co-relation queries the response was YES. [2024-05-12 13:29:42,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56139 conditions, 15826 events. 5960/15826 cut-off events. For 81646/81648 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 188682 event pairs, 4456 based on Foata normal form. 8/14585 useless extension candidates. Maximal degree in co-relation 56041. Up to 11026 conditions per place. [2024-05-12 13:29:42,866 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 244 selfloop transitions, 62 changer transitions 0/314 dead transitions. [2024-05-12 13:29:42,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 314 transitions, 6460 flow [2024-05-12 13:29:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:29:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:29:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-05-12 13:29:42,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2024-05-12 13:29:42,868 INFO L175 Difference]: Start difference. First operand has 264 places, 280 transitions, 5651 flow. Second operand 9 states and 154 transitions. [2024-05-12 13:29:42,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 314 transitions, 6460 flow [2024-05-12 13:29:43,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 314 transitions, 6399 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-05-12 13:29:43,440 INFO L231 Difference]: Finished difference. Result has 268 places, 280 transitions, 5719 flow [2024-05-12 13:29:43,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5590, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5719, PETRI_PLACES=268, PETRI_TRANSITIONS=280} [2024-05-12 13:29:43,440 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 228 predicate places. [2024-05-12 13:29:43,441 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 280 transitions, 5719 flow [2024-05-12 13:29:43,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:43,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:43,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:29:43,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-12 13:29:43,441 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:43,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash 851131755, now seen corresponding path program 5 times [2024-05-12 13:29:43,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:43,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893279494] [2024-05-12 13:29:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:43,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:44,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:44,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893279494] [2024-05-12 13:29:44,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893279494] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:44,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:44,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:29:44,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368819270] [2024-05-12 13:29:44,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:44,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:29:44,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:44,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:29:44,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:29:44,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:44,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 280 transitions, 5719 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:44,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:44,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:44,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:46,947 INFO L124 PetriNetUnfolderBase]: 6019/15963 cut-off events. [2024-05-12 13:29:46,947 INFO L125 PetriNetUnfolderBase]: For 84256/84261 co-relation queries the response was YES. [2024-05-12 13:29:47,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56627 conditions, 15963 events. 6019/15963 cut-off events. For 84256/84261 co-relation queries the response was YES. Maximal size of possible extension queue 1183. Compared 190536 event pairs, 4390 based on Foata normal form. 11/14735 useless extension candidates. Maximal degree in co-relation 56528. Up to 11172 conditions per place. [2024-05-12 13:29:47,152 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 247 selfloop transitions, 55 changer transitions 0/310 dead transitions. [2024-05-12 13:29:47,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 310 transitions, 6489 flow [2024-05-12 13:29:47,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:29:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:29:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-05-12 13:29:47,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2024-05-12 13:29:47,158 INFO L175 Difference]: Start difference. First operand has 268 places, 280 transitions, 5719 flow. Second operand 9 states and 148 transitions. [2024-05-12 13:29:47,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 310 transitions, 6489 flow [2024-05-12 13:29:47,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 310 transitions, 6349 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-05-12 13:29:47,801 INFO L231 Difference]: Finished difference. Result has 268 places, 280 transitions, 5693 flow [2024-05-12 13:29:47,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5579, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5693, PETRI_PLACES=268, PETRI_TRANSITIONS=280} [2024-05-12 13:29:47,802 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 228 predicate places. [2024-05-12 13:29:47,802 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 280 transitions, 5693 flow [2024-05-12 13:29:47,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:47,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:47,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:29:47,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-05-12 13:29:47,803 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:47,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:47,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1105203493, now seen corresponding path program 6 times [2024-05-12 13:29:47,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:47,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461662504] [2024-05-12 13:29:47,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:47,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:48,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:48,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461662504] [2024-05-12 13:29:48,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461662504] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:48,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:48,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:29:48,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118567461] [2024-05-12 13:29:48,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:48,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:29:48,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:48,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:29:48,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:29:48,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:48,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 280 transitions, 5693 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:48,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:48,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:48,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:51,206 INFO L124 PetriNetUnfolderBase]: 6078/16116 cut-off events. [2024-05-12 13:29:51,207 INFO L125 PetriNetUnfolderBase]: For 84803/84808 co-relation queries the response was YES. [2024-05-12 13:29:51,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57054 conditions, 16116 events. 6078/16116 cut-off events. For 84803/84808 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 192727 event pairs, 4315 based on Foata normal form. 11/14895 useless extension candidates. Maximal degree in co-relation 56955. Up to 10880 conditions per place. [2024-05-12 13:29:51,398 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 244 selfloop transitions, 60 changer transitions 0/312 dead transitions. [2024-05-12 13:29:51,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 312 transitions, 6460 flow [2024-05-12 13:29:51,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:29:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:29:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-05-12 13:29:51,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660493827160494 [2024-05-12 13:29:51,399 INFO L175 Difference]: Start difference. First operand has 268 places, 280 transitions, 5693 flow. Second operand 9 states and 151 transitions. [2024-05-12 13:29:51,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 312 transitions, 6460 flow [2024-05-12 13:29:52,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 312 transitions, 6349 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-05-12 13:29:52,078 INFO L231 Difference]: Finished difference. Result has 269 places, 280 transitions, 5706 flow [2024-05-12 13:29:52,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5582, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5706, PETRI_PLACES=269, PETRI_TRANSITIONS=280} [2024-05-12 13:29:52,079 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 229 predicate places. [2024-05-12 13:29:52,079 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 280 transitions, 5706 flow [2024-05-12 13:29:52,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:52,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:52,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:29:52,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-05-12 13:29:52,080 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:52,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:52,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1211109599, now seen corresponding path program 7 times [2024-05-12 13:29:52,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:52,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796238428] [2024-05-12 13:29:52,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:52,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:52,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:52,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796238428] [2024-05-12 13:29:52,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796238428] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:52,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:52,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:29:52,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683620550] [2024-05-12 13:29:52,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:52,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:29:52,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:52,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:29:52,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:29:53,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:53,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 280 transitions, 5706 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:53,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:53,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:53,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:55,513 INFO L124 PetriNetUnfolderBase]: 6071/16190 cut-off events. [2024-05-12 13:29:55,514 INFO L125 PetriNetUnfolderBase]: For 81146/81151 co-relation queries the response was YES. [2024-05-12 13:29:55,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57068 conditions, 16190 events. 6071/16190 cut-off events. For 81146/81151 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 194223 event pairs, 5008 based on Foata normal form. 7/14966 useless extension candidates. Maximal degree in co-relation 56969. Up to 11652 conditions per place. [2024-05-12 13:29:55,752 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 284 selfloop transitions, 15 changer transitions 0/307 dead transitions. [2024-05-12 13:29:55,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 307 transitions, 6418 flow [2024-05-12 13:29:55,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:29:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:29:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-05-12 13:29:55,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2024-05-12 13:29:55,754 INFO L175 Difference]: Start difference. First operand has 269 places, 280 transitions, 5706 flow. Second operand 8 states and 134 transitions. [2024-05-12 13:29:55,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 307 transitions, 6418 flow [2024-05-12 13:29:56,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 307 transitions, 6297 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-05-12 13:29:56,393 INFO L231 Difference]: Finished difference. Result has 269 places, 280 transitions, 5619 flow [2024-05-12 13:29:56,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5585, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5619, PETRI_PLACES=269, PETRI_TRANSITIONS=280} [2024-05-12 13:29:56,394 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 229 predicate places. [2024-05-12 13:29:56,394 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 280 transitions, 5619 flow [2024-05-12 13:29:56,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:56,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:29:56,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:29:56,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-05-12 13:29:56,395 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:29:56,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:29:56,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1978168617, now seen corresponding path program 8 times [2024-05-12 13:29:56,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:29:56,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865869709] [2024-05-12 13:29:56,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:29:56,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:29:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:29:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:29:57,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:29:57,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865869709] [2024-05-12 13:29:57,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865869709] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:29:57,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:29:57,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 13:29:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129199298] [2024-05-12 13:29:57,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:29:57,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 13:29:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:29:57,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 13:29:57,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 13:29:57,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:29:57,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 280 transitions, 5619 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:29:57,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:29:57,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:29:57,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:29:59,920 INFO L124 PetriNetUnfolderBase]: 6130/16313 cut-off events. [2024-05-12 13:29:59,921 INFO L125 PetriNetUnfolderBase]: For 77468/77470 co-relation queries the response was YES. [2024-05-12 13:30:00,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57130 conditions, 16313 events. 6130/16313 cut-off events. For 77468/77470 co-relation queries the response was YES. Maximal size of possible extension queue 1209. Compared 195883 event pairs, 4866 based on Foata normal form. 8/15053 useless extension candidates. Maximal degree in co-relation 57031. Up to 11654 conditions per place. [2024-05-12 13:30:00,102 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 254 selfloop transitions, 53 changer transitions 0/315 dead transitions. [2024-05-12 13:30:00,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 315 transitions, 6455 flow [2024-05-12 13:30:00,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:30:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:30:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-05-12 13:30:00,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2024-05-12 13:30:00,104 INFO L175 Difference]: Start difference. First operand has 269 places, 280 transitions, 5619 flow. Second operand 9 states and 154 transitions. [2024-05-12 13:30:00,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 315 transitions, 6455 flow [2024-05-12 13:30:00,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 315 transitions, 6286 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-05-12 13:30:00,665 INFO L231 Difference]: Finished difference. Result has 271 places, 280 transitions, 5559 flow [2024-05-12 13:30:00,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5450, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5559, PETRI_PLACES=271, PETRI_TRANSITIONS=280} [2024-05-12 13:30:00,666 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 231 predicate places. [2024-05-12 13:30:00,666 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 280 transitions, 5559 flow [2024-05-12 13:30:00,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:00,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:00,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:00,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-05-12 13:30:00,666 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:00,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:00,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1977937977, now seen corresponding path program 9 times [2024-05-12 13:30:00,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:00,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614661826] [2024-05-12 13:30:00,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:00,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:01,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:01,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614661826] [2024-05-12 13:30:01,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614661826] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:01,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:01,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 13:30:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696571960] [2024-05-12 13:30:01,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:01,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 13:30:01,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:01,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 13:30:01,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 13:30:01,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 13:30:01,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 280 transitions, 5559 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:01,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:01,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 13:30:01,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:04,098 INFO L124 PetriNetUnfolderBase]: 6123/16333 cut-off events. [2024-05-12 13:30:04,098 INFO L125 PetriNetUnfolderBase]: For 72888/72893 co-relation queries the response was YES. [2024-05-12 13:30:04,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56236 conditions, 16333 events. 6123/16333 cut-off events. For 72888/72893 co-relation queries the response was YES. Maximal size of possible extension queue 1214. Compared 196390 event pairs, 4881 based on Foata normal form. 11/15069 useless extension candidates. Maximal degree in co-relation 56139. Up to 11553 conditions per place. [2024-05-12 13:30:04,295 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 260 selfloop transitions, 41 changer transitions 0/309 dead transitions. [2024-05-12 13:30:04,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 309 transitions, 6220 flow [2024-05-12 13:30:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:30:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:30:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-05-12 13:30:04,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826388888888889 [2024-05-12 13:30:04,297 INFO L175 Difference]: Start difference. First operand has 271 places, 280 transitions, 5559 flow. Second operand 8 states and 139 transitions. [2024-05-12 13:30:04,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 309 transitions, 6220 flow [2024-05-12 13:30:04,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 309 transitions, 5674 flow, removed 12 selfloop flow, removed 40 redundant places. [2024-05-12 13:30:04,921 INFO L231 Difference]: Finished difference. Result has 237 places, 279 transitions, 5007 flow [2024-05-12 13:30:04,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4925, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5007, PETRI_PLACES=237, PETRI_TRANSITIONS=279} [2024-05-12 13:30:04,922 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 197 predicate places. [2024-05-12 13:30:04,922 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 279 transitions, 5007 flow [2024-05-12 13:30:04,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:04,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:04,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:04,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-05-12 13:30:04,923 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:04,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:04,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1047579126, now seen corresponding path program 1 times [2024-05-12 13:30:04,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:04,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640432293] [2024-05-12 13:30:04,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:04,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:04,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:04,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640432293] [2024-05-12 13:30:04,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640432293] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:04,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:04,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:30:04,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822186021] [2024-05-12 13:30:04,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:04,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 13:30:04,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:04,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 13:30:04,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 13:30:04,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 13:30:04,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 279 transitions, 5007 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:04,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:04,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 13:30:04,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:06,250 INFO L124 PetriNetUnfolderBase]: 4150/10956 cut-off events. [2024-05-12 13:30:06,250 INFO L125 PetriNetUnfolderBase]: For 39819/39970 co-relation queries the response was YES. [2024-05-12 13:30:06,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35886 conditions, 10956 events. 4150/10956 cut-off events. For 39819/39970 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 120326 event pairs, 847 based on Foata normal form. 1071/11439 useless extension candidates. Maximal degree in co-relation 35823. Up to 3265 conditions per place. [2024-05-12 13:30:06,334 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 100 selfloop transitions, 119 changer transitions 0/280 dead transitions. [2024-05-12 13:30:06,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 280 transitions, 5413 flow [2024-05-12 13:30:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:30:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:30:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-05-12 13:30:06,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-05-12 13:30:06,335 INFO L175 Difference]: Start difference. First operand has 237 places, 279 transitions, 5007 flow. Second operand 5 states and 104 transitions. [2024-05-12 13:30:06,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 280 transitions, 5413 flow [2024-05-12 13:30:06,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 280 transitions, 5111 flow, removed 25 selfloop flow, removed 23 redundant places. [2024-05-12 13:30:06,499 INFO L231 Difference]: Finished difference. Result has 220 places, 271 transitions, 5015 flow [2024-05-12 13:30:06,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4647, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5015, PETRI_PLACES=220, PETRI_TRANSITIONS=271} [2024-05-12 13:30:06,500 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 180 predicate places. [2024-05-12 13:30:06,500 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 271 transitions, 5015 flow [2024-05-12 13:30:06,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:30:06,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:06,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:06,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-05-12 13:30:06,501 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:06,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1062624131, now seen corresponding path program 1 times [2024-05-12 13:30:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:06,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455718571] [2024-05-12 13:30:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:06,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:30:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:30:06,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:30:06,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455718571] [2024-05-12 13:30:06,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455718571] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:30:06,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:30:06,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:30:06,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834107757] [2024-05-12 13:30:06,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:30:06,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:30:06,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:30:06,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:30:06,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:30:06,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-05-12 13:30:06,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 271 transitions, 5015 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 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-05-12 13:30:06,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:30:06,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-05-12 13:30:06,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:30:07,885 INFO L124 PetriNetUnfolderBase]: 3060/8839 cut-off events. [2024-05-12 13:30:07,885 INFO L125 PetriNetUnfolderBase]: For 30936/30983 co-relation queries the response was YES. [2024-05-12 13:30:07,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29940 conditions, 8839 events. 3060/8839 cut-off events. For 30936/30983 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 100985 event pairs, 1194 based on Foata normal form. 363/8732 useless extension candidates. Maximal degree in co-relation 29887. Up to 2798 conditions per place. [2024-05-12 13:30:07,941 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 36 selfloop transitions, 20 changer transitions 211/309 dead transitions. [2024-05-12 13:30:07,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 309 transitions, 5555 flow [2024-05-12 13:30:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:30:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:30:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-05-12 13:30:07,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2024-05-12 13:30:07,942 INFO L175 Difference]: Start difference. First operand has 220 places, 271 transitions, 5015 flow. Second operand 9 states and 174 transitions. [2024-05-12 13:30:07,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 309 transitions, 5555 flow [2024-05-12 13:30:08,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 309 transitions, 5317 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 13:30:08,097 INFO L231 Difference]: Finished difference. Result has 231 places, 93 transitions, 1551 flow [2024-05-12 13:30:08,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4777, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1551, PETRI_PLACES=231, PETRI_TRANSITIONS=93} [2024-05-12 13:30:08,098 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 191 predicate places. [2024-05-12 13:30:08,098 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 93 transitions, 1551 flow [2024-05-12 13:30:08,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 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-05-12 13:30:08,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:30:08,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:08,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-05-12 13:30:08,099 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:30:08,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:30:08,099 INFO L85 PathProgramCache]: Analyzing trace with hash -27230679, now seen corresponding path program 2 times [2024-05-12 13:30:08,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:30:08,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802292214] [2024-05-12 13:30:08,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:30:08,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:30:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:30:08,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 13:30:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:30:08,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 13:30:08,173 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 13:30:08,173 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-12 13:30:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-12 13:30:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-05-12 13:30:08,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-05-12 13:30:08,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-12 13:30:08,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-12 13:30:08,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-12 13:30:08,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-05-12 13:30:08,178 INFO L445 BasicCegarLoop]: Path program histogram: [23, 9, 8, 6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:30:08,183 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 13:30:08,183 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 13:30:08,241 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-05-12 13:30:08,249 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-05-12 13:30:08,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 01:30:08 BasicIcfg [2024-05-12 13:30:08,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 13:30:08,251 INFO L158 Benchmark]: Toolchain (without parser) took 156660.53ms. Allocated memory was 134.2MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 72.8MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 768.2MB. Max. memory is 16.1GB. [2024-05-12 13:30:08,251 INFO L158 Benchmark]: Witness Parser took 0.87ms. Allocated memory is still 134.2MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:30:08,251 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 134.2MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:30:08,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.48ms. Allocated memory is still 134.2MB. Free memory was 72.8MB in the beginning and 93.5MB in the end (delta: -20.7MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-05-12 13:30:08,251 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.85ms. Allocated memory is still 134.2MB. Free memory was 93.5MB in the beginning and 90.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-05-12 13:30:08,254 INFO L158 Benchmark]: Boogie Preprocessor took 53.76ms. Allocated memory is still 134.2MB. Free memory was 90.9MB in the beginning and 87.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 13:30:08,255 INFO L158 Benchmark]: RCFGBuilder took 613.45ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 87.8MB in the beginning and 163.2MB in the end (delta: -75.5MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2024-05-12 13:30:08,255 INFO L158 Benchmark]: TraceAbstraction took 155415.32ms. Allocated memory was 203.4MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 163.2MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 788.8MB. Max. memory is 16.1GB. [2024-05-12 13:30:08,256 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.87ms. Allocated memory is still 134.2MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 134.2MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.48ms. Allocated memory is still 134.2MB. Free memory was 72.8MB in the beginning and 93.5MB in the end (delta: -20.7MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.85ms. Allocated memory is still 134.2MB. Free memory was 93.5MB in the beginning and 90.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.76ms. Allocated memory is still 134.2MB. Free memory was 90.9MB in the beginning and 87.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 613.45ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 87.8MB in the beginning and 163.2MB in the end (delta: -75.5MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. * TraceAbstraction took 155415.32ms. Allocated memory was 203.4MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 163.2MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 788.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L805] 0 pthread_t t1441; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L806] 0 //@ ghost multithreaded = 1; [L806] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L807] 0 pthread_t t1442; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 1 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L808] 0 //@ assert ((((((((((((((!multithreaded || (y$read_delayed_var == 0)) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= y$w_buff0) && (y$w_buff0 <= 1)) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (((0 <= y$w_buff1) && (y$w_buff1 <= 1)) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= y$mem_tmp) && (y$mem_tmp <= 1)) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))))); [L808] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441={5:0}, t1442={3: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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L809] 0 //@ assert ((((((((((((((!multithreaded || (y$read_delayed_var == 0)) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= y$w_buff0) && (y$w_buff0 <= 1)) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (((0 <= y$w_buff1) && (y$w_buff1 <= 1)) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= y$mem_tmp) && (y$mem_tmp <= 1)) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441={5:0}, t1442={3: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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L783] 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) [L784] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L785] 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 [L786] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L787] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L810] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L812] RET 0 assume_abort_if_not(main$tmp_guard0) [L814] 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) [L815] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L816] 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 [L817] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L818] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L821] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - 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: 808]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 808]: 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: 806]: 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, 53 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: 155.3s, OverallIterations: 69, TraceHistogramMax: 1, PathProgramHistogramMax: 23, EmptinessCheckTime: 0.0s, AutomataDifference: 105.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4248 SdHoareTripleChecker+Valid, 16.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3693 mSDsluCounter, 2227 SdHoareTripleChecker+Invalid, 13.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1967 mSDsCounter, 1074 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26056 IncrementalHoareTripleChecker+Invalid, 27130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1074 mSolverCounterUnsat, 260 mSDtfsCounter, 26056 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 618 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 611 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5719occurred in iteration=61, InterpolantAutomatonStates: 550, 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.6s SatisfiabilityAnalysisTime, 48.4s InterpolantComputationTime, 1114 NumberOfCodeBlocks, 1114 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 1020 ConstructedInterpolants, 0 QuantifiedInterpolants, 37409 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 68 InterpolantComputations, 68 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-05-12 13:30:08,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE