./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/rfi001_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/protection/rfi001_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 18:40:20,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:40:20,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:40:20,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:40:20,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:40:20,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:40:20,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:40:20,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:40:20,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:40:20,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:40:20,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:40:20,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:40:20,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:40:20,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:40:20,324 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:40:20,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:40:20,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:40:20,331 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:40:20,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:40:20,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:40:20,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:40:20,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:40:20,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:40:20,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:40:20,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:40:20,333 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:40:20,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:40:20,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:40:20,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:40:20,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:40:20,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:40:20,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:40:20,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:40:20,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:40:20,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:40:20,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:40:20,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:40:20,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:40:20,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:40:20,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:40:20,337 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:40:20,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:40:20,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:40:20,337 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 18:40:20,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:40:20,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:40:20,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:40:20,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:40:20,556 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:40:20,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 18:40:21,566 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:40:21,741 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:40:21,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 18:40:21,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7643e5576/50399a87d2324d4daeb21a4f51319e43/FLAGec95431e3 [2024-06-27 18:40:21,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7643e5576/50399a87d2324d4daeb21a4f51319e43 [2024-06-27 18:40:21,765 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:40:21,766 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:40:21,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/rfi001_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 18:40:21,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:40:21,871 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:40:21,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:40:21,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:40:21,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:40:21,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:40:21" (1/2) ... [2024-06-27 18:40:21,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd99451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:40:21, skipping insertion in model container [2024-06-27 18:40:21,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:40:21" (1/2) ... [2024-06-27 18:40:21,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3313f7da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:40:21, skipping insertion in model container [2024-06-27 18:40:21,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:40:21" (2/2) ... [2024-06-27 18:40:21,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd99451 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:21, skipping insertion in model container [2024-06-27 18:40:21,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:40:21" (2/2) ... [2024-06-27 18:40:21,879 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:40:21,921 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:40:21,922 INFO L97 edCorrectnessWitness]: Location invariant before [L818-L818] (((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1)) [2024-06-27 18:40:21,922 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] (((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1)) [2024-06-27 18:40:21,922 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:40:21,922 INFO L106 edCorrectnessWitness]: ghost_update [L816-L816] multithreaded = 1; [2024-06-27 18:40:21,969 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:40:22,090 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-06-27 18:40:22,197 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:40:22,205 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 18:40:22,231 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:40:22,298 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:40:22,323 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:40:22,324 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:22 WrapperNode [2024-06-27 18:40:22,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:40:22,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:40:22,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:40:22,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:40:22,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:22" (1/1) ... [2024-06-27 18:40:22,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:22" (1/1) ... [2024-06-27 18:40:22,385 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2024-06-27 18:40:22,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:40:22,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:40:22,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:40:22,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:40:22,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:22" (1/1) ... [2024-06-27 18:40:22,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:22" (1/1) ... [2024-06-27 18:40:22,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:22" (1/1) ... [2024-06-27 18:40:22,410 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 18:40:22,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:22" (1/1) ... [2024-06-27 18:40:22,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:22" (1/1) ... [2024-06-27 18:40:22,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:22" (1/1) ... [2024-06-27 18:40:22,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:22" (1/1) ... [2024-06-27 18:40:22,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:22" (1/1) ... [2024-06-27 18:40:22,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:22" (1/1) ... [2024-06-27 18:40:22,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:40:22,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:40:22,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:40:22,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:40:22,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:22" (1/1) ... [2024-06-27 18:40:22,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:40:22,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:40:22,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 18:40:22,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 18:40:22,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:40:22,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:40:22,493 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 18:40:22,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 18:40:22,494 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 18:40:22,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 18:40:22,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:40:22,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:40:22,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:40:22,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:40:22,496 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 18:40:22,613 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:40:22,615 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:40:22,896 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:40:22,896 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:40:23,031 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:40:23,031 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 18:40:23,033 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:40:23 BoogieIcfgContainer [2024-06-27 18:40:23,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:40:23,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:40:23,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:40:23,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:40:23,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:40:21" (1/4) ... [2024-06-27 18:40:23,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ed3e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:40:23, skipping insertion in model container [2024-06-27 18:40:23,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:40:21" (2/4) ... [2024-06-27 18:40:23,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ed3e80 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:40:23, skipping insertion in model container [2024-06-27 18:40:23,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:40:22" (3/4) ... [2024-06-27 18:40:23,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ed3e80 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:40:23, skipping insertion in model container [2024-06-27 18:40:23,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:40:23" (4/4) ... [2024-06-27 18:40:23,043 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 18:40:23,056 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:40:23,056 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 18:40:23,056 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:40:23,085 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 18:40:23,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 82 flow [2024-06-27 18:40:23,126 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-06-27 18:40:23,135 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:40:23,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-06-27 18:40:23,137 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 37 transitions, 82 flow [2024-06-27 18:40:23,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 76 flow [2024-06-27 18:40:23,146 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:40:23,151 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;@4f3a3e20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:40:23,152 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 18:40:23,155 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:40:23,155 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 18:40:23,155 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:40:23,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:23,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:40:23,156 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:23,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash 315654007, now seen corresponding path program 1 times [2024-06-27 18:40:23,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:23,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140881448] [2024-06-27 18:40:23,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:23,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:23,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140881448] [2024-06-27 18:40:23,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140881448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:23,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:23,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:40:23,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043962845] [2024-06-27 18:40:23,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:23,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:40:23,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:23,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:40:23,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:40:23,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 18:40:23,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:23,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:23,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 18:40:23,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:24,194 INFO L124 PetriNetUnfolderBase]: 559/1092 cut-off events. [2024-06-27 18:40:24,195 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-27 18:40:24,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 1092 events. 559/1092 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6092 event pairs, 397 based on Foata normal form. 43/1024 useless extension candidates. Maximal degree in co-relation 2030. Up to 920 conditions per place. [2024-06-27 18:40:24,206 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 31 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-27 18:40:24,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 169 flow [2024-06-27 18:40:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:40:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:40:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-27 18:40:24,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-06-27 18:40:24,217 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 76 flow. Second operand 3 states and 75 transitions. [2024-06-27 18:40:24,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 169 flow [2024-06-27 18:40:24,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:40:24,223 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 100 flow [2024-06-27 18:40:24,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-27 18:40:24,227 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-06-27 18:40:24,227 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 100 flow [2024-06-27 18:40:24,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:24,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:24,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:40:24,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:40:24,227 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:24,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash 315654920, now seen corresponding path program 1 times [2024-06-27 18:40:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:24,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251597869] [2024-06-27 18:40:24,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:24,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:24,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251597869] [2024-06-27 18:40:24,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251597869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:24,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:24,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:40:24,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493743139] [2024-06-27 18:40:24,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:24,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:40:24,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:24,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:40:24,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:40:24,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 37 [2024-06-27 18:40:24,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:24,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:24,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 37 [2024-06-27 18:40:24,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:24,340 INFO L124 PetriNetUnfolderBase]: 169/402 cut-off events. [2024-06-27 18:40:24,340 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-06-27 18:40:24,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 402 events. 169/402 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2151 event pairs, 96 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 759. Up to 256 conditions per place. [2024-06-27 18:40:24,342 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 23 selfloop transitions, 3 changer transitions 2/46 dead transitions. [2024-06-27 18:40:24,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 171 flow [2024-06-27 18:40:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:40:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:40:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-06-27 18:40:24,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7657657657657657 [2024-06-27 18:40:24,344 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 100 flow. Second operand 3 states and 85 transitions. [2024-06-27 18:40:24,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 171 flow [2024-06-27 18:40:24,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:40:24,345 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 92 flow [2024-06-27 18:40:24,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2024-06-27 18:40:24,346 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-06-27 18:40:24,346 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 92 flow [2024-06-27 18:40:24,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:24,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:24,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:24,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:40:24,346 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:24,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:24,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1599155083, now seen corresponding path program 1 times [2024-06-27 18:40:24,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:24,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456973739] [2024-06-27 18:40:24,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:24,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:24,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:24,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456973739] [2024-06-27 18:40:24,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456973739] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:24,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:24,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:40:24,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316028928] [2024-06-27 18:40:24,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:24,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:40:24,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:24,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:40:24,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:40:24,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 18:40:24,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-06-27 18:40:24,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:24,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 18:40:24,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:24,936 INFO L124 PetriNetUnfolderBase]: 402/815 cut-off events. [2024-06-27 18:40:24,936 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2024-06-27 18:40:24,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 815 events. 402/815 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4307 event pairs, 260 based on Foata normal form. 2/780 useless extension candidates. Maximal degree in co-relation 1667. Up to 658 conditions per place. [2024-06-27 18:40:24,940 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 35 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-06-27 18:40:24,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 220 flow [2024-06-27 18:40:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:40:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:40:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-06-27 18:40:24,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2024-06-27 18:40:24,942 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 92 flow. Second operand 4 states and 89 transitions. [2024-06-27 18:40:24,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 220 flow [2024-06-27 18:40:24,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:40:24,943 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 135 flow [2024-06-27 18:40:24,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-06-27 18:40:24,944 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2024-06-27 18:40:24,944 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 135 flow [2024-06-27 18:40:24,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-06-27 18:40:24,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:24,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:24,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:40:24,945 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:24,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1965800764, now seen corresponding path program 1 times [2024-06-27 18:40:24,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:24,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765293580] [2024-06-27 18:40:24,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:24,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:25,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:25,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765293580] [2024-06-27 18:40:25,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765293580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:25,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:25,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:40:25,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558424116] [2024-06-27 18:40:25,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:25,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:40:25,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:25,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:40:25,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:40:25,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 18:40:25,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:25,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:25,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 18:40:25,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:25,480 INFO L124 PetriNetUnfolderBase]: 418/854 cut-off events. [2024-06-27 18:40:25,480 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2024-06-27 18:40:25,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 854 events. 418/854 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4623 event pairs, 147 based on Foata normal form. 3/820 useless extension candidates. Maximal degree in co-relation 1888. Up to 629 conditions per place. [2024-06-27 18:40:25,485 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 46 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-27 18:40:25,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 341 flow [2024-06-27 18:40:25,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:40:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:40:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-27 18:40:25,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2024-06-27 18:40:25,487 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 135 flow. Second operand 5 states and 116 transitions. [2024-06-27 18:40:25,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 341 flow [2024-06-27 18:40:25,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 334 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 18:40:25,489 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 216 flow [2024-06-27 18:40:25,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2024-06-27 18:40:25,490 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-06-27 18:40:25,490 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 216 flow [2024-06-27 18:40:25,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:25,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:25,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:25,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:40:25,491 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:25,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:25,491 INFO L85 PathProgramCache]: Analyzing trace with hash 810282356, now seen corresponding path program 1 times [2024-06-27 18:40:25,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:25,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363345256] [2024-06-27 18:40:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:25,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:25,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:25,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363345256] [2024-06-27 18:40:25,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363345256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:25,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:25,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:40:25,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977798095] [2024-06-27 18:40:25,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:25,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:40:25,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:25,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:40:25,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:40:26,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 18:40:26,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:26,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:26,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 18:40:26,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:26,223 INFO L124 PetriNetUnfolderBase]: 428/794 cut-off events. [2024-06-27 18:40:26,223 INFO L125 PetriNetUnfolderBase]: For 798/798 co-relation queries the response was YES. [2024-06-27 18:40:26,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2219 conditions, 794 events. 428/794 cut-off events. For 798/798 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4024 event pairs, 77 based on Foata normal form. 3/787 useless extension candidates. Maximal degree in co-relation 2200. Up to 593 conditions per place. [2024-06-27 18:40:26,227 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 56 selfloop transitions, 23 changer transitions 0/89 dead transitions. [2024-06-27 18:40:26,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 526 flow [2024-06-27 18:40:26,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:40:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:40:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-06-27 18:40:26,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6261261261261262 [2024-06-27 18:40:26,229 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 216 flow. Second operand 6 states and 139 transitions. [2024-06-27 18:40:26,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 526 flow [2024-06-27 18:40:26,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 522 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 18:40:26,232 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 364 flow [2024-06-27 18:40:26,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2024-06-27 18:40:26,233 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2024-06-27 18:40:26,233 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 364 flow [2024-06-27 18:40:26,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:26,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:26,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:26,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:40:26,233 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:26,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:26,234 INFO L85 PathProgramCache]: Analyzing trace with hash -651049893, now seen corresponding path program 1 times [2024-06-27 18:40:26,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:26,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856237958] [2024-06-27 18:40:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:26,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:26,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:26,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856237958] [2024-06-27 18:40:26,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856237958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:26,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:26,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:40:26,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46180324] [2024-06-27 18:40:26,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:26,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:40:26,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:26,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:40:26,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:40:26,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 18:40:26,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 364 flow. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:26,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:26,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 18:40:26,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:27,130 INFO L124 PetriNetUnfolderBase]: 438/812 cut-off events. [2024-06-27 18:40:27,130 INFO L125 PetriNetUnfolderBase]: For 1539/1539 co-relation queries the response was YES. [2024-06-27 18:40:27,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 812 events. 438/812 cut-off events. For 1539/1539 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4199 event pairs, 37 based on Foata normal form. 6/808 useless extension candidates. Maximal degree in co-relation 2680. Up to 561 conditions per place. [2024-06-27 18:40:27,135 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 59 selfloop transitions, 25 changer transitions 0/94 dead transitions. [2024-06-27 18:40:27,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 94 transitions, 648 flow [2024-06-27 18:40:27,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:40:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:40:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-06-27 18:40:27,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6023166023166023 [2024-06-27 18:40:27,136 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 364 flow. Second operand 7 states and 156 transitions. [2024-06-27 18:40:27,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 94 transitions, 648 flow [2024-06-27 18:40:27,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 628 flow, removed 10 selfloop flow, removed 0 redundant places. [2024-06-27 18:40:27,143 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 411 flow [2024-06-27 18:40:27,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=411, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-06-27 18:40:27,145 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2024-06-27 18:40:27,145 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 411 flow [2024-06-27 18:40:27,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:27,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:27,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:27,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:40:27,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:27,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:27,146 INFO L85 PathProgramCache]: Analyzing trace with hash -981548492, now seen corresponding path program 1 times [2024-06-27 18:40:27,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:27,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725405049] [2024-06-27 18:40:27,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:27,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:27,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725405049] [2024-06-27 18:40:27,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725405049] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:27,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:27,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:40:27,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393780651] [2024-06-27 18:40:27,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:27,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:40:27,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:27,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:40:27,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:40:27,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 18:40:27,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 411 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-06-27 18:40:27,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:27,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 18:40:27,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:27,850 INFO L124 PetriNetUnfolderBase]: 514/1028 cut-off events. [2024-06-27 18:40:27,850 INFO L125 PetriNetUnfolderBase]: For 2013/2013 co-relation queries the response was YES. [2024-06-27 18:40:27,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3278 conditions, 1028 events. 514/1028 cut-off events. For 2013/2013 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5657 event pairs, 156 based on Foata normal form. 1/993 useless extension candidates. Maximal degree in co-relation 3249. Up to 838 conditions per place. [2024-06-27 18:40:27,856 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 53 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2024-06-27 18:40:27,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 561 flow [2024-06-27 18:40:27,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:40:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:40:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2024-06-27 18:40:27,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-06-27 18:40:27,858 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 411 flow. Second operand 5 states and 91 transitions. [2024-06-27 18:40:27,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 561 flow [2024-06-27 18:40:27,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 502 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 18:40:27,862 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 380 flow [2024-06-27 18:40:27,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-06-27 18:40:27,863 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2024-06-27 18:40:27,863 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 380 flow [2024-06-27 18:40:27,863 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-06-27 18:40:27,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:27,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:27,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:40:27,864 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:27,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:27,864 INFO L85 PathProgramCache]: Analyzing trace with hash -364326629, now seen corresponding path program 1 times [2024-06-27 18:40:27,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:27,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708303848] [2024-06-27 18:40:27,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:27,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:28,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:28,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708303848] [2024-06-27 18:40:28,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708303848] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:28,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:28,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:40:28,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796784735] [2024-06-27 18:40:28,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:28,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:40:28,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:28,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:40:28,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:40:28,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:28,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:28,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:28,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:28,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:28,623 INFO L124 PetriNetUnfolderBase]: 583/1135 cut-off events. [2024-06-27 18:40:28,624 INFO L125 PetriNetUnfolderBase]: For 2084/2084 co-relation queries the response was YES. [2024-06-27 18:40:28,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3441 conditions, 1135 events. 583/1135 cut-off events. For 2084/2084 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6194 event pairs, 178 based on Foata normal form. 1/1094 useless extension candidates. Maximal degree in co-relation 3410. Up to 937 conditions per place. [2024-06-27 18:40:28,629 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 59 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2024-06-27 18:40:28,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 78 transitions, 570 flow [2024-06-27 18:40:28,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:40:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:40:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-27 18:40:28,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46396396396396394 [2024-06-27 18:40:28,631 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 380 flow. Second operand 6 states and 103 transitions. [2024-06-27 18:40:28,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 78 transitions, 570 flow [2024-06-27 18:40:28,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 545 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 18:40:28,639 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 399 flow [2024-06-27 18:40:28,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=399, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2024-06-27 18:40:28,642 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2024-06-27 18:40:28,642 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 399 flow [2024-06-27 18:40:28,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:28,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:28,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:28,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 18:40:28,643 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:28,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:28,643 INFO L85 PathProgramCache]: Analyzing trace with hash 565424084, now seen corresponding path program 1 times [2024-06-27 18:40:28,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:28,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003314332] [2024-06-27 18:40:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:28,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:29,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:29,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003314332] [2024-06-27 18:40:29,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003314332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:29,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:29,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:40:29,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652651217] [2024-06-27 18:40:29,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:29,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:40:29,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:29,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:40:29,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:40:29,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 18:40:29,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 399 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-06-27 18:40:29,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:29,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 18:40:29,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:29,325 INFO L124 PetriNetUnfolderBase]: 540/1060 cut-off events. [2024-06-27 18:40:29,325 INFO L125 PetriNetUnfolderBase]: For 2398/2398 co-relation queries the response was YES. [2024-06-27 18:40:29,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3425 conditions, 1060 events. 540/1060 cut-off events. For 2398/2398 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5761 event pairs, 124 based on Foata normal form. 2/1022 useless extension candidates. Maximal degree in co-relation 3394. Up to 798 conditions per place. [2024-06-27 18:40:29,330 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 60 selfloop transitions, 15 changer transitions 0/84 dead transitions. [2024-06-27 18:40:29,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 635 flow [2024-06-27 18:40:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:40:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:40:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-27 18:40:29,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180180180180181 [2024-06-27 18:40:29,332 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 399 flow. Second operand 6 states and 115 transitions. [2024-06-27 18:40:29,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 635 flow [2024-06-27 18:40:29,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 84 transitions, 611 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 18:40:29,336 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 434 flow [2024-06-27 18:40:29,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-06-27 18:40:29,337 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2024-06-27 18:40:29,337 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 434 flow [2024-06-27 18:40:29,337 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-06-27 18:40:29,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:29,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:29,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 18:40:29,338 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:29,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:29,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1625595254, now seen corresponding path program 2 times [2024-06-27 18:40:29,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:29,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884908867] [2024-06-27 18:40:29,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:29,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:29,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:29,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884908867] [2024-06-27 18:40:29,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884908867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:29,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:29,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:40:29,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448807590] [2024-06-27 18:40:29,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:29,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:40:29,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:29,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:40:29,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:40:29,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 18:40:29,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 434 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-06-27 18:40:29,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:29,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 18:40:29,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:30,103 INFO L124 PetriNetUnfolderBase]: 544/1071 cut-off events. [2024-06-27 18:40:30,103 INFO L125 PetriNetUnfolderBase]: For 2740/2740 co-relation queries the response was YES. [2024-06-27 18:40:30,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3514 conditions, 1071 events. 544/1071 cut-off events. For 2740/2740 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5897 event pairs, 168 based on Foata normal form. 1/1036 useless extension candidates. Maximal degree in co-relation 3482. Up to 875 conditions per place. [2024-06-27 18:40:30,109 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 59 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2024-06-27 18:40:30,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 78 transitions, 606 flow [2024-06-27 18:40:30,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:40:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:40:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-27 18:40:30,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2024-06-27 18:40:30,110 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 434 flow. Second operand 6 states and 106 transitions. [2024-06-27 18:40:30,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 78 transitions, 606 flow [2024-06-27 18:40:30,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 78 transitions, 587 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-27 18:40:30,115 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 440 flow [2024-06-27 18:40:30,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=440, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2024-06-27 18:40:30,116 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2024-06-27 18:40:30,116 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 440 flow [2024-06-27 18:40:30,116 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-06-27 18:40:30,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:30,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:30,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 18:40:30,117 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:30,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1590777511, now seen corresponding path program 1 times [2024-06-27 18:40:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:30,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673251704] [2024-06-27 18:40:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:30,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:30,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:30,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673251704] [2024-06-27 18:40:30,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673251704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:30,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:30,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:40:30,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936458947] [2024-06-27 18:40:30,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:30,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:40:30,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:30,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:40:30,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:40:30,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:30,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 440 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:30,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:30,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:30,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:31,039 INFO L124 PetriNetUnfolderBase]: 581/1115 cut-off events. [2024-06-27 18:40:31,039 INFO L125 PetriNetUnfolderBase]: For 3041/3041 co-relation queries the response was YES. [2024-06-27 18:40:31,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3652 conditions, 1115 events. 581/1115 cut-off events. For 3041/3041 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6016 event pairs, 169 based on Foata normal form. 3/1079 useless extension candidates. Maximal degree in co-relation 3619. Up to 899 conditions per place. [2024-06-27 18:40:31,044 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 68 selfloop transitions, 14 changer transitions 0/89 dead transitions. [2024-06-27 18:40:31,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 672 flow [2024-06-27 18:40:31,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:40:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:40:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-27 18:40:31,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671814671814672 [2024-06-27 18:40:31,046 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 440 flow. Second operand 7 states and 121 transitions. [2024-06-27 18:40:31,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 672 flow [2024-06-27 18:40:31,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 89 transitions, 630 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-27 18:40:31,050 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 447 flow [2024-06-27 18:40:31,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=447, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2024-06-27 18:40:31,051 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2024-06-27 18:40:31,051 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 447 flow [2024-06-27 18:40:31,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:31,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:31,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:31,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 18:40:31,052 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:31,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:31,052 INFO L85 PathProgramCache]: Analyzing trace with hash -834559091, now seen corresponding path program 1 times [2024-06-27 18:40:31,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:31,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235788612] [2024-06-27 18:40:31,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:31,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:31,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:31,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235788612] [2024-06-27 18:40:31,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235788612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:31,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:31,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:40:31,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570300341] [2024-06-27 18:40:31,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:31,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:40:31,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:31,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:40:31,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:40:31,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:31,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 447 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:31,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:31,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:31,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:31,779 INFO L124 PetriNetUnfolderBase]: 609/1122 cut-off events. [2024-06-27 18:40:31,779 INFO L125 PetriNetUnfolderBase]: For 3201/3201 co-relation queries the response was YES. [2024-06-27 18:40:31,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3846 conditions, 1122 events. 609/1122 cut-off events. For 3201/3201 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5922 event pairs, 138 based on Foata normal form. 2/1090 useless extension candidates. Maximal degree in co-relation 3813. Up to 843 conditions per place. [2024-06-27 18:40:31,786 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 73 selfloop transitions, 20 changer transitions 0/100 dead transitions. [2024-06-27 18:40:31,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 100 transitions, 768 flow [2024-06-27 18:40:31,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:40:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:40:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-27 18:40:31,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4980694980694981 [2024-06-27 18:40:31,788 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 447 flow. Second operand 7 states and 129 transitions. [2024-06-27 18:40:31,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 100 transitions, 768 flow [2024-06-27 18:40:31,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 100 transitions, 734 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 18:40:31,795 INFO L231 Difference]: Finished difference. Result has 76 places, 74 transitions, 522 flow [2024-06-27 18:40:31,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=522, PETRI_PLACES=76, PETRI_TRANSITIONS=74} [2024-06-27 18:40:31,795 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2024-06-27 18:40:31,796 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 74 transitions, 522 flow [2024-06-27 18:40:31,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:31,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:31,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:31,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 18:40:31,797 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:31,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1172965487, now seen corresponding path program 2 times [2024-06-27 18:40:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:31,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244167117] [2024-06-27 18:40:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:32,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:32,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244167117] [2024-06-27 18:40:32,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244167117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:32,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:32,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:40:32,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218644116] [2024-06-27 18:40:32,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:32,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:40:32,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:32,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:40:32,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:40:32,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:32,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 74 transitions, 522 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:32,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:32,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:32,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:32,613 INFO L124 PetriNetUnfolderBase]: 620/1167 cut-off events. [2024-06-27 18:40:32,614 INFO L125 PetriNetUnfolderBase]: For 3799/3799 co-relation queries the response was YES. [2024-06-27 18:40:32,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4193 conditions, 1167 events. 620/1167 cut-off events. For 3799/3799 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6342 event pairs, 179 based on Foata normal form. 1/1132 useless extension candidates. Maximal degree in co-relation 4158. Up to 973 conditions per place. [2024-06-27 18:40:32,621 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 75 selfloop transitions, 16 changer transitions 0/98 dead transitions. [2024-06-27 18:40:32,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 98 transitions, 808 flow [2024-06-27 18:40:32,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:40:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:40:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-27 18:40:32,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46332046332046334 [2024-06-27 18:40:32,623 INFO L175 Difference]: Start difference. First operand has 76 places, 74 transitions, 522 flow. Second operand 7 states and 120 transitions. [2024-06-27 18:40:32,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 98 transitions, 808 flow [2024-06-27 18:40:32,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 98 transitions, 793 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 18:40:32,629 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 576 flow [2024-06-27 18:40:32,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2024-06-27 18:40:32,629 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 40 predicate places. [2024-06-27 18:40:32,630 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 576 flow [2024-06-27 18:40:32,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:32,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:32,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:32,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 18:40:32,630 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:32,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash 154518591, now seen corresponding path program 3 times [2024-06-27 18:40:32,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:32,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318974997] [2024-06-27 18:40:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:32,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:33,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:33,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318974997] [2024-06-27 18:40:33,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318974997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:33,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:33,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:40:33,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225154873] [2024-06-27 18:40:33,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:33,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:40:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:33,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:40:33,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:40:33,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:33,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 576 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:33,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:33,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:33,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:33,398 INFO L124 PetriNetUnfolderBase]: 618/1165 cut-off events. [2024-06-27 18:40:33,399 INFO L125 PetriNetUnfolderBase]: For 4414/4414 co-relation queries the response was YES. [2024-06-27 18:40:33,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4285 conditions, 1165 events. 618/1165 cut-off events. For 4414/4414 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6315 event pairs, 181 based on Foata normal form. 1/1130 useless extension candidates. Maximal degree in co-relation 4247. Up to 991 conditions per place. [2024-06-27 18:40:33,407 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 75 selfloop transitions, 13 changer transitions 0/95 dead transitions. [2024-06-27 18:40:33,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 95 transitions, 794 flow [2024-06-27 18:40:33,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:40:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:40:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-27 18:40:33,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44787644787644787 [2024-06-27 18:40:33,409 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 576 flow. Second operand 7 states and 116 transitions. [2024-06-27 18:40:33,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 95 transitions, 794 flow [2024-06-27 18:40:33,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 95 transitions, 764 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 18:40:33,417 INFO L231 Difference]: Finished difference. Result has 85 places, 78 transitions, 577 flow [2024-06-27 18:40:33,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=577, PETRI_PLACES=85, PETRI_TRANSITIONS=78} [2024-06-27 18:40:33,417 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2024-06-27 18:40:33,417 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 577 flow [2024-06-27 18:40:33,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:33,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:33,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:33,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 18:40:33,418 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:33,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash 347202575, now seen corresponding path program 1 times [2024-06-27 18:40:33,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:33,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395207989] [2024-06-27 18:40:33,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:33,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:33,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:33,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395207989] [2024-06-27 18:40:33,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395207989] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:33,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:33,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:40:33,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147061731] [2024-06-27 18:40:33,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:33,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:40:33,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:33,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:40:33,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:40:34,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 18:40:34,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 78 transitions, 577 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:34,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:34,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 18:40:34,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:34,321 INFO L124 PetriNetUnfolderBase]: 581/1097 cut-off events. [2024-06-27 18:40:34,321 INFO L125 PetriNetUnfolderBase]: For 4668/4668 co-relation queries the response was YES. [2024-06-27 18:40:34,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4148 conditions, 1097 events. 581/1097 cut-off events. For 4668/4668 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5910 event pairs, 121 based on Foata normal form. 1/1067 useless extension candidates. Maximal degree in co-relation 4109. Up to 798 conditions per place. [2024-06-27 18:40:34,327 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 81 selfloop transitions, 20 changer transitions 0/115 dead transitions. [2024-06-27 18:40:34,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 115 transitions, 900 flow [2024-06-27 18:40:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:40:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:40:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 18:40:34,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-27 18:40:34,328 INFO L175 Difference]: Start difference. First operand has 85 places, 78 transitions, 577 flow. Second operand 8 states and 152 transitions. [2024-06-27 18:40:34,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 115 transitions, 900 flow [2024-06-27 18:40:34,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 115 transitions, 863 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-27 18:40:34,337 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 627 flow [2024-06-27 18:40:34,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=627, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2024-06-27 18:40:34,338 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2024-06-27 18:40:34,338 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 83 transitions, 627 flow [2024-06-27 18:40:34,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:34,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:34,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:34,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 18:40:34,338 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:34,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash 351017807, now seen corresponding path program 1 times [2024-06-27 18:40:34,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:34,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660287379] [2024-06-27 18:40:34,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:34,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:34,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:34,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660287379] [2024-06-27 18:40:34,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660287379] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:34,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:34,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:34,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628710834] [2024-06-27 18:40:34,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:34,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:34,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:34,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:34,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:34,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:34,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 627 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:34,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:34,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:34,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:35,183 INFO L124 PetriNetUnfolderBase]: 749/1358 cut-off events. [2024-06-27 18:40:35,183 INFO L125 PetriNetUnfolderBase]: For 6431/6431 co-relation queries the response was YES. [2024-06-27 18:40:35,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5258 conditions, 1358 events. 749/1358 cut-off events. For 6431/6431 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7406 event pairs, 167 based on Foata normal form. 6/1327 useless extension candidates. Maximal degree in co-relation 5217. Up to 853 conditions per place. [2024-06-27 18:40:35,190 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 93 selfloop transitions, 26 changer transitions 0/126 dead transitions. [2024-06-27 18:40:35,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 126 transitions, 1045 flow [2024-06-27 18:40:35,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:40:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:40:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 18:40:35,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-27 18:40:35,192 INFO L175 Difference]: Start difference. First operand has 88 places, 83 transitions, 627 flow. Second operand 8 states and 152 transitions. [2024-06-27 18:40:35,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 126 transitions, 1045 flow [2024-06-27 18:40:35,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 126 transitions, 1005 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 18:40:35,201 INFO L231 Difference]: Finished difference. Result has 92 places, 91 transitions, 713 flow [2024-06-27 18:40:35,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=713, PETRI_PLACES=92, PETRI_TRANSITIONS=91} [2024-06-27 18:40:35,202 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places. [2024-06-27 18:40:35,202 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 91 transitions, 713 flow [2024-06-27 18:40:35,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:35,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:35,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:35,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 18:40:35,203 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:35,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:35,203 INFO L85 PathProgramCache]: Analyzing trace with hash 351017590, now seen corresponding path program 1 times [2024-06-27 18:40:35,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:35,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057296720] [2024-06-27 18:40:35,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:35,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:35,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:35,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057296720] [2024-06-27 18:40:35,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057296720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:35,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:35,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:40:35,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411985169] [2024-06-27 18:40:35,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:35,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:40:35,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:35,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:40:35,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:40:35,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:35,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 91 transitions, 713 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-06-27 18:40:35,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:35,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:35,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:35,963 INFO L124 PetriNetUnfolderBase]: 773/1413 cut-off events. [2024-06-27 18:40:35,964 INFO L125 PetriNetUnfolderBase]: For 7335/7335 co-relation queries the response was YES. [2024-06-27 18:40:35,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5894 conditions, 1413 events. 773/1413 cut-off events. For 7335/7335 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7866 event pairs, 181 based on Foata normal form. 1/1370 useless extension candidates. Maximal degree in co-relation 5851. Up to 1078 conditions per place. [2024-06-27 18:40:35,971 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 88 selfloop transitions, 26 changer transitions 0/121 dead transitions. [2024-06-27 18:40:35,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 121 transitions, 1113 flow [2024-06-27 18:40:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:40:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:40:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-27 18:40:35,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4980694980694981 [2024-06-27 18:40:35,972 INFO L175 Difference]: Start difference. First operand has 92 places, 91 transitions, 713 flow. Second operand 7 states and 129 transitions. [2024-06-27 18:40:35,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 121 transitions, 1113 flow [2024-06-27 18:40:35,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 121 transitions, 1088 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 18:40:35,989 INFO L231 Difference]: Finished difference. Result has 96 places, 95 transitions, 778 flow [2024-06-27 18:40:35,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=778, PETRI_PLACES=96, PETRI_TRANSITIONS=95} [2024-06-27 18:40:35,989 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2024-06-27 18:40:35,989 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 95 transitions, 778 flow [2024-06-27 18:40:35,989 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-06-27 18:40:35,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:35,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:35,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 18:40:35,990 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:35,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash 351012010, now seen corresponding path program 2 times [2024-06-27 18:40:35,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:35,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429106559] [2024-06-27 18:40:35,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:35,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:36,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:36,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429106559] [2024-06-27 18:40:36,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429106559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:36,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:36,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:40:36,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625898113] [2024-06-27 18:40:36,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:36,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:40:36,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:36,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:40:36,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:40:36,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:36,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 95 transitions, 778 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-06-27 18:40:36,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:36,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:36,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:36,749 INFO L124 PetriNetUnfolderBase]: 771/1416 cut-off events. [2024-06-27 18:40:36,750 INFO L125 PetriNetUnfolderBase]: For 7926/7926 co-relation queries the response was YES. [2024-06-27 18:40:36,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5928 conditions, 1416 events. 771/1416 cut-off events. For 7926/7926 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7909 event pairs, 166 based on Foata normal form. 1/1371 useless extension candidates. Maximal degree in co-relation 5882. Up to 1076 conditions per place. [2024-06-27 18:40:36,757 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 87 selfloop transitions, 29 changer transitions 0/123 dead transitions. [2024-06-27 18:40:36,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 123 transitions, 1128 flow [2024-06-27 18:40:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:40:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:40:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-27 18:40:36,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096525096525096 [2024-06-27 18:40:36,760 INFO L175 Difference]: Start difference. First operand has 96 places, 95 transitions, 778 flow. Second operand 7 states and 132 transitions. [2024-06-27 18:40:36,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 123 transitions, 1128 flow [2024-06-27 18:40:36,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 123 transitions, 1091 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 18:40:36,772 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 804 flow [2024-06-27 18:40:36,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=804, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2024-06-27 18:40:36,773 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2024-06-27 18:40:36,773 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 804 flow [2024-06-27 18:40:36,773 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-06-27 18:40:36,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:36,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:36,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 18:40:36,774 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:36,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1171021707, now seen corresponding path program 2 times [2024-06-27 18:40:36,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:36,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015689333] [2024-06-27 18:40:36,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:36,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:37,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:37,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015689333] [2024-06-27 18:40:37,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015689333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:37,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:37,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:37,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404614569] [2024-06-27 18:40:37,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:37,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:37,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:37,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:37,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:37,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:37,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 804 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:37,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:37,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:37,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:37,481 INFO L124 PetriNetUnfolderBase]: 804/1482 cut-off events. [2024-06-27 18:40:37,482 INFO L125 PetriNetUnfolderBase]: For 9446/9446 co-relation queries the response was YES. [2024-06-27 18:40:37,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6251 conditions, 1482 events. 804/1482 cut-off events. For 9446/9446 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8365 event pairs, 215 based on Foata normal form. 3/1442 useless extension candidates. Maximal degree in co-relation 6204. Up to 1178 conditions per place. [2024-06-27 18:40:37,489 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 100 selfloop transitions, 21 changer transitions 0/128 dead transitions. [2024-06-27 18:40:37,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 128 transitions, 1204 flow [2024-06-27 18:40:37,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:40:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:40:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-27 18:40:37,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797297297297297 [2024-06-27 18:40:37,493 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 804 flow. Second operand 8 states and 142 transitions. [2024-06-27 18:40:37,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 128 transitions, 1204 flow [2024-06-27 18:40:37,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 128 transitions, 1132 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-27 18:40:37,506 INFO L231 Difference]: Finished difference. Result has 102 places, 99 transitions, 819 flow [2024-06-27 18:40:37,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=819, PETRI_PLACES=102, PETRI_TRANSITIONS=99} [2024-06-27 18:40:37,507 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2024-06-27 18:40:37,507 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 99 transitions, 819 flow [2024-06-27 18:40:37,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:37,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:37,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:37,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 18:40:37,508 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:37,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:37,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1756159395, now seen corresponding path program 3 times [2024-06-27 18:40:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:37,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915543901] [2024-06-27 18:40:37,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:37,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:37,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:37,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915543901] [2024-06-27 18:40:37,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915543901] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:37,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:37,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:37,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991037954] [2024-06-27 18:40:37,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:37,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:37,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:37,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:37,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:37,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:37,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 99 transitions, 819 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:37,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:37,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:37,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:38,349 INFO L124 PetriNetUnfolderBase]: 837/1561 cut-off events. [2024-06-27 18:40:38,350 INFO L125 PetriNetUnfolderBase]: For 10613/10613 co-relation queries the response was YES. [2024-06-27 18:40:38,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6558 conditions, 1561 events. 837/1561 cut-off events. For 10613/10613 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9020 event pairs, 231 based on Foata normal form. 3/1514 useless extension candidates. Maximal degree in co-relation 6510. Up to 1302 conditions per place. [2024-06-27 18:40:38,361 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 100 selfloop transitions, 16 changer transitions 0/123 dead transitions. [2024-06-27 18:40:38,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 123 transitions, 1129 flow [2024-06-27 18:40:38,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:40:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:40:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-27 18:40:38,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44932432432432434 [2024-06-27 18:40:38,363 INFO L175 Difference]: Start difference. First operand has 102 places, 99 transitions, 819 flow. Second operand 8 states and 133 transitions. [2024-06-27 18:40:38,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 123 transitions, 1129 flow [2024-06-27 18:40:38,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 123 transitions, 1094 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 18:40:38,380 INFO L231 Difference]: Finished difference. Result has 106 places, 101 transitions, 847 flow [2024-06-27 18:40:38,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=847, PETRI_PLACES=106, PETRI_TRANSITIONS=101} [2024-06-27 18:40:38,380 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2024-06-27 18:40:38,381 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 101 transitions, 847 flow [2024-06-27 18:40:38,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:38,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:38,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:38,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 18:40:38,381 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:38,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:38,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1861057912, now seen corresponding path program 3 times [2024-06-27 18:40:38,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:38,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034248236] [2024-06-27 18:40:38,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:38,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:38,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:38,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034248236] [2024-06-27 18:40:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034248236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:38,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:38,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:40:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895427481] [2024-06-27 18:40:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:38,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:40:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:38,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:40:38,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:40:38,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:38,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 101 transitions, 847 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-06-27 18:40:38,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:38,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:38,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:39,155 INFO L124 PetriNetUnfolderBase]: 835/1558 cut-off events. [2024-06-27 18:40:39,156 INFO L125 PetriNetUnfolderBase]: For 10523/10523 co-relation queries the response was YES. [2024-06-27 18:40:39,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6546 conditions, 1558 events. 835/1558 cut-off events. For 10523/10523 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9032 event pairs, 230 based on Foata normal form. 1/1509 useless extension candidates. Maximal degree in co-relation 6497. Up to 1317 conditions per place. [2024-06-27 18:40:39,165 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 99 selfloop transitions, 14 changer transitions 0/120 dead transitions. [2024-06-27 18:40:39,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 120 transitions, 1129 flow [2024-06-27 18:40:39,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:40:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:40:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-27 18:40:39,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4555984555984556 [2024-06-27 18:40:39,166 INFO L175 Difference]: Start difference. First operand has 106 places, 101 transitions, 847 flow. Second operand 7 states and 118 transitions. [2024-06-27 18:40:39,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 120 transitions, 1129 flow [2024-06-27 18:40:39,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 120 transitions, 1076 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 18:40:39,182 INFO L231 Difference]: Finished difference. Result has 107 places, 101 transitions, 827 flow [2024-06-27 18:40:39,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=827, PETRI_PLACES=107, PETRI_TRANSITIONS=101} [2024-06-27 18:40:39,183 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2024-06-27 18:40:39,183 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 101 transitions, 827 flow [2024-06-27 18:40:39,183 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-06-27 18:40:39,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:39,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:39,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 18:40:39,184 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:39,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1993945227, now seen corresponding path program 4 times [2024-06-27 18:40:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:39,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313795251] [2024-06-27 18:40:39,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:39,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:39,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:39,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313795251] [2024-06-27 18:40:39,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313795251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:39,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:39,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:39,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183605578] [2024-06-27 18:40:39,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:39,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:39,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:39,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:39,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:39,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:39,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 101 transitions, 827 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:39,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:39,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:39,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:40,178 INFO L124 PetriNetUnfolderBase]: 829/1546 cut-off events. [2024-06-27 18:40:40,178 INFO L125 PetriNetUnfolderBase]: For 10495/10495 co-relation queries the response was YES. [2024-06-27 18:40:40,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6371 conditions, 1546 events. 829/1546 cut-off events. For 10495/10495 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8942 event pairs, 223 based on Foata normal form. 3/1499 useless extension candidates. Maximal degree in co-relation 6321. Up to 1248 conditions per place. [2024-06-27 18:40:40,189 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 101 selfloop transitions, 19 changer transitions 0/127 dead transitions. [2024-06-27 18:40:40,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 127 transitions, 1141 flow [2024-06-27 18:40:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:40:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:40:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-27 18:40:40,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46621621621621623 [2024-06-27 18:40:40,190 INFO L175 Difference]: Start difference. First operand has 107 places, 101 transitions, 827 flow. Second operand 8 states and 138 transitions. [2024-06-27 18:40:40,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 127 transitions, 1141 flow [2024-06-27 18:40:40,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 127 transitions, 1082 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-27 18:40:40,207 INFO L231 Difference]: Finished difference. Result has 108 places, 101 transitions, 811 flow [2024-06-27 18:40:40,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=811, PETRI_PLACES=108, PETRI_TRANSITIONS=101} [2024-06-27 18:40:40,207 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2024-06-27 18:40:40,208 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 101 transitions, 811 flow [2024-06-27 18:40:40,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:40,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:40,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:40,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 18:40:40,209 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:40,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:40,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1029301008, now seen corresponding path program 1 times [2024-06-27 18:40:40,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:40,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026089044] [2024-06-27 18:40:40,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:40,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:40,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:40,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026089044] [2024-06-27 18:40:40,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026089044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:40,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:40,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:40,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698130026] [2024-06-27 18:40:40,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:40,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:40,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:40,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:40,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:41,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 18:40:41,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 101 transitions, 811 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:41,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:41,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 18:40:41,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:41,369 INFO L124 PetriNetUnfolderBase]: 799/1509 cut-off events. [2024-06-27 18:40:41,369 INFO L125 PetriNetUnfolderBase]: For 10745/10746 co-relation queries the response was YES. [2024-06-27 18:40:41,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6244 conditions, 1509 events. 799/1509 cut-off events. For 10745/10746 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8762 event pairs, 115 based on Foata normal form. 3/1464 useless extension candidates. Maximal degree in co-relation 6193. Up to 1032 conditions per place. [2024-06-27 18:40:41,377 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 104 selfloop transitions, 20 changer transitions 0/140 dead transitions. [2024-06-27 18:40:41,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 140 transitions, 1233 flow [2024-06-27 18:40:41,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:40:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:40:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-27 18:40:41,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168918918918919 [2024-06-27 18:40:41,378 INFO L175 Difference]: Start difference. First operand has 108 places, 101 transitions, 811 flow. Second operand 8 states and 153 transitions. [2024-06-27 18:40:41,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 140 transitions, 1233 flow [2024-06-27 18:40:41,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 140 transitions, 1169 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 18:40:41,395 INFO L231 Difference]: Finished difference. Result has 109 places, 105 transitions, 826 flow [2024-06-27 18:40:41,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=826, PETRI_PLACES=109, PETRI_TRANSITIONS=105} [2024-06-27 18:40:41,396 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2024-06-27 18:40:41,396 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 105 transitions, 826 flow [2024-06-27 18:40:41,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:41,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:41,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:41,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 18:40:41,397 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:41,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1029361458, now seen corresponding path program 2 times [2024-06-27 18:40:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:41,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942750794] [2024-06-27 18:40:41,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:41,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:42,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:42,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942750794] [2024-06-27 18:40:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942750794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:42,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:42,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:42,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369788634] [2024-06-27 18:40:42,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:42,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:42,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:42,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:42,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 18:40:42,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 105 transitions, 826 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:42,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:42,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 18:40:42,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:42,477 INFO L124 PetriNetUnfolderBase]: 795/1495 cut-off events. [2024-06-27 18:40:42,478 INFO L125 PetriNetUnfolderBase]: For 10785/10786 co-relation queries the response was YES. [2024-06-27 18:40:42,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6211 conditions, 1495 events. 795/1495 cut-off events. For 10785/10786 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8667 event pairs, 158 based on Foata normal form. 3/1452 useless extension candidates. Maximal degree in co-relation 6159. Up to 1111 conditions per place. [2024-06-27 18:40:42,488 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 106 selfloop transitions, 21 changer transitions 0/143 dead transitions. [2024-06-27 18:40:42,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 143 transitions, 1202 flow [2024-06-27 18:40:42,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:40:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:40:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 18:40:42,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2024-06-27 18:40:42,489 INFO L175 Difference]: Start difference. First operand has 109 places, 105 transitions, 826 flow. Second operand 9 states and 169 transitions. [2024-06-27 18:40:42,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 143 transitions, 1202 flow [2024-06-27 18:40:42,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 143 transitions, 1171 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 18:40:42,509 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 841 flow [2024-06-27 18:40:42,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=841, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2024-06-27 18:40:42,510 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 73 predicate places. [2024-06-27 18:40:42,510 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 841 flow [2024-06-27 18:40:42,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:42,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:42,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:42,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 18:40:42,510 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:42,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:42,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2121620972, now seen corresponding path program 1 times [2024-06-27 18:40:42,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:42,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729355021] [2024-06-27 18:40:42,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:42,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:43,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:43,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729355021] [2024-06-27 18:40:43,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729355021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:43,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:43,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:43,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684065557] [2024-06-27 18:40:43,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:43,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:43,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:43,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:43,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:43,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:43,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 841 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-06-27 18:40:43,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:43,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:43,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:43,616 INFO L124 PetriNetUnfolderBase]: 868/1597 cut-off events. [2024-06-27 18:40:43,616 INFO L125 PetriNetUnfolderBase]: For 11230/11230 co-relation queries the response was YES. [2024-06-27 18:40:43,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6648 conditions, 1597 events. 868/1597 cut-off events. For 11230/11230 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9223 event pairs, 173 based on Foata normal form. 1/1546 useless extension candidates. Maximal degree in co-relation 6594. Up to 1144 conditions per place. [2024-06-27 18:40:43,626 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 111 selfloop transitions, 34 changer transitions 0/152 dead transitions. [2024-06-27 18:40:43,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 152 transitions, 1341 flow [2024-06-27 18:40:43,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:40:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:40:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-27 18:40:43,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-06-27 18:40:43,628 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 841 flow. Second operand 10 states and 182 transitions. [2024-06-27 18:40:43,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 152 transitions, 1341 flow [2024-06-27 18:40:43,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 152 transitions, 1299 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 18:40:43,649 INFO L231 Difference]: Finished difference. Result has 117 places, 109 transitions, 901 flow [2024-06-27 18:40:43,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=901, PETRI_PLACES=117, PETRI_TRANSITIONS=109} [2024-06-27 18:40:43,649 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2024-06-27 18:40:43,650 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 109 transitions, 901 flow [2024-06-27 18:40:43,650 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-06-27 18:40:43,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:43,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:43,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 18:40:43,650 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:43,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:43,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2003533292, now seen corresponding path program 2 times [2024-06-27 18:40:43,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:43,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134003311] [2024-06-27 18:40:43,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:43,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:44,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:44,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134003311] [2024-06-27 18:40:44,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134003311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:44,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:44,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:44,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451251008] [2024-06-27 18:40:44,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:44,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:44,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:44,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:44,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:44,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:44,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 901 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-06-27 18:40:44,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:44,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:44,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:44,652 INFO L124 PetriNetUnfolderBase]: 879/1607 cut-off events. [2024-06-27 18:40:44,652 INFO L125 PetriNetUnfolderBase]: For 12130/12130 co-relation queries the response was YES. [2024-06-27 18:40:44,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6885 conditions, 1607 events. 879/1607 cut-off events. For 12130/12130 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9260 event pairs, 174 based on Foata normal form. 1/1558 useless extension candidates. Maximal degree in co-relation 6830. Up to 1190 conditions per place. [2024-06-27 18:40:44,662 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 109 selfloop transitions, 36 changer transitions 0/152 dead transitions. [2024-06-27 18:40:44,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 152 transitions, 1385 flow [2024-06-27 18:40:44,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:40:44,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:40:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 18:40:44,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2024-06-27 18:40:44,663 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 901 flow. Second operand 9 states and 169 transitions. [2024-06-27 18:40:44,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 152 transitions, 1385 flow [2024-06-27 18:40:44,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 152 transitions, 1334 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 18:40:44,687 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 944 flow [2024-06-27 18:40:44,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=944, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2024-06-27 18:40:44,688 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 79 predicate places. [2024-06-27 18:40:44,688 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 944 flow [2024-06-27 18:40:44,688 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-06-27 18:40:44,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:44,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:44,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 18:40:44,689 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:44,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2003528456, now seen corresponding path program 1 times [2024-06-27 18:40:44,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:44,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805647049] [2024-06-27 18:40:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:44,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:45,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:45,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805647049] [2024-06-27 18:40:45,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805647049] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:45,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:45,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:45,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27504484] [2024-06-27 18:40:45,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:45,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:45,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:45,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:45,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:45,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:45,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 944 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-06-27 18:40:45,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:45,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:45,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:45,549 INFO L124 PetriNetUnfolderBase]: 912/1659 cut-off events. [2024-06-27 18:40:45,549 INFO L125 PetriNetUnfolderBase]: For 13768/13768 co-relation queries the response was YES. [2024-06-27 18:40:45,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7236 conditions, 1659 events. 912/1659 cut-off events. For 13768/13768 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9572 event pairs, 193 based on Foata normal form. 3/1614 useless extension candidates. Maximal degree in co-relation 7179. Up to 985 conditions per place. [2024-06-27 18:40:45,559 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 106 selfloop transitions, 39 changer transitions 0/152 dead transitions. [2024-06-27 18:40:45,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 152 transitions, 1422 flow [2024-06-27 18:40:45,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:40:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:40:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-27 18:40:45,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304054054054054 [2024-06-27 18:40:45,561 INFO L175 Difference]: Start difference. First operand has 120 places, 111 transitions, 944 flow. Second operand 8 states and 157 transitions. [2024-06-27 18:40:45,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 152 transitions, 1422 flow [2024-06-27 18:40:45,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 152 transitions, 1346 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 18:40:45,584 INFO L231 Difference]: Finished difference. Result has 121 places, 113 transitions, 967 flow [2024-06-27 18:40:45,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=967, PETRI_PLACES=121, PETRI_TRANSITIONS=113} [2024-06-27 18:40:45,584 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 80 predicate places. [2024-06-27 18:40:45,584 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 113 transitions, 967 flow [2024-06-27 18:40:45,585 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-06-27 18:40:45,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:45,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:45,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 18:40:45,585 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:45,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:45,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1147626892, now seen corresponding path program 3 times [2024-06-27 18:40:45,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:45,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502544849] [2024-06-27 18:40:45,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:45,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:46,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:46,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502544849] [2024-06-27 18:40:46,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502544849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:46,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:46,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:46,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293092510] [2024-06-27 18:40:46,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:46,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:46,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:46,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:46,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:46,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:46,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 967 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-06-27 18:40:46,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:46,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:46,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:46,515 INFO L124 PetriNetUnfolderBase]: 935/1620 cut-off events. [2024-06-27 18:40:46,515 INFO L125 PetriNetUnfolderBase]: For 14295/14295 co-relation queries the response was YES. [2024-06-27 18:40:46,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7452 conditions, 1620 events. 935/1620 cut-off events. For 14295/14295 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8941 event pairs, 131 based on Foata normal form. 1/1596 useless extension candidates. Maximal degree in co-relation 7394. Up to 1283 conditions per place. [2024-06-27 18:40:46,524 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 106 selfloop transitions, 42 changer transitions 0/155 dead transitions. [2024-06-27 18:40:46,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 155 transitions, 1461 flow [2024-06-27 18:40:46,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:40:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:40:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 18:40:46,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-27 18:40:46,525 INFO L175 Difference]: Start difference. First operand has 121 places, 113 transitions, 967 flow. Second operand 8 states and 144 transitions. [2024-06-27 18:40:46,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 155 transitions, 1461 flow [2024-06-27 18:40:46,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 155 transitions, 1373 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 18:40:46,550 INFO L231 Difference]: Finished difference. Result has 124 places, 124 transitions, 1088 flow [2024-06-27 18:40:46,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1088, PETRI_PLACES=124, PETRI_TRANSITIONS=124} [2024-06-27 18:40:46,551 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 83 predicate places. [2024-06-27 18:40:46,551 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 124 transitions, 1088 flow [2024-06-27 18:40:46,551 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-06-27 18:40:46,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:46,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:46,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 18:40:46,552 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:46,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2003348966, now seen corresponding path program 2 times [2024-06-27 18:40:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:46,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94325507] [2024-06-27 18:40:46,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:46,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:47,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:47,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94325507] [2024-06-27 18:40:47,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94325507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:47,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:47,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:47,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856562470] [2024-06-27 18:40:47,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:47,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:47,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:47,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:47,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:47,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:47,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 124 transitions, 1088 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-06-27 18:40:47,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:47,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:47,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:47,490 INFO L124 PetriNetUnfolderBase]: 1007/1778 cut-off events. [2024-06-27 18:40:47,490 INFO L125 PetriNetUnfolderBase]: For 17303/17303 co-relation queries the response was YES. [2024-06-27 18:40:47,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8126 conditions, 1778 events. 1007/1778 cut-off events. For 17303/17303 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10163 event pairs, 199 based on Foata normal form. 3/1740 useless extension candidates. Maximal degree in co-relation 8066. Up to 1074 conditions per place. [2024-06-27 18:40:47,500 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 119 selfloop transitions, 39 changer transitions 0/165 dead transitions. [2024-06-27 18:40:47,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 165 transitions, 1656 flow [2024-06-27 18:40:47,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:40:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:40:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-27 18:40:47,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202702702702703 [2024-06-27 18:40:47,520 INFO L175 Difference]: Start difference. First operand has 124 places, 124 transitions, 1088 flow. Second operand 8 states and 154 transitions. [2024-06-27 18:40:47,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 165 transitions, 1656 flow [2024-06-27 18:40:47,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 165 transitions, 1615 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-27 18:40:47,569 INFO L231 Difference]: Finished difference. Result has 130 places, 128 transitions, 1159 flow [2024-06-27 18:40:47,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1159, PETRI_PLACES=130, PETRI_TRANSITIONS=128} [2024-06-27 18:40:47,571 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 89 predicate places. [2024-06-27 18:40:47,571 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 128 transitions, 1159 flow [2024-06-27 18:40:47,571 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-06-27 18:40:47,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:47,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:47,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 18:40:47,572 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:47,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2003355476, now seen corresponding path program 3 times [2024-06-27 18:40:47,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:47,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445235550] [2024-06-27 18:40:47,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:47,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:48,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:48,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445235550] [2024-06-27 18:40:48,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445235550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:48,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:48,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:48,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660499172] [2024-06-27 18:40:48,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:48,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:48,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:48,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:48,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:48,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:48,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 128 transitions, 1159 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-06-27 18:40:48,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:48,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:48,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:48,526 INFO L124 PetriNetUnfolderBase]: 1001/1769 cut-off events. [2024-06-27 18:40:48,527 INFO L125 PetriNetUnfolderBase]: For 17621/17621 co-relation queries the response was YES. [2024-06-27 18:40:48,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8336 conditions, 1769 events. 1001/1769 cut-off events. For 17621/17621 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10134 event pairs, 197 based on Foata normal form. 3/1731 useless extension candidates. Maximal degree in co-relation 8274. Up to 1070 conditions per place. [2024-06-27 18:40:48,537 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 121 selfloop transitions, 38 changer transitions 0/166 dead transitions. [2024-06-27 18:40:48,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 166 transitions, 1653 flow [2024-06-27 18:40:48,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:40:48,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:40:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-27 18:40:48,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2024-06-27 18:40:48,538 INFO L175 Difference]: Start difference. First operand has 130 places, 128 transitions, 1159 flow. Second operand 8 states and 156 transitions. [2024-06-27 18:40:48,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 166 transitions, 1653 flow [2024-06-27 18:40:48,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 166 transitions, 1594 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 18:40:48,575 INFO L231 Difference]: Finished difference. Result has 134 places, 128 transitions, 1181 flow [2024-06-27 18:40:48,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1181, PETRI_PLACES=134, PETRI_TRANSITIONS=128} [2024-06-27 18:40:48,575 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 93 predicate places. [2024-06-27 18:40:48,575 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 128 transitions, 1181 flow [2024-06-27 18:40:48,576 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-06-27 18:40:48,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:48,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:48,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 18:40:48,576 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:48,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:48,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1178597730, now seen corresponding path program 4 times [2024-06-27 18:40:48,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:48,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752118813] [2024-06-27 18:40:48,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:48,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:49,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:49,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752118813] [2024-06-27 18:40:49,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752118813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:49,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:49,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:49,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610702313] [2024-06-27 18:40:49,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:49,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:49,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:49,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:49,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:49,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:49,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 128 transitions, 1181 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-06-27 18:40:49,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:49,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:49,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:49,455 INFO L124 PetriNetUnfolderBase]: 1073/1981 cut-off events. [2024-06-27 18:40:49,455 INFO L125 PetriNetUnfolderBase]: For 21391/21391 co-relation queries the response was YES. [2024-06-27 18:40:49,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9023 conditions, 1981 events. 1073/1981 cut-off events. For 21391/21391 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12045 event pairs, 285 based on Foata normal form. 3/1923 useless extension candidates. Maximal degree in co-relation 8960. Up to 1491 conditions per place. [2024-06-27 18:40:49,466 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 133 selfloop transitions, 24 changer transitions 0/164 dead transitions. [2024-06-27 18:40:49,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 164 transitions, 1747 flow [2024-06-27 18:40:49,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:40:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:40:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-27 18:40:49,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49324324324324326 [2024-06-27 18:40:49,468 INFO L175 Difference]: Start difference. First operand has 134 places, 128 transitions, 1181 flow. Second operand 8 states and 146 transitions. [2024-06-27 18:40:49,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 164 transitions, 1747 flow [2024-06-27 18:40:49,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 164 transitions, 1653 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 18:40:49,517 INFO L231 Difference]: Finished difference. Result has 135 places, 132 transitions, 1180 flow [2024-06-27 18:40:49,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1180, PETRI_PLACES=135, PETRI_TRANSITIONS=132} [2024-06-27 18:40:49,518 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 94 predicate places. [2024-06-27 18:40:49,518 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 132 transitions, 1180 flow [2024-06-27 18:40:49,518 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-06-27 18:40:49,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:49,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:49,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 18:40:49,519 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:49,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1178591034, now seen corresponding path program 4 times [2024-06-27 18:40:49,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:49,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510645346] [2024-06-27 18:40:49,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:49,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:50,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:50,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510645346] [2024-06-27 18:40:50,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510645346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:50,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:50,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:50,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734414374] [2024-06-27 18:40:50,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:50,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:50,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:50,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:50,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:50,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:50,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 132 transitions, 1180 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-06-27 18:40:50,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:50,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:50,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:50,628 INFO L124 PetriNetUnfolderBase]: 1074/1987 cut-off events. [2024-06-27 18:40:50,628 INFO L125 PetriNetUnfolderBase]: For 20143/20143 co-relation queries the response was YES. [2024-06-27 18:40:50,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8854 conditions, 1987 events. 1074/1987 cut-off events. For 20143/20143 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12104 event pairs, 288 based on Foata normal form. 1/1926 useless extension candidates. Maximal degree in co-relation 8790. Up to 1667 conditions per place. [2024-06-27 18:40:50,640 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 128 selfloop transitions, 27 changer transitions 0/162 dead transitions. [2024-06-27 18:40:50,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 162 transitions, 1610 flow [2024-06-27 18:40:50,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:40:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:40:50,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2024-06-27 18:40:50,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4297297297297297 [2024-06-27 18:40:50,641 INFO L175 Difference]: Start difference. First operand has 135 places, 132 transitions, 1180 flow. Second operand 10 states and 159 transitions. [2024-06-27 18:40:50,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 162 transitions, 1610 flow [2024-06-27 18:40:50,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 162 transitions, 1545 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 18:40:50,685 INFO L231 Difference]: Finished difference. Result has 141 places, 136 transitions, 1231 flow [2024-06-27 18:40:50,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1231, PETRI_PLACES=141, PETRI_TRANSITIONS=136} [2024-06-27 18:40:50,685 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 100 predicate places. [2024-06-27 18:40:50,685 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 136 transitions, 1231 flow [2024-06-27 18:40:50,685 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-06-27 18:40:50,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:50,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:50,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 18:40:50,686 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:50,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:50,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1682765498, now seen corresponding path program 5 times [2024-06-27 18:40:50,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:50,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110353816] [2024-06-27 18:40:50,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:50,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:51,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:51,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110353816] [2024-06-27 18:40:51,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110353816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:51,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:51,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:51,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416833417] [2024-06-27 18:40:51,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:51,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:51,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:51,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:51,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:51,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:51,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 136 transitions, 1231 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-06-27 18:40:51,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:51,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:51,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:51,582 INFO L124 PetriNetUnfolderBase]: 1068/1970 cut-off events. [2024-06-27 18:40:51,583 INFO L125 PetriNetUnfolderBase]: For 20427/20427 co-relation queries the response was YES. [2024-06-27 18:40:51,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8708 conditions, 1970 events. 1068/1970 cut-off events. For 20427/20427 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12004 event pairs, 268 based on Foata normal form. 3/1913 useless extension candidates. Maximal degree in co-relation 8642. Up to 1489 conditions per place. [2024-06-27 18:40:51,594 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 135 selfloop transitions, 25 changer transitions 0/167 dead transitions. [2024-06-27 18:40:51,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 167 transitions, 1707 flow [2024-06-27 18:40:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:40:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:40:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 18:40:51,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-27 18:40:51,596 INFO L175 Difference]: Start difference. First operand has 141 places, 136 transitions, 1231 flow. Second operand 8 states and 144 transitions. [2024-06-27 18:40:51,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 167 transitions, 1707 flow [2024-06-27 18:40:51,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 167 transitions, 1613 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-27 18:40:51,642 INFO L231 Difference]: Finished difference. Result has 143 places, 136 transitions, 1192 flow [2024-06-27 18:40:51,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1192, PETRI_PLACES=143, PETRI_TRANSITIONS=136} [2024-06-27 18:40:51,643 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 102 predicate places. [2024-06-27 18:40:51,643 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 1192 flow [2024-06-27 18:40:51,643 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-06-27 18:40:51,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:51,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:51,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 18:40:51,643 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:51,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:51,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1673591048, now seen corresponding path program 6 times [2024-06-27 18:40:51,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:51,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847448293] [2024-06-27 18:40:51,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:51,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:52,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:52,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847448293] [2024-06-27 18:40:52,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847448293] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:52,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:52,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:40:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275278506] [2024-06-27 18:40:52,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:52,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:40:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:52,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:40:52,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:40:52,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:52,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 136 transitions, 1192 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-06-27 18:40:52,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:52,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:52,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:52,549 INFO L124 PetriNetUnfolderBase]: 1062/1961 cut-off events. [2024-06-27 18:40:52,550 INFO L125 PetriNetUnfolderBase]: For 19810/19810 co-relation queries the response was YES. [2024-06-27 18:40:52,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8669 conditions, 1961 events. 1062/1961 cut-off events. For 19810/19810 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11924 event pairs, 296 based on Foata normal form. 3/1904 useless extension candidates. Maximal degree in co-relation 8602. Up to 1616 conditions per place. [2024-06-27 18:40:52,563 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 138 selfloop transitions, 17 changer transitions 0/162 dead transitions. [2024-06-27 18:40:52,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 162 transitions, 1576 flow [2024-06-27 18:40:52,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:40:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:40:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-27 18:40:52,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46283783783783783 [2024-06-27 18:40:52,572 INFO L175 Difference]: Start difference. First operand has 143 places, 136 transitions, 1192 flow. Second operand 8 states and 137 transitions. [2024-06-27 18:40:52,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 162 transitions, 1576 flow [2024-06-27 18:40:52,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 162 transitions, 1491 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 18:40:52,611 INFO L231 Difference]: Finished difference. Result has 143 places, 136 transitions, 1150 flow [2024-06-27 18:40:52,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1150, PETRI_PLACES=143, PETRI_TRANSITIONS=136} [2024-06-27 18:40:52,612 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 102 predicate places. [2024-06-27 18:40:52,612 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 1150 flow [2024-06-27 18:40:52,612 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-06-27 18:40:52,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:52,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:52,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 18:40:52,613 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:52,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:52,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1673265300, now seen corresponding path program 1 times [2024-06-27 18:40:52,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:52,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566892318] [2024-06-27 18:40:52,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:52,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:53,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:53,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566892318] [2024-06-27 18:40:53,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566892318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:53,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:53,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:40:53,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612566323] [2024-06-27 18:40:53,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:53,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:40:53,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:53,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:40:53,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:40:53,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:53,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 136 transitions, 1150 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:53,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:53,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:53,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:53,726 INFO L124 PetriNetUnfolderBase]: 1064/1944 cut-off events. [2024-06-27 18:40:53,726 INFO L125 PetriNetUnfolderBase]: For 18576/18576 co-relation queries the response was YES. [2024-06-27 18:40:53,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8378 conditions, 1944 events. 1064/1944 cut-off events. For 18576/18576 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11687 event pairs, 285 based on Foata normal form. 2/1891 useless extension candidates. Maximal degree in co-relation 8311. Up to 1658 conditions per place. [2024-06-27 18:40:53,737 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 140 selfloop transitions, 19 changer transitions 0/166 dead transitions. [2024-06-27 18:40:53,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 166 transitions, 1568 flow [2024-06-27 18:40:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:40:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:40:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-27 18:40:53,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 18:40:53,738 INFO L175 Difference]: Start difference. First operand has 143 places, 136 transitions, 1150 flow. Second operand 9 states and 148 transitions. [2024-06-27 18:40:53,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 166 transitions, 1568 flow [2024-06-27 18:40:53,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 166 transitions, 1518 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-27 18:40:53,769 INFO L231 Difference]: Finished difference. Result has 145 places, 141 transitions, 1199 flow [2024-06-27 18:40:53,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1199, PETRI_PLACES=145, PETRI_TRANSITIONS=141} [2024-06-27 18:40:53,769 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 104 predicate places. [2024-06-27 18:40:53,770 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 141 transitions, 1199 flow [2024-06-27 18:40:53,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:53,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:53,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:53,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 18:40:53,770 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:53,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:53,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1599356561, now seen corresponding path program 1 times [2024-06-27 18:40:53,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:53,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169439834] [2024-06-27 18:40:53,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:53,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:54,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169439834] [2024-06-27 18:40:54,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169439834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:54,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:54,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:40:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825971097] [2024-06-27 18:40:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:54,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:40:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:54,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:40:54,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:40:54,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:54,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 141 transitions, 1199 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:54,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:54,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:54,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:55,193 INFO L124 PetriNetUnfolderBase]: 1061/1950 cut-off events. [2024-06-27 18:40:55,193 INFO L125 PetriNetUnfolderBase]: For 18615/18615 co-relation queries the response was YES. [2024-06-27 18:40:55,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8444 conditions, 1950 events. 1061/1950 cut-off events. For 18615/18615 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11781 event pairs, 276 based on Foata normal form. 2/1893 useless extension candidates. Maximal degree in co-relation 8375. Up to 1633 conditions per place. [2024-06-27 18:40:55,203 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 143 selfloop transitions, 23 changer transitions 0/173 dead transitions. [2024-06-27 18:40:55,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 173 transitions, 1615 flow [2024-06-27 18:40:55,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:40:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:40:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-27 18:40:55,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45345345345345345 [2024-06-27 18:40:55,204 INFO L175 Difference]: Start difference. First operand has 145 places, 141 transitions, 1199 flow. Second operand 9 states and 151 transitions. [2024-06-27 18:40:55,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 173 transitions, 1615 flow [2024-06-27 18:40:55,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 173 transitions, 1552 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 18:40:55,242 INFO L231 Difference]: Finished difference. Result has 149 places, 143 transitions, 1209 flow [2024-06-27 18:40:55,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1209, PETRI_PLACES=149, PETRI_TRANSITIONS=143} [2024-06-27 18:40:55,243 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 108 predicate places. [2024-06-27 18:40:55,243 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 1209 flow [2024-06-27 18:40:55,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:55,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:55,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:55,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 18:40:55,243 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:55,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash -862908327, now seen corresponding path program 1 times [2024-06-27 18:40:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:55,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227295043] [2024-06-27 18:40:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:55,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:55,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227295043] [2024-06-27 18:40:55,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227295043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:55,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:55,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:40:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316853510] [2024-06-27 18:40:55,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:55,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:40:55,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:55,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:40:55,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:40:55,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-06-27 18:40:55,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 143 transitions, 1209 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:55,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:55,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-06-27 18:40:55,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:55,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L772-->L775: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][148], [Black: 126#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 389#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 260#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 514#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 401#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 67#true, Black: 277#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 326#true, Black: 413#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 291#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 168#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 10#L775true, Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 427#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 425#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 306#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~x$mem_tmp~0 0)), Black: 307#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 12#L762true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 238#true, Black: 181#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 444#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 299#true, Black: 320#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 195#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~x$mem_tmp~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 458#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 488#true, Black: 83#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 334#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 211#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 368#true, Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 350#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 59#true, Black: 485#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 475#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 149#true, Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 203#true, Black: 364#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 5#L832true, Black: 116#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 376#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 374#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 506#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 2 ~y~0)), Black: 498#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~y~0) (= ~x$mem_tmp~0 0))]) [2024-06-27 18:40:55,571 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-06-27 18:40:55,571 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 18:40:55,571 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 18:40:55,571 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 18:40:55,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L772-->L775: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][170], [Black: 126#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 389#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 260#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 401#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 67#true, Black: 277#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 326#true, Black: 413#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 291#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 168#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 10#L775true, Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 427#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 425#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 306#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~x$mem_tmp~0 0)), Black: 307#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 12#L762true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 521#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 238#true, Black: 181#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 444#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 299#true, Black: 320#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 195#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~x$mem_tmp~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 458#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 488#true, Black: 83#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 334#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 211#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 368#true, Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 350#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 59#true, Black: 485#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 29#L18-1true, Black: 475#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 149#true, Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 203#true, Black: 364#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 376#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 374#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 506#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 2 ~y~0)), Black: 498#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~y~0) (= ~x$mem_tmp~0 0))]) [2024-06-27 18:40:55,603 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-06-27 18:40:55,603 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-06-27 18:40:55,603 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-06-27 18:40:55,603 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-06-27 18:40:55,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L772-->L775: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][170], [Black: 126#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 389#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 260#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 401#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 67#true, Black: 277#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 326#true, Black: 413#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 6#L18-5true, Black: 291#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 168#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 10#L775true, Black: 48#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 427#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 425#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 306#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~x$mem_tmp~0 0)), Black: 307#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 12#L762true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 521#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 238#true, Black: 181#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 444#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), 299#true, Black: 320#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 195#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= ~x$mem_tmp~0 0)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 72#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 71#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 458#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 488#true, Black: 83#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 334#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 211#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 213#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 94#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 368#true, Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 350#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (or (= ~x~0 0) (= ~x~0 1)) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 59#true, Black: 485#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 0 ~x$r_buff0_thd0~0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 475#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~x$flush_delayed~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 149#true, Black: 234#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= ~x$r_buff1_thd2~0 (* 256 (div ~x$r_buff1_thd2~0 256))) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), 203#true, Black: 364#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 116#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 376#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 246#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= ~x$w_buff0~0 1) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0) (= ~x$mem_tmp~0 0)), Black: 374#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 1 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~x$mem_tmp~0 0)), Black: 506#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= 2 ~y~0)), Black: 498#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$w_buff0~0) (= (* (div ~x$r_buff0_thd2~0 256) 256) ~x$r_buff0_thd2~0) (= ~x$flush_delayed~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~y~0) (= ~x$mem_tmp~0 0))]) [2024-06-27 18:40:55,621 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2024-06-27 18:40:55,621 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-27 18:40:55,621 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-27 18:40:55,621 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-27 18:40:55,644 INFO L124 PetriNetUnfolderBase]: 1083/1975 cut-off events. [2024-06-27 18:40:55,644 INFO L125 PetriNetUnfolderBase]: For 13236/13590 co-relation queries the response was YES. [2024-06-27 18:40:55,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7750 conditions, 1975 events. 1083/1975 cut-off events. For 13236/13590 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12296 event pairs, 167 based on Foata normal form. 52/1919 useless extension candidates. Maximal degree in co-relation 7680. Up to 863 conditions per place. [2024-06-27 18:40:55,655 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 93 selfloop transitions, 23 changer transitions 77/264 dead transitions. [2024-06-27 18:40:55,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 264 transitions, 2523 flow [2024-06-27 18:40:55,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:40:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:40:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-06-27 18:40:55,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2024-06-27 18:40:55,656 INFO L175 Difference]: Start difference. First operand has 149 places, 143 transitions, 1209 flow. Second operand 8 states and 178 transitions. [2024-06-27 18:40:55,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 264 transitions, 2523 flow [2024-06-27 18:40:55,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 264 transitions, 2378 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-27 18:40:55,693 INFO L231 Difference]: Finished difference. Result has 155 places, 146 transitions, 1256 flow [2024-06-27 18:40:55,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1256, PETRI_PLACES=155, PETRI_TRANSITIONS=146} [2024-06-27 18:40:55,694 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 114 predicate places. [2024-06-27 18:40:55,694 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 146 transitions, 1256 flow [2024-06-27 18:40:55,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:40:55,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:55,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:55,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 18:40:55,695 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:55,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:55,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1855802219, now seen corresponding path program 1 times [2024-06-27 18:40:55,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:55,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083262178] [2024-06-27 18:40:55,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:55,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:56,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:56,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083262178] [2024-06-27 18:40:56,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083262178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:56,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:56,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:40:56,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993595162] [2024-06-27 18:40:56,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:56,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:40:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:56,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:40:56,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:40:56,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:56,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 146 transitions, 1256 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-06-27 18:40:56,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:56,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:56,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:57,199 INFO L124 PetriNetUnfolderBase]: 1211/2281 cut-off events. [2024-06-27 18:40:57,199 INFO L125 PetriNetUnfolderBase]: For 21431/21461 co-relation queries the response was YES. [2024-06-27 18:40:57,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10880 conditions, 2281 events. 1211/2281 cut-off events. For 21431/21461 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14220 event pairs, 268 based on Foata normal form. 32/2305 useless extension candidates. Maximal degree in co-relation 10805. Up to 1658 conditions per place. [2024-06-27 18:40:57,212 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 179 selfloop transitions, 47 changer transitions 7/241 dead transitions. [2024-06-27 18:40:57,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 241 transitions, 2538 flow [2024-06-27 18:40:57,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:40:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:40:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-06-27 18:40:57,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837837837837838 [2024-06-27 18:40:57,218 INFO L175 Difference]: Start difference. First operand has 155 places, 146 transitions, 1256 flow. Second operand 10 states and 179 transitions. [2024-06-27 18:40:57,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 241 transitions, 2538 flow [2024-06-27 18:40:57,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 241 transitions, 2534 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 18:40:57,279 INFO L231 Difference]: Finished difference. Result has 166 places, 182 transitions, 1887 flow [2024-06-27 18:40:57,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1887, PETRI_PLACES=166, PETRI_TRANSITIONS=182} [2024-06-27 18:40:57,280 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 125 predicate places. [2024-06-27 18:40:57,280 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 182 transitions, 1887 flow [2024-06-27 18:40:57,280 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-06-27 18:40:57,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:57,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:57,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 18:40:57,281 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:57,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:57,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1347617395, now seen corresponding path program 2 times [2024-06-27 18:40:57,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:57,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300010171] [2024-06-27 18:40:57,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:57,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:57,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300010171] [2024-06-27 18:40:57,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300010171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:57,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:57,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:40:57,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041275953] [2024-06-27 18:40:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:57,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:40:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:40:57,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:40:57,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:57,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 182 transitions, 1887 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-06-27 18:40:57,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:57,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:57,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:58,451 INFO L124 PetriNetUnfolderBase]: 1118/2059 cut-off events. [2024-06-27 18:40:58,451 INFO L125 PetriNetUnfolderBase]: For 23005/23043 co-relation queries the response was YES. [2024-06-27 18:40:58,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10560 conditions, 2059 events. 1118/2059 cut-off events. For 23005/23043 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12209 event pairs, 207 based on Foata normal form. 40/2093 useless extension candidates. Maximal degree in co-relation 10478. Up to 1229 conditions per place. [2024-06-27 18:40:58,466 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 146 selfloop transitions, 65 changer transitions 0/219 dead transitions. [2024-06-27 18:40:58,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 219 transitions, 2555 flow [2024-06-27 18:40:58,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:40:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:40:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-27 18:40:58,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48348348348348347 [2024-06-27 18:40:58,468 INFO L175 Difference]: Start difference. First operand has 166 places, 182 transitions, 1887 flow. Second operand 9 states and 161 transitions. [2024-06-27 18:40:58,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 219 transitions, 2555 flow [2024-06-27 18:40:58,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 219 transitions, 2451 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 18:40:58,542 INFO L231 Difference]: Finished difference. Result has 169 places, 184 transitions, 1951 flow [2024-06-27 18:40:58,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1787, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1951, PETRI_PLACES=169, PETRI_TRANSITIONS=184} [2024-06-27 18:40:58,542 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 128 predicate places. [2024-06-27 18:40:58,542 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 184 transitions, 1951 flow [2024-06-27 18:40:58,543 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-06-27 18:40:58,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:58,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:58,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 18:40:58,543 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:58,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:58,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1345739570, now seen corresponding path program 1 times [2024-06-27 18:40:58,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:58,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982592873] [2024-06-27 18:40:58,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:58,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:40:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:40:59,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:40:59,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982592873] [2024-06-27 18:40:59,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982592873] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:40:59,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:40:59,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:40:59,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200871678] [2024-06-27 18:40:59,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:40:59,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:40:59,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:40:59,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:40:59,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:40:59,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:40:59,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 184 transitions, 1951 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-06-27 18:40:59,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:40:59,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:40:59,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:40:59,823 INFO L124 PetriNetUnfolderBase]: 1180/2097 cut-off events. [2024-06-27 18:40:59,823 INFO L125 PetriNetUnfolderBase]: For 25932/25980 co-relation queries the response was YES. [2024-06-27 18:40:59,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10976 conditions, 2097 events. 1180/2097 cut-off events. For 25932/25980 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12091 event pairs, 203 based on Foata normal form. 51/2100 useless extension candidates. Maximal degree in co-relation 10895. Up to 864 conditions per place. [2024-06-27 18:40:59,837 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 160 selfloop transitions, 80 changer transitions 0/248 dead transitions. [2024-06-27 18:40:59,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 248 transitions, 2811 flow [2024-06-27 18:40:59,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:40:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:40:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 222 transitions. [2024-06-27 18:40:59,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 18:40:59,838 INFO L175 Difference]: Start difference. First operand has 169 places, 184 transitions, 1951 flow. Second operand 12 states and 222 transitions. [2024-06-27 18:40:59,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 248 transitions, 2811 flow [2024-06-27 18:40:59,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 248 transitions, 2711 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 18:40:59,926 INFO L231 Difference]: Finished difference. Result has 177 places, 190 transitions, 2105 flow [2024-06-27 18:40:59,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1851, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2105, PETRI_PLACES=177, PETRI_TRANSITIONS=190} [2024-06-27 18:40:59,926 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 136 predicate places. [2024-06-27 18:40:59,927 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 190 transitions, 2105 flow [2024-06-27 18:40:59,927 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-06-27 18:40:59,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:40:59,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:40:59,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 18:40:59,927 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:40:59,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:40:59,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1845438937, now seen corresponding path program 3 times [2024-06-27 18:40:59,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:40:59,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387004933] [2024-06-27 18:40:59,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:40:59,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:40:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:00,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:00,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387004933] [2024-06-27 18:41:00,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387004933] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:00,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:00,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:41:00,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44558957] [2024-06-27 18:41:00,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:00,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:41:00,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:00,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:41:00,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:41:00,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:00,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 190 transitions, 2105 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-06-27 18:41:00,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:00,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:00,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:01,231 INFO L124 PetriNetUnfolderBase]: 1193/2188 cut-off events. [2024-06-27 18:41:01,231 INFO L125 PetriNetUnfolderBase]: For 27616/27666 co-relation queries the response was YES. [2024-06-27 18:41:01,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11912 conditions, 2188 events. 1193/2188 cut-off events. For 27616/27666 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13070 event pairs, 248 based on Foata normal form. 52/2182 useless extension candidates. Maximal degree in co-relation 11828. Up to 1498 conditions per place. [2024-06-27 18:41:01,246 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 153 selfloop transitions, 74 changer transitions 0/235 dead transitions. [2024-06-27 18:41:01,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 235 transitions, 2769 flow [2024-06-27 18:41:01,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:41:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:41:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-06-27 18:41:01,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4668304668304668 [2024-06-27 18:41:01,248 INFO L175 Difference]: Start difference. First operand has 177 places, 190 transitions, 2105 flow. Second operand 11 states and 190 transitions. [2024-06-27 18:41:01,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 235 transitions, 2769 flow [2024-06-27 18:41:01,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 235 transitions, 2648 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-27 18:41:01,338 INFO L231 Difference]: Finished difference. Result has 180 places, 191 transitions, 2152 flow [2024-06-27 18:41:01,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2152, PETRI_PLACES=180, PETRI_TRANSITIONS=191} [2024-06-27 18:41:01,339 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 139 predicate places. [2024-06-27 18:41:01,340 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 191 transitions, 2152 flow [2024-06-27 18:41:01,340 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-06-27 18:41:01,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:01,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:01,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 18:41:01,340 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:01,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:01,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1345743445, now seen corresponding path program 4 times [2024-06-27 18:41:01,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:01,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870045023] [2024-06-27 18:41:01,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:01,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:02,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:02,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:02,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870045023] [2024-06-27 18:41:02,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870045023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:02,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:02,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:41:02,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60757890] [2024-06-27 18:41:02,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:02,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:41:02,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:02,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:41:02,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:41:02,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:02,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 191 transitions, 2152 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-06-27 18:41:02,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:02,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:02,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:02,668 INFO L124 PetriNetUnfolderBase]: 1206/2215 cut-off events. [2024-06-27 18:41:02,669 INFO L125 PetriNetUnfolderBase]: For 28586/28638 co-relation queries the response was YES. [2024-06-27 18:41:02,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12138 conditions, 2215 events. 1206/2215 cut-off events. For 28586/28638 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13304 event pairs, 254 based on Foata normal form. 54/2211 useless extension candidates. Maximal degree in co-relation 12052. Up to 1480 conditions per place. [2024-06-27 18:41:02,690 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 150 selfloop transitions, 73 changer transitions 0/231 dead transitions. [2024-06-27 18:41:02,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 231 transitions, 2781 flow [2024-06-27 18:41:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:41:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:41:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-27 18:41:02,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783783783783784 [2024-06-27 18:41:02,693 INFO L175 Difference]: Start difference. First operand has 180 places, 191 transitions, 2152 flow. Second operand 10 states and 177 transitions. [2024-06-27 18:41:02,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 231 transitions, 2781 flow [2024-06-27 18:41:02,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 231 transitions, 2633 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-27 18:41:02,817 INFO L231 Difference]: Finished difference. Result has 181 places, 192 transitions, 2170 flow [2024-06-27 18:41:02,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2004, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2170, PETRI_PLACES=181, PETRI_TRANSITIONS=192} [2024-06-27 18:41:02,818 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 140 predicate places. [2024-06-27 18:41:02,818 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 192 transitions, 2170 flow [2024-06-27 18:41:02,818 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-06-27 18:41:02,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:02,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:02,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 18:41:02,832 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:02,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:02,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1979992661, now seen corresponding path program 5 times [2024-06-27 18:41:02,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:02,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001483774] [2024-06-27 18:41:02,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:02,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:03,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:03,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001483774] [2024-06-27 18:41:03,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001483774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:03,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:03,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:41:03,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810806497] [2024-06-27 18:41:03,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:03,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:41:03,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:03,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:41:03,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:41:03,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:03,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 192 transitions, 2170 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-06-27 18:41:03,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:03,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:03,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:04,058 INFO L124 PetriNetUnfolderBase]: 1219/2230 cut-off events. [2024-06-27 18:41:04,058 INFO L125 PetriNetUnfolderBase]: For 29768/29822 co-relation queries the response was YES. [2024-06-27 18:41:04,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12281 conditions, 2230 events. 1219/2230 cut-off events. For 29768/29822 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13383 event pairs, 205 based on Foata normal form. 56/2228 useless extension candidates. Maximal degree in co-relation 12194. Up to 1526 conditions per place. [2024-06-27 18:41:04,076 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 154 selfloop transitions, 70 changer transitions 0/232 dead transitions. [2024-06-27 18:41:04,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 232 transitions, 2877 flow [2024-06-27 18:41:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:41:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:41:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 18:41:04,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984984984984985 [2024-06-27 18:41:04,087 INFO L175 Difference]: Start difference. First operand has 181 places, 192 transitions, 2170 flow. Second operand 9 states and 166 transitions. [2024-06-27 18:41:04,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 232 transitions, 2877 flow [2024-06-27 18:41:04,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 232 transitions, 2725 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 18:41:04,202 INFO L231 Difference]: Finished difference. Result has 182 places, 193 transitions, 2178 flow [2024-06-27 18:41:04,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2018, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2178, PETRI_PLACES=182, PETRI_TRANSITIONS=193} [2024-06-27 18:41:04,202 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 141 predicate places. [2024-06-27 18:41:04,203 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 193 transitions, 2178 flow [2024-06-27 18:41:04,203 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-06-27 18:41:04,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:04,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:04,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 18:41:04,203 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:04,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:04,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1979988941, now seen corresponding path program 6 times [2024-06-27 18:41:04,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:04,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116529159] [2024-06-27 18:41:04,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:04,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:04,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:04,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116529159] [2024-06-27 18:41:04,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116529159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:04,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:04,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:41:04,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728625770] [2024-06-27 18:41:04,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:04,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:41:04,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:04,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:41:04,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:41:05,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:05,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 193 transitions, 2178 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-06-27 18:41:05,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:05,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:05,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:05,517 INFO L124 PetriNetUnfolderBase]: 1232/2252 cut-off events. [2024-06-27 18:41:05,517 INFO L125 PetriNetUnfolderBase]: For 31025/31082 co-relation queries the response was YES. [2024-06-27 18:41:05,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12427 conditions, 2252 events. 1232/2252 cut-off events. For 31025/31082 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13565 event pairs, 254 based on Foata normal form. 59/2253 useless extension candidates. Maximal degree in co-relation 12339. Up to 1633 conditions per place. [2024-06-27 18:41:05,535 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 160 selfloop transitions, 69 changer transitions 0/237 dead transitions. [2024-06-27 18:41:05,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 237 transitions, 2844 flow [2024-06-27 18:41:05,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:41:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:41:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-27 18:41:05,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2024-06-27 18:41:05,537 INFO L175 Difference]: Start difference. First operand has 182 places, 193 transitions, 2178 flow. Second operand 10 states and 178 transitions. [2024-06-27 18:41:05,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 237 transitions, 2844 flow [2024-06-27 18:41:05,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 237 transitions, 2688 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-27 18:41:05,674 INFO L231 Difference]: Finished difference. Result has 185 places, 194 transitions, 2184 flow [2024-06-27 18:41:05,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2184, PETRI_PLACES=185, PETRI_TRANSITIONS=194} [2024-06-27 18:41:05,675 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places. [2024-06-27 18:41:05,675 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 194 transitions, 2184 flow [2024-06-27 18:41:05,676 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-06-27 18:41:05,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:05,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:05,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 18:41:05,677 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:05,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:05,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1979988786, now seen corresponding path program 2 times [2024-06-27 18:41:05,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:05,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657105107] [2024-06-27 18:41:05,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:05,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:06,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:06,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657105107] [2024-06-27 18:41:06,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657105107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:06,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:06,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:41:06,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79661847] [2024-06-27 18:41:06,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:06,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:41:06,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:06,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:41:06,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:41:06,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:06,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 194 transitions, 2184 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-06-27 18:41:06,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:06,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:06,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:06,871 INFO L124 PetriNetUnfolderBase]: 1265/2256 cut-off events. [2024-06-27 18:41:06,872 INFO L125 PetriNetUnfolderBase]: For 32818/32875 co-relation queries the response was YES. [2024-06-27 18:41:06,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12606 conditions, 2256 events. 1265/2256 cut-off events. For 32818/32875 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13394 event pairs, 178 based on Foata normal form. 60/2260 useless extension candidates. Maximal degree in co-relation 12517. Up to 1083 conditions per place. [2024-06-27 18:41:06,889 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 170 selfloop transitions, 79 changer transitions 0/257 dead transitions. [2024-06-27 18:41:06,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 257 transitions, 3067 flow [2024-06-27 18:41:06,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:41:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:41:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2024-06-27 18:41:06,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233415233415234 [2024-06-27 18:41:06,891 INFO L175 Difference]: Start difference. First operand has 185 places, 194 transitions, 2184 flow. Second operand 11 states and 213 transitions. [2024-06-27 18:41:06,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 257 transitions, 3067 flow [2024-06-27 18:41:07,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 257 transitions, 2921 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-27 18:41:07,039 INFO L231 Difference]: Finished difference. Result has 188 places, 197 transitions, 2234 flow [2024-06-27 18:41:07,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2038, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2234, PETRI_PLACES=188, PETRI_TRANSITIONS=197} [2024-06-27 18:41:07,040 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 147 predicate places. [2024-06-27 18:41:07,040 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 197 transitions, 2234 flow [2024-06-27 18:41:07,040 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-06-27 18:41:07,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:07,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:07,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 18:41:07,040 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:07,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1599692945, now seen corresponding path program 7 times [2024-06-27 18:41:07,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:07,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458244346] [2024-06-27 18:41:07,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:07,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:07,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:07,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458244346] [2024-06-27 18:41:07,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458244346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:07,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:07,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:41:07,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207974100] [2024-06-27 18:41:07,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:07,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:41:07,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:07,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:41:07,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:41:07,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:07,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 197 transitions, 2234 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-06-27 18:41:07,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:07,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:07,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:08,146 INFO L124 PetriNetUnfolderBase]: 1279/2370 cut-off events. [2024-06-27 18:41:08,146 INFO L125 PetriNetUnfolderBase]: For 34293/34329 co-relation queries the response was YES. [2024-06-27 18:41:08,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13196 conditions, 2370 events. 1279/2370 cut-off events. For 34293/34329 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14553 event pairs, 299 based on Foata normal form. 38/2343 useless extension candidates. Maximal degree in co-relation 13106. Up to 1756 conditions per place. [2024-06-27 18:41:08,165 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 150 selfloop transitions, 74 changer transitions 0/232 dead transitions. [2024-06-27 18:41:08,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 232 transitions, 2864 flow [2024-06-27 18:41:08,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:41:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:41:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 18:41:08,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4624624624624625 [2024-06-27 18:41:08,166 INFO L175 Difference]: Start difference. First operand has 188 places, 197 transitions, 2234 flow. Second operand 9 states and 154 transitions. [2024-06-27 18:41:08,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 232 transitions, 2864 flow [2024-06-27 18:41:08,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 232 transitions, 2690 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-27 18:41:08,344 INFO L231 Difference]: Finished difference. Result has 188 places, 199 transitions, 2252 flow [2024-06-27 18:41:08,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2060, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2252, PETRI_PLACES=188, PETRI_TRANSITIONS=199} [2024-06-27 18:41:08,345 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 147 predicate places. [2024-06-27 18:41:08,345 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 199 transitions, 2252 flow [2024-06-27 18:41:08,345 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-06-27 18:41:08,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:08,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:08,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 18:41:08,346 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:08,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1216696406, now seen corresponding path program 3 times [2024-06-27 18:41:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:08,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603543037] [2024-06-27 18:41:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:08,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:08,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603543037] [2024-06-27 18:41:08,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603543037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:08,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:08,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:41:08,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050312216] [2024-06-27 18:41:08,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:08,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:41:08,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:08,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:41:08,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:41:09,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:09,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 199 transitions, 2252 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-06-27 18:41:09,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:09,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:09,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:09,652 INFO L124 PetriNetUnfolderBase]: 1351/2437 cut-off events. [2024-06-27 18:41:09,652 INFO L125 PetriNetUnfolderBase]: For 39084/39118 co-relation queries the response was YES. [2024-06-27 18:41:09,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13540 conditions, 2437 events. 1351/2437 cut-off events. For 39084/39118 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14740 event pairs, 256 based on Foata normal form. 37/2417 useless extension candidates. Maximal degree in co-relation 13449. Up to 1368 conditions per place. [2024-06-27 18:41:09,669 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 182 selfloop transitions, 68 changer transitions 0/258 dead transitions. [2024-06-27 18:41:09,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 258 transitions, 3146 flow [2024-06-27 18:41:09,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:41:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:41:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-27 18:41:09,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216216216216216 [2024-06-27 18:41:09,671 INFO L175 Difference]: Start difference. First operand has 188 places, 199 transitions, 2252 flow. Second operand 10 states and 193 transitions. [2024-06-27 18:41:09,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 258 transitions, 3146 flow [2024-06-27 18:41:09,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 258 transitions, 2980 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 18:41:09,797 INFO L231 Difference]: Finished difference. Result has 191 places, 205 transitions, 2297 flow [2024-06-27 18:41:09,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2086, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2297, PETRI_PLACES=191, PETRI_TRANSITIONS=205} [2024-06-27 18:41:09,797 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 150 predicate places. [2024-06-27 18:41:09,797 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 205 transitions, 2297 flow [2024-06-27 18:41:09,798 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-06-27 18:41:09,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:09,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:09,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 18:41:09,798 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:09,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:09,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1974274866, now seen corresponding path program 4 times [2024-06-27 18:41:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:09,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025473215] [2024-06-27 18:41:09,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:09,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:10,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:10,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025473215] [2024-06-27 18:41:10,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025473215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:10,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:10,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:41:10,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353892354] [2024-06-27 18:41:10,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:10,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:41:10,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:10,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:41:10,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:41:10,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:10,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 205 transitions, 2297 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-06-27 18:41:10,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:10,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:10,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:11,055 INFO L124 PetriNetUnfolderBase]: 1345/2431 cut-off events. [2024-06-27 18:41:11,055 INFO L125 PetriNetUnfolderBase]: For 37769/37803 co-relation queries the response was YES. [2024-06-27 18:41:11,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13598 conditions, 2431 events. 1345/2431 cut-off events. For 37769/37803 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 14715 event pairs, 259 based on Foata normal form. 37/2411 useless extension candidates. Maximal degree in co-relation 13506. Up to 1421 conditions per place. [2024-06-27 18:41:11,075 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 168 selfloop transitions, 70 changer transitions 0/246 dead transitions. [2024-06-27 18:41:11,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 246 transitions, 2962 flow [2024-06-27 18:41:11,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:41:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:41:11,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 18:41:11,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2024-06-27 18:41:11,077 INFO L175 Difference]: Start difference. First operand has 191 places, 205 transitions, 2297 flow. Second operand 9 states and 169 transitions. [2024-06-27 18:41:11,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 246 transitions, 2962 flow [2024-06-27 18:41:11,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 246 transitions, 2861 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-27 18:41:11,226 INFO L231 Difference]: Finished difference. Result has 194 places, 205 transitions, 2342 flow [2024-06-27 18:41:11,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2196, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2342, PETRI_PLACES=194, PETRI_TRANSITIONS=205} [2024-06-27 18:41:11,227 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 153 predicate places. [2024-06-27 18:41:11,227 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 205 transitions, 2342 flow [2024-06-27 18:41:11,227 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-06-27 18:41:11,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:11,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:11,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 18:41:11,228 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:11,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:11,228 INFO L85 PathProgramCache]: Analyzing trace with hash -625920140, now seen corresponding path program 5 times [2024-06-27 18:41:11,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:11,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758663557] [2024-06-27 18:41:11,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:11,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:11,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:11,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758663557] [2024-06-27 18:41:11,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758663557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:11,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:11,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:41:11,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493453346] [2024-06-27 18:41:11,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:11,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:41:11,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:11,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:41:11,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:41:11,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:11,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 205 transitions, 2342 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-06-27 18:41:11,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:11,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:11,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:12,466 INFO L124 PetriNetUnfolderBase]: 1378/2480 cut-off events. [2024-06-27 18:41:12,466 INFO L125 PetriNetUnfolderBase]: For 39100/39143 co-relation queries the response was YES. [2024-06-27 18:41:12,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14137 conditions, 2480 events. 1378/2480 cut-off events. For 39100/39143 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 15070 event pairs, 337 based on Foata normal form. 46/2461 useless extension candidates. Maximal degree in co-relation 14043. Up to 1955 conditions per place. [2024-06-27 18:41:12,484 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 205 selfloop transitions, 33 changer transitions 0/246 dead transitions. [2024-06-27 18:41:12,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 246 transitions, 3026 flow [2024-06-27 18:41:12,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:41:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:41:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-27 18:41:12,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-27 18:41:12,486 INFO L175 Difference]: Start difference. First operand has 194 places, 205 transitions, 2342 flow. Second operand 9 states and 162 transitions. [2024-06-27 18:41:12,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 246 transitions, 3026 flow [2024-06-27 18:41:12,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 246 transitions, 2886 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-27 18:41:12,650 INFO L231 Difference]: Finished difference. Result has 196 places, 208 transitions, 2317 flow [2024-06-27 18:41:12,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2202, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2317, PETRI_PLACES=196, PETRI_TRANSITIONS=208} [2024-06-27 18:41:12,651 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 155 predicate places. [2024-06-27 18:41:12,651 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 208 transitions, 2317 flow [2024-06-27 18:41:12,651 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-06-27 18:41:12,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:12,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:12,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 18:41:12,651 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:12,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:12,652 INFO L85 PathProgramCache]: Analyzing trace with hash -626121950, now seen corresponding path program 6 times [2024-06-27 18:41:12,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:12,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923073274] [2024-06-27 18:41:12,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:12,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:13,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:13,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923073274] [2024-06-27 18:41:13,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923073274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:13,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:13,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:41:13,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797376044] [2024-06-27 18:41:13,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:13,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:41:13,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:13,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:41:13,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:41:13,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:13,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 208 transitions, 2317 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-06-27 18:41:13,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:13,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:13,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:13,972 INFO L124 PetriNetUnfolderBase]: 1411/2546 cut-off events. [2024-06-27 18:41:13,973 INFO L125 PetriNetUnfolderBase]: For 40534/40577 co-relation queries the response was YES. [2024-06-27 18:41:13,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14304 conditions, 2546 events. 1411/2546 cut-off events. For 40534/40577 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15565 event pairs, 318 based on Foata normal form. 46/2521 useless extension candidates. Maximal degree in co-relation 14209. Up to 2006 conditions per place. [2024-06-27 18:41:13,992 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 211 selfloop transitions, 32 changer transitions 0/251 dead transitions. [2024-06-27 18:41:13,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 251 transitions, 3028 flow [2024-06-27 18:41:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:41:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:41:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-27 18:41:14,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48348348348348347 [2024-06-27 18:41:14,000 INFO L175 Difference]: Start difference. First operand has 196 places, 208 transitions, 2317 flow. Second operand 9 states and 161 transitions. [2024-06-27 18:41:14,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 251 transitions, 3028 flow [2024-06-27 18:41:14,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 251 transitions, 2946 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-27 18:41:14,172 INFO L231 Difference]: Finished difference. Result has 198 places, 211 transitions, 2354 flow [2024-06-27 18:41:14,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2235, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2354, PETRI_PLACES=198, PETRI_TRANSITIONS=211} [2024-06-27 18:41:14,179 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 157 predicate places. [2024-06-27 18:41:14,179 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 211 transitions, 2354 flow [2024-06-27 18:41:14,179 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-06-27 18:41:14,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:14,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:14,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 18:41:14,179 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:14,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash -626127530, now seen corresponding path program 7 times [2024-06-27 18:41:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666319396] [2024-06-27 18:41:14,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:14,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:14,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666319396] [2024-06-27 18:41:14,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666319396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:14,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:14,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:41:14,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849583254] [2024-06-27 18:41:14,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:14,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:41:14,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:14,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:41:14,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:41:14,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:14,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 211 transitions, 2354 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-06-27 18:41:14,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:14,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:14,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:15,439 INFO L124 PetriNetUnfolderBase]: 1422/2536 cut-off events. [2024-06-27 18:41:15,440 INFO L125 PetriNetUnfolderBase]: For 39139/39180 co-relation queries the response was YES. [2024-06-27 18:41:15,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14400 conditions, 2536 events. 1422/2536 cut-off events. For 39139/39180 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 15411 event pairs, 311 based on Foata normal form. 42/2515 useless extension candidates. Maximal degree in co-relation 14304. Up to 1919 conditions per place. [2024-06-27 18:41:15,460 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 210 selfloop transitions, 42 changer transitions 0/260 dead transitions. [2024-06-27 18:41:15,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 260 transitions, 3198 flow [2024-06-27 18:41:15,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:41:15,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:41:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-27 18:41:15,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891891891891892 [2024-06-27 18:41:15,462 INFO L175 Difference]: Start difference. First operand has 198 places, 211 transitions, 2354 flow. Second operand 10 states and 181 transitions. [2024-06-27 18:41:15,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 260 transitions, 3198 flow [2024-06-27 18:41:15,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 260 transitions, 3112 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-27 18:41:15,659 INFO L231 Difference]: Finished difference. Result has 201 places, 213 transitions, 2395 flow [2024-06-27 18:41:15,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2268, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2395, PETRI_PLACES=201, PETRI_TRANSITIONS=213} [2024-06-27 18:41:15,660 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 160 predicate places. [2024-06-27 18:41:15,660 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 213 transitions, 2395 flow [2024-06-27 18:41:15,660 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-06-27 18:41:15,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:15,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:15,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 18:41:15,661 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:15,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:15,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2111025258, now seen corresponding path program 8 times [2024-06-27 18:41:15,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:15,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912044248] [2024-06-27 18:41:15,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:16,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:16,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912044248] [2024-06-27 18:41:16,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912044248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:16,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:16,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:41:16,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286172453] [2024-06-27 18:41:16,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:16,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:41:16,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:16,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:41:16,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:41:16,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:16,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 213 transitions, 2395 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-06-27 18:41:16,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:16,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:16,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:17,127 INFO L124 PetriNetUnfolderBase]: 1420/2509 cut-off events. [2024-06-27 18:41:17,127 INFO L125 PetriNetUnfolderBase]: For 38959/39003 co-relation queries the response was YES. [2024-06-27 18:41:17,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14303 conditions, 2509 events. 1420/2509 cut-off events. For 38959/39003 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15073 event pairs, 370 based on Foata normal form. 45/2491 useless extension candidates. Maximal degree in co-relation 14206. Up to 2243 conditions per place. [2024-06-27 18:41:17,147 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 218 selfloop transitions, 19 changer transitions 0/245 dead transitions. [2024-06-27 18:41:17,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 245 transitions, 3037 flow [2024-06-27 18:41:17,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:41:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:41:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-27 18:41:17,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44744744744744747 [2024-06-27 18:41:17,148 INFO L175 Difference]: Start difference. First operand has 201 places, 213 transitions, 2395 flow. Second operand 9 states and 149 transitions. [2024-06-27 18:41:17,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 245 transitions, 3037 flow [2024-06-27 18:41:17,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 245 transitions, 2859 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-27 18:41:17,348 INFO L231 Difference]: Finished difference. Result has 203 places, 218 transitions, 2336 flow [2024-06-27 18:41:17,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2336, PETRI_PLACES=203, PETRI_TRANSITIONS=218} [2024-06-27 18:41:17,349 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 162 predicate places. [2024-06-27 18:41:17,349 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 218 transitions, 2336 flow [2024-06-27 18:41:17,350 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-06-27 18:41:17,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:17,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:17,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 18:41:17,350 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:17,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:17,350 INFO L85 PathProgramCache]: Analyzing trace with hash -626127685, now seen corresponding path program 8 times [2024-06-27 18:41:17,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:17,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587241725] [2024-06-27 18:41:17,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:17,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:18,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:18,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587241725] [2024-06-27 18:41:18,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587241725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:18,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:18,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:41:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651870853] [2024-06-27 18:41:18,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:18,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:41:18,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:18,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:41:18,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:41:18,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:18,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 218 transitions, 2336 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-06-27 18:41:18,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:18,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:18,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:18,632 INFO L124 PetriNetUnfolderBase]: 1417/2500 cut-off events. [2024-06-27 18:41:18,632 INFO L125 PetriNetUnfolderBase]: For 38910/38953 co-relation queries the response was YES. [2024-06-27 18:41:18,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13674 conditions, 2500 events. 1417/2500 cut-off events. For 38910/38953 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 14961 event pairs, 376 based on Foata normal form. 45/2482 useless extension candidates. Maximal degree in co-relation 13575. Up to 2222 conditions per place. [2024-06-27 18:41:18,650 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 215 selfloop transitions, 23 changer transitions 0/246 dead transitions. [2024-06-27 18:41:18,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 246 transitions, 2934 flow [2024-06-27 18:41:18,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:41:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:41:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-27 18:41:18,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43843843843843844 [2024-06-27 18:41:18,652 INFO L175 Difference]: Start difference. First operand has 203 places, 218 transitions, 2336 flow. Second operand 9 states and 146 transitions. [2024-06-27 18:41:18,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 246 transitions, 2934 flow [2024-06-27 18:41:18,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 246 transitions, 2878 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-27 18:41:18,812 INFO L231 Difference]: Finished difference. Result has 208 places, 218 transitions, 2330 flow [2024-06-27 18:41:18,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2330, PETRI_PLACES=208, PETRI_TRANSITIONS=218} [2024-06-27 18:41:18,812 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 167 predicate places. [2024-06-27 18:41:18,813 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 218 transitions, 2330 flow [2024-06-27 18:41:18,813 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-06-27 18:41:18,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:18,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:18,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 18:41:18,813 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:18,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:18,814 INFO L85 PathProgramCache]: Analyzing trace with hash -331615843, now seen corresponding path program 1 times [2024-06-27 18:41:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:18,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601834263] [2024-06-27 18:41:18,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:19,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:19,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601834263] [2024-06-27 18:41:19,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601834263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:19,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:19,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:41:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97124794] [2024-06-27 18:41:19,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:19,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:41:19,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:19,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:41:19,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:41:19,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:19,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 218 transitions, 2330 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-06-27 18:41:19,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:19,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:19,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:19,856 INFO L124 PetriNetUnfolderBase]: 1419/2469 cut-off events. [2024-06-27 18:41:19,856 INFO L125 PetriNetUnfolderBase]: For 37119/37163 co-relation queries the response was YES. [2024-06-27 18:41:19,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13505 conditions, 2469 events. 1419/2469 cut-off events. For 37119/37163 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 14590 event pairs, 356 based on Foata normal form. 46/2464 useless extension candidates. Maximal degree in co-relation 13404. Up to 2207 conditions per place. [2024-06-27 18:41:19,875 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 220 selfloop transitions, 20 changer transitions 0/248 dead transitions. [2024-06-27 18:41:19,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 248 transitions, 2924 flow [2024-06-27 18:41:19,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:41:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:41:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-27 18:41:19,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45345345345345345 [2024-06-27 18:41:19,877 INFO L175 Difference]: Start difference. First operand has 208 places, 218 transitions, 2330 flow. Second operand 9 states and 151 transitions. [2024-06-27 18:41:19,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 248 transitions, 2924 flow [2024-06-27 18:41:20,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 248 transitions, 2881 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-27 18:41:20,053 INFO L231 Difference]: Finished difference. Result has 211 places, 220 transitions, 2354 flow [2024-06-27 18:41:20,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2287, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2354, PETRI_PLACES=211, PETRI_TRANSITIONS=220} [2024-06-27 18:41:20,054 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 170 predicate places. [2024-06-27 18:41:20,054 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 220 transitions, 2354 flow [2024-06-27 18:41:20,054 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-06-27 18:41:20,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:20,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:20,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 18:41:20,054 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:20,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:20,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1173534837, now seen corresponding path program 1 times [2024-06-27 18:41:20,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:20,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138624117] [2024-06-27 18:41:20,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:20,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:20,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:20,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138624117] [2024-06-27 18:41:20,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138624117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:20,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:20,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:20,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583178737] [2024-06-27 18:41:20,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:20,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:20,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:20,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:20,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:20,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:20,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 220 transitions, 2354 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:20,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:20,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:20,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:21,348 INFO L124 PetriNetUnfolderBase]: 1558/2786 cut-off events. [2024-06-27 18:41:21,349 INFO L125 PetriNetUnfolderBase]: For 58083/58133 co-relation queries the response was YES. [2024-06-27 18:41:21,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15417 conditions, 2786 events. 1558/2786 cut-off events. For 58083/58133 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 17140 event pairs, 245 based on Foata normal form. 52/2776 useless extension candidates. Maximal degree in co-relation 15315. Up to 751 conditions per place. [2024-06-27 18:41:21,371 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 183 selfloop transitions, 85 changer transitions 0/276 dead transitions. [2024-06-27 18:41:21,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 276 transitions, 3378 flow [2024-06-27 18:41:21,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:41:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:41:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-06-27 18:41:21,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2024-06-27 18:41:21,372 INFO L175 Difference]: Start difference. First operand has 211 places, 220 transitions, 2354 flow. Second operand 10 states and 195 transitions. [2024-06-27 18:41:21,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 276 transitions, 3378 flow [2024-06-27 18:41:21,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 276 transitions, 3327 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-27 18:41:21,631 INFO L231 Difference]: Finished difference. Result has 215 places, 222 transitions, 2540 flow [2024-06-27 18:41:21,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2303, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2540, PETRI_PLACES=215, PETRI_TRANSITIONS=222} [2024-06-27 18:41:21,632 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 174 predicate places. [2024-06-27 18:41:21,632 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 222 transitions, 2540 flow [2024-06-27 18:41:21,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:21,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:21,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:21,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 18:41:21,633 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:21,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:21,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1374033321, now seen corresponding path program 2 times [2024-06-27 18:41:21,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:21,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381175209] [2024-06-27 18:41:21,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:21,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:22,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381175209] [2024-06-27 18:41:22,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381175209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:22,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:22,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:22,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35426480] [2024-06-27 18:41:22,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:22,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:22,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:22,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:22,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:22,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:22,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 222 transitions, 2540 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:22,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:22,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:22,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:23,277 INFO L124 PetriNetUnfolderBase]: 1712/3074 cut-off events. [2024-06-27 18:41:23,278 INFO L125 PetriNetUnfolderBase]: For 85796/85856 co-relation queries the response was YES. [2024-06-27 18:41:23,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18131 conditions, 3074 events. 1712/3074 cut-off events. For 85796/85856 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 19448 event pairs, 285 based on Foata normal form. 62/3068 useless extension candidates. Maximal degree in co-relation 18027. Up to 1342 conditions per place. [2024-06-27 18:41:23,303 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 187 selfloop transitions, 98 changer transitions 0/293 dead transitions. [2024-06-27 18:41:23,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 293 transitions, 3698 flow [2024-06-27 18:41:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:41:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:41:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 233 transitions. [2024-06-27 18:41:23,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247747747747747 [2024-06-27 18:41:23,305 INFO L175 Difference]: Start difference. First operand has 215 places, 222 transitions, 2540 flow. Second operand 12 states and 233 transitions. [2024-06-27 18:41:23,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 293 transitions, 3698 flow [2024-06-27 18:41:23,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 293 transitions, 3537 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-27 18:41:23,642 INFO L231 Difference]: Finished difference. Result has 221 places, 225 transitions, 2641 flow [2024-06-27 18:41:23,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2393, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2641, PETRI_PLACES=221, PETRI_TRANSITIONS=225} [2024-06-27 18:41:23,643 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 180 predicate places. [2024-06-27 18:41:23,643 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 225 transitions, 2641 flow [2024-06-27 18:41:23,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:23,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:23,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:23,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 18:41:23,643 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:23,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:23,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1231627287, now seen corresponding path program 3 times [2024-06-27 18:41:23,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:23,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130784891] [2024-06-27 18:41:23,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:24,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:24,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130784891] [2024-06-27 18:41:24,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130784891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:24,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:24,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:24,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435669799] [2024-06-27 18:41:24,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:24,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:24,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:24,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:24,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:24,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:24,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 225 transitions, 2641 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:24,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:24,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:24,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:25,161 INFO L124 PetriNetUnfolderBase]: 1728/3112 cut-off events. [2024-06-27 18:41:25,161 INFO L125 PetriNetUnfolderBase]: For 89077/89137 co-relation queries the response was YES. [2024-06-27 18:41:25,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18633 conditions, 3112 events. 1728/3112 cut-off events. For 89077/89137 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 19881 event pairs, 292 based on Foata normal form. 62/3105 useless extension candidates. Maximal degree in co-relation 18527. Up to 1303 conditions per place. [2024-06-27 18:41:25,186 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 185 selfloop transitions, 96 changer transitions 0/289 dead transitions. [2024-06-27 18:41:25,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 289 transitions, 3728 flow [2024-06-27 18:41:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:41:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:41:25,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2024-06-27 18:41:25,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-06-27 18:41:25,188 INFO L175 Difference]: Start difference. First operand has 221 places, 225 transitions, 2641 flow. Second operand 11 states and 220 transitions. [2024-06-27 18:41:25,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 289 transitions, 3728 flow [2024-06-27 18:41:25,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 289 transitions, 3579 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-27 18:41:25,440 INFO L231 Difference]: Finished difference. Result has 224 places, 226 transitions, 2700 flow [2024-06-27 18:41:25,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2492, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2700, PETRI_PLACES=224, PETRI_TRANSITIONS=226} [2024-06-27 18:41:25,440 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 183 predicate places. [2024-06-27 18:41:25,440 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 226 transitions, 2700 flow [2024-06-27 18:41:25,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:25,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:25,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:25,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 18:41:25,441 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:25,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:25,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1374037971, now seen corresponding path program 4 times [2024-06-27 18:41:25,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:25,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587275597] [2024-06-27 18:41:25,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:25,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:26,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-06-27 18:41:26,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:26,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587275597] [2024-06-27 18:41:26,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587275597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:26,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:26,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:26,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866362645] [2024-06-27 18:41:26,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:26,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:26,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:26,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:26,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:26,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:26,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 226 transitions, 2700 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:26,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:26,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:26,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:27,093 INFO L124 PetriNetUnfolderBase]: 1706/3072 cut-off events. [2024-06-27 18:41:27,094 INFO L125 PetriNetUnfolderBase]: For 88632/88692 co-relation queries the response was YES. [2024-06-27 18:41:27,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18008 conditions, 3072 events. 1706/3072 cut-off events. For 88632/88692 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 19529 event pairs, 285 based on Foata normal form. 76/3078 useless extension candidates. Maximal degree in co-relation 17900. Up to 1438 conditions per place. [2024-06-27 18:41:27,119 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 186 selfloop transitions, 101 changer transitions 0/295 dead transitions. [2024-06-27 18:41:27,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 295 transitions, 3724 flow [2024-06-27 18:41:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 18:41:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 18:41:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 244 transitions. [2024-06-27 18:41:27,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072765072765073 [2024-06-27 18:41:27,121 INFO L175 Difference]: Start difference. First operand has 224 places, 226 transitions, 2700 flow. Second operand 13 states and 244 transitions. [2024-06-27 18:41:27,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 295 transitions, 3724 flow [2024-06-27 18:41:27,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 295 transitions, 3522 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-27 18:41:27,369 INFO L231 Difference]: Finished difference. Result has 228 places, 226 transitions, 2707 flow [2024-06-27 18:41:27,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2498, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2707, PETRI_PLACES=228, PETRI_TRANSITIONS=226} [2024-06-27 18:41:27,370 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 187 predicate places. [2024-06-27 18:41:27,370 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 226 transitions, 2707 flow [2024-06-27 18:41:27,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:27,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:27,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:27,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 18:41:27,371 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:27,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:27,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1231747443, now seen corresponding path program 1 times [2024-06-27 18:41:27,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:27,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393261432] [2024-06-27 18:41:27,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:27,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:28,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:28,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393261432] [2024-06-27 18:41:28,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393261432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:28,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:28,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:28,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898084026] [2024-06-27 18:41:28,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:28,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:28,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:28,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:28,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:28,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:28,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 226 transitions, 2707 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:28,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:28,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:28,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:29,208 INFO L124 PetriNetUnfolderBase]: 1754/3170 cut-off events. [2024-06-27 18:41:29,209 INFO L125 PetriNetUnfolderBase]: For 73151/73211 co-relation queries the response was YES. [2024-06-27 18:41:29,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18573 conditions, 3170 events. 1754/3170 cut-off events. For 73151/73211 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 20264 event pairs, 320 based on Foata normal form. 62/3154 useless extension candidates. Maximal degree in co-relation 18464. Up to 1653 conditions per place. [2024-06-27 18:41:29,236 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 194 selfloop transitions, 99 changer transitions 0/301 dead transitions. [2024-06-27 18:41:29,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 301 transitions, 3798 flow [2024-06-27 18:41:29,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 18:41:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 18:41:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 255 transitions. [2024-06-27 18:41:29,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4922779922779923 [2024-06-27 18:41:29,238 INFO L175 Difference]: Start difference. First operand has 228 places, 226 transitions, 2707 flow. Second operand 14 states and 255 transitions. [2024-06-27 18:41:29,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 301 transitions, 3798 flow [2024-06-27 18:41:29,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 301 transitions, 3588 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-06-27 18:41:29,488 INFO L231 Difference]: Finished difference. Result has 231 places, 233 transitions, 2798 flow [2024-06-27 18:41:29,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2501, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2798, PETRI_PLACES=231, PETRI_TRANSITIONS=233} [2024-06-27 18:41:29,488 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 190 predicate places. [2024-06-27 18:41:29,489 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 233 transitions, 2798 flow [2024-06-27 18:41:29,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:29,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:29,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:29,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 18:41:29,489 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:29,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:29,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1250229225, now seen corresponding path program 5 times [2024-06-27 18:41:29,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:29,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12737437] [2024-06-27 18:41:29,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:29,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:30,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:30,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12737437] [2024-06-27 18:41:30,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12737437] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:30,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:30,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:30,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776737544] [2024-06-27 18:41:30,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:30,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:30,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:30,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:30,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:30,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:30,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 233 transitions, 2798 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:30,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:30,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:30,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:31,071 INFO L124 PetriNetUnfolderBase]: 1788/3196 cut-off events. [2024-06-27 18:41:31,072 INFO L125 PetriNetUnfolderBase]: For 76664/76730 co-relation queries the response was YES. [2024-06-27 18:41:31,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19119 conditions, 3196 events. 1788/3196 cut-off events. For 76664/76730 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 20548 event pairs, 259 based on Foata normal form. 68/3205 useless extension candidates. Maximal degree in co-relation 19008. Up to 2043 conditions per place. [2024-06-27 18:41:31,100 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 196 selfloop transitions, 106 changer transitions 0/310 dead transitions. [2024-06-27 18:41:31,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 310 transitions, 4084 flow [2024-06-27 18:41:31,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:41:31,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:41:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-27 18:41:31,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162162162162162 [2024-06-27 18:41:31,105 INFO L175 Difference]: Start difference. First operand has 231 places, 233 transitions, 2798 flow. Second operand 10 states and 191 transitions. [2024-06-27 18:41:31,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 310 transitions, 4084 flow [2024-06-27 18:41:31,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 310 transitions, 3927 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-27 18:41:31,441 INFO L231 Difference]: Finished difference. Result has 236 places, 257 transitions, 3343 flow [2024-06-27 18:41:31,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2648, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3343, PETRI_PLACES=236, PETRI_TRANSITIONS=257} [2024-06-27 18:41:31,443 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 195 predicate places. [2024-06-27 18:41:31,443 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 257 transitions, 3343 flow [2024-06-27 18:41:31,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:31,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:31,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:31,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 18:41:31,444 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:31,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1107818541, now seen corresponding path program 6 times [2024-06-27 18:41:31,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:31,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554045482] [2024-06-27 18:41:31,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:32,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:32,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:32,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554045482] [2024-06-27 18:41:32,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554045482] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:32,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:32,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:32,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753271096] [2024-06-27 18:41:32,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:32,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:32,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:32,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:32,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:32,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:32,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 257 transitions, 3343 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:32,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:32,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:32,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:33,096 INFO L124 PetriNetUnfolderBase]: 1832/3270 cut-off events. [2024-06-27 18:41:33,096 INFO L125 PetriNetUnfolderBase]: For 80940/81008 co-relation queries the response was YES. [2024-06-27 18:41:33,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20466 conditions, 3270 events. 1832/3270 cut-off events. For 80940/81008 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 21236 event pairs, 303 based on Foata normal form. 70/3280 useless extension candidates. Maximal degree in co-relation 20349. Up to 2343 conditions per place. [2024-06-27 18:41:33,125 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 200 selfloop transitions, 108 changer transitions 0/316 dead transitions. [2024-06-27 18:41:33,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 316 transitions, 4356 flow [2024-06-27 18:41:33,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:41:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:41:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-27 18:41:33,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081081081081081 [2024-06-27 18:41:33,143 INFO L175 Difference]: Start difference. First operand has 236 places, 257 transitions, 3343 flow. Second operand 10 states and 188 transitions. [2024-06-27 18:41:33,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 316 transitions, 4356 flow [2024-06-27 18:41:33,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 316 transitions, 4168 flow, removed 58 selfloop flow, removed 4 redundant places. [2024-06-27 18:41:33,573 INFO L231 Difference]: Finished difference. Result has 243 places, 267 transitions, 3554 flow [2024-06-27 18:41:33,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3182, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3554, PETRI_PLACES=243, PETRI_TRANSITIONS=267} [2024-06-27 18:41:33,574 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 202 predicate places. [2024-06-27 18:41:33,574 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 267 transitions, 3554 flow [2024-06-27 18:41:33,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:33,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:33,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:33,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 18:41:33,575 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:33,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:33,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1107818355, now seen corresponding path program 2 times [2024-06-27 18:41:33,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:33,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181203259] [2024-06-27 18:41:33,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:33,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:34,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-06-27 18:41:34,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:34,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181203259] [2024-06-27 18:41:34,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181203259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:34,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:34,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:34,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513658528] [2024-06-27 18:41:34,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:34,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:34,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:34,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:34,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:34,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:34,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 267 transitions, 3554 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:34,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:34,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:34,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:35,730 INFO L124 PetriNetUnfolderBase]: 2246/4037 cut-off events. [2024-06-27 18:41:35,730 INFO L125 PetriNetUnfolderBase]: For 89314/89364 co-relation queries the response was YES. [2024-06-27 18:41:35,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24850 conditions, 4037 events. 2246/4037 cut-off events. For 89314/89364 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 27044 event pairs, 569 based on Foata normal form. 52/3985 useless extension candidates. Maximal degree in co-relation 24732. Up to 2583 conditions per place. [2024-06-27 18:41:35,770 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 268 selfloop transitions, 115 changer transitions 0/391 dead transitions. [2024-06-27 18:41:35,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 391 transitions, 5636 flow [2024-06-27 18:41:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 18:41:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 18:41:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 249 transitions. [2024-06-27 18:41:35,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806949806949807 [2024-06-27 18:41:35,775 INFO L175 Difference]: Start difference. First operand has 243 places, 267 transitions, 3554 flow. Second operand 14 states and 249 transitions. [2024-06-27 18:41:35,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 391 transitions, 5636 flow [2024-06-27 18:41:36,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 391 transitions, 5331 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-27 18:41:36,306 INFO L231 Difference]: Finished difference. Result has 260 places, 320 transitions, 4546 flow [2024-06-27 18:41:36,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3314, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4546, PETRI_PLACES=260, PETRI_TRANSITIONS=320} [2024-06-27 18:41:36,307 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 219 predicate places. [2024-06-27 18:41:36,307 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 320 transitions, 4546 flow [2024-06-27 18:41:36,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:36,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:36,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:36,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 18:41:36,311 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-06-27 18:41:36,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:36,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1250113905, now seen corresponding path program 7 times [2024-06-27 18:41:36,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:36,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086571380] [2024-06-27 18:41:36,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:36,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:37,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086571380] [2024-06-27 18:41:37,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086571380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:37,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:37,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:37,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926801282] [2024-06-27 18:41:37,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:37,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:37,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:37,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:37,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:37,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:37,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 320 transitions, 4546 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:37,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:37,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:37,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:38,268 INFO L124 PetriNetUnfolderBase]: 2381/4340 cut-off events. [2024-06-27 18:41:38,268 INFO L125 PetriNetUnfolderBase]: For 119979/120053 co-relation queries the response was YES. [2024-06-27 18:41:38,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27830 conditions, 4340 events. 2381/4340 cut-off events. For 119979/120053 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 29992 event pairs, 375 based on Foata normal form. 76/4290 useless extension candidates. Maximal degree in co-relation 27702. Up to 2113 conditions per place. [2024-06-27 18:41:38,313 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 226 selfloop transitions, 157 changer transitions 0/391 dead transitions. [2024-06-27 18:41:38,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 391 transitions, 5909 flow [2024-06-27 18:41:38,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:41:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:41:38,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2024-06-27 18:41:38,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5503685503685504 [2024-06-27 18:41:38,314 INFO L175 Difference]: Start difference. First operand has 260 places, 320 transitions, 4546 flow. Second operand 11 states and 224 transitions. [2024-06-27 18:41:38,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 391 transitions, 5909 flow [2024-06-27 18:41:38,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 391 transitions, 5881 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-06-27 18:41:38,945 INFO L231 Difference]: Finished difference. Result has 270 places, 322 transitions, 4866 flow [2024-06-27 18:41:38,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4518, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4866, PETRI_PLACES=270, PETRI_TRANSITIONS=322} [2024-06-27 18:41:38,946 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 229 predicate places. [2024-06-27 18:41:38,946 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 322 transitions, 4866 flow [2024-06-27 18:41:38,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:38,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:38,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:38,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 18:41:38,947 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-06-27 18:41:38,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1103176911, now seen corresponding path program 8 times [2024-06-27 18:41:38,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:38,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407784094] [2024-06-27 18:41:38,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:38,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:39,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:39,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407784094] [2024-06-27 18:41:39,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407784094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:39,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:39,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:39,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084567527] [2024-06-27 18:41:39,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:39,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:39,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:39,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:39,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:39,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:39,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 322 transitions, 4866 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:39,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:39,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:39,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:40,925 INFO L124 PetriNetUnfolderBase]: 2403/4458 cut-off events. [2024-06-27 18:41:40,926 INFO L125 PetriNetUnfolderBase]: For 128665/128718 co-relation queries the response was YES. [2024-06-27 18:41:40,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28623 conditions, 4458 events. 2403/4458 cut-off events. For 128665/128718 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 31480 event pairs, 452 based on Foata normal form. 67/4380 useless extension candidates. Maximal degree in co-relation 28492. Up to 2713 conditions per place. [2024-06-27 18:41:40,983 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 262 selfloop transitions, 113 changer transitions 0/383 dead transitions. [2024-06-27 18:41:40,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 383 transitions, 5980 flow [2024-06-27 18:41:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:41:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:41:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-06-27 18:41:40,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5243243243243243 [2024-06-27 18:41:40,985 INFO L175 Difference]: Start difference. First operand has 270 places, 322 transitions, 4866 flow. Second operand 10 states and 194 transitions. [2024-06-27 18:41:40,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 383 transitions, 5980 flow [2024-06-27 18:41:41,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 383 transitions, 5749 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 18:41:41,799 INFO L231 Difference]: Finished difference. Result has 274 places, 327 transitions, 4977 flow [2024-06-27 18:41:41,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4639, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4977, PETRI_PLACES=274, PETRI_TRANSITIONS=327} [2024-06-27 18:41:41,800 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 233 predicate places. [2024-06-27 18:41:41,800 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 327 transitions, 4977 flow [2024-06-27 18:41:41,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:41,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:41,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:41,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 18:41:41,801 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-06-27 18:41:41,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:41,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1103349891, now seen corresponding path program 9 times [2024-06-27 18:41:41,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:41,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724318953] [2024-06-27 18:41:41,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:41,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:42,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:42,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:42,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724318953] [2024-06-27 18:41:42,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724318953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:42,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:42,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:42,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199273464] [2024-06-27 18:41:42,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:42,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:42,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:42,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:42,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:42,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:42,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 327 transitions, 4977 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:42,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:42,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:42,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:43,741 INFO L124 PetriNetUnfolderBase]: 2413/4350 cut-off events. [2024-06-27 18:41:43,741 INFO L125 PetriNetUnfolderBase]: For 103470/103523 co-relation queries the response was YES. [2024-06-27 18:41:43,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28812 conditions, 4350 events. 2413/4350 cut-off events. For 103470/103523 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 30092 event pairs, 475 based on Foata normal form. 55/4308 useless extension candidates. Maximal degree in co-relation 28678. Up to 3316 conditions per place. [2024-06-27 18:41:43,786 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 258 selfloop transitions, 116 changer transitions 0/382 dead transitions. [2024-06-27 18:41:43,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 382 transitions, 6051 flow [2024-06-27 18:41:43,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:41:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:41:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2024-06-27 18:41:43,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48894348894348894 [2024-06-27 18:41:43,787 INFO L175 Difference]: Start difference. First operand has 274 places, 327 transitions, 4977 flow. Second operand 11 states and 199 transitions. [2024-06-27 18:41:43,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 382 transitions, 6051 flow [2024-06-27 18:41:44,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 382 transitions, 5836 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-27 18:41:44,438 INFO L231 Difference]: Finished difference. Result has 279 places, 335 transitions, 5139 flow [2024-06-27 18:41:44,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4762, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5139, PETRI_PLACES=279, PETRI_TRANSITIONS=335} [2024-06-27 18:41:44,439 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 238 predicate places. [2024-06-27 18:41:44,439 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 335 transitions, 5139 flow [2024-06-27 18:41:44,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:44,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:44,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:44,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 18:41:44,440 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-06-27 18:41:44,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash -930686835, now seen corresponding path program 3 times [2024-06-27 18:41:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:44,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801854486] [2024-06-27 18:41:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:45,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-06-27 18:41:45,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:45,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801854486] [2024-06-27 18:41:45,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801854486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:45,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:45,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:45,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156127475] [2024-06-27 18:41:45,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:45,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:45,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:45,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:45,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:45,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 335 transitions, 5139 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:45,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:45,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:45,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:46,433 INFO L124 PetriNetUnfolderBase]: 2501/4611 cut-off events. [2024-06-27 18:41:46,433 INFO L125 PetriNetUnfolderBase]: For 112989/113034 co-relation queries the response was YES. [2024-06-27 18:41:46,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29887 conditions, 4611 events. 2501/4611 cut-off events. For 112989/113034 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 32689 event pairs, 498 based on Foata normal form. 49/4528 useless extension candidates. Maximal degree in co-relation 29751. Up to 2999 conditions per place. [2024-06-27 18:41:46,485 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 275 selfloop transitions, 115 changer transitions 0/398 dead transitions. [2024-06-27 18:41:46,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 398 transitions, 6325 flow [2024-06-27 18:41:46,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:41:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:41:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2024-06-27 18:41:46,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987714987714988 [2024-06-27 18:41:46,486 INFO L175 Difference]: Start difference. First operand has 279 places, 335 transitions, 5139 flow. Second operand 11 states and 203 transitions. [2024-06-27 18:41:46,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 398 transitions, 6325 flow [2024-06-27 18:41:47,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 398 transitions, 6112 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-27 18:41:47,121 INFO L231 Difference]: Finished difference. Result has 286 places, 344 transitions, 5331 flow [2024-06-27 18:41:47,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4940, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5331, PETRI_PLACES=286, PETRI_TRANSITIONS=344} [2024-06-27 18:41:47,122 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 245 predicate places. [2024-06-27 18:41:47,122 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 344 transitions, 5331 flow [2024-06-27 18:41:47,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:47,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:47,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:47,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 18:41:47,123 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:47,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash -930687021, now seen corresponding path program 10 times [2024-06-27 18:41:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:47,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892805525] [2024-06-27 18:41:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:47,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:47,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:47,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892805525] [2024-06-27 18:41:47,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892805525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:47,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:47,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:47,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423451208] [2024-06-27 18:41:47,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:47,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:47,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:47,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:47,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:48,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:48,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 344 transitions, 5331 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:48,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:48,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:48,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:49,132 INFO L124 PetriNetUnfolderBase]: 2601/4797 cut-off events. [2024-06-27 18:41:49,132 INFO L125 PetriNetUnfolderBase]: For 137371/137416 co-relation queries the response was YES. [2024-06-27 18:41:49,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31224 conditions, 4797 events. 2601/4797 cut-off events. For 137371/137416 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 34405 event pairs, 528 based on Foata normal form. 59/4721 useless extension candidates. Maximal degree in co-relation 31086. Up to 2983 conditions per place. [2024-06-27 18:41:49,183 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 279 selfloop transitions, 111 changer transitions 0/398 dead transitions. [2024-06-27 18:41:49,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 398 transitions, 6410 flow [2024-06-27 18:41:49,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:41:49,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:41:49,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-27 18:41:49,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-27 18:41:49,185 INFO L175 Difference]: Start difference. First operand has 286 places, 344 transitions, 5331 flow. Second operand 10 states and 190 transitions. [2024-06-27 18:41:49,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 398 transitions, 6410 flow [2024-06-27 18:41:49,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 398 transitions, 6141 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-27 18:41:49,918 INFO L231 Difference]: Finished difference. Result has 288 places, 345 transitions, 5315 flow [2024-06-27 18:41:49,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5062, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5315, PETRI_PLACES=288, PETRI_TRANSITIONS=345} [2024-06-27 18:41:49,918 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 247 predicate places. [2024-06-27 18:41:49,919 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 345 transitions, 5315 flow [2024-06-27 18:41:49,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:49,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:49,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:49,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 18:41:49,919 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:49,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:49,920 INFO L85 PathProgramCache]: Analyzing trace with hash -936943131, now seen corresponding path program 11 times [2024-06-27 18:41:49,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:49,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791426919] [2024-06-27 18:41:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:49,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:50,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:50,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791426919] [2024-06-27 18:41:50,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791426919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:50,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:50,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:50,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733274806] [2024-06-27 18:41:50,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:50,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:50,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:50,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:50,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:50,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 345 transitions, 5315 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:50,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:50,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:50,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:52,035 INFO L124 PetriNetUnfolderBase]: 2723/5091 cut-off events. [2024-06-27 18:41:52,035 INFO L125 PetriNetUnfolderBase]: For 141653/141698 co-relation queries the response was YES. [2024-06-27 18:41:52,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32199 conditions, 5091 events. 2723/5091 cut-off events. For 141653/141698 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 37404 event pairs, 596 based on Foata normal form. 59/4989 useless extension candidates. Maximal degree in co-relation 32060. Up to 3237 conditions per place. [2024-06-27 18:41:52,090 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 294 selfloop transitions, 104 changer transitions 0/406 dead transitions. [2024-06-27 18:41:52,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 406 transitions, 6474 flow [2024-06-27 18:41:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:41:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:41:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-06-27 18:41:52,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5243243243243243 [2024-06-27 18:41:52,091 INFO L175 Difference]: Start difference. First operand has 288 places, 345 transitions, 5315 flow. Second operand 10 states and 194 transitions. [2024-06-27 18:41:52,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 406 transitions, 6474 flow [2024-06-27 18:41:52,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 406 transitions, 6255 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 18:41:52,806 INFO L231 Difference]: Finished difference. Result has 291 places, 349 transitions, 5397 flow [2024-06-27 18:41:52,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5096, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5397, PETRI_PLACES=291, PETRI_TRANSITIONS=349} [2024-06-27 18:41:52,807 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 250 predicate places. [2024-06-27 18:41:52,807 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 349 transitions, 5397 flow [2024-06-27 18:41:52,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:52,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:52,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:52,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 18:41:52,808 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:52,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:52,808 INFO L85 PathProgramCache]: Analyzing trace with hash -936942945, now seen corresponding path program 4 times [2024-06-27 18:41:52,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:52,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449199812] [2024-06-27 18:41:52,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:52,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:53,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:53,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449199812] [2024-06-27 18:41:53,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449199812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:53,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:53,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:53,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697417369] [2024-06-27 18:41:53,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:53,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:53,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:53,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:53,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:53,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 349 transitions, 5397 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:53,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:53,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:53,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:55,060 INFO L124 PetriNetUnfolderBase]: 2767/5173 cut-off events. [2024-06-27 18:41:55,061 INFO L125 PetriNetUnfolderBase]: For 124981/125026 co-relation queries the response was YES. [2024-06-27 18:41:55,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32850 conditions, 5173 events. 2767/5173 cut-off events. For 124981/125026 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 38005 event pairs, 618 based on Foata normal form. 49/5060 useless extension candidates. Maximal degree in co-relation 32709. Up to 3493 conditions per place. [2024-06-27 18:41:55,122 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 294 selfloop transitions, 108 changer transitions 0/410 dead transitions. [2024-06-27 18:41:55,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 410 transitions, 6555 flow [2024-06-27 18:41:55,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:41:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:41:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2024-06-27 18:41:55,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036855036855037 [2024-06-27 18:41:55,123 INFO L175 Difference]: Start difference. First operand has 291 places, 349 transitions, 5397 flow. Second operand 11 states and 205 transitions. [2024-06-27 18:41:55,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 410 transitions, 6555 flow [2024-06-27 18:41:55,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 410 transitions, 6357 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-27 18:41:55,793 INFO L231 Difference]: Finished difference. Result has 296 places, 354 transitions, 5524 flow [2024-06-27 18:41:55,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5199, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5524, PETRI_PLACES=296, PETRI_TRANSITIONS=354} [2024-06-27 18:41:55,794 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 255 predicate places. [2024-06-27 18:41:55,794 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 354 transitions, 5524 flow [2024-06-27 18:41:55,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:55,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:55,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:55,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 18:41:55,795 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:55,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1079406639, now seen corresponding path program 5 times [2024-06-27 18:41:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:55,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914710164] [2024-06-27 18:41:55,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:55,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:56,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:56,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914710164] [2024-06-27 18:41:56,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914710164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:56,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:56,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:56,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731924218] [2024-06-27 18:41:56,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:56,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:56,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:56,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:56,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:56,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:56,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 354 transitions, 5524 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:56,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:56,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:56,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:41:57,734 INFO L124 PetriNetUnfolderBase]: 2853/5266 cut-off events. [2024-06-27 18:41:57,734 INFO L125 PetriNetUnfolderBase]: For 128439/128484 co-relation queries the response was YES. [2024-06-27 18:41:57,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33980 conditions, 5266 events. 2853/5266 cut-off events. For 128439/128484 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 38416 event pairs, 495 based on Foata normal form. 49/5167 useless extension candidates. Maximal degree in co-relation 33837. Up to 3222 conditions per place. [2024-06-27 18:41:57,792 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 259 selfloop transitions, 159 changer transitions 0/426 dead transitions. [2024-06-27 18:41:57,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 426 transitions, 6927 flow [2024-06-27 18:41:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:41:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:41:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-27 18:41:57,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518918918918919 [2024-06-27 18:41:57,794 INFO L175 Difference]: Start difference. First operand has 296 places, 354 transitions, 5524 flow. Second operand 10 states and 192 transitions. [2024-06-27 18:41:57,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 426 transitions, 6927 flow [2024-06-27 18:41:58,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 426 transitions, 6662 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-06-27 18:41:58,642 INFO L231 Difference]: Finished difference. Result has 300 places, 374 transitions, 5972 flow [2024-06-27 18:41:58,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5259, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5972, PETRI_PLACES=300, PETRI_TRANSITIONS=374} [2024-06-27 18:41:58,642 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 259 predicate places. [2024-06-27 18:41:58,642 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 374 transitions, 5972 flow [2024-06-27 18:41:58,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:58,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:41:58,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:41:58,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 18:41:58,643 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:41:58,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:41:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1949132029, now seen corresponding path program 12 times [2024-06-27 18:41:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:41:58,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635736339] [2024-06-27 18:41:58,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:41:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:41:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:41:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:41:59,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:41:59,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635736339] [2024-06-27 18:41:59,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635736339] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:41:59,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:41:59,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:41:59,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978358762] [2024-06-27 18:41:59,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:41:59,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:41:59,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:41:59,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:41:59,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:41:59,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:41:59,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 374 transitions, 5972 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:41:59,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:41:59,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:41:59,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:00,896 INFO L124 PetriNetUnfolderBase]: 2869/5366 cut-off events. [2024-06-27 18:42:00,897 INFO L125 PetriNetUnfolderBase]: For 129671/129716 co-relation queries the response was YES. [2024-06-27 18:42:00,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34923 conditions, 5366 events. 2869/5366 cut-off events. For 129671/129716 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 39800 event pairs, 601 based on Foata normal form. 47/5243 useless extension candidates. Maximal degree in co-relation 34777. Up to 3300 conditions per place. [2024-06-27 18:42:00,957 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 311 selfloop transitions, 118 changer transitions 0/437 dead transitions. [2024-06-27 18:42:00,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 437 transitions, 7172 flow [2024-06-27 18:42:00,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:42:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:42:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2024-06-27 18:42:00,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233415233415234 [2024-06-27 18:42:00,958 INFO L175 Difference]: Start difference. First operand has 300 places, 374 transitions, 5972 flow. Second operand 11 states and 213 transitions. [2024-06-27 18:42:00,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 437 transitions, 7172 flow [2024-06-27 18:42:01,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 437 transitions, 6981 flow, removed 82 selfloop flow, removed 3 redundant places. [2024-06-27 18:42:01,725 INFO L231 Difference]: Finished difference. Result has 308 places, 375 transitions, 6057 flow [2024-06-27 18:42:01,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5785, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6057, PETRI_PLACES=308, PETRI_TRANSITIONS=375} [2024-06-27 18:42:01,727 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 267 predicate places. [2024-06-27 18:42:01,727 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 375 transitions, 6057 flow [2024-06-27 18:42:01,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:01,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:01,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:01,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 18:42:01,728 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:01,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:01,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1079411475, now seen corresponding path program 13 times [2024-06-27 18:42:01,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:01,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060847719] [2024-06-27 18:42:01,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:01,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:02,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-06-27 18:42:02,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060847719] [2024-06-27 18:42:02,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060847719] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:02,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:02,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:42:02,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250502365] [2024-06-27 18:42:02,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:02,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:42:02,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:02,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:42:02,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:42:02,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:02,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 375 transitions, 6057 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:02,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:02,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:02,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:03,698 INFO L124 PetriNetUnfolderBase]: 2893/5376 cut-off events. [2024-06-27 18:42:03,698 INFO L125 PetriNetUnfolderBase]: For 131855/131902 co-relation queries the response was YES. [2024-06-27 18:42:03,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35346 conditions, 5376 events. 2893/5376 cut-off events. For 131855/131902 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 39879 event pairs, 689 based on Foata normal form. 49/5263 useless extension candidates. Maximal degree in co-relation 35199. Up to 3991 conditions per place. [2024-06-27 18:42:03,757 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 306 selfloop transitions, 111 changer transitions 0/425 dead transitions. [2024-06-27 18:42:03,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 425 transitions, 7180 flow [2024-06-27 18:42:03,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:42:03,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:42:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-27 18:42:03,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-06-27 18:42:03,759 INFO L175 Difference]: Start difference. First operand has 308 places, 375 transitions, 6057 flow. Second operand 10 states and 182 transitions. [2024-06-27 18:42:03,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 425 transitions, 7180 flow [2024-06-27 18:42:04,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 425 transitions, 6940 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-27 18:42:04,789 INFO L231 Difference]: Finished difference. Result has 310 places, 381 transitions, 6172 flow [2024-06-27 18:42:04,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5819, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6172, PETRI_PLACES=310, PETRI_TRANSITIONS=381} [2024-06-27 18:42:04,789 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 269 predicate places. [2024-06-27 18:42:04,790 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 381 transitions, 6172 flow [2024-06-27 18:42:04,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:04,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:04,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:04,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 18:42:04,790 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:04,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:04,790 INFO L85 PathProgramCache]: Analyzing trace with hash -2002952177, now seen corresponding path program 1 times [2024-06-27 18:42:04,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:04,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559755210] [2024-06-27 18:42:04,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:04,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:05,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:05,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559755210] [2024-06-27 18:42:05,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559755210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:05,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:05,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:42:05,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25782987] [2024-06-27 18:42:05,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:05,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:42:05,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:42:05,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:42:05,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:05,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 381 transitions, 6172 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:05,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:05,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:05,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:07,030 INFO L124 PetriNetUnfolderBase]: 2909/5150 cut-off events. [2024-06-27 18:42:07,031 INFO L125 PetriNetUnfolderBase]: For 131517/131571 co-relation queries the response was YES. [2024-06-27 18:42:07,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35065 conditions, 5150 events. 2909/5150 cut-off events. For 131517/131571 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 36395 event pairs, 1015 based on Foata normal form. 56/5097 useless extension candidates. Maximal degree in co-relation 34916. Up to 4737 conditions per place. [2024-06-27 18:42:07,093 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 385 selfloop transitions, 20 changer transitions 0/413 dead transitions. [2024-06-27 18:42:07,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 413 transitions, 7114 flow [2024-06-27 18:42:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:42:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:42:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 18:42:07,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44324324324324327 [2024-06-27 18:42:07,094 INFO L175 Difference]: Start difference. First operand has 310 places, 381 transitions, 6172 flow. Second operand 10 states and 164 transitions. [2024-06-27 18:42:07,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 413 transitions, 7114 flow [2024-06-27 18:42:08,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 413 transitions, 7054 flow, removed 23 selfloop flow, removed 2 redundant places. [2024-06-27 18:42:08,239 INFO L231 Difference]: Finished difference. Result has 318 places, 382 transitions, 6176 flow [2024-06-27 18:42:08,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6112, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6176, PETRI_PLACES=318, PETRI_TRANSITIONS=382} [2024-06-27 18:42:08,240 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 277 predicate places. [2024-06-27 18:42:08,240 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 382 transitions, 6176 flow [2024-06-27 18:42:08,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:08,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:08,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:08,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 18:42:08,240 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:08,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:08,241 INFO L85 PathProgramCache]: Analyzing trace with hash 527404781, now seen corresponding path program 2 times [2024-06-27 18:42:08,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:08,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832495900] [2024-06-27 18:42:08,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:08,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:09,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:09,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832495900] [2024-06-27 18:42:09,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832495900] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:09,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:09,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:42:09,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924988052] [2024-06-27 18:42:09,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:09,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:42:09,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:09,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:42:09,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:42:09,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:09,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 382 transitions, 6176 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:09,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:09,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:09,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:10,358 INFO L124 PetriNetUnfolderBase]: 2925/5203 cut-off events. [2024-06-27 18:42:10,358 INFO L125 PetriNetUnfolderBase]: For 133827/133881 co-relation queries the response was YES. [2024-06-27 18:42:10,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35285 conditions, 5203 events. 2925/5203 cut-off events. For 133827/133881 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 36973 event pairs, 1005 based on Foata normal form. 56/5142 useless extension candidates. Maximal degree in co-relation 35134. Up to 4720 conditions per place. [2024-06-27 18:42:10,416 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 386 selfloop transitions, 26 changer transitions 0/420 dead transitions. [2024-06-27 18:42:10,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 420 transitions, 7175 flow [2024-06-27 18:42:10,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:42:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:42:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-27 18:42:10,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45675675675675675 [2024-06-27 18:42:10,417 INFO L175 Difference]: Start difference. First operand has 318 places, 382 transitions, 6176 flow. Second operand 10 states and 169 transitions. [2024-06-27 18:42:10,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 420 transitions, 7175 flow [2024-06-27 18:42:11,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 420 transitions, 7115 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-27 18:42:11,678 INFO L231 Difference]: Finished difference. Result has 320 places, 384 transitions, 6213 flow [2024-06-27 18:42:11,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6116, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6213, PETRI_PLACES=320, PETRI_TRANSITIONS=384} [2024-06-27 18:42:11,679 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 279 predicate places. [2024-06-27 18:42:11,679 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 384 transitions, 6213 flow [2024-06-27 18:42:11,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:11,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:11,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:11,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 18:42:11,680 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:11,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:11,680 INFO L85 PathProgramCache]: Analyzing trace with hash -752976143, now seen corresponding path program 3 times [2024-06-27 18:42:11,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:11,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286441797] [2024-06-27 18:42:11,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:11,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:12,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:12,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286441797] [2024-06-27 18:42:12,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286441797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:12,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:12,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:42:12,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279543210] [2024-06-27 18:42:12,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:12,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:42:12,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:12,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:42:12,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:42:12,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:12,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 384 transitions, 6213 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:12,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:12,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:12,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:13,921 INFO L124 PetriNetUnfolderBase]: 2933/5209 cut-off events. [2024-06-27 18:42:13,922 INFO L125 PetriNetUnfolderBase]: For 130658/130712 co-relation queries the response was YES. [2024-06-27 18:42:13,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35187 conditions, 5209 events. 2933/5209 cut-off events. For 130658/130712 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 36926 event pairs, 985 based on Foata normal form. 56/5152 useless extension candidates. Maximal degree in co-relation 35035. Up to 4646 conditions per place. [2024-06-27 18:42:13,980 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 386 selfloop transitions, 35 changer transitions 0/429 dead transitions. [2024-06-27 18:42:13,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 429 transitions, 7278 flow [2024-06-27 18:42:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:42:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:42:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 18:42:13,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2024-06-27 18:42:13,981 INFO L175 Difference]: Start difference. First operand has 320 places, 384 transitions, 6213 flow. Second operand 10 states and 172 transitions. [2024-06-27 18:42:13,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 429 transitions, 7278 flow [2024-06-27 18:42:15,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 429 transitions, 7208 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 18:42:15,140 INFO L231 Difference]: Finished difference. Result has 326 places, 391 transitions, 6322 flow [2024-06-27 18:42:15,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6143, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6322, PETRI_PLACES=326, PETRI_TRANSITIONS=391} [2024-06-27 18:42:15,141 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 285 predicate places. [2024-06-27 18:42:15,141 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 391 transitions, 6322 flow [2024-06-27 18:42:15,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:15,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:15,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:15,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 18:42:15,142 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:15,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:15,142 INFO L85 PathProgramCache]: Analyzing trace with hash 616662893, now seen corresponding path program 4 times [2024-06-27 18:42:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:15,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201636944] [2024-06-27 18:42:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:16,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:16,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201636944] [2024-06-27 18:42:16,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201636944] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:16,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:16,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:42:16,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078711469] [2024-06-27 18:42:16,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:16,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:42:16,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:16,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:42:16,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:42:16,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:16,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 391 transitions, 6322 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:16,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:16,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:16,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:17,405 INFO L124 PetriNetUnfolderBase]: 2949/5210 cut-off events. [2024-06-27 18:42:17,405 INFO L125 PetriNetUnfolderBase]: For 134465/134519 co-relation queries the response was YES. [2024-06-27 18:42:17,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35864 conditions, 5210 events. 2949/5210 cut-off events. For 134465/134519 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 36620 event pairs, 996 based on Foata normal form. 56/5162 useless extension candidates. Maximal degree in co-relation 35708. Up to 4806 conditions per place. [2024-06-27 18:42:17,468 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 390 selfloop transitions, 23 changer transitions 0/421 dead transitions. [2024-06-27 18:42:17,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 421 transitions, 7272 flow [2024-06-27 18:42:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:42:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:42:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions. [2024-06-27 18:42:17,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43783783783783786 [2024-06-27 18:42:17,469 INFO L175 Difference]: Start difference. First operand has 326 places, 391 transitions, 6322 flow. Second operand 10 states and 162 transitions. [2024-06-27 18:42:17,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 421 transitions, 7272 flow [2024-06-27 18:42:18,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 421 transitions, 7207 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-27 18:42:18,532 INFO L231 Difference]: Finished difference. Result has 332 places, 394 transitions, 6358 flow [2024-06-27 18:42:18,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6257, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6358, PETRI_PLACES=332, PETRI_TRANSITIONS=394} [2024-06-27 18:42:18,533 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 291 predicate places. [2024-06-27 18:42:18,533 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 394 transitions, 6358 flow [2024-06-27 18:42:18,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:18,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:18,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:18,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 18:42:18,533 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:18,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:18,534 INFO L85 PathProgramCache]: Analyzing trace with hash 65501191, now seen corresponding path program 14 times [2024-06-27 18:42:18,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:18,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811254274] [2024-06-27 18:42:18,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:18,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:19,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:19,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811254274] [2024-06-27 18:42:19,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811254274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:19,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:19,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:42:19,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738661316] [2024-06-27 18:42:19,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:19,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:42:19,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:19,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:42:19,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:42:19,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:19,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 394 transitions, 6358 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:19,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:19,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:19,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:20,605 INFO L124 PetriNetUnfolderBase]: 3049/5452 cut-off events. [2024-06-27 18:42:20,606 INFO L125 PetriNetUnfolderBase]: For 172877/172930 co-relation queries the response was YES. [2024-06-27 18:42:20,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36933 conditions, 5452 events. 3049/5452 cut-off events. For 172877/172930 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39302 event pairs, 978 based on Foata normal form. 67/5398 useless extension candidates. Maximal degree in co-relation 36775. Up to 4586 conditions per place. [2024-06-27 18:42:20,675 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 396 selfloop transitions, 40 changer transitions 0/444 dead transitions. [2024-06-27 18:42:20,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 444 transitions, 7516 flow [2024-06-27 18:42:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:42:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:42:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-27 18:42:20,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-06-27 18:42:20,676 INFO L175 Difference]: Start difference. First operand has 332 places, 394 transitions, 6358 flow. Second operand 10 states and 182 transitions. [2024-06-27 18:42:20,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 444 transitions, 7516 flow [2024-06-27 18:42:21,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 444 transitions, 7443 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-27 18:42:21,941 INFO L231 Difference]: Finished difference. Result has 335 places, 395 transitions, 6396 flow [2024-06-27 18:42:21,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6285, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6396, PETRI_PLACES=335, PETRI_TRANSITIONS=395} [2024-06-27 18:42:21,942 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 294 predicate places. [2024-06-27 18:42:21,942 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 395 transitions, 6396 flow [2024-06-27 18:42:21,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:21,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:21,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:21,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 18:42:21,943 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:21,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:21,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2002961105, now seen corresponding path program 6 times [2024-06-27 18:42:21,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:21,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14754481] [2024-06-27 18:42:21,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:21,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:22,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:22,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:22,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14754481] [2024-06-27 18:42:22,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14754481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:22,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:22,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:42:22,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64651618] [2024-06-27 18:42:22,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:22,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:42:22,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:22,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:42:22,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:42:22,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:22,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 395 transitions, 6396 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:22,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:22,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:22,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:24,125 INFO L124 PetriNetUnfolderBase]: 3093/5479 cut-off events. [2024-06-27 18:42:24,125 INFO L125 PetriNetUnfolderBase]: For 145085/145139 co-relation queries the response was YES. [2024-06-27 18:42:24,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37539 conditions, 5479 events. 3093/5479 cut-off events. For 145085/145139 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 39141 event pairs, 1030 based on Foata normal form. 56/5421 useless extension candidates. Maximal degree in co-relation 37380. Up to 4990 conditions per place. [2024-06-27 18:42:24,194 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 400 selfloop transitions, 25 changer transitions 0/433 dead transitions. [2024-06-27 18:42:24,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 433 transitions, 7477 flow [2024-06-27 18:42:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:42:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:42:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-27 18:42:24,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-27 18:42:24,195 INFO L175 Difference]: Start difference. First operand has 335 places, 395 transitions, 6396 flow. Second operand 10 states and 170 transitions. [2024-06-27 18:42:24,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 433 transitions, 7477 flow [2024-06-27 18:42:25,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 433 transitions, 7382 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-27 18:42:25,376 INFO L231 Difference]: Finished difference. Result has 337 places, 399 transitions, 6445 flow [2024-06-27 18:42:25,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6305, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6445, PETRI_PLACES=337, PETRI_TRANSITIONS=399} [2024-06-27 18:42:25,377 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 296 predicate places. [2024-06-27 18:42:25,377 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 399 transitions, 6445 flow [2024-06-27 18:42:25,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:25,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:25,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:25,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 18:42:25,378 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:25,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:25,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1689858377, now seen corresponding path program 5 times [2024-06-27 18:42:25,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:25,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283574932] [2024-06-27 18:42:25,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:25,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:26,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:26,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:26,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283574932] [2024-06-27 18:42:26,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283574932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:26,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:26,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:42:26,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409509765] [2024-06-27 18:42:26,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:26,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:42:26,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:26,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:42:26,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:42:26,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:26,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 399 transitions, 6445 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:26,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:26,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:26,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:27,639 INFO L124 PetriNetUnfolderBase]: 3094/5469 cut-off events. [2024-06-27 18:42:27,639 INFO L125 PetriNetUnfolderBase]: For 140492/140546 co-relation queries the response was YES. [2024-06-27 18:42:27,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37310 conditions, 5469 events. 3094/5469 cut-off events. For 140492/140546 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 39076 event pairs, 1070 based on Foata normal form. 56/5420 useless extension candidates. Maximal degree in co-relation 37150. Up to 5042 conditions per place. [2024-06-27 18:42:27,705 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 396 selfloop transitions, 25 changer transitions 0/429 dead transitions. [2024-06-27 18:42:27,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 429 transitions, 7417 flow [2024-06-27 18:42:27,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:42:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:42:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 18:42:27,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44324324324324327 [2024-06-27 18:42:27,706 INFO L175 Difference]: Start difference. First operand has 337 places, 399 transitions, 6445 flow. Second operand 10 states and 164 transitions. [2024-06-27 18:42:27,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 429 transitions, 7417 flow [2024-06-27 18:42:29,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 429 transitions, 7348 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-27 18:42:29,213 INFO L231 Difference]: Finished difference. Result has 340 places, 400 transitions, 6459 flow [2024-06-27 18:42:29,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6376, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6459, PETRI_PLACES=340, PETRI_TRANSITIONS=400} [2024-06-27 18:42:29,214 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 299 predicate places. [2024-06-27 18:42:29,214 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 400 transitions, 6459 flow [2024-06-27 18:42:29,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:29,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:29,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:29,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 18:42:29,214 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:29,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:29,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2107199499, now seen corresponding path program 7 times [2024-06-27 18:42:29,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:29,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296138111] [2024-06-27 18:42:29,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:29,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:29,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:29,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296138111] [2024-06-27 18:42:29,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296138111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:29,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:29,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:42:29,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024166258] [2024-06-27 18:42:29,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:29,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:42:29,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:29,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:42:29,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:42:30,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:30,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 400 transitions, 6459 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:30,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:30,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:30,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:31,517 INFO L124 PetriNetUnfolderBase]: 3096/5470 cut-off events. [2024-06-27 18:42:31,517 INFO L125 PetriNetUnfolderBase]: For 137126/137180 co-relation queries the response was YES. [2024-06-27 18:42:31,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37089 conditions, 5470 events. 3096/5470 cut-off events. For 137126/137180 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 38992 event pairs, 1073 based on Foata normal form. 56/5424 useless extension candidates. Maximal degree in co-relation 36929. Up to 5012 conditions per place. [2024-06-27 18:42:31,576 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 399 selfloop transitions, 27 changer transitions 0/434 dead transitions. [2024-06-27 18:42:31,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 434 transitions, 7469 flow [2024-06-27 18:42:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:42:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:42:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-06-27 18:42:31,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2024-06-27 18:42:31,577 INFO L175 Difference]: Start difference. First operand has 340 places, 400 transitions, 6459 flow. Second operand 10 states and 168 transitions. [2024-06-27 18:42:31,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 434 transitions, 7469 flow [2024-06-27 18:42:32,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 434 transitions, 7402 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 18:42:32,738 INFO L231 Difference]: Finished difference. Result has 343 places, 402 transitions, 6485 flow [2024-06-27 18:42:32,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6392, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6485, PETRI_PLACES=343, PETRI_TRANSITIONS=402} [2024-06-27 18:42:32,739 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 302 predicate places. [2024-06-27 18:42:32,739 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 402 transitions, 6485 flow [2024-06-27 18:42:32,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:32,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:32,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:32,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 18:42:32,740 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:32,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:32,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1109834443, now seen corresponding path program 15 times [2024-06-27 18:42:32,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:32,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094819700] [2024-06-27 18:42:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:32,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:33,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:33,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094819700] [2024-06-27 18:42:33,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094819700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:33,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:33,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:42:33,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276323923] [2024-06-27 18:42:33,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:33,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:42:33,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:33,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:42:33,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:42:33,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:33,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 402 transitions, 6485 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:33,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:33,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:33,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:34,914 INFO L124 PetriNetUnfolderBase]: 3192/5652 cut-off events. [2024-06-27 18:42:34,915 INFO L125 PetriNetUnfolderBase]: For 177664/177718 co-relation queries the response was YES. [2024-06-27 18:42:34,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37877 conditions, 5652 events. 3192/5652 cut-off events. For 177664/177718 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 40723 event pairs, 1050 based on Foata normal form. 70/5615 useless extension candidates. Maximal degree in co-relation 37716. Up to 4910 conditions per place. [2024-06-27 18:42:34,986 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 406 selfloop transitions, 29 changer transitions 0/443 dead transitions. [2024-06-27 18:42:34,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 443 transitions, 7579 flow [2024-06-27 18:42:34,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:42:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:42:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-27 18:42:34,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783783783783784 [2024-06-27 18:42:34,987 INFO L175 Difference]: Start difference. First operand has 343 places, 402 transitions, 6485 flow. Second operand 10 states and 177 transitions. [2024-06-27 18:42:34,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 443 transitions, 7579 flow [2024-06-27 18:42:36,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 443 transitions, 7488 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-27 18:42:36,367 INFO L231 Difference]: Finished difference. Result has 346 places, 403 transitions, 6499 flow [2024-06-27 18:42:36,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6394, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6499, PETRI_PLACES=346, PETRI_TRANSITIONS=403} [2024-06-27 18:42:36,367 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 305 predicate places. [2024-06-27 18:42:36,367 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 403 transitions, 6499 flow [2024-06-27 18:42:36,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:36,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:36,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:36,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 18:42:36,368 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:36,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1337735407, now seen corresponding path program 8 times [2024-06-27 18:42:36,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:36,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859662410] [2024-06-27 18:42:36,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:36,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:37,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:37,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859662410] [2024-06-27 18:42:37,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859662410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:37,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:37,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:42:37,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041694591] [2024-06-27 18:42:37,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:37,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:42:37,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:37,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:42:37,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:42:37,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:37,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 403 transitions, 6499 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:37,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:37,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:37,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:38,584 INFO L124 PetriNetUnfolderBase]: 3214/5778 cut-off events. [2024-06-27 18:42:38,585 INFO L125 PetriNetUnfolderBase]: For 144017/144070 co-relation queries the response was YES. [2024-06-27 18:42:38,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38304 conditions, 5778 events. 3214/5778 cut-off events. For 144017/144070 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 42418 event pairs, 1062 based on Foata normal form. 55/5691 useless extension candidates. Maximal degree in co-relation 38141. Up to 5037 conditions per place. [2024-06-27 18:42:38,655 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 402 selfloop transitions, 44 changer transitions 0/454 dead transitions. [2024-06-27 18:42:38,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 454 transitions, 7681 flow [2024-06-27 18:42:38,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:42:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:42:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-06-27 18:42:38,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742014742014742 [2024-06-27 18:42:38,657 INFO L175 Difference]: Start difference. First operand has 346 places, 403 transitions, 6499 flow. Second operand 11 states and 193 transitions. [2024-06-27 18:42:38,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 454 transitions, 7681 flow [2024-06-27 18:42:39,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 454 transitions, 7590 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-27 18:42:39,955 INFO L231 Difference]: Finished difference. Result has 350 places, 406 transitions, 6570 flow [2024-06-27 18:42:39,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6408, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6570, PETRI_PLACES=350, PETRI_TRANSITIONS=406} [2024-06-27 18:42:39,956 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 309 predicate places. [2024-06-27 18:42:39,956 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 406 transitions, 6570 flow [2024-06-27 18:42:39,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:39,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:39,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:39,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 18:42:39,957 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:39,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:39,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1337908387, now seen corresponding path program 9 times [2024-06-27 18:42:39,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:39,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182802879] [2024-06-27 18:42:39,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:39,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:40,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-06-27 18:42:40,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:40,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182802879] [2024-06-27 18:42:40,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182802879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:40,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:40,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:42:40,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113695910] [2024-06-27 18:42:40,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:40,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:42:40,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:40,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:42:40,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:42:40,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:40,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 406 transitions, 6570 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:40,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:40,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:40,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:42,269 INFO L124 PetriNetUnfolderBase]: 3236/5803 cut-off events. [2024-06-27 18:42:42,269 INFO L125 PetriNetUnfolderBase]: For 138966/139017 co-relation queries the response was YES. [2024-06-27 18:42:42,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38587 conditions, 5803 events. 3236/5803 cut-off events. For 138966/139017 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 42439 event pairs, 1027 based on Foata normal form. 53/5722 useless extension candidates. Maximal degree in co-relation 38422. Up to 4890 conditions per place. [2024-06-27 18:42:42,324 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 395 selfloop transitions, 60 changer transitions 0/463 dead transitions. [2024-06-27 18:42:42,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 463 transitions, 7950 flow [2024-06-27 18:42:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:42:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:42:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2024-06-27 18:42:42,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797297297297297 [2024-06-27 18:42:42,325 INFO L175 Difference]: Start difference. First operand has 350 places, 406 transitions, 6570 flow. Second operand 12 states and 213 transitions. [2024-06-27 18:42:42,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 463 transitions, 7950 flow [2024-06-27 18:42:43,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 463 transitions, 7831 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-27 18:42:43,343 INFO L231 Difference]: Finished difference. Result has 354 places, 408 transitions, 6629 flow [2024-06-27 18:42:43,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6451, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6629, PETRI_PLACES=354, PETRI_TRANSITIONS=408} [2024-06-27 18:42:43,344 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 313 predicate places. [2024-06-27 18:42:43,344 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 408 transitions, 6629 flow [2024-06-27 18:42:43,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:43,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:43,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:43,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 18:42:43,345 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:43,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:43,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1238917445, now seen corresponding path program 10 times [2024-06-27 18:42:43,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:43,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55758404] [2024-06-27 18:42:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:44,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:44,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55758404] [2024-06-27 18:42:44,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55758404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:44,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:44,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:42:44,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137100510] [2024-06-27 18:42:44,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:44,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:42:44,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:44,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:42:44,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:42:44,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:44,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 408 transitions, 6629 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:44,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:44,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:44,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:45,745 INFO L124 PetriNetUnfolderBase]: 3280/5874 cut-off events. [2024-06-27 18:42:45,746 INFO L125 PetriNetUnfolderBase]: For 144706/144759 co-relation queries the response was YES. [2024-06-27 18:42:45,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39218 conditions, 5874 events. 3280/5874 cut-off events. For 144706/144759 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 43094 event pairs, 1094 based on Foata normal form. 55/5791 useless extension candidates. Maximal degree in co-relation 39052. Up to 5111 conditions per place. [2024-06-27 18:42:45,811 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 405 selfloop transitions, 46 changer transitions 0/459 dead transitions. [2024-06-27 18:42:45,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 459 transitions, 7848 flow [2024-06-27 18:42:45,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:42:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:42:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-06-27 18:42:45,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48157248157248156 [2024-06-27 18:42:45,812 INFO L175 Difference]: Start difference. First operand has 354 places, 408 transitions, 6629 flow. Second operand 11 states and 196 transitions. [2024-06-27 18:42:45,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 459 transitions, 7848 flow [2024-06-27 18:42:46,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 459 transitions, 7717 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-27 18:42:46,964 INFO L231 Difference]: Finished difference. Result has 357 places, 413 transitions, 6711 flow [2024-06-27 18:42:46,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6503, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6711, PETRI_PLACES=357, PETRI_TRANSITIONS=413} [2024-06-27 18:42:46,965 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 316 predicate places. [2024-06-27 18:42:46,965 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 413 transitions, 6711 flow [2024-06-27 18:42:46,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:46,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:46,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:46,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 18:42:46,966 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:46,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:46,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2071313107, now seen corresponding path program 16 times [2024-06-27 18:42:46,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:46,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017736856] [2024-06-27 18:42:46,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:46,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:47,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:47,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017736856] [2024-06-27 18:42:47,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017736856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:47,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:47,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:42:47,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639998821] [2024-06-27 18:42:47,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:47,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:42:47,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:47,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:42:47,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:42:47,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:47,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 413 transitions, 6711 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:47,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:47,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:47,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:49,195 INFO L124 PetriNetUnfolderBase]: 3342/5980 cut-off events. [2024-06-27 18:42:49,195 INFO L125 PetriNetUnfolderBase]: For 172456/172509 co-relation queries the response was YES. [2024-06-27 18:42:49,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39368 conditions, 5980 events. 3342/5980 cut-off events. For 172456/172509 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 44015 event pairs, 1094 based on Foata normal form. 67/5912 useless extension candidates. Maximal degree in co-relation 39200. Up to 5043 conditions per place. [2024-06-27 18:42:49,270 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 407 selfloop transitions, 44 changer transitions 0/459 dead transitions. [2024-06-27 18:42:49,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 459 transitions, 7872 flow [2024-06-27 18:42:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:42:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:42:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-27 18:42:49,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2024-06-27 18:42:49,271 INFO L175 Difference]: Start difference. First operand has 357 places, 413 transitions, 6711 flow. Second operand 10 states and 183 transitions. [2024-06-27 18:42:49,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 459 transitions, 7872 flow [2024-06-27 18:42:50,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 459 transitions, 7743 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-27 18:42:50,471 INFO L231 Difference]: Finished difference. Result has 359 places, 414 transitions, 6706 flow [2024-06-27 18:42:50,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6582, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6706, PETRI_PLACES=359, PETRI_TRANSITIONS=414} [2024-06-27 18:42:50,472 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 318 predicate places. [2024-06-27 18:42:50,472 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 414 transitions, 6706 flow [2024-06-27 18:42:50,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:50,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:50,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:50,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 18:42:50,472 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:50,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:50,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2003198255, now seen corresponding path program 11 times [2024-06-27 18:42:50,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:50,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249508324] [2024-06-27 18:42:50,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:50,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:51,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:51,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249508324] [2024-06-27 18:42:51,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249508324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:51,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:51,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:42:51,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584491620] [2024-06-27 18:42:51,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:51,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:42:51,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:51,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:42:51,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:42:51,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:51,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 414 transitions, 6706 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:51,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:51,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:51,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:52,699 INFO L124 PetriNetUnfolderBase]: 3338/5933 cut-off events. [2024-06-27 18:42:52,699 INFO L125 PetriNetUnfolderBase]: For 128353/128407 co-relation queries the response was YES. [2024-06-27 18:42:52,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38952 conditions, 5933 events. 3338/5933 cut-off events. For 128353/128407 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 43272 event pairs, 1113 based on Foata normal form. 56/5868 useless extension candidates. Maximal degree in co-relation 38783. Up to 5362 conditions per place. [2024-06-27 18:42:52,773 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 416 selfloop transitions, 31 changer transitions 0/455 dead transitions. [2024-06-27 18:42:52,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 455 transitions, 7780 flow [2024-06-27 18:42:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:42:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:42:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2024-06-27 18:42:52,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4643734643734644 [2024-06-27 18:42:52,775 INFO L175 Difference]: Start difference. First operand has 359 places, 414 transitions, 6706 flow. Second operand 11 states and 189 transitions. [2024-06-27 18:42:52,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 455 transitions, 7780 flow [2024-06-27 18:42:53,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 455 transitions, 7652 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-27 18:42:53,855 INFO L231 Difference]: Finished difference. Result has 362 places, 414 transitions, 6645 flow [2024-06-27 18:42:53,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6578, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6645, PETRI_PLACES=362, PETRI_TRANSITIONS=414} [2024-06-27 18:42:53,856 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 321 predicate places. [2024-06-27 18:42:53,856 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 414 transitions, 6645 flow [2024-06-27 18:42:53,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:53,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:53,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:53,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 18:42:53,857 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:53,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:53,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1337908573, now seen corresponding path program 17 times [2024-06-27 18:42:53,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:53,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745196833] [2024-06-27 18:42:53,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:53,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:54,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:54,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745196833] [2024-06-27 18:42:54,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745196833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:54,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:54,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:42:54,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161976383] [2024-06-27 18:42:54,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:54,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:42:54,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:54,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:42:54,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:42:54,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:54,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 414 transitions, 6645 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:54,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:54,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:54,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:56,012 INFO L124 PetriNetUnfolderBase]: 3361/6002 cut-off events. [2024-06-27 18:42:56,012 INFO L125 PetriNetUnfolderBase]: For 129085/129136 co-relation queries the response was YES. [2024-06-27 18:42:56,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39101 conditions, 6002 events. 3361/6002 cut-off events. For 129085/129136 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 44171 event pairs, 1158 based on Foata normal form. 53/5926 useless extension candidates. Maximal degree in co-relation 38931. Up to 5396 conditions per place. [2024-06-27 18:42:56,086 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 396 selfloop transitions, 53 changer transitions 0/457 dead transitions. [2024-06-27 18:42:56,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 457 transitions, 7803 flow [2024-06-27 18:42:56,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:42:56,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:42:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 18:42:56,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-06-27 18:42:56,088 INFO L175 Difference]: Start difference. First operand has 362 places, 414 transitions, 6645 flow. Second operand 10 states and 171 transitions. [2024-06-27 18:42:56,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 457 transitions, 7803 flow [2024-06-27 18:42:57,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 457 transitions, 7697 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-06-27 18:42:57,248 INFO L231 Difference]: Finished difference. Result has 361 places, 418 transitions, 6735 flow [2024-06-27 18:42:57,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6539, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6735, PETRI_PLACES=361, PETRI_TRANSITIONS=418} [2024-06-27 18:42:57,248 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 320 predicate places. [2024-06-27 18:42:57,248 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 418 transitions, 6735 flow [2024-06-27 18:42:57,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:57,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:42:57,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:42:57,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 18:42:57,249 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:42:57,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:42:57,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2064879367, now seen corresponding path program 18 times [2024-06-27 18:42:57,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:42:57,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100263259] [2024-06-27 18:42:57,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:42:57,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:42:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:42:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:42:57,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:42:57,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100263259] [2024-06-27 18:42:57,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100263259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:42:57,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:42:57,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:42:57,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690484663] [2024-06-27 18:42:57,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:42:57,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:42:57,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:42:57,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:42:57,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:42:57,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:42:57,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 418 transitions, 6735 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:42:57,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:42:57,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:42:57,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:42:59,519 INFO L124 PetriNetUnfolderBase]: 3367/6006 cut-off events. [2024-06-27 18:42:59,520 INFO L125 PetriNetUnfolderBase]: For 122705/122760 co-relation queries the response was YES. [2024-06-27 18:42:59,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38940 conditions, 6006 events. 3367/6006 cut-off events. For 122705/122760 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 44215 event pairs, 1145 based on Foata normal form. 57/5936 useless extension candidates. Maximal degree in co-relation 38769. Up to 5286 conditions per place. [2024-06-27 18:42:59,583 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 394 selfloop transitions, 59 changer transitions 0/461 dead transitions. [2024-06-27 18:42:59,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 461 transitions, 7887 flow [2024-06-27 18:42:59,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:42:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:42:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 18:42:59,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2024-06-27 18:42:59,584 INFO L175 Difference]: Start difference. First operand has 361 places, 418 transitions, 6735 flow. Second operand 10 states and 172 transitions. [2024-06-27 18:42:59,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 461 transitions, 7887 flow [2024-06-27 18:43:00,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 461 transitions, 7433 flow, removed 46 selfloop flow, removed 11 redundant places. [2024-06-27 18:43:00,867 INFO L231 Difference]: Finished difference. Result has 361 places, 421 transitions, 6489 flow [2024-06-27 18:43:00,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6289, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6489, PETRI_PLACES=361, PETRI_TRANSITIONS=421} [2024-06-27 18:43:00,868 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 320 predicate places. [2024-06-27 18:43:00,868 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 421 transitions, 6489 flow [2024-06-27 18:43:00,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:00,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:43:00,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:43:00,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 18:43:00,869 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:43:00,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:43:00,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1482666995, now seen corresponding path program 12 times [2024-06-27 18:43:00,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:43:00,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29685680] [2024-06-27 18:43:00,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:43:00,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:43:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:43:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:43:01,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:43:01,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29685680] [2024-06-27 18:43:01,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29685680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:43:01,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:43:01,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:43:01,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861727453] [2024-06-27 18:43:01,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:43:01,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:43:01,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:43:01,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:43:01,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:43:01,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:43:01,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 421 transitions, 6489 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:01,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:43:01,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:43:01,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:43:03,762 INFO L124 PetriNetUnfolderBase]: 4262/7989 cut-off events. [2024-06-27 18:43:03,762 INFO L125 PetriNetUnfolderBase]: For 137103/137160 co-relation queries the response was YES. [2024-06-27 18:43:03,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50146 conditions, 7989 events. 4262/7989 cut-off events. For 137103/137160 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 64812 event pairs, 737 based on Foata normal form. 59/7787 useless extension candidates. Maximal degree in co-relation 49977. Up to 4886 conditions per place. [2024-06-27 18:43:03,848 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 430 selfloop transitions, 278 changer transitions 0/716 dead transitions. [2024-06-27 18:43:03,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 716 transitions, 12434 flow [2024-06-27 18:43:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:43:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:43:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-06-27 18:43:03,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5331695331695332 [2024-06-27 18:43:03,849 INFO L175 Difference]: Start difference. First operand has 361 places, 421 transitions, 6489 flow. Second operand 11 states and 217 transitions. [2024-06-27 18:43:03,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 716 transitions, 12434 flow [2024-06-27 18:43:05,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 716 transitions, 12104 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-27 18:43:05,187 INFO L231 Difference]: Finished difference. Result has 371 places, 598 transitions, 10378 flow [2024-06-27 18:43:05,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6284, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10378, PETRI_PLACES=371, PETRI_TRANSITIONS=598} [2024-06-27 18:43:05,187 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 330 predicate places. [2024-06-27 18:43:05,188 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 598 transitions, 10378 flow [2024-06-27 18:43:05,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:05,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:43:05,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:43:05,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 18:43:05,188 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:43:05,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:43:05,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1478025365, now seen corresponding path program 13 times [2024-06-27 18:43:05,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:43:05,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063134680] [2024-06-27 18:43:05,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:43:05,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:43:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:43:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:43:05,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:43:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063134680] [2024-06-27 18:43:05,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063134680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:43:05,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:43:05,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:43:05,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422245247] [2024-06-27 18:43:05,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:43:05,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:43:05,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:43:05,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:43:05,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:43:06,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:43:06,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 598 transitions, 10378 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:06,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:43:06,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:43:06,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:43:08,499 INFO L124 PetriNetUnfolderBase]: 4298/8136 cut-off events. [2024-06-27 18:43:08,500 INFO L125 PetriNetUnfolderBase]: For 155902/155959 co-relation queries the response was YES. [2024-06-27 18:43:08,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54095 conditions, 8136 events. 4298/8136 cut-off events. For 155902/155959 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 66857 event pairs, 808 based on Foata normal form. 59/7909 useless extension candidates. Maximal degree in co-relation 53919. Up to 5745 conditions per place. [2024-06-27 18:43:08,598 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 520 selfloop transitions, 181 changer transitions 0/709 dead transitions. [2024-06-27 18:43:08,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 709 transitions, 12989 flow [2024-06-27 18:43:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:43:08,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:43:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2024-06-27 18:43:08,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067567567567568 [2024-06-27 18:43:08,599 INFO L175 Difference]: Start difference. First operand has 371 places, 598 transitions, 10378 flow. Second operand 12 states and 225 transitions. [2024-06-27 18:43:08,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 709 transitions, 12989 flow [2024-06-27 18:43:10,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 709 transitions, 12920 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-06-27 18:43:10,251 INFO L231 Difference]: Finished difference. Result has 386 places, 609 transitions, 11012 flow [2024-06-27 18:43:10,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10319, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11012, PETRI_PLACES=386, PETRI_TRANSITIONS=609} [2024-06-27 18:43:10,251 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 345 predicate places. [2024-06-27 18:43:10,251 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 609 transitions, 11012 flow [2024-06-27 18:43:10,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:10,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:43:10,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:43:10,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-27 18:43:10,252 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:43:10,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:43:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1478198345, now seen corresponding path program 14 times [2024-06-27 18:43:10,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:43:10,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105527561] [2024-06-27 18:43:10,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:43:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:43:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:43:10,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-06-27 18:43:10,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:43:10,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105527561] [2024-06-27 18:43:10,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105527561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:43:10,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:43:10,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:43:10,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845758381] [2024-06-27 18:43:10,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:43:10,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:43:10,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:43:10,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:43:10,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:43:11,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:43:11,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 609 transitions, 11012 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:11,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:43:11,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:43:11,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:43:13,521 INFO L124 PetriNetUnfolderBase]: 4294/8156 cut-off events. [2024-06-27 18:43:13,522 INFO L125 PetriNetUnfolderBase]: For 155374/155431 co-relation queries the response was YES. [2024-06-27 18:43:13,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55360 conditions, 8156 events. 4294/8156 cut-off events. For 155374/155431 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 67193 event pairs, 752 based on Foata normal form. 59/7913 useless extension candidates. Maximal degree in co-relation 55177. Up to 5481 conditions per place. [2024-06-27 18:43:13,630 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 484 selfloop transitions, 221 changer transitions 0/713 dead transitions. [2024-06-27 18:43:13,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 713 transitions, 13524 flow [2024-06-27 18:43:13,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:43:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:43:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-06-27 18:43:13,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5331695331695332 [2024-06-27 18:43:13,631 INFO L175 Difference]: Start difference. First operand has 386 places, 609 transitions, 11012 flow. Second operand 11 states and 217 transitions. [2024-06-27 18:43:13,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 713 transitions, 13524 flow [2024-06-27 18:43:15,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 713 transitions, 13297 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-27 18:43:15,308 INFO L231 Difference]: Finished difference. Result has 394 places, 611 transitions, 11299 flow [2024-06-27 18:43:15,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10787, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11299, PETRI_PLACES=394, PETRI_TRANSITIONS=611} [2024-06-27 18:43:15,308 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 353 predicate places. [2024-06-27 18:43:15,309 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 611 transitions, 11299 flow [2024-06-27 18:43:15,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:15,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:43:15,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:43:15,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-27 18:43:15,325 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:43:15,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:43:15,325 INFO L85 PathProgramCache]: Analyzing trace with hash 692387154, now seen corresponding path program 1 times [2024-06-27 18:43:15,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:43:15,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029783123] [2024-06-27 18:43:15,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:43:15,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:43:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:43:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:43:16,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:43:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029783123] [2024-06-27 18:43:16,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029783123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:43:16,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:43:16,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:43:16,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218653996] [2024-06-27 18:43:16,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:43:16,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:43:16,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:43:16,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:43:16,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:43:16,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:43:16,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 611 transitions, 11299 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:16,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:43:16,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:43:16,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:43:18,604 INFO L124 PetriNetUnfolderBase]: 4427/8176 cut-off events. [2024-06-27 18:43:18,605 INFO L125 PetriNetUnfolderBase]: For 219396/219465 co-relation queries the response was YES. [2024-06-27 18:43:18,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57231 conditions, 8176 events. 4427/8176 cut-off events. For 219396/219465 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 65538 event pairs, 842 based on Foata normal form. 77/8025 useless extension candidates. Maximal degree in co-relation 57045. Up to 3302 conditions per place. [2024-06-27 18:43:18,721 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 357 selfloop transitions, 305 changer transitions 0/670 dead transitions. [2024-06-27 18:43:18,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 670 transitions, 13121 flow [2024-06-27 18:43:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:43:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:43:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-27 18:43:18,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208845208845209 [2024-06-27 18:43:18,722 INFO L175 Difference]: Start difference. First operand has 394 places, 611 transitions, 11299 flow. Second operand 11 states and 212 transitions. [2024-06-27 18:43:18,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 670 transitions, 13121 flow [2024-06-27 18:43:20,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 670 transitions, 12477 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-27 18:43:20,502 INFO L231 Difference]: Finished difference. Result has 396 places, 611 transitions, 11268 flow [2024-06-27 18:43:20,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10655, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=305, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11268, PETRI_PLACES=396, PETRI_TRANSITIONS=611} [2024-06-27 18:43:20,503 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 355 predicate places. [2024-06-27 18:43:20,503 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 611 transitions, 11268 flow [2024-06-27 18:43:20,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:20,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:43:20,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:43:20,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-27 18:43:20,503 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:43:20,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:43:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash -470533964, now seen corresponding path program 2 times [2024-06-27 18:43:20,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:43:20,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073231763] [2024-06-27 18:43:20,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:43:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:43:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:43:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:43:21,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:43:21,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073231763] [2024-06-27 18:43:21,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073231763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:43:21,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:43:21,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:43:21,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770437131] [2024-06-27 18:43:21,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:43:21,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:43:21,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:43:21,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:43:21,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:43:21,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:43:21,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 611 transitions, 11268 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:21,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:43:21,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:43:21,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:43:23,751 INFO L124 PetriNetUnfolderBase]: 4495/8414 cut-off events. [2024-06-27 18:43:23,752 INFO L125 PetriNetUnfolderBase]: For 232211/232293 co-relation queries the response was YES. [2024-06-27 18:43:23,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57409 conditions, 8414 events. 4495/8414 cut-off events. For 232211/232293 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 68432 event pairs, 844 based on Foata normal form. 92/8230 useless extension candidates. Maximal degree in co-relation 57223. Up to 4244 conditions per place. [2024-06-27 18:43:23,862 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 344 selfloop transitions, 339 changer transitions 0/691 dead transitions. [2024-06-27 18:43:23,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 691 transitions, 13146 flow [2024-06-27 18:43:23,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 18:43:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 18:43:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 275 transitions. [2024-06-27 18:43:23,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-27 18:43:23,863 INFO L175 Difference]: Start difference. First operand has 396 places, 611 transitions, 11268 flow. Second operand 15 states and 275 transitions. [2024-06-27 18:43:23,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 691 transitions, 13146 flow [2024-06-27 18:43:25,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 691 transitions, 12537 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 18:43:25,529 INFO L231 Difference]: Finished difference. Result has 402 places, 612 transitions, 11361 flow [2024-06-27 18:43:25,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10659, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=11361, PETRI_PLACES=402, PETRI_TRANSITIONS=612} [2024-06-27 18:43:25,530 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 361 predicate places. [2024-06-27 18:43:25,530 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 612 transitions, 11361 flow [2024-06-27 18:43:25,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:25,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:43:25,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:43:25,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-27 18:43:25,530 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:43:25,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:43:25,531 INFO L85 PathProgramCache]: Analyzing trace with hash -474258614, now seen corresponding path program 3 times [2024-06-27 18:43:25,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:43:25,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783032597] [2024-06-27 18:43:25,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:43:25,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:43:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:43:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:43:26,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:43:26,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783032597] [2024-06-27 18:43:26,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783032597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:43:26,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:43:26,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:43:26,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735429435] [2024-06-27 18:43:26,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:43:26,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:43:26,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:43:26,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:43:26,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:43:26,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:43:26,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 612 transitions, 11361 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:26,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:43:26,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:43:26,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:43:28,828 INFO L124 PetriNetUnfolderBase]: 4528/8593 cut-off events. [2024-06-27 18:43:28,828 INFO L125 PetriNetUnfolderBase]: For 222030/222112 co-relation queries the response was YES. [2024-06-27 18:43:28,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57937 conditions, 8593 events. 4528/8593 cut-off events. For 222030/222112 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 70778 event pairs, 866 based on Foata normal form. 90/8367 useless extension candidates. Maximal degree in co-relation 57750. Up to 3738 conditions per place. [2024-06-27 18:43:28,947 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 343 selfloop transitions, 330 changer transitions 0/681 dead transitions. [2024-06-27 18:43:28,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 681 transitions, 13282 flow [2024-06-27 18:43:28,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:43:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:43:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 237 transitions. [2024-06-27 18:43:28,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5337837837837838 [2024-06-27 18:43:28,949 INFO L175 Difference]: Start difference. First operand has 402 places, 612 transitions, 11361 flow. Second operand 12 states and 237 transitions. [2024-06-27 18:43:28,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 681 transitions, 13282 flow [2024-06-27 18:43:30,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 681 transitions, 12624 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-27 18:43:30,938 INFO L231 Difference]: Finished difference. Result has 402 places, 612 transitions, 11366 flow [2024-06-27 18:43:30,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10703, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=330, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11366, PETRI_PLACES=402, PETRI_TRANSITIONS=612} [2024-06-27 18:43:30,939 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 361 predicate places. [2024-06-27 18:43:30,939 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 612 transitions, 11366 flow [2024-06-27 18:43:30,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:30,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:43:30,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:43:30,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-27 18:43:30,939 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:43:30,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:43:30,940 INFO L85 PathProgramCache]: Analyzing trace with hash -470683694, now seen corresponding path program 4 times [2024-06-27 18:43:30,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:43:30,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139814898] [2024-06-27 18:43:30,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:43:30,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:43:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:43:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:43:31,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:43:31,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139814898] [2024-06-27 18:43:31,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139814898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:43:31,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:43:31,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:43:31,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868229687] [2024-06-27 18:43:31,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:43:31,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:43:31,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:43:31,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:43:31,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:43:31,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:43:31,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 612 transitions, 11366 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:31,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:43:31,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:43:31,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:43:34,182 INFO L124 PetriNetUnfolderBase]: 4854/8941 cut-off events. [2024-06-27 18:43:34,183 INFO L125 PetriNetUnfolderBase]: For 258052/258129 co-relation queries the response was YES. [2024-06-27 18:43:34,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60944 conditions, 8941 events. 4854/8941 cut-off events. For 258052/258129 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 73040 event pairs, 965 based on Foata normal form. 85/8797 useless extension candidates. Maximal degree in co-relation 60756. Up to 4190 conditions per place. [2024-06-27 18:43:34,304 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 315 selfloop transitions, 375 changer transitions 0/698 dead transitions. [2024-06-27 18:43:34,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 698 transitions, 13635 flow [2024-06-27 18:43:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:43:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:43:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2024-06-27 18:43:34,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5282555282555282 [2024-06-27 18:43:34,305 INFO L175 Difference]: Start difference. First operand has 402 places, 612 transitions, 11366 flow. Second operand 11 states and 215 transitions. [2024-06-27 18:43:34,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 698 transitions, 13635 flow [2024-06-27 18:43:36,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 698 transitions, 12966 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 18:43:36,775 INFO L231 Difference]: Finished difference. Result has 408 places, 629 transitions, 12023 flow [2024-06-27 18:43:36,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10707, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=360, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12023, PETRI_PLACES=408, PETRI_TRANSITIONS=629} [2024-06-27 18:43:36,776 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 367 predicate places. [2024-06-27 18:43:36,776 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 629 transitions, 12023 flow [2024-06-27 18:43:36,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:36,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:43:36,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:43:36,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-27 18:43:36,777 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:43:36,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:43:36,777 INFO L85 PathProgramCache]: Analyzing trace with hash -470539544, now seen corresponding path program 5 times [2024-06-27 18:43:36,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:43:36,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568633230] [2024-06-27 18:43:36,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:43:36,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:43:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:43:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:43:37,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:43:37,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568633230] [2024-06-27 18:43:37,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568633230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:43:37,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:43:37,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:43:37,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282805870] [2024-06-27 18:43:37,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:43:37,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:43:37,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:43:37,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:43:37,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:43:37,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:43:37,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 629 transitions, 12023 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:37,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:43:37,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:43:37,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:43:40,030 INFO L124 PetriNetUnfolderBase]: 4770/8865 cut-off events. [2024-06-27 18:43:40,030 INFO L125 PetriNetUnfolderBase]: For 208366/208443 co-relation queries the response was YES. [2024-06-27 18:43:40,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60828 conditions, 8865 events. 4770/8865 cut-off events. For 208366/208443 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 72418 event pairs, 941 based on Foata normal form. 85/8695 useless extension candidates. Maximal degree in co-relation 60634. Up to 4240 conditions per place. [2024-06-27 18:43:40,149 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 312 selfloop transitions, 376 changer transitions 0/696 dead transitions. [2024-06-27 18:43:40,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 696 transitions, 13904 flow [2024-06-27 18:43:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:43:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:43:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2024-06-27 18:43:40,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5184275184275184 [2024-06-27 18:43:40,151 INFO L175 Difference]: Start difference. First operand has 408 places, 629 transitions, 12023 flow. Second operand 11 states and 211 transitions. [2024-06-27 18:43:40,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 696 transitions, 13904 flow [2024-06-27 18:43:42,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 696 transitions, 13586 flow, removed 50 selfloop flow, removed 3 redundant places. [2024-06-27 18:43:42,441 INFO L231 Difference]: Finished difference. Result has 418 places, 634 transitions, 12571 flow [2024-06-27 18:43:42,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11717, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=371, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12571, PETRI_PLACES=418, PETRI_TRANSITIONS=634} [2024-06-27 18:43:42,442 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 377 predicate places. [2024-06-27 18:43:42,442 INFO L495 AbstractCegarLoop]: Abstraction has has 418 places, 634 transitions, 12571 flow [2024-06-27 18:43:42,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:42,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:43:42,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:43:42,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-27 18:43:42,443 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:43:42,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:43:42,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1495846610, now seen corresponding path program 6 times [2024-06-27 18:43:42,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:43:42,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149885468] [2024-06-27 18:43:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:43:42,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:43:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:43:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:43:43,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:43:43,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149885468] [2024-06-27 18:43:43,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149885468] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:43:43,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:43:43,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:43:43,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972431568] [2024-06-27 18:43:43,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:43:43,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:43:43,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:43:43,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:43:43,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:43:43,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:43:43,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 634 transitions, 12571 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:43,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:43:43,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:43:43,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:43:45,946 INFO L124 PetriNetUnfolderBase]: 5021/9362 cut-off events. [2024-06-27 18:43:45,947 INFO L125 PetriNetUnfolderBase]: For 217184/217252 co-relation queries the response was YES. [2024-06-27 18:43:46,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64872 conditions, 9362 events. 5021/9362 cut-off events. For 217184/217252 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 78097 event pairs, 1227 based on Foata normal form. 76/9162 useless extension candidates. Maximal degree in co-relation 64674. Up to 6195 conditions per place. [2024-06-27 18:43:46,081 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 455 selfloop transitions, 250 changer transitions 0/713 dead transitions. [2024-06-27 18:43:46,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 713 transitions, 14656 flow [2024-06-27 18:43:46,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:43:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:43:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2024-06-27 18:43:46,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110565110565111 [2024-06-27 18:43:46,082 INFO L175 Difference]: Start difference. First operand has 418 places, 634 transitions, 12571 flow. Second operand 11 states and 208 transitions. [2024-06-27 18:43:46,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 713 transitions, 14656 flow [2024-06-27 18:43:48,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 713 transitions, 13863 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-27 18:43:48,711 INFO L231 Difference]: Finished difference. Result has 427 places, 649 transitions, 12626 flow [2024-06-27 18:43:48,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11792, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12626, PETRI_PLACES=427, PETRI_TRANSITIONS=649} [2024-06-27 18:43:48,712 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 386 predicate places. [2024-06-27 18:43:48,712 INFO L495 AbstractCegarLoop]: Abstraction has has 427 places, 649 transitions, 12626 flow [2024-06-27 18:43:48,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:48,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:43:48,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:43:48,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-27 18:43:48,713 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:43:48,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:43:48,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1374295242, now seen corresponding path program 7 times [2024-06-27 18:43:48,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:43:48,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540108642] [2024-06-27 18:43:48,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:43:48,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:43:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:43:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:43:49,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:43:49,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540108642] [2024-06-27 18:43:49,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540108642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:43:49,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:43:49,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:43:49,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198051636] [2024-06-27 18:43:49,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:43:49,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:43:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:43:49,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:43:49,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:43:49,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:43:49,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 649 transitions, 12626 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:49,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:43:49,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:43:49,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:43:52,487 INFO L124 PetriNetUnfolderBase]: 5313/9933 cut-off events. [2024-06-27 18:43:52,488 INFO L125 PetriNetUnfolderBase]: For 254908/254981 co-relation queries the response was YES. [2024-06-27 18:43:52,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67838 conditions, 9933 events. 5313/9933 cut-off events. For 254908/254981 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 84049 event pairs, 1316 based on Foata normal form. 81/9730 useless extension candidates. Maximal degree in co-relation 67634. Up to 6141 conditions per place. [2024-06-27 18:43:52,639 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 467 selfloop transitions, 255 changer transitions 0/730 dead transitions. [2024-06-27 18:43:52,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 730 transitions, 14957 flow [2024-06-27 18:43:52,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:43:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:43:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-27 18:43:52,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208845208845209 [2024-06-27 18:43:52,641 INFO L175 Difference]: Start difference. First operand has 427 places, 649 transitions, 12626 flow. Second operand 11 states and 212 transitions. [2024-06-27 18:43:52,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 730 transitions, 14957 flow [2024-06-27 18:43:55,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 730 transitions, 14696 flow, removed 30 selfloop flow, removed 3 redundant places. [2024-06-27 18:43:55,751 INFO L231 Difference]: Finished difference. Result has 438 places, 659 transitions, 13116 flow [2024-06-27 18:43:55,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12365, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=245, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13116, PETRI_PLACES=438, PETRI_TRANSITIONS=659} [2024-06-27 18:43:55,752 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 397 predicate places. [2024-06-27 18:43:55,752 INFO L495 AbstractCegarLoop]: Abstraction has has 438 places, 659 transitions, 13116 flow [2024-06-27 18:43:55,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:55,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:43:55,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:43:55,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-27 18:43:55,753 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:43:55,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:43:55,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1490484230, now seen corresponding path program 8 times [2024-06-27 18:43:55,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:43:55,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874665694] [2024-06-27 18:43:55,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:43:55,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:43:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:43:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:43:56,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:43:56,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874665694] [2024-06-27 18:43:56,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874665694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:43:56,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:43:56,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:43:56,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261070335] [2024-06-27 18:43:56,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:43:56,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:43:56,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:43:56,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:43:56,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:43:56,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:43:56,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 659 transitions, 13116 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:43:56,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:43:56,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:43:56,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:43:59,482 INFO L124 PetriNetUnfolderBase]: 5315/9977 cut-off events. [2024-06-27 18:43:59,483 INFO L125 PetriNetUnfolderBase]: For 235695/235766 co-relation queries the response was YES. [2024-06-27 18:43:59,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67710 conditions, 9977 events. 5315/9977 cut-off events. For 235695/235766 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 84699 event pairs, 1382 based on Foata normal form. 79/9756 useless extension candidates. Maximal degree in co-relation 67502. Up to 6815 conditions per place. [2024-06-27 18:43:59,657 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 468 selfloop transitions, 256 changer transitions 0/732 dead transitions. [2024-06-27 18:43:59,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 732 transitions, 15167 flow [2024-06-27 18:43:59,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:43:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:43:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-27 18:43:59,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208845208845209 [2024-06-27 18:43:59,658 INFO L175 Difference]: Start difference. First operand has 438 places, 659 transitions, 13116 flow. Second operand 11 states and 212 transitions. [2024-06-27 18:43:59,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 732 transitions, 15167 flow [2024-06-27 18:44:03,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 732 transitions, 14635 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-27 18:44:03,064 INFO L231 Difference]: Finished difference. Result has 445 places, 664 transitions, 13253 flow [2024-06-27 18:44:03,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12596, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13253, PETRI_PLACES=445, PETRI_TRANSITIONS=664} [2024-06-27 18:44:03,065 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 404 predicate places. [2024-06-27 18:44:03,065 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 664 transitions, 13253 flow [2024-06-27 18:44:03,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:44:03,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:44:03,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:44:03,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-27 18:44:03,066 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:44:03,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:44:03,066 INFO L85 PathProgramCache]: Analyzing trace with hash -684966250, now seen corresponding path program 9 times [2024-06-27 18:44:03,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:44:03,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150204846] [2024-06-27 18:44:03,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:44:03,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:44:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:44:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:44:03,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:44:03,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150204846] [2024-06-27 18:44:03,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150204846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:44:03,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:44:03,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:44:03,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11617167] [2024-06-27 18:44:03,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:44:03,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:44:03,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:44:03,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:44:03,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:44:03,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:44:03,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 664 transitions, 13253 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:44:03,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:44:03,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:44:03,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:44:07,076 INFO L124 PetriNetUnfolderBase]: 5448/10380 cut-off events. [2024-06-27 18:44:07,076 INFO L125 PetriNetUnfolderBase]: For 276499/276575 co-relation queries the response was YES. [2024-06-27 18:44:07,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69974 conditions, 10380 events. 5448/10380 cut-off events. For 276499/276575 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 89470 event pairs, 1465 based on Foata normal form. 84/10118 useless extension candidates. Maximal degree in co-relation 69763. Up to 6841 conditions per place. [2024-06-27 18:44:07,252 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 471 selfloop transitions, 262 changer transitions 0/741 dead transitions. [2024-06-27 18:44:07,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 741 transitions, 15578 flow [2024-06-27 18:44:07,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:44:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:44:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-06-27 18:44:07,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5331695331695332 [2024-06-27 18:44:07,253 INFO L175 Difference]: Start difference. First operand has 445 places, 664 transitions, 13253 flow. Second operand 11 states and 217 transitions. [2024-06-27 18:44:07,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 741 transitions, 15578 flow [2024-06-27 18:44:10,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 741 transitions, 15019 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-27 18:44:10,752 INFO L231 Difference]: Finished difference. Result has 453 places, 670 transitions, 13425 flow [2024-06-27 18:44:10,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12694, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13425, PETRI_PLACES=453, PETRI_TRANSITIONS=670} [2024-06-27 18:44:10,755 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 412 predicate places. [2024-06-27 18:44:10,756 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 670 transitions, 13425 flow [2024-06-27 18:44:10,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:44:10,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:44:10,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:44:10,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-27 18:44:10,756 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:44:10,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:44:10,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1351956080, now seen corresponding path program 10 times [2024-06-27 18:44:10,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:44:10,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139207806] [2024-06-27 18:44:10,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:44:10,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:44:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:44:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:44:11,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:44:11,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139207806] [2024-06-27 18:44:11,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139207806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:44:11,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:44:11,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:44:11,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033672521] [2024-06-27 18:44:11,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:44:11,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:44:11,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:44:11,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:44:11,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:44:11,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:44:11,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 670 transitions, 13425 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:44:11,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:44:11,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:44:11,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:44:14,604 INFO L124 PetriNetUnfolderBase]: 5450/10389 cut-off events. [2024-06-27 18:44:14,604 INFO L125 PetriNetUnfolderBase]: For 246302/246376 co-relation queries the response was YES. [2024-06-27 18:44:14,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69460 conditions, 10389 events. 5450/10389 cut-off events. For 246302/246376 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 89677 event pairs, 1492 based on Foata normal form. 82/10123 useless extension candidates. Maximal degree in co-relation 69244. Up to 7009 conditions per place. [2024-06-27 18:44:15,102 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 468 selfloop transitions, 263 changer transitions 0/739 dead transitions. [2024-06-27 18:44:15,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 739 transitions, 15456 flow [2024-06-27 18:44:15,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:44:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:44:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2024-06-27 18:44:15,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233415233415234 [2024-06-27 18:44:15,104 INFO L175 Difference]: Start difference. First operand has 453 places, 670 transitions, 13425 flow. Second operand 11 states and 213 transitions. [2024-06-27 18:44:15,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 739 transitions, 15456 flow [2024-06-27 18:44:18,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 739 transitions, 15068 flow, removed 57 selfloop flow, removed 4 redundant places. [2024-06-27 18:44:18,093 INFO L231 Difference]: Finished difference. Result has 462 places, 673 transitions, 13675 flow [2024-06-27 18:44:18,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13051, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13675, PETRI_PLACES=462, PETRI_TRANSITIONS=673} [2024-06-27 18:44:18,094 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 421 predicate places. [2024-06-27 18:44:18,094 INFO L495 AbstractCegarLoop]: Abstraction has has 462 places, 673 transitions, 13675 flow [2024-06-27 18:44:18,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:44:18,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:44:18,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:44:18,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-27 18:44:18,095 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:44:18,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:44:18,096 INFO L85 PathProgramCache]: Analyzing trace with hash 13645680, now seen corresponding path program 11 times [2024-06-27 18:44:18,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:44:18,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265171191] [2024-06-27 18:44:18,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:44:18,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:44:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:44:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:44:18,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:44:18,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265171191] [2024-06-27 18:44:18,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265171191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:44:18,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:44:18,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:44:18,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818068554] [2024-06-27 18:44:18,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:44:18,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:44:18,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:44:18,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:44:18,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:44:18,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:44:18,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 673 transitions, 13675 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:44:18,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:44:18,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:44:18,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:44:22,825 INFO L124 PetriNetUnfolderBase]: 5769/10901 cut-off events. [2024-06-27 18:44:22,825 INFO L125 PetriNetUnfolderBase]: For 276179/276268 co-relation queries the response was YES. [2024-06-27 18:44:23,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73437 conditions, 10901 events. 5769/10901 cut-off events. For 276179/276268 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 94514 event pairs, 1371 based on Foata normal form. 97/10722 useless extension candidates. Maximal degree in co-relation 73217. Up to 4133 conditions per place. [2024-06-27 18:44:23,133 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 317 selfloop transitions, 423 changer transitions 0/748 dead transitions. [2024-06-27 18:44:23,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 748 transitions, 15884 flow [2024-06-27 18:44:23,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:44:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:44:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 221 transitions. [2024-06-27 18:44:23,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.542997542997543 [2024-06-27 18:44:23,134 INFO L175 Difference]: Start difference. First operand has 462 places, 673 transitions, 13675 flow. Second operand 11 states and 221 transitions. [2024-06-27 18:44:23,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 748 transitions, 15884 flow [2024-06-27 18:44:26,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 748 transitions, 15299 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-27 18:44:26,410 INFO L231 Difference]: Finished difference. Result has 467 places, 676 transitions, 14120 flow [2024-06-27 18:44:26,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13094, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=420, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14120, PETRI_PLACES=467, PETRI_TRANSITIONS=676} [2024-06-27 18:44:26,411 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 426 predicate places. [2024-06-27 18:44:26,411 INFO L495 AbstractCegarLoop]: Abstraction has has 467 places, 676 transitions, 14120 flow [2024-06-27 18:44:26,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:44:26,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:44:26,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:44:26,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-27 18:44:26,412 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:44:26,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:44:26,412 INFO L85 PathProgramCache]: Analyzing trace with hash -703250546, now seen corresponding path program 12 times [2024-06-27 18:44:26,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:44:26,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176320509] [2024-06-27 18:44:26,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:44:26,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:44:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:44:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:44:27,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:44:27,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176320509] [2024-06-27 18:44:27,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176320509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:44:27,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:44:27,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:44:27,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631838232] [2024-06-27 18:44:27,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:44:27,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:44:27,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:44:27,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:44:27,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:44:27,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:44:27,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 676 transitions, 14120 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:44:27,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:44:27,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:44:27,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:44:31,273 INFO L124 PetriNetUnfolderBase]: 5865/11060 cut-off events. [2024-06-27 18:44:31,273 INFO L125 PetriNetUnfolderBase]: For 292749/292839 co-relation queries the response was YES. [2024-06-27 18:44:31,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75704 conditions, 11060 events. 5865/11060 cut-off events. For 292749/292839 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 96261 event pairs, 1480 based on Foata normal form. 100/10885 useless extension candidates. Maximal degree in co-relation 75482. Up to 6662 conditions per place. [2024-06-27 18:44:31,574 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 306 selfloop transitions, 431 changer transitions 0/745 dead transitions. [2024-06-27 18:44:31,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 745 transitions, 16076 flow [2024-06-27 18:44:31,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:44:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:44:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 216 transitions. [2024-06-27 18:44:31,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5307125307125307 [2024-06-27 18:44:31,584 INFO L175 Difference]: Start difference. First operand has 467 places, 676 transitions, 14120 flow. Second operand 11 states and 216 transitions. [2024-06-27 18:44:31,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 745 transitions, 16076 flow [2024-06-27 18:44:35,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 745 transitions, 15261 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-06-27 18:44:35,571 INFO L231 Difference]: Finished difference. Result has 469 places, 680 transitions, 14251 flow [2024-06-27 18:44:35,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13323, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=427, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14251, PETRI_PLACES=469, PETRI_TRANSITIONS=680} [2024-06-27 18:44:35,572 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 428 predicate places. [2024-06-27 18:44:35,572 INFO L495 AbstractCegarLoop]: Abstraction has has 469 places, 680 transitions, 14251 flow [2024-06-27 18:44:35,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:44:35,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:44:35,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:44:35,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-27 18:44:35,572 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:44:35,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:44:35,573 INFO L85 PathProgramCache]: Analyzing trace with hash 17220600, now seen corresponding path program 13 times [2024-06-27 18:44:35,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:44:35,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498208580] [2024-06-27 18:44:35,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:44:35,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:44:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:44:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:44:36,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:44:36,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498208580] [2024-06-27 18:44:36,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498208580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:44:36,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:44:36,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:44:36,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510719525] [2024-06-27 18:44:36,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:44:36,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:44:36,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:44:36,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:44:36,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:44:36,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:44:36,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 680 transitions, 14251 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:44:36,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:44:36,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:44:36,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:44:40,357 INFO L124 PetriNetUnfolderBase]: 5746/10873 cut-off events. [2024-06-27 18:44:40,357 INFO L125 PetriNetUnfolderBase]: For 303282/303376 co-relation queries the response was YES. [2024-06-27 18:44:40,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74103 conditions, 10873 events. 5746/10873 cut-off events. For 303282/303376 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 94242 event pairs, 1324 based on Foata normal form. 102/10677 useless extension candidates. Maximal degree in co-relation 73882. Up to 6061 conditions per place. [2024-06-27 18:44:40,501 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 321 selfloop transitions, 427 changer transitions 0/756 dead transitions. [2024-06-27 18:44:40,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 756 transitions, 16460 flow [2024-06-27 18:44:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:44:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:44:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2024-06-27 18:44:40,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5503685503685504 [2024-06-27 18:44:40,502 INFO L175 Difference]: Start difference. First operand has 469 places, 680 transitions, 14251 flow. Second operand 11 states and 224 transitions. [2024-06-27 18:44:40,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 756 transitions, 16460 flow [2024-06-27 18:44:44,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 756 transitions, 15588 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-27 18:44:44,300 INFO L231 Difference]: Finished difference. Result has 474 places, 684 transitions, 14344 flow [2024-06-27 18:44:44,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13379, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=423, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14344, PETRI_PLACES=474, PETRI_TRANSITIONS=684} [2024-06-27 18:44:44,301 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 433 predicate places. [2024-06-27 18:44:44,301 INFO L495 AbstractCegarLoop]: Abstraction has has 474 places, 684 transitions, 14344 flow [2024-06-27 18:44:44,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:44:44,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:44:44,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:44:44,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-27 18:44:44,302 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:44:44,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:44:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash -98680088, now seen corresponding path program 14 times [2024-06-27 18:44:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:44:44,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662811248] [2024-06-27 18:44:44,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:44:44,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:44:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:44:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:44:45,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:44:45,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662811248] [2024-06-27 18:44:45,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662811248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:44:45,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:44:45,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:44:45,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139947126] [2024-06-27 18:44:45,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:44:45,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:44:45,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:44:45,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:44:45,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:44:45,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:44:45,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 684 transitions, 14344 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:44:45,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:44:45,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:44:45,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:44:49,194 INFO L124 PetriNetUnfolderBase]: 5736/10789 cut-off events. [2024-06-27 18:44:49,195 INFO L125 PetriNetUnfolderBase]: For 269472/269566 co-relation queries the response was YES. [2024-06-27 18:44:49,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73302 conditions, 10789 events. 5736/10789 cut-off events. For 269472/269566 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 93181 event pairs, 1308 based on Foata normal form. 102/10613 useless extension candidates. Maximal degree in co-relation 73078. Up to 6237 conditions per place. [2024-06-27 18:44:49,353 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 316 selfloop transitions, 429 changer transitions 0/753 dead transitions. [2024-06-27 18:44:49,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 753 transitions, 16268 flow [2024-06-27 18:44:49,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:44:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:44:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2024-06-27 18:44:49,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-06-27 18:44:49,354 INFO L175 Difference]: Start difference. First operand has 474 places, 684 transitions, 14344 flow. Second operand 11 states and 220 transitions. [2024-06-27 18:44:49,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 753 transitions, 16268 flow [2024-06-27 18:44:53,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 753 transitions, 15400 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-27 18:44:53,045 INFO L231 Difference]: Finished difference. Result has 478 places, 684 transitions, 14338 flow [2024-06-27 18:44:53,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13476, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=429, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14338, PETRI_PLACES=478, PETRI_TRANSITIONS=684} [2024-06-27 18:44:53,046 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 437 predicate places. [2024-06-27 18:44:53,046 INFO L495 AbstractCegarLoop]: Abstraction has has 478 places, 684 transitions, 14338 flow [2024-06-27 18:44:53,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:44:53,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:44:53,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:44:53,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-27 18:44:53,046 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:44:53,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:44:53,047 INFO L85 PathProgramCache]: Analyzing trace with hash 45216022, now seen corresponding path program 15 times [2024-06-27 18:44:53,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:44:53,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086166409] [2024-06-27 18:44:53,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:44:53,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:44:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:44:53,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-06-27 18:44:53,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:44:53,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086166409] [2024-06-27 18:44:53,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086166409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:44:53,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:44:53,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:44:53,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201575277] [2024-06-27 18:44:53,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:44:53,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:44:53,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:44:53,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:44:53,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:44:54,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:44:54,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 684 transitions, 14338 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:44:54,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:44:54,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:44:54,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:44:57,977 INFO L124 PetriNetUnfolderBase]: 5826/11236 cut-off events. [2024-06-27 18:44:57,977 INFO L125 PetriNetUnfolderBase]: For 291093/291164 co-relation queries the response was YES. [2024-06-27 18:44:58,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74599 conditions, 11236 events. 5826/11236 cut-off events. For 291093/291164 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 100314 event pairs, 1791 based on Foata normal form. 81/10922 useless extension candidates. Maximal degree in co-relation 74374. Up to 8130 conditions per place. [2024-06-27 18:44:58,147 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 506 selfloop transitions, 242 changer transitions 0/756 dead transitions. [2024-06-27 18:44:58,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 756 transitions, 16331 flow [2024-06-27 18:44:58,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:44:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:44:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2024-06-27 18:44:58,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067567567567568 [2024-06-27 18:44:58,149 INFO L175 Difference]: Start difference. First operand has 478 places, 684 transitions, 14338 flow. Second operand 12 states and 225 transitions. [2024-06-27 18:44:58,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 756 transitions, 16331 flow [2024-06-27 18:45:01,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 756 transitions, 15471 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 18:45:01,614 INFO L231 Difference]: Finished difference. Result has 482 places, 687 transitions, 14033 flow [2024-06-27 18:45:01,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13482, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14033, PETRI_PLACES=482, PETRI_TRANSITIONS=687} [2024-06-27 18:45:01,615 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 441 predicate places. [2024-06-27 18:45:01,615 INFO L495 AbstractCegarLoop]: Abstraction has has 482 places, 687 transitions, 14033 flow [2024-06-27 18:45:01,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:45:01,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:45:01,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:45:01,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-27 18:45:01,616 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:45:01,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:45:01,616 INFO L85 PathProgramCache]: Analyzing trace with hash 45210442, now seen corresponding path program 16 times [2024-06-27 18:45:01,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:45:01,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646991601] [2024-06-27 18:45:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:45:01,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:45:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:45:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:45:02,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:45:02,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646991601] [2024-06-27 18:45:02,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646991601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:45:02,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:45:02,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:45:02,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905921645] [2024-06-27 18:45:02,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:45:02,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:45:02,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:45:02,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:45:02,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:45:02,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 18:45:02,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 687 transitions, 14033 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:45:02,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:45:02,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 18:45:02,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:45:06,390 INFO L124 PetriNetUnfolderBase]: 5878/11191 cut-off events. [2024-06-27 18:45:06,390 INFO L125 PetriNetUnfolderBase]: For 277666/277737 co-relation queries the response was YES. [2024-06-27 18:45:06,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73982 conditions, 11191 events. 5878/11191 cut-off events. For 277666/277737 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 98675 event pairs, 1765 based on Foata normal form. 79/10919 useless extension candidates. Maximal degree in co-relation 73755. Up to 7898 conditions per place. [2024-06-27 18:45:06,546 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 508 selfloop transitions, 236 changer transitions 0/752 dead transitions. [2024-06-27 18:45:06,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 752 transitions, 15946 flow [2024-06-27 18:45:06,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:45:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:45:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-27 18:45:06,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208845208845209 [2024-06-27 18:45:06,547 INFO L175 Difference]: Start difference. First operand has 482 places, 687 transitions, 14033 flow. Second operand 11 states and 212 transitions. [2024-06-27 18:45:06,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 752 transitions, 15946 flow [2024-06-27 18:45:09,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 752 transitions, 15475 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-27 18:45:09,857 INFO L231 Difference]: Finished difference. Result has 484 places, 687 transitions, 14037 flow [2024-06-27 18:45:09,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13562, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14037, PETRI_PLACES=484, PETRI_TRANSITIONS=687} [2024-06-27 18:45:09,857 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 443 predicate places. [2024-06-27 18:45:09,857 INFO L495 AbstractCegarLoop]: Abstraction has has 484 places, 687 transitions, 14037 flow [2024-06-27 18:45:09,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:45:09,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:45:09,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:45:09,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-27 18:45:09,858 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:45:09,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:45:09,858 INFO L85 PathProgramCache]: Analyzing trace with hash 39703912, now seen corresponding path program 17 times [2024-06-27 18:45:09,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:45:09,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118814947] [2024-06-27 18:45:09,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:45:09,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:45:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat