./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/szymanski.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/szymanski.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-atomic/szymanski.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/szymanski.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 10:33:54,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 10:33:54,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 10:33:54,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 10:33:54,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 10:33:54,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 10:33:54,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 10:33:54,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 10:33:54,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 10:33:54,768 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 10:33:54,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 10:33:54,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 10:33:54,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 10:33:54,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 10:33:54,771 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 10:33:54,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 10:33:54,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 10:33:54,771 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 10:33:54,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 10:33:54,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 10:33:54,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 10:33:54,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 10:33:54,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 10:33:54,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 10:33:54,773 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 10:33:54,774 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 10:33:54,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 10:33:54,774 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 10:33:54,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 10:33:54,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 10:33:54,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 10:33:54,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 10:33:54,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 10:33:54,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 10:33:54,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 10:33:54,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 10:33:54,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 10:33:54,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 10:33:54,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 10:33:54,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 10:33:54,784 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 10:33:54,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 10:33:54,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 10:33:54,784 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 10:33:55,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 10:33:55,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 10:33:55,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 10:33:55,033 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 10:33:55,034 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 10:33:55,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/szymanski.yml/witness.yml [2024-05-12 10:33:55,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 10:33:55,132 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 10:33:55,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/szymanski.i [2024-05-12 10:33:56,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 10:33:56,487 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 10:33:56,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i [2024-05-12 10:33:56,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3089f5c77/315fe0525a1f49b9a072d0d8095f36f0/FLAG1c0c3c435 [2024-05-12 10:33:56,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3089f5c77/315fe0525a1f49b9a072d0d8095f36f0 [2024-05-12 10:33:56,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 10:33:56,523 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 10:33:56,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 10:33:56,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 10:33:56,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 10:33:56,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:33:55" (1/2) ... [2024-05-12 10:33:56,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cddfc84 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 10:33:56, skipping insertion in model container [2024-05-12 10:33:56,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:33:55" (1/2) ... [2024-05-12 10:33:56,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5b11488a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 10:33:56, skipping insertion in model container [2024-05-12 10:33:56,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 10:33:56" (2/2) ... [2024-05-12 10:33:56,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cddfc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:56, skipping insertion in model container [2024-05-12 10:33:56,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 10:33:56" (2/2) ... [2024-05-12 10:33:56,535 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 10:33:56,576 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 10:33:56,577 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] ((((! multithreaded || ((4LL - (long long )flag1) + (long long )flag2 >= 0LL && (long long )flag1 + (long long )flag2 >= 0LL)) && (! multithreaded || (((((((0 <= flag1 && 0 <= flag2) && flag1 <= 4) && flag1 <= 127) && flag2 <= 4) && flag2 <= 127) && ((((flag1 == 0 || flag1 == 1) || flag1 == 2) || flag1 == 3) || flag1 == 4)) && ((((flag2 == 0 || flag2 == 1) || flag2 == 2) || flag2 == 3) || flag2 == 4)))) && (! multithreaded || (((0 <= flag1 && flag1 <= 4) && flag1 <= 127) && ((((flag1 == 0 || flag1 == 1) || flag1 == 2) || flag1 == 3) || flag1 == 4)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((0 <= flag2 && flag2 <= 4) && flag2 <= 127) && ((((flag2 == 0 || flag2 == 1) || flag2 == 2) || flag2 == 3) || flag2 == 4))) [2024-05-12 10:33:56,577 INFO L97 edCorrectnessWitness]: Location invariant before [L820-L820] ((((! multithreaded || ((4LL - (long long )flag1) + (long long )flag2 >= 0LL && (long long )flag1 + (long long )flag2 >= 0LL)) && (! multithreaded || (((((((0 <= flag1 && 0 <= flag2) && flag1 <= 4) && flag1 <= 127) && flag2 <= 4) && flag2 <= 127) && ((((flag1 == 0 || flag1 == 1) || flag1 == 2) || flag1 == 3) || flag1 == 4)) && ((((flag2 == 0 || flag2 == 1) || flag2 == 2) || flag2 == 3) || flag2 == 4)))) && (! multithreaded || (((0 <= flag1 && flag1 <= 4) && flag1 <= 127) && ((((flag1 == 0 || flag1 == 1) || flag1 == 2) || flag1 == 3) || flag1 == 4)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((0 <= flag2 && flag2 <= 4) && flag2 <= 127) && ((((flag2 == 0 || flag2 == 1) || flag2 == 2) || flag2 == 3) || flag2 == 4))) [2024-05-12 10:33:56,577 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 10:33:56,577 INFO L106 edCorrectnessWitness]: ghost_update [L818-L818] multithreaded = 1; [2024-05-12 10:33:56,620 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 10:33:56,967 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[31505,31518] [2024-05-12 10:33:56,979 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[32915,32928] [2024-05-12 10:33:56,989 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 10:33:56,996 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 10:33:57,068 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[31505,31518] [2024-05-12 10:33:57,078 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[32915,32928] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 10:33:57,103 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 10:33:57,164 INFO L206 MainTranslator]: Completed translation [2024-05-12 10:33:57,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:57 WrapperNode [2024-05-12 10:33:57,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 10:33:57,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 10:33:57,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 10:33:57,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 10:33:57,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:57" (1/1) ... [2024-05-12 10:33:57,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:57" (1/1) ... [2024-05-12 10:33:57,224 INFO L138 Inliner]: procedures = 170, calls = 74, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2024-05-12 10:33:57,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 10:33:57,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 10:33:57,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 10:33:57,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 10:33:57,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:57" (1/1) ... [2024-05-12 10:33:57,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:57" (1/1) ... [2024-05-12 10:33:57,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:57" (1/1) ... [2024-05-12 10:33:57,259 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 10:33:57,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:57" (1/1) ... [2024-05-12 10:33:57,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:57" (1/1) ... [2024-05-12 10:33:57,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:57" (1/1) ... [2024-05-12 10:33:57,275 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:57" (1/1) ... [2024-05-12 10:33:57,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:57" (1/1) ... [2024-05-12 10:33:57,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:57" (1/1) ... [2024-05-12 10:33:57,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 10:33:57,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 10:33:57,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 10:33:57,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 10:33:57,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:57" (1/1) ... [2024-05-12 10:33:57,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 10:33:57,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:33:57,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-05-12 10:33:57,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-05-12 10:33:57,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 10:33:57,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 10:33:57,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 10:33:57,349 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-05-12 10:33:57,349 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-05-12 10:33:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-05-12 10:33:57,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-05-12 10:33:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 10:33:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 10:33:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 10:33:57,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 10:33:57,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 10:33:57,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 10:33:57,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 10:33:57,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 10:33:57,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 10:33:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 10:33:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 10:33:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 10:33:57,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 10:33:57,354 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 10:33:57,471 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 10:33:57,473 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 10:33:57,723 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 10:33:57,723 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 10:33:57,795 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 10:33:57,795 INFO L320 CfgBuilder]: Removed 8 assume(true) statements. [2024-05-12 10:33:57,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 10:33:57 BoogieIcfgContainer [2024-05-12 10:33:57,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 10:33:57,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 10:33:57,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 10:33:57,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 10:33:57,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:33:55" (1/4) ... [2024-05-12 10:33:57,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1529079e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 10:33:57, skipping insertion in model container [2024-05-12 10:33:57,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 10:33:56" (2/4) ... [2024-05-12 10:33:57,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1529079e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 10:33:57, skipping insertion in model container [2024-05-12 10:33:57,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:57" (3/4) ... [2024-05-12 10:33:57,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1529079e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 10:33:57, skipping insertion in model container [2024-05-12 10:33:57,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 10:33:57" (4/4) ... [2024-05-12 10:33:57,803 INFO L112 eAbstractionObserver]: Analyzing ICFG szymanski.i [2024-05-12 10:33:57,819 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 10:33:57,819 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 10:33:57,819 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 10:33:57,880 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-12 10:33:57,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 77 transitions, 168 flow [2024-05-12 10:33:57,974 INFO L124 PetriNetUnfolderBase]: 12/75 cut-off events. [2024-05-12 10:33:57,975 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-05-12 10:33:57,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 12/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 143 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2024-05-12 10:33:57,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 77 transitions, 168 flow [2024-05-12 10:33:57,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 73 transitions, 155 flow [2024-05-12 10:33:57,997 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 10:33:58,009 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;@590d3282, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 10:33:58,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-05-12 10:33:58,016 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 10:33:58,017 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-05-12 10:33:58,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 10:33:58,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:58,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 10:33:58,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:58,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:58,025 INFO L85 PathProgramCache]: Analyzing trace with hash 529858989, now seen corresponding path program 1 times [2024-05-12 10:33:58,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:58,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621976811] [2024-05-12 10:33:58,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:58,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:58,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:58,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621976811] [2024-05-12 10:33:58,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621976811] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:58,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:58,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 10:33:58,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050770142] [2024-05-12 10:33:58,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:58,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 10:33:58,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:58,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 10:33:58,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 10:33:58,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 77 [2024-05-12 10:33:58,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 73 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:33:58,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:58,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 77 [2024-05-12 10:33:58,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:59,020 INFO L124 PetriNetUnfolderBase]: 1003/2144 cut-off events. [2024-05-12 10:33:59,021 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-05-12 10:33:59,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3521 conditions, 2144 events. 1003/2144 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 14116 event pairs, 456 based on Foata normal form. 90/2037 useless extension candidates. Maximal degree in co-relation 3411. Up to 1333 conditions per place. [2024-05-12 10:33:59,044 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 37 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2024-05-12 10:33:59,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 78 transitions, 248 flow [2024-05-12 10:33:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 10:33:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 10:33:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2024-05-12 10:33:59,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.70995670995671 [2024-05-12 10:33:59,061 INFO L175 Difference]: Start difference. First operand has 68 places, 73 transitions, 155 flow. Second operand 3 states and 164 transitions. [2024-05-12 10:33:59,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 78 transitions, 248 flow [2024-05-12 10:33:59,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 78 transitions, 242 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 10:33:59,071 INFO L231 Difference]: Finished difference. Result has 68 places, 73 transitions, 167 flow [2024-05-12 10:33:59,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=68, PETRI_TRANSITIONS=73} [2024-05-12 10:33:59,076 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2024-05-12 10:33:59,076 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 73 transitions, 167 flow [2024-05-12 10:33:59,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:33:59,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:59,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:59,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 10:33:59,077 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:59,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:59,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1904652792, now seen corresponding path program 1 times [2024-05-12 10:33:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:59,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850492468] [2024-05-12 10:33:59,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:59,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:59,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:59,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850492468] [2024-05-12 10:33:59,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850492468] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:59,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:59,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:33:59,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556022034] [2024-05-12 10:33:59,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:59,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:33:59,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:59,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:33:59,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:33:59,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 77 [2024-05-12 10:33:59,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 73 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:33:59,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:59,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 77 [2024-05-12 10:33:59,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:59,599 INFO L124 PetriNetUnfolderBase]: 1073/2300 cut-off events. [2024-05-12 10:33:59,600 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2024-05-12 10:33:59,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3978 conditions, 2300 events. 1073/2300 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 15400 event pairs, 183 based on Foata normal form. 12/2235 useless extension candidates. Maximal degree in co-relation 2977. Up to 1275 conditions per place. [2024-05-12 10:33:59,619 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 50 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2024-05-12 10:33:59,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 93 transitions, 326 flow [2024-05-12 10:33:59,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 10:33:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 10:33:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2024-05-12 10:33:59,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6948051948051948 [2024-05-12 10:33:59,628 INFO L175 Difference]: Start difference. First operand has 68 places, 73 transitions, 167 flow. Second operand 4 states and 214 transitions. [2024-05-12 10:33:59,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 93 transitions, 326 flow [2024-05-12 10:33:59,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 93 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 10:33:59,632 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 198 flow [2024-05-12 10:33:59,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2024-05-12 10:33:59,637 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 4 predicate places. [2024-05-12 10:33:59,637 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 198 flow [2024-05-12 10:33:59,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:33:59,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:59,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:59,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 10:33:59,639 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:59,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:59,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1222812464, now seen corresponding path program 1 times [2024-05-12 10:33:59,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:59,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019020446] [2024-05-12 10:33:59,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:59,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:59,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:59,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019020446] [2024-05-12 10:33:59,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019020446] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:59,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:59,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:33:59,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548343140] [2024-05-12 10:33:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:59,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:33:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:59,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:33:59,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:33:59,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 77 [2024-05-12 10:33:59,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:33:59,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:59,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 77 [2024-05-12 10:33:59,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:00,143 INFO L124 PetriNetUnfolderBase]: 1079/2342 cut-off events. [2024-05-12 10:34:00,143 INFO L125 PetriNetUnfolderBase]: For 613/613 co-relation queries the response was YES. [2024-05-12 10:34:00,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4309 conditions, 2342 events. 1079/2342 cut-off events. For 613/613 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 15760 event pairs, 185 based on Foata normal form. 2/2273 useless extension candidates. Maximal degree in co-relation 3373. Up to 1274 conditions per place. [2024-05-12 10:34:00,162 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 50 selfloop transitions, 8 changer transitions 0/95 dead transitions. [2024-05-12 10:34:00,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 95 transitions, 366 flow [2024-05-12 10:34:00,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 10:34:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 10:34:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2024-05-12 10:34:00,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6948051948051948 [2024-05-12 10:34:00,164 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 198 flow. Second operand 4 states and 214 transitions. [2024-05-12 10:34:00,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 95 transitions, 366 flow [2024-05-12 10:34:00,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 95 transitions, 359 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 10:34:00,167 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 230 flow [2024-05-12 10:34:00,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2024-05-12 10:34:00,168 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2024-05-12 10:34:00,168 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 230 flow [2024-05-12 10:34:00,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:00,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:00,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:00,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 10:34:00,169 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:00,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1230041169, now seen corresponding path program 1 times [2024-05-12 10:34:00,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:00,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599296958] [2024-05-12 10:34:00,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:00,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:00,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599296958] [2024-05-12 10:34:00,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599296958] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:00,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:00,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:34:00,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338199062] [2024-05-12 10:34:00,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:00,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:34:00,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:00,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:34:00,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:34:00,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 77 [2024-05-12 10:34:00,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:00,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:00,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 77 [2024-05-12 10:34:00,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:00,596 INFO L124 PetriNetUnfolderBase]: 1068/2213 cut-off events. [2024-05-12 10:34:00,596 INFO L125 PetriNetUnfolderBase]: For 1159/1171 co-relation queries the response was YES. [2024-05-12 10:34:00,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4468 conditions, 2213 events. 1068/2213 cut-off events. For 1159/1171 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 14522 event pairs, 377 based on Foata normal form. 2/2143 useless extension candidates. Maximal degree in co-relation 4184. Up to 1391 conditions per place. [2024-05-12 10:34:00,614 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 50 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2024-05-12 10:34:00,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 94 transitions, 388 flow [2024-05-12 10:34:00,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 10:34:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 10:34:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2024-05-12 10:34:00,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6753246753246753 [2024-05-12 10:34:00,616 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 230 flow. Second operand 4 states and 208 transitions. [2024-05-12 10:34:00,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 94 transitions, 388 flow [2024-05-12 10:34:00,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 94 transitions, 381 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 10:34:00,623 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 266 flow [2024-05-12 10:34:00,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2024-05-12 10:34:00,625 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2024-05-12 10:34:00,625 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 266 flow [2024-05-12 10:34:00,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:00,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:00,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:00,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 10:34:00,626 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:00,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:00,626 INFO L85 PathProgramCache]: Analyzing trace with hash -486184518, now seen corresponding path program 1 times [2024-05-12 10:34:00,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:00,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039120447] [2024-05-12 10:34:00,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:00,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:00,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:00,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039120447] [2024-05-12 10:34:00,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039120447] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:00,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:00,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:00,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386100154] [2024-05-12 10:34:00,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:00,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:00,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:00,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:00,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:00,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:00,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 266 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:00,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:00,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:00,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:01,100 INFO L124 PetriNetUnfolderBase]: 1216/2457 cut-off events. [2024-05-12 10:34:01,101 INFO L125 PetriNetUnfolderBase]: For 2066/2066 co-relation queries the response was YES. [2024-05-12 10:34:01,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5368 conditions, 2457 events. 1216/2457 cut-off events. For 2066/2066 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 15941 event pairs, 398 based on Foata normal form. 62/2441 useless extension candidates. Maximal degree in co-relation 3988. Up to 912 conditions per place. [2024-05-12 10:34:01,119 INFO L140 encePairwiseOnDemand]: 67/77 looper letters, 68 selfloop transitions, 13 changer transitions 0/117 dead transitions. [2024-05-12 10:34:01,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 117 transitions, 531 flow [2024-05-12 10:34:01,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 265 transitions. [2024-05-12 10:34:01,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6883116883116883 [2024-05-12 10:34:01,122 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 266 flow. Second operand 5 states and 265 transitions. [2024-05-12 10:34:01,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 117 transitions, 531 flow [2024-05-12 10:34:01,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 529 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-05-12 10:34:01,127 INFO L231 Difference]: Finished difference. Result has 86 places, 87 transitions, 338 flow [2024-05-12 10:34:01,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=338, PETRI_PLACES=86, PETRI_TRANSITIONS=87} [2024-05-12 10:34:01,128 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 18 predicate places. [2024-05-12 10:34:01,128 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 87 transitions, 338 flow [2024-05-12 10:34:01,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:01,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:01,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:01,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 10:34:01,129 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:01,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:01,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1003376022, now seen corresponding path program 2 times [2024-05-12 10:34:01,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:01,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757506551] [2024-05-12 10:34:01,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:01,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:01,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757506551] [2024-05-12 10:34:01,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757506551] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:01,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:01,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:01,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126085099] [2024-05-12 10:34:01,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:01,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:01,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:01,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:01,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:01,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:01,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 87 transitions, 338 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:01,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:01,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:01,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:01,588 INFO L124 PetriNetUnfolderBase]: 1247/2536 cut-off events. [2024-05-12 10:34:01,588 INFO L125 PetriNetUnfolderBase]: For 3398/3410 co-relation queries the response was YES. [2024-05-12 10:34:01,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5991 conditions, 2536 events. 1247/2536 cut-off events. For 3398/3410 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 16375 event pairs, 331 based on Foata normal form. 16/2477 useless extension candidates. Maximal degree in co-relation 5300. Up to 830 conditions per place. [2024-05-12 10:34:01,605 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 70 selfloop transitions, 15 changer transitions 0/121 dead transitions. [2024-05-12 10:34:01,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 121 transitions, 617 flow [2024-05-12 10:34:01,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 265 transitions. [2024-05-12 10:34:01,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6883116883116883 [2024-05-12 10:34:01,607 INFO L175 Difference]: Start difference. First operand has 86 places, 87 transitions, 338 flow. Second operand 5 states and 265 transitions. [2024-05-12 10:34:01,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 121 transitions, 617 flow [2024-05-12 10:34:01,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 121 transitions, 603 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-05-12 10:34:01,613 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 374 flow [2024-05-12 10:34:01,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2024-05-12 10:34:01,614 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 22 predicate places. [2024-05-12 10:34:01,614 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 374 flow [2024-05-12 10:34:01,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:01,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:01,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:01,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 10:34:01,615 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:01,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:01,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1195880781, now seen corresponding path program 1 times [2024-05-12 10:34:01,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:01,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040760623] [2024-05-12 10:34:01,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:01,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:01,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:01,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040760623] [2024-05-12 10:34:01,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040760623] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:01,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:01,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:01,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590643527] [2024-05-12 10:34:01,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:01,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:34:01,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:01,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:34:01,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:34:01,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 77 [2024-05-12 10:34:01,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 374 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:01,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:01,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 77 [2024-05-12 10:34:01,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:02,144 INFO L124 PetriNetUnfolderBase]: 2020/4393 cut-off events. [2024-05-12 10:34:02,144 INFO L125 PetriNetUnfolderBase]: For 3285/3323 co-relation queries the response was YES. [2024-05-12 10:34:02,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8980 conditions, 4393 events. 2020/4393 cut-off events. For 3285/3323 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 33189 event pairs, 418 based on Foata normal form. 82/4215 useless extension candidates. Maximal degree in co-relation 8791. Up to 1518 conditions per place. [2024-05-12 10:34:02,171 INFO L140 encePairwiseOnDemand]: 60/77 looper letters, 88 selfloop transitions, 20 changer transitions 2/150 dead transitions. [2024-05-12 10:34:02,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 150 transitions, 772 flow [2024-05-12 10:34:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 276 transitions. [2024-05-12 10:34:02,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7168831168831169 [2024-05-12 10:34:02,173 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 374 flow. Second operand 5 states and 276 transitions. [2024-05-12 10:34:02,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 150 transitions, 772 flow [2024-05-12 10:34:02,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 150 transitions, 735 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-05-12 10:34:02,181 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 495 flow [2024-05-12 10:34:02,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=495, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2024-05-12 10:34:02,182 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 27 predicate places. [2024-05-12 10:34:02,183 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 495 flow [2024-05-12 10:34:02,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:02,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:02,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:02,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 10:34:02,183 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:02,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:02,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1122070807, now seen corresponding path program 1 times [2024-05-12 10:34:02,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:02,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039053723] [2024-05-12 10:34:02,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:02,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:02,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:02,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039053723] [2024-05-12 10:34:02,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039053723] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:02,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:02,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:34:02,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888884322] [2024-05-12 10:34:02,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:02,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:34:02,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:02,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:34:02,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:34:02,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 77 [2024-05-12 10:34:02,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 495 flow. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:02,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:02,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 77 [2024-05-12 10:34:02,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:02,730 INFO L124 PetriNetUnfolderBase]: 1997/4122 cut-off events. [2024-05-12 10:34:02,730 INFO L125 PetriNetUnfolderBase]: For 7438/7478 co-relation queries the response was YES. [2024-05-12 10:34:02,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10387 conditions, 4122 events. 1997/4122 cut-off events. For 7438/7478 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 30015 event pairs, 696 based on Foata normal form. 6/3993 useless extension candidates. Maximal degree in co-relation 9692. Up to 2647 conditions per place. [2024-05-12 10:34:02,767 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 59 selfloop transitions, 9 changer transitions 0/118 dead transitions. [2024-05-12 10:34:02,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 118 transitions, 689 flow [2024-05-12 10:34:02,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 10:34:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 10:34:02,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2024-05-12 10:34:02,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.685064935064935 [2024-05-12 10:34:02,770 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 495 flow. Second operand 4 states and 211 transitions. [2024-05-12 10:34:02,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 118 transitions, 689 flow [2024-05-12 10:34:02,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 118 transitions, 689 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-05-12 10:34:02,781 INFO L231 Difference]: Finished difference. Result has 99 places, 104 transitions, 535 flow [2024-05-12 10:34:02,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=535, PETRI_PLACES=99, PETRI_TRANSITIONS=104} [2024-05-12 10:34:02,784 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 31 predicate places. [2024-05-12 10:34:02,784 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 104 transitions, 535 flow [2024-05-12 10:34:02,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:02,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:02,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:02,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 10:34:02,785 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:02,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:02,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2080507943, now seen corresponding path program 1 times [2024-05-12 10:34:02,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:02,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422467916] [2024-05-12 10:34:02,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:02,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:02,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:02,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422467916] [2024-05-12 10:34:02,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422467916] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:02,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:02,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:34:02,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328558714] [2024-05-12 10:34:02,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:02,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:34:02,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:02,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:34:02,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:34:02,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 77 [2024-05-12 10:34:02,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 104 transitions, 535 flow. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:02,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:02,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 77 [2024-05-12 10:34:02,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:03,411 INFO L124 PetriNetUnfolderBase]: 2033/4164 cut-off events. [2024-05-12 10:34:03,411 INFO L125 PetriNetUnfolderBase]: For 10273/10309 co-relation queries the response was YES. [2024-05-12 10:34:03,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11164 conditions, 4164 events. 2033/4164 cut-off events. For 10273/10309 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 29712 event pairs, 786 based on Foata normal form. 1/4017 useless extension candidates. Maximal degree in co-relation 10916. Up to 2789 conditions per place. [2024-05-12 10:34:03,440 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 59 selfloop transitions, 9 changer transitions 0/118 dead transitions. [2024-05-12 10:34:03,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 118 transitions, 723 flow [2024-05-12 10:34:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 10:34:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 10:34:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2024-05-12 10:34:03,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-05-12 10:34:03,442 INFO L175 Difference]: Start difference. First operand has 99 places, 104 transitions, 535 flow. Second operand 4 states and 209 transitions. [2024-05-12 10:34:03,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 118 transitions, 723 flow [2024-05-12 10:34:03,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 118 transitions, 714 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 10:34:03,452 INFO L231 Difference]: Finished difference. Result has 102 places, 107 transitions, 568 flow [2024-05-12 10:34:03,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=568, PETRI_PLACES=102, PETRI_TRANSITIONS=107} [2024-05-12 10:34:03,453 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 34 predicate places. [2024-05-12 10:34:03,454 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 107 transitions, 568 flow [2024-05-12 10:34:03,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:03,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:03,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:03,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 10:34:03,457 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:03,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash 369489132, now seen corresponding path program 1 times [2024-05-12 10:34:03,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:03,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503948152] [2024-05-12 10:34:03,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:03,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:03,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503948152] [2024-05-12 10:34:03,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503948152] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:03,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:03,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:03,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299031313] [2024-05-12 10:34:03,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:03,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:03,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:03,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:03,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:03,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:03,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 107 transitions, 568 flow. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:03,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:03,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:03,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:04,186 INFO L124 PetriNetUnfolderBase]: 2168/4501 cut-off events. [2024-05-12 10:34:04,187 INFO L125 PetriNetUnfolderBase]: For 12389/12449 co-relation queries the response was YES. [2024-05-12 10:34:04,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12226 conditions, 4501 events. 2168/4501 cut-off events. For 12389/12449 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 33028 event pairs, 720 based on Foata normal form. 4/4355 useless extension candidates. Maximal degree in co-relation 11409. Up to 1567 conditions per place. [2024-05-12 10:34:04,221 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 77 selfloop transitions, 17 changer transitions 0/142 dead transitions. [2024-05-12 10:34:04,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 142 transitions, 902 flow [2024-05-12 10:34:04,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2024-05-12 10:34:04,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-05-12 10:34:04,227 INFO L175 Difference]: Start difference. First operand has 102 places, 107 transitions, 568 flow. Second operand 5 states and 264 transitions. [2024-05-12 10:34:04,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 142 transitions, 902 flow [2024-05-12 10:34:04,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 142 transitions, 894 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 10:34:04,245 INFO L231 Difference]: Finished difference. Result has 107 places, 113 transitions, 649 flow [2024-05-12 10:34:04,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=649, PETRI_PLACES=107, PETRI_TRANSITIONS=113} [2024-05-12 10:34:04,247 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 39 predicate places. [2024-05-12 10:34:04,247 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 113 transitions, 649 flow [2024-05-12 10:34:04,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:04,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:04,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:04,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 10:34:04,248 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:04,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:04,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1482637032, now seen corresponding path program 2 times [2024-05-12 10:34:04,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:04,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804839047] [2024-05-12 10:34:04,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:04,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:04,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:04,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804839047] [2024-05-12 10:34:04,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804839047] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:04,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:04,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:04,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204784958] [2024-05-12 10:34:04,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:04,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:04,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:04,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:04,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:04,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:04,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 113 transitions, 649 flow. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:04,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:04,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:04,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:04,975 INFO L124 PetriNetUnfolderBase]: 2227/4432 cut-off events. [2024-05-12 10:34:04,975 INFO L125 PetriNetUnfolderBase]: For 16891/16980 co-relation queries the response was YES. [2024-05-12 10:34:04,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13521 conditions, 4432 events. 2227/4432 cut-off events. For 16891/16980 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 31406 event pairs, 651 based on Foata normal form. 4/4291 useless extension candidates. Maximal degree in co-relation 12729. Up to 1422 conditions per place. [2024-05-12 10:34:05,015 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 76 selfloop transitions, 22 changer transitions 0/146 dead transitions. [2024-05-12 10:34:05,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 146 transitions, 995 flow [2024-05-12 10:34:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 265 transitions. [2024-05-12 10:34:05,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6883116883116883 [2024-05-12 10:34:05,018 INFO L175 Difference]: Start difference. First operand has 107 places, 113 transitions, 649 flow. Second operand 5 states and 265 transitions. [2024-05-12 10:34:05,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 146 transitions, 995 flow [2024-05-12 10:34:05,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 146 transitions, 985 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-05-12 10:34:05,038 INFO L231 Difference]: Finished difference. Result has 112 places, 116 transitions, 717 flow [2024-05-12 10:34:05,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=717, PETRI_PLACES=112, PETRI_TRANSITIONS=116} [2024-05-12 10:34:05,039 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 44 predicate places. [2024-05-12 10:34:05,039 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 116 transitions, 717 flow [2024-05-12 10:34:05,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:05,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:05,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:05,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 10:34:05,040 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:05,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:05,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1789404810, now seen corresponding path program 1 times [2024-05-12 10:34:05,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:05,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659773373] [2024-05-12 10:34:05,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:05,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:05,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:05,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:05,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659773373] [2024-05-12 10:34:05,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659773373] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:05,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:05,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:05,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636751989] [2024-05-12 10:34:05,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:05,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:05,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:05,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:05,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:05,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:05,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 116 transitions, 717 flow. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:05,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:05,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:05,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:05,706 INFO L124 PetriNetUnfolderBase]: 2170/4426 cut-off events. [2024-05-12 10:34:05,706 INFO L125 PetriNetUnfolderBase]: For 20004/20056 co-relation queries the response was YES. [2024-05-12 10:34:05,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13576 conditions, 4426 events. 2170/4426 cut-off events. For 20004/20056 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 32118 event pairs, 710 based on Foata normal form. 16/4286 useless extension candidates. Maximal degree in co-relation 10108. Up to 1516 conditions per place. [2024-05-12 10:34:05,741 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 80 selfloop transitions, 19 changer transitions 0/147 dead transitions. [2024-05-12 10:34:05,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 147 transitions, 1055 flow [2024-05-12 10:34:05,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 263 transitions. [2024-05-12 10:34:05,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6831168831168831 [2024-05-12 10:34:05,743 INFO L175 Difference]: Start difference. First operand has 112 places, 116 transitions, 717 flow. Second operand 5 states and 263 transitions. [2024-05-12 10:34:05,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 147 transitions, 1055 flow [2024-05-12 10:34:05,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 147 transitions, 1021 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-05-12 10:34:05,763 INFO L231 Difference]: Finished difference. Result has 115 places, 119 transitions, 752 flow [2024-05-12 10:34:05,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=752, PETRI_PLACES=115, PETRI_TRANSITIONS=119} [2024-05-12 10:34:05,764 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 47 predicate places. [2024-05-12 10:34:05,764 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 119 transitions, 752 flow [2024-05-12 10:34:05,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:05,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:05,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:05,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 10:34:05,765 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:05,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1050964128, now seen corresponding path program 2 times [2024-05-12 10:34:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:05,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3855587] [2024-05-12 10:34:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:05,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:05,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:05,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3855587] [2024-05-12 10:34:05,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3855587] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:05,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:05,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:05,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115306904] [2024-05-12 10:34:05,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:05,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:05,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:05,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:05,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:05,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:05,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 119 transitions, 752 flow. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:05,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:05,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:05,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:06,434 INFO L124 PetriNetUnfolderBase]: 2266/4680 cut-off events. [2024-05-12 10:34:06,434 INFO L125 PetriNetUnfolderBase]: For 24165/24229 co-relation queries the response was YES. [2024-05-12 10:34:06,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14816 conditions, 4680 events. 2266/4680 cut-off events. For 24165/24229 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 34373 event pairs, 727 based on Foata normal form. 14/4576 useless extension candidates. Maximal degree in co-relation 13832. Up to 1666 conditions per place. [2024-05-12 10:34:06,468 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 85 selfloop transitions, 22 changer transitions 0/155 dead transitions. [2024-05-12 10:34:06,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 155 transitions, 1151 flow [2024-05-12 10:34:06,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 266 transitions. [2024-05-12 10:34:06,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-05-12 10:34:06,470 INFO L175 Difference]: Start difference. First operand has 115 places, 119 transitions, 752 flow. Second operand 5 states and 266 transitions. [2024-05-12 10:34:06,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 155 transitions, 1151 flow [2024-05-12 10:34:06,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 155 transitions, 1122 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-05-12 10:34:06,494 INFO L231 Difference]: Finished difference. Result has 118 places, 123 transitions, 809 flow [2024-05-12 10:34:06,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=809, PETRI_PLACES=118, PETRI_TRANSITIONS=123} [2024-05-12 10:34:06,495 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 50 predicate places. [2024-05-12 10:34:06,496 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 123 transitions, 809 flow [2024-05-12 10:34:06,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:06,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:06,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:06,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 10:34:06,496 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:06,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:06,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1780555590, now seen corresponding path program 1 times [2024-05-12 10:34:06,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:06,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217909719] [2024-05-12 10:34:06,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:06,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:06,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:06,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217909719] [2024-05-12 10:34:06,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217909719] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:06,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:06,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:06,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484394538] [2024-05-12 10:34:06,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:06,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:34:06,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:06,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:34:06,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:34:06,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 77 [2024-05-12 10:34:06,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 123 transitions, 809 flow. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:06,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:06,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 77 [2024-05-12 10:34:06,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:07,232 INFO L124 PetriNetUnfolderBase]: 3454/7013 cut-off events. [2024-05-12 10:34:07,233 INFO L125 PetriNetUnfolderBase]: For 20097/20450 co-relation queries the response was YES. [2024-05-12 10:34:07,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20124 conditions, 7013 events. 3454/7013 cut-off events. For 20097/20450 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 55235 event pairs, 775 based on Foata normal form. 117/6631 useless extension candidates. Maximal degree in co-relation 19808. Up to 2775 conditions per place. [2024-05-12 10:34:07,285 INFO L140 encePairwiseOnDemand]: 60/77 looper letters, 104 selfloop transitions, 22 changer transitions 0/187 dead transitions. [2024-05-12 10:34:07,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 187 transitions, 1347 flow [2024-05-12 10:34:07,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 272 transitions. [2024-05-12 10:34:07,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7064935064935065 [2024-05-12 10:34:07,287 INFO L175 Difference]: Start difference. First operand has 118 places, 123 transitions, 809 flow. Second operand 5 states and 272 transitions. [2024-05-12 10:34:07,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 187 transitions, 1347 flow [2024-05-12 10:34:07,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 187 transitions, 1319 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-05-12 10:34:07,327 INFO L231 Difference]: Finished difference. Result has 124 places, 136 transitions, 947 flow [2024-05-12 10:34:07,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=947, PETRI_PLACES=124, PETRI_TRANSITIONS=136} [2024-05-12 10:34:07,328 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 56 predicate places. [2024-05-12 10:34:07,328 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 136 transitions, 947 flow [2024-05-12 10:34:07,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:07,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:07,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:07,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 10:34:07,329 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:07,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:07,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1574807082, now seen corresponding path program 1 times [2024-05-12 10:34:07,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:07,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149446086] [2024-05-12 10:34:07,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:07,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:07,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:07,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149446086] [2024-05-12 10:34:07,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149446086] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:07,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:07,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:34:07,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962507949] [2024-05-12 10:34:07,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:07,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:34:07,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:07,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:34:07,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:34:07,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 77 [2024-05-12 10:34:07,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 136 transitions, 947 flow. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:07,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:07,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 77 [2024-05-12 10:34:07,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:08,278 INFO L124 PetriNetUnfolderBase]: 3278/6862 cut-off events. [2024-05-12 10:34:08,279 INFO L125 PetriNetUnfolderBase]: For 44940/45068 co-relation queries the response was YES. [2024-05-12 10:34:08,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24688 conditions, 6862 events. 3278/6862 cut-off events. For 44940/45068 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 54778 event pairs, 1193 based on Foata normal form. 3/6722 useless extension candidates. Maximal degree in co-relation 24405. Up to 4548 conditions per place. [2024-05-12 10:34:08,342 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 73 selfloop transitions, 8 changer transitions 0/144 dead transitions. [2024-05-12 10:34:08,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 144 transitions, 1127 flow [2024-05-12 10:34:08,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 10:34:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 10:34:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2024-05-12 10:34:08,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6655844155844156 [2024-05-12 10:34:08,344 INFO L175 Difference]: Start difference. First operand has 124 places, 136 transitions, 947 flow. Second operand 4 states and 205 transitions. [2024-05-12 10:34:08,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 144 transitions, 1127 flow [2024-05-12 10:34:08,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 144 transitions, 1127 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-05-12 10:34:08,401 INFO L231 Difference]: Finished difference. Result has 128 places, 136 transitions, 968 flow [2024-05-12 10:34:08,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=968, PETRI_PLACES=128, PETRI_TRANSITIONS=136} [2024-05-12 10:34:08,402 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 60 predicate places. [2024-05-12 10:34:08,402 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 136 transitions, 968 flow [2024-05-12 10:34:08,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:08,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:08,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:08,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 10:34:08,403 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:08,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash 417296211, now seen corresponding path program 1 times [2024-05-12 10:34:08,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:08,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443180802] [2024-05-12 10:34:08,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:08,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:08,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:08,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443180802] [2024-05-12 10:34:08,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443180802] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:08,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:08,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:08,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596113872] [2024-05-12 10:34:08,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:08,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:08,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:08,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:08,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:08,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:08,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 136 transitions, 968 flow. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:08,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:08,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:08,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:09,313 INFO L124 PetriNetUnfolderBase]: 3478/7142 cut-off events. [2024-05-12 10:34:09,313 INFO L125 PetriNetUnfolderBase]: For 51857/52001 co-relation queries the response was YES. [2024-05-12 10:34:09,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26085 conditions, 7142 events. 3478/7142 cut-off events. For 51857/52001 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 56097 event pairs, 1111 based on Foata normal form. 16/7038 useless extension candidates. Maximal degree in co-relation 18474. Up to 2154 conditions per place. [2024-05-12 10:34:09,378 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 97 selfloop transitions, 18 changer transitions 0/175 dead transitions. [2024-05-12 10:34:09,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 175 transitions, 1424 flow [2024-05-12 10:34:09,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:09,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 266 transitions. [2024-05-12 10:34:09,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-05-12 10:34:09,381 INFO L175 Difference]: Start difference. First operand has 128 places, 136 transitions, 968 flow. Second operand 5 states and 266 transitions. [2024-05-12 10:34:09,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 175 transitions, 1424 flow [2024-05-12 10:34:09,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 175 transitions, 1394 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-05-12 10:34:09,441 INFO L231 Difference]: Finished difference. Result has 131 places, 142 transitions, 1068 flow [2024-05-12 10:34:09,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1068, PETRI_PLACES=131, PETRI_TRANSITIONS=142} [2024-05-12 10:34:09,442 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 63 predicate places. [2024-05-12 10:34:09,442 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 1068 flow [2024-05-12 10:34:09,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:09,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:09,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:09,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 10:34:09,443 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:09,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:09,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1853673149, now seen corresponding path program 2 times [2024-05-12 10:34:09,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:09,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733523728] [2024-05-12 10:34:09,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:09,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:09,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:09,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733523728] [2024-05-12 10:34:09,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733523728] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:09,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:09,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089826566] [2024-05-12 10:34:09,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:09,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:09,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:09,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:09,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:09,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:09,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 142 transitions, 1068 flow. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:09,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:09,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:09,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:10,435 INFO L124 PetriNetUnfolderBase]: 3524/7072 cut-off events. [2024-05-12 10:34:10,435 INFO L125 PetriNetUnfolderBase]: For 62338/62509 co-relation queries the response was YES. [2024-05-12 10:34:10,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27920 conditions, 7072 events. 3524/7072 cut-off events. For 62338/62509 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 54527 event pairs, 1175 based on Foata normal form. 18/6907 useless extension candidates. Maximal degree in co-relation 19731. Up to 2305 conditions per place. [2024-05-12 10:34:10,498 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 90 selfloop transitions, 26 changer transitions 0/176 dead transitions. [2024-05-12 10:34:10,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 176 transitions, 1499 flow [2024-05-12 10:34:10,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 266 transitions. [2024-05-12 10:34:10,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-05-12 10:34:10,501 INFO L175 Difference]: Start difference. First operand has 131 places, 142 transitions, 1068 flow. Second operand 5 states and 266 transitions. [2024-05-12 10:34:10,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 176 transitions, 1499 flow [2024-05-12 10:34:10,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 176 transitions, 1480 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-05-12 10:34:10,598 INFO L231 Difference]: Finished difference. Result has 136 places, 146 transitions, 1182 flow [2024-05-12 10:34:10,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1182, PETRI_PLACES=136, PETRI_TRANSITIONS=146} [2024-05-12 10:34:10,599 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 68 predicate places. [2024-05-12 10:34:10,599 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 146 transitions, 1182 flow [2024-05-12 10:34:10,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:10,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:10,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:10,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 10:34:10,600 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:10,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:10,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1820421464, now seen corresponding path program 1 times [2024-05-12 10:34:10,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:10,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164605742] [2024-05-12 10:34:10,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:10,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:10,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:10,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164605742] [2024-05-12 10:34:10,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164605742] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:10,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:10,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:10,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422183576] [2024-05-12 10:34:10,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:10,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:34:10,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:10,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:34:10,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:34:10,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 77 [2024-05-12 10:34:10,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 146 transitions, 1182 flow. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:10,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:10,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 77 [2024-05-12 10:34:10,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:11,426 INFO L124 PetriNetUnfolderBase]: 3223/6744 cut-off events. [2024-05-12 10:34:11,426 INFO L125 PetriNetUnfolderBase]: For 33570/33984 co-relation queries the response was YES. [2024-05-12 10:34:11,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23340 conditions, 6744 events. 3223/6744 cut-off events. For 33570/33984 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 53469 event pairs, 911 based on Foata normal form. 152/6622 useless extension candidates. Maximal degree in co-relation 17027. Up to 1995 conditions per place. [2024-05-12 10:34:11,462 INFO L140 encePairwiseOnDemand]: 59/77 looper letters, 94 selfloop transitions, 61 changer transitions 0/218 dead transitions. [2024-05-12 10:34:11,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 218 transitions, 1900 flow [2024-05-12 10:34:11,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 277 transitions. [2024-05-12 10:34:11,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7194805194805195 [2024-05-12 10:34:11,464 INFO L175 Difference]: Start difference. First operand has 136 places, 146 transitions, 1182 flow. Second operand 5 states and 277 transitions. [2024-05-12 10:34:11,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 218 transitions, 1900 flow [2024-05-12 10:34:11,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 218 transitions, 1858 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-05-12 10:34:11,551 INFO L231 Difference]: Finished difference. Result has 142 places, 183 transitions, 1710 flow [2024-05-12 10:34:11,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1710, PETRI_PLACES=142, PETRI_TRANSITIONS=183} [2024-05-12 10:34:11,551 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 74 predicate places. [2024-05-12 10:34:11,552 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 183 transitions, 1710 flow [2024-05-12 10:34:11,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:11,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:11,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:11,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 10:34:11,554 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:11,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:11,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1821497877, now seen corresponding path program 1 times [2024-05-12 10:34:11,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:11,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947317375] [2024-05-12 10:34:11,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:11,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:11,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:11,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947317375] [2024-05-12 10:34:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947317375] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:11,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:11,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:11,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027943459] [2024-05-12 10:34:11,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:11,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:11,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:11,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:11,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:11,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:11,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 183 transitions, 1710 flow. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:11,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:11,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:11,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:12,642 INFO L124 PetriNetUnfolderBase]: 3702/7403 cut-off events. [2024-05-12 10:34:12,643 INFO L125 PetriNetUnfolderBase]: For 83170/83452 co-relation queries the response was YES. [2024-05-12 10:34:12,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32811 conditions, 7403 events. 3702/7403 cut-off events. For 83170/83452 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 57296 event pairs, 1281 based on Foata normal form. 37/7209 useless extension candidates. Maximal degree in co-relation 23859. Up to 2588 conditions per place. [2024-05-12 10:34:12,697 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 104 selfloop transitions, 26 changer transitions 0/212 dead transitions. [2024-05-12 10:34:12,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 212 transitions, 2155 flow [2024-05-12 10:34:12,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2024-05-12 10:34:12,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-05-12 10:34:12,699 INFO L175 Difference]: Start difference. First operand has 142 places, 183 transitions, 1710 flow. Second operand 5 states and 264 transitions. [2024-05-12 10:34:12,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 212 transitions, 2155 flow [2024-05-12 10:34:12,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 212 transitions, 2113 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-05-12 10:34:12,813 INFO L231 Difference]: Finished difference. Result has 146 places, 184 transitions, 1745 flow [2024-05-12 10:34:12,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1668, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1745, PETRI_PLACES=146, PETRI_TRANSITIONS=184} [2024-05-12 10:34:12,814 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 78 predicate places. [2024-05-12 10:34:12,814 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 184 transitions, 1745 flow [2024-05-12 10:34:12,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:12,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:12,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:12,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 10:34:12,815 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:12,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:12,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1315429788, now seen corresponding path program 2 times [2024-05-12 10:34:12,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:12,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883934173] [2024-05-12 10:34:12,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:12,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:12,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:12,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883934173] [2024-05-12 10:34:12,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883934173] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:12,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:12,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:12,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739633435] [2024-05-12 10:34:12,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:12,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:12,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:12,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:12,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:12,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:12,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 184 transitions, 1745 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:12,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:12,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:12,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:13,873 INFO L124 PetriNetUnfolderBase]: 3776/7725 cut-off events. [2024-05-12 10:34:13,873 INFO L125 PetriNetUnfolderBase]: For 89790/90062 co-relation queries the response was YES. [2024-05-12 10:34:13,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33952 conditions, 7725 events. 3776/7725 cut-off events. For 89790/90062 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 60882 event pairs, 1253 based on Foata normal form. 80/7667 useless extension candidates. Maximal degree in co-relation 24707. Up to 2905 conditions per place. [2024-05-12 10:34:13,934 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 104 selfloop transitions, 31 changer transitions 0/217 dead transitions. [2024-05-12 10:34:13,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 217 transitions, 2261 flow [2024-05-12 10:34:13,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 263 transitions. [2024-05-12 10:34:13,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6831168831168831 [2024-05-12 10:34:13,936 INFO L175 Difference]: Start difference. First operand has 146 places, 184 transitions, 1745 flow. Second operand 5 states and 263 transitions. [2024-05-12 10:34:13,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 217 transitions, 2261 flow [2024-05-12 10:34:14,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 217 transitions, 2218 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-05-12 10:34:14,069 INFO L231 Difference]: Finished difference. Result has 149 places, 188 transitions, 1817 flow [2024-05-12 10:34:14,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1702, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1817, PETRI_PLACES=149, PETRI_TRANSITIONS=188} [2024-05-12 10:34:14,069 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 81 predicate places. [2024-05-12 10:34:14,069 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 188 transitions, 1817 flow [2024-05-12 10:34:14,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:14,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:14,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:14,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 10:34:14,070 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:14,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1312810908, now seen corresponding path program 3 times [2024-05-12 10:34:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:14,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87248850] [2024-05-12 10:34:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:14,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:14,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:14,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87248850] [2024-05-12 10:34:14,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87248850] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:14,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:14,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:14,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873173304] [2024-05-12 10:34:14,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:14,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:14,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:14,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:14,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:14,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:14,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 188 transitions, 1817 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:14,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:14,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:14,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:14,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L749-1-->L756: Formula: (= v_~flag1~0_11 0) InVars {} OutVars{~flag1~0=v_~flag1~0_11} AuxVars[] AssignedVars[~flag1~0][190], [Black: 127#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), Black: 188#(and (<= 3 ~flag1~0) (<= 3 thr2Thread1of1ForFork1_~f12~0)), 170#(= ~x~0 0), 32#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, thr2Thread1of1ForFork1InUse, Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 198#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), 131#(= ~x~0 0), 186#(<= 3 thr2Thread1of1ForFork1_~f12~0), Black: 140#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 204#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 77#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), 208#(= ~x~0 0), Black: 82#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 146#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 156#(= ~flag1~0 0), 90#true, Black: 88#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 152#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 19#L756true, Black: 93#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), 202#(= ~x~0 0), Black: 92#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 157#(= thr2Thread1of1ForFork1_~f12~0 0), Black: 159#(and (= ~flag1~0 0) (= thr2Thread1of1ForFork1_~f12~0 0)), Black: 96#true, Black: 100#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), 110#true, Black: 166#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), Black: 108#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 171#(and (= ~x~0 0) (= ~flag1~0 4)), Black: 172#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 150#(= ~x~0 0), 34#L799true, Black: 113#(= thr1Thread1of1ForFork0_~f21~0 0), Black: 179#(and (= ~x~0 0) (= ~flag2~0 1)), Black: 115#(and (= thr1Thread1of1ForFork0_~f21~0 0) (= ~flag2~0 0)), Black: 112#(= ~flag2~0 0), Black: 180#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 122#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), 144#(= ~x~0 0), Black: 183#true, Black: 185#(<= 3 ~flag1~0)]) [2024-05-12 10:34:14,922 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-05-12 10:34:14,922 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-05-12 10:34:14,922 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-05-12 10:34:14,922 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-05-12 10:34:15,014 INFO L124 PetriNetUnfolderBase]: 3711/7556 cut-off events. [2024-05-12 10:34:15,014 INFO L125 PetriNetUnfolderBase]: For 97572/97845 co-relation queries the response was YES. [2024-05-12 10:34:15,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34091 conditions, 7556 events. 3711/7556 cut-off events. For 97572/97845 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 59053 event pairs, 1305 based on Foata normal form. 108/7511 useless extension candidates. Maximal degree in co-relation 24713. Up to 2740 conditions per place. [2024-05-12 10:34:15,072 INFO L140 encePairwiseOnDemand]: 67/77 looper letters, 114 selfloop transitions, 29 changer transitions 0/225 dead transitions. [2024-05-12 10:34:15,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 225 transitions, 2418 flow [2024-05-12 10:34:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 266 transitions. [2024-05-12 10:34:15,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-05-12 10:34:15,073 INFO L175 Difference]: Start difference. First operand has 149 places, 188 transitions, 1817 flow. Second operand 5 states and 266 transitions. [2024-05-12 10:34:15,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 225 transitions, 2418 flow [2024-05-12 10:34:15,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 225 transitions, 2364 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-05-12 10:34:15,207 INFO L231 Difference]: Finished difference. Result has 152 places, 193 transitions, 1896 flow [2024-05-12 10:34:15,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1896, PETRI_PLACES=152, PETRI_TRANSITIONS=193} [2024-05-12 10:34:15,207 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 84 predicate places. [2024-05-12 10:34:15,208 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 193 transitions, 1896 flow [2024-05-12 10:34:15,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:15,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:15,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:15,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 10:34:15,208 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:15,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:15,209 INFO L85 PathProgramCache]: Analyzing trace with hash -629542343, now seen corresponding path program 1 times [2024-05-12 10:34:15,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:15,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460186445] [2024-05-12 10:34:15,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:15,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:15,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:15,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460186445] [2024-05-12 10:34:15,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460186445] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:15,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:15,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077199270] [2024-05-12 10:34:15,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:15,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:34:15,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:15,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:34:15,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:34:15,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 77 [2024-05-12 10:34:15,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 193 transitions, 1896 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:15,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:15,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 77 [2024-05-12 10:34:15,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:16,198 INFO L124 PetriNetUnfolderBase]: 3861/7905 cut-off events. [2024-05-12 10:34:16,199 INFO L125 PetriNetUnfolderBase]: For 60917/61347 co-relation queries the response was YES. [2024-05-12 10:34:16,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31687 conditions, 7905 events. 3861/7905 cut-off events. For 60917/61347 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 63498 event pairs, 1725 based on Foata normal form. 213/7723 useless extension candidates. Maximal degree in co-relation 22463. Up to 4102 conditions per place. [2024-05-12 10:34:16,240 INFO L140 encePairwiseOnDemand]: 63/77 looper letters, 162 selfloop transitions, 36 changer transitions 0/261 dead transitions. [2024-05-12 10:34:16,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 261 transitions, 2846 flow [2024-05-12 10:34:16,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 261 transitions. [2024-05-12 10:34:16,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6779220779220779 [2024-05-12 10:34:16,241 INFO L175 Difference]: Start difference. First operand has 152 places, 193 transitions, 1896 flow. Second operand 5 states and 261 transitions. [2024-05-12 10:34:16,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 261 transitions, 2846 flow [2024-05-12 10:34:16,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 261 transitions, 2776 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-05-12 10:34:16,333 INFO L231 Difference]: Finished difference. Result has 158 places, 210 transitions, 2188 flow [2024-05-12 10:34:16,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2188, PETRI_PLACES=158, PETRI_TRANSITIONS=210} [2024-05-12 10:34:16,333 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 90 predicate places. [2024-05-12 10:34:16,334 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 210 transitions, 2188 flow [2024-05-12 10:34:16,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:16,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:16,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:16,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 10:34:16,334 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:16,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:16,335 INFO L85 PathProgramCache]: Analyzing trace with hash 884433285, now seen corresponding path program 1 times [2024-05-12 10:34:16,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:16,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013801671] [2024-05-12 10:34:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:16,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:16,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013801671] [2024-05-12 10:34:16,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013801671] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:16,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:16,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:16,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893433872] [2024-05-12 10:34:16,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:16,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:16,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:16,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:16,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:16,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:16,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 210 transitions, 2188 flow. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:16,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:16,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:16,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:17,326 INFO L124 PetriNetUnfolderBase]: 4017/8257 cut-off events. [2024-05-12 10:34:17,327 INFO L125 PetriNetUnfolderBase]: For 119935/120187 co-relation queries the response was YES. [2024-05-12 10:34:17,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38233 conditions, 8257 events. 4017/8257 cut-off events. For 119935/120187 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 66517 event pairs, 1529 based on Foata normal form. 56/8111 useless extension candidates. Maximal degree in co-relation 26929. Up to 3385 conditions per place. [2024-05-12 10:34:17,396 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 113 selfloop transitions, 26 changer transitions 0/236 dead transitions. [2024-05-12 10:34:17,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 236 transitions, 2661 flow [2024-05-12 10:34:17,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 260 transitions. [2024-05-12 10:34:17,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6753246753246753 [2024-05-12 10:34:17,398 INFO L175 Difference]: Start difference. First operand has 158 places, 210 transitions, 2188 flow. Second operand 5 states and 260 transitions. [2024-05-12 10:34:17,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 236 transitions, 2661 flow [2024-05-12 10:34:17,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 236 transitions, 2649 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-05-12 10:34:17,553 INFO L231 Difference]: Finished difference. Result has 163 places, 211 transitions, 2256 flow [2024-05-12 10:34:17,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2176, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2256, PETRI_PLACES=163, PETRI_TRANSITIONS=211} [2024-05-12 10:34:17,553 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 95 predicate places. [2024-05-12 10:34:17,553 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 211 transitions, 2256 flow [2024-05-12 10:34:17,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:17,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:17,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:17,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 10:34:17,554 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:17,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash 229575047, now seen corresponding path program 2 times [2024-05-12 10:34:17,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:17,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104820505] [2024-05-12 10:34:17,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:17,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:17,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:17,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104820505] [2024-05-12 10:34:17,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104820505] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:17,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:17,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:17,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910281526] [2024-05-12 10:34:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:17,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:17,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:17,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:17,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:17,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:17,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 211 transitions, 2256 flow. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:17,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:17,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:17,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:18,574 INFO L124 PetriNetUnfolderBase]: 4017/8225 cut-off events. [2024-05-12 10:34:18,574 INFO L125 PetriNetUnfolderBase]: For 131279/131541 co-relation queries the response was YES. [2024-05-12 10:34:18,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39040 conditions, 8225 events. 4017/8225 cut-off events. For 131279/131541 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 66009 event pairs, 1642 based on Foata normal form. 50/8060 useless extension candidates. Maximal degree in co-relation 27502. Up to 3388 conditions per place. [2024-05-12 10:34:18,639 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 114 selfloop transitions, 28 changer transitions 0/239 dead transitions. [2024-05-12 10:34:18,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 239 transitions, 2779 flow [2024-05-12 10:34:18,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 261 transitions. [2024-05-12 10:34:18,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6779220779220779 [2024-05-12 10:34:18,641 INFO L175 Difference]: Start difference. First operand has 163 places, 211 transitions, 2256 flow. Second operand 5 states and 261 transitions. [2024-05-12 10:34:18,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 239 transitions, 2779 flow [2024-05-12 10:34:18,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 239 transitions, 2740 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-05-12 10:34:18,801 INFO L231 Difference]: Finished difference. Result has 166 places, 214 transitions, 2342 flow [2024-05-12 10:34:18,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2220, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2342, PETRI_PLACES=166, PETRI_TRANSITIONS=214} [2024-05-12 10:34:18,802 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 98 predicate places. [2024-05-12 10:34:18,802 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 214 transitions, 2342 flow [2024-05-12 10:34:18,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:18,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:18,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:18,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 10:34:18,803 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:18,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:18,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1715897607, now seen corresponding path program 3 times [2024-05-12 10:34:18,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:18,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043743628] [2024-05-12 10:34:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:18,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:18,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043743628] [2024-05-12 10:34:18,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043743628] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:18,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:18,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:18,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552815758] [2024-05-12 10:34:18,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:18,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:18,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:18,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:18,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:18,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:18,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 214 transitions, 2342 flow. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:18,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:18,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:18,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:20,016 INFO L124 PetriNetUnfolderBase]: 4102/8448 cut-off events. [2024-05-12 10:34:20,016 INFO L125 PetriNetUnfolderBase]: For 141160/141443 co-relation queries the response was YES. [2024-05-12 10:34:20,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40139 conditions, 8448 events. 4102/8448 cut-off events. For 141160/141443 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 67515 event pairs, 1568 based on Foata normal form. 56/8366 useless extension candidates. Maximal degree in co-relation 24240. Up to 3063 conditions per place. [2024-05-12 10:34:20,088 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 136 selfloop transitions, 17 changer transitions 0/250 dead transitions. [2024-05-12 10:34:20,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 250 transitions, 2962 flow [2024-05-12 10:34:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:20,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2024-05-12 10:34:20,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-05-12 10:34:20,090 INFO L175 Difference]: Start difference. First operand has 166 places, 214 transitions, 2342 flow. Second operand 5 states and 264 transitions. [2024-05-12 10:34:20,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 250 transitions, 2962 flow [2024-05-12 10:34:20,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 250 transitions, 2917 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-05-12 10:34:20,279 INFO L231 Difference]: Finished difference. Result has 169 places, 214 transitions, 2337 flow [2024-05-12 10:34:20,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2297, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2337, PETRI_PLACES=169, PETRI_TRANSITIONS=214} [2024-05-12 10:34:20,280 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 101 predicate places. [2024-05-12 10:34:20,280 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 214 transitions, 2337 flow [2024-05-12 10:34:20,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:20,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:20,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:20,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 10:34:20,280 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:20,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:20,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1715914378, now seen corresponding path program 1 times [2024-05-12 10:34:20,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:20,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158867982] [2024-05-12 10:34:20,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:20,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:20,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:20,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158867982] [2024-05-12 10:34:20,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158867982] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:20,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:20,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:20,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25721853] [2024-05-12 10:34:20,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:20,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:20,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:20,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:20,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:20,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:20,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 214 transitions, 2337 flow. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:20,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:20,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:20,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:21,593 INFO L124 PetriNetUnfolderBase]: 4539/9081 cut-off events. [2024-05-12 10:34:21,594 INFO L125 PetriNetUnfolderBase]: For 169663/169978 co-relation queries the response was YES. [2024-05-12 10:34:21,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43999 conditions, 9081 events. 4539/9081 cut-off events. For 169663/169978 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 71997 event pairs, 1597 based on Foata normal form. 101/9019 useless extension candidates. Maximal degree in co-relation 43475. Up to 4560 conditions per place. [2024-05-12 10:34:21,672 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 118 selfloop transitions, 27 changer transitions 4/246 dead transitions. [2024-05-12 10:34:21,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 246 transitions, 2881 flow [2024-05-12 10:34:21,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 260 transitions. [2024-05-12 10:34:21,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6753246753246753 [2024-05-12 10:34:21,675 INFO L175 Difference]: Start difference. First operand has 169 places, 214 transitions, 2337 flow. Second operand 5 states and 260 transitions. [2024-05-12 10:34:21,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 246 transitions, 2881 flow [2024-05-12 10:34:21,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 246 transitions, 2764 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-05-12 10:34:21,908 INFO L231 Difference]: Finished difference. Result has 170 places, 219 transitions, 2380 flow [2024-05-12 10:34:21,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2224, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2380, PETRI_PLACES=170, PETRI_TRANSITIONS=219} [2024-05-12 10:34:21,908 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 102 predicate places. [2024-05-12 10:34:21,908 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 219 transitions, 2380 flow [2024-05-12 10:34:21,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:21,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:21,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:21,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 10:34:21,909 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:21,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1546671524, now seen corresponding path program 1 times [2024-05-12 10:34:21,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:21,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556580498] [2024-05-12 10:34:21,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:21,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:21,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:21,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556580498] [2024-05-12 10:34:21,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556580498] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:21,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:21,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:21,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298694842] [2024-05-12 10:34:21,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:21,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:21,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:21,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:21,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:22,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:22,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 219 transitions, 2380 flow. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:22,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:22,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:22,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:23,220 INFO L124 PetriNetUnfolderBase]: 4300/8948 cut-off events. [2024-05-12 10:34:23,221 INFO L125 PetriNetUnfolderBase]: For 182380/182673 co-relation queries the response was YES. [2024-05-12 10:34:23,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44400 conditions, 8948 events. 4300/8948 cut-off events. For 182380/182673 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 73073 event pairs, 971 based on Foata normal form. 77/8847 useless extension candidates. Maximal degree in co-relation 43967. Up to 4080 conditions per place. [2024-05-12 10:34:23,317 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 141 selfloop transitions, 16 changer transitions 4/258 dead transitions. [2024-05-12 10:34:23,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 258 transitions, 3043 flow [2024-05-12 10:34:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 263 transitions. [2024-05-12 10:34:23,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6831168831168831 [2024-05-12 10:34:23,318 INFO L175 Difference]: Start difference. First operand has 170 places, 219 transitions, 2380 flow. Second operand 5 states and 263 transitions. [2024-05-12 10:34:23,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 258 transitions, 3043 flow [2024-05-12 10:34:23,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 258 transitions, 3013 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-05-12 10:34:23,524 INFO L231 Difference]: Finished difference. Result has 175 places, 222 transitions, 2471 flow [2024-05-12 10:34:23,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2346, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2471, PETRI_PLACES=175, PETRI_TRANSITIONS=222} [2024-05-12 10:34:23,525 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 107 predicate places. [2024-05-12 10:34:23,525 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 222 transitions, 2471 flow [2024-05-12 10:34:23,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:23,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:23,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:23,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 10:34:23,526 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:23,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:23,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1934891487, now seen corresponding path program 1 times [2024-05-12 10:34:23,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:23,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209647166] [2024-05-12 10:34:23,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:23,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:23,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-05-12 10:34:23,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:23,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209647166] [2024-05-12 10:34:23,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209647166] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:23,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:23,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:23,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790559394] [2024-05-12 10:34:23,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:23,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:23,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:23,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:23,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:23,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:23,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 222 transitions, 2471 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:23,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:23,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:23,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:24,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L809-->L806-1: Formula: (or (< 3 v_thr2Thread1of1ForFork1_~f12~0_35) (< v_thr2Thread1of1ForFork1_~f12~0_35 2)) InVars {thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_35} OutVars{thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_35} AuxVars[] AssignedVars[][123], [Black: 127#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), 154#true, 32#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 140#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 146#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 90#true, 96#true, Black: 152#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 188#(and (<= 3 ~flag1~0) (<= 3 thr2Thread1of1ForFork1_~f12~0)), Black: 156#(= ~flag1~0 0), Black: 157#(= thr2Thread1of1ForFork1_~f12~0 0), Black: 159#(and (= ~flag1~0 0) (= thr2Thread1of1ForFork1_~f12~0 0)), 248#true, Black: 166#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), Black: 171#(and (= ~x~0 0) (= ~flag1~0 4)), Black: 170#(= ~x~0 0), Black: 172#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 179#(and (= ~x~0 0) (= ~flag2~0 1)), Black: 180#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 31#L806-1true, Black: 183#true, Black: 185#(<= 3 ~flag1~0), Black: 186#(<= 3 thr2Thread1of1ForFork1_~f12~0), 24#L735true, Black: 198#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, Black: 204#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 77#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 82#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 210#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 214#(= ~flag1~0 1), Black: 215#(= thr2Thread1of1ForFork1_~f12~0 1), Black: 217#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1)), Black: 93#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), Black: 92#(and (= ~flag1~0 0) (= ~x~0 0)), 256#true, Black: 226#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), 110#true, Black: 100#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 98#(= ~x~0 0), Black: 232#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 108#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 238#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 113#(= thr1Thread1of1ForFork0_~f21~0 0), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 115#(and (= thr1Thread1of1ForFork0_~f21~0 0) (= ~flag2~0 0)), Black: 244#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 112#(= ~flag2~0 0), Black: 242#(= ~flag1~0 0), 129#true, Black: 122#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 251#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 250#(= ~flag2~0 0), 212#true, Black: 252#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0))]) [2024-05-12 10:34:24,386 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-05-12 10:34:24,386 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-05-12 10:34:24,386 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-05-12 10:34:24,386 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-05-12 10:34:24,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L809-->L806-1: Formula: (or (< 3 v_thr2Thread1of1ForFork1_~f12~0_35) (< v_thr2Thread1of1ForFork1_~f12~0_35 2)) InVars {thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_35} OutVars{thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_35} AuxVars[] AssignedVars[][123], [Black: 127#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), 154#true, 32#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 140#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 146#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 90#true, Black: 152#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 188#(and (<= 3 ~flag1~0) (<= 3 thr2Thread1of1ForFork1_~f12~0)), Black: 156#(= ~flag1~0 0), Black: 157#(= thr2Thread1of1ForFork1_~f12~0 0), Black: 159#(and (= ~flag1~0 0) (= thr2Thread1of1ForFork1_~f12~0 0)), 248#true, Black: 166#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), Black: 171#(and (= ~x~0 0) (= ~flag1~0 4)), 150#(= ~x~0 0), Black: 172#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 179#(and (= ~x~0 0) (= ~flag2~0 1)), Black: 180#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 31#L806-1true, 144#(= ~x~0 0), Black: 183#true, Black: 185#(<= 3 ~flag1~0), Black: 186#(<= 3 thr2Thread1of1ForFork1_~f12~0), 170#(= ~x~0 0), Black: 198#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, Black: 204#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 77#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 82#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 210#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 214#(= ~flag1~0 1), Black: 215#(= thr2Thread1of1ForFork1_~f12~0 1), Black: 217#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1)), 202#(= ~x~0 0), Black: 93#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), Black: 92#(and (= ~flag1~0 0) (= ~x~0 0)), 256#true, Black: 226#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), Black: 96#true, 110#true, Black: 100#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 232#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 108#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 238#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 113#(= thr1Thread1of1ForFork0_~f21~0 0), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 115#(and (= thr1Thread1of1ForFork0_~f21~0 0) (= ~flag2~0 0)), Black: 112#(= ~flag2~0 0), Black: 244#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 242#(= ~flag1~0 0), 64#L745true, Black: 122#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 251#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 250#(= ~flag2~0 0), 212#true, Black: 252#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0))]) [2024-05-12 10:34:24,386 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-05-12 10:34:24,387 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-05-12 10:34:24,387 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-05-12 10:34:24,387 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-05-12 10:34:24,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L809-->L806-1: Formula: (or (< 3 v_thr2Thread1of1ForFork1_~f12~0_35) (< v_thr2Thread1of1ForFork1_~f12~0_35 2)) InVars {thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_35} OutVars{thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_35} AuxVars[] AssignedVars[][123], [Black: 127#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), 154#true, 32#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 140#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 146#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 90#true, Black: 152#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 188#(and (<= 3 ~flag1~0) (<= 3 thr2Thread1of1ForFork1_~f12~0)), Black: 156#(= ~flag1~0 0), Black: 157#(= thr2Thread1of1ForFork1_~f12~0 0), Black: 159#(and (= ~flag1~0 0) (= thr2Thread1of1ForFork1_~f12~0 0)), 248#true, Black: 166#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), Black: 171#(and (= ~x~0 0) (= ~flag1~0 4)), 150#(= ~x~0 0), Black: 172#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 179#(and (= ~x~0 0) (= ~flag2~0 1)), Black: 180#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 31#L806-1true, 144#(= ~x~0 0), Black: 183#true, Black: 185#(<= 3 ~flag1~0), Black: 186#(<= 3 thr2Thread1of1ForFork1_~f12~0), 170#(= ~x~0 0), 20#L745-3true, thr2Thread1of1ForFork1InUse, Black: 198#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), Black: 204#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 77#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 82#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 210#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 214#(= ~flag1~0 1), Black: 215#(= thr2Thread1of1ForFork1_~f12~0 1), Black: 217#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1)), Black: 93#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), 202#(= ~x~0 0), 256#true, Black: 92#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 226#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), Black: 96#true, 110#true, Black: 100#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 232#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 108#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 238#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 113#(= thr1Thread1of1ForFork0_~f21~0 0), Black: 115#(and (= thr1Thread1of1ForFork0_~f21~0 0) (= ~flag2~0 0)), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 244#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 112#(= ~flag2~0 0), Black: 242#(= ~flag1~0 0), Black: 122#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 251#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 250#(= ~flag2~0 0), Black: 252#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), 212#true]) [2024-05-12 10:34:24,446 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-05-12 10:34:24,446 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-05-12 10:34:24,446 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-05-12 10:34:24,447 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-05-12 10:34:24,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L809-->L806-1: Formula: (or (< 3 v_thr2Thread1of1ForFork1_~f12~0_35) (< v_thr2Thread1of1ForFork1_~f12~0_35 2)) InVars {thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_35} OutVars{thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_35} AuxVars[] AssignedVars[][123], [Black: 127#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), 154#true, 32#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), 56#L749-1true, Black: 140#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 146#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 90#true, Black: 152#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 188#(and (<= 3 ~flag1~0) (<= 3 thr2Thread1of1ForFork1_~f12~0)), Black: 156#(= ~flag1~0 0), Black: 157#(= thr2Thread1of1ForFork1_~f12~0 0), Black: 159#(and (= ~flag1~0 0) (= thr2Thread1of1ForFork1_~f12~0 0)), 248#true, Black: 166#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), Black: 171#(and (= ~x~0 0) (= ~flag1~0 4)), Black: 172#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 150#(= ~x~0 0), Black: 179#(and (= ~x~0 0) (= ~flag2~0 1)), Black: 180#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 31#L806-1true, 144#(= ~x~0 0), Black: 183#true, Black: 185#(<= 3 ~flag1~0), Black: 186#(<= 3 thr2Thread1of1ForFork1_~f12~0), 170#(= ~x~0 0), Black: 198#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, Black: 204#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 77#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 82#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 210#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), Black: 214#(= ~flag1~0 1), Black: 215#(= thr2Thread1of1ForFork1_~f12~0 1), Black: 217#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1)), Black: 93#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), 202#(= ~x~0 0), Black: 92#(and (= ~flag1~0 0) (= ~x~0 0)), 256#true, Black: 226#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), Black: 96#true, Black: 100#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), 110#true, Black: 232#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 108#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 238#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 113#(= thr1Thread1of1ForFork0_~f21~0 0), Black: 115#(and (= thr1Thread1of1ForFork0_~f21~0 0) (= ~flag2~0 0)), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 112#(= ~flag2~0 0), Black: 244#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 242#(= ~flag1~0 0), Black: 122#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 251#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 250#(= ~flag2~0 0), Black: 252#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), 212#true]) [2024-05-12 10:34:24,576 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-05-12 10:34:24,577 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-05-12 10:34:24,577 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 10:34:24,577 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 10:34:24,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L749-1-->L756: Formula: (= v_~flag1~0_11 0) InVars {} OutVars{~flag1~0=v_~flag1~0_11} AuxVars[] AssignedVars[~flag1~0][228], [Black: 127#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), 32#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), 186#(<= 3 thr2Thread1of1ForFork1_~f12~0), Black: 140#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 146#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 90#true, Black: 152#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), Black: 157#(= thr2Thread1of1ForFork1_~f12~0 0), Black: 159#(and (= ~flag1~0 0) (= thr2Thread1of1ForFork1_~f12~0 0)), 248#true, Black: 166#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), Black: 171#(and (= ~x~0 0) (= ~flag1~0 4)), 150#(= ~x~0 0), Black: 172#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), Black: 179#(and (= ~x~0 0) (= ~flag2~0 1)), Black: 180#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 144#(= ~x~0 0), Black: 183#true, Black: 185#(<= 3 ~flag1~0), Black: 188#(and (<= 3 ~flag1~0) (<= 3 thr2Thread1of1ForFork1_~f12~0)), 170#(= ~x~0 0), Black: 198#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, Black: 204#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 77#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 82#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 210#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), 156#(= ~flag1~0 0), 61#L809true, Black: 88#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), 242#(= ~flag1~0 0), Black: 214#(= ~flag1~0 1), 19#L756true, Black: 215#(= thr2Thread1of1ForFork1_~f12~0 1), Black: 217#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1)), Black: 93#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), 202#(= ~x~0 0), Black: 92#(and (= ~flag1~0 0) (= ~x~0 0)), 256#true, Black: 226#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), Black: 96#true, Black: 100#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), 110#true, Black: 232#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 108#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 238#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 113#(= thr1Thread1of1ForFork0_~f21~0 0), Black: 115#(and (= thr1Thread1of1ForFork0_~f21~0 0) (= ~flag2~0 0)), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 112#(= ~flag2~0 0), Black: 244#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 122#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 251#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 250#(= ~flag2~0 0), Black: 252#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), 212#true]) [2024-05-12 10:34:24,636 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2024-05-12 10:34:24,636 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2024-05-12 10:34:24,636 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-05-12 10:34:24,636 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2024-05-12 10:34:24,798 INFO L124 PetriNetUnfolderBase]: 4646/9214 cut-off events. [2024-05-12 10:34:24,798 INFO L125 PetriNetUnfolderBase]: For 202301/202607 co-relation queries the response was YES. [2024-05-12 10:34:24,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47457 conditions, 9214 events. 4646/9214 cut-off events. For 202301/202607 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 73357 event pairs, 2888 based on Foata normal form. 74/9002 useless extension candidates. Maximal degree in co-relation 33497. Up to 6384 conditions per place. [2024-05-12 10:34:24,878 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 118 selfloop transitions, 27 changer transitions 0/242 dead transitions. [2024-05-12 10:34:24,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 242 transitions, 2883 flow [2024-05-12 10:34:24,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 253 transitions. [2024-05-12 10:34:24,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2024-05-12 10:34:24,879 INFO L175 Difference]: Start difference. First operand has 175 places, 222 transitions, 2471 flow. Second operand 5 states and 253 transitions. [2024-05-12 10:34:24,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 242 transitions, 2883 flow [2024-05-12 10:34:25,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 242 transitions, 2871 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 10:34:25,101 INFO L231 Difference]: Finished difference. Result has 179 places, 224 transitions, 2547 flow [2024-05-12 10:34:25,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2461, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2547, PETRI_PLACES=179, PETRI_TRANSITIONS=224} [2024-05-12 10:34:25,102 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 111 predicate places. [2024-05-12 10:34:25,102 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 224 transitions, 2547 flow [2024-05-12 10:34:25,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:25,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:25,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:25,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 10:34:25,103 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:25,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash 274199479, now seen corresponding path program 2 times [2024-05-12 10:34:25,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:25,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208298524] [2024-05-12 10:34:25,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:25,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:25,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208298524] [2024-05-12 10:34:25,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208298524] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:25,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:25,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:25,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543516223] [2024-05-12 10:34:25,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:25,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:25,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:25,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:25,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:25,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:25,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 224 transitions, 2547 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:25,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:25,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:25,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:26,430 INFO L124 PetriNetUnfolderBase]: 4737/9468 cut-off events. [2024-05-12 10:34:26,430 INFO L125 PetriNetUnfolderBase]: For 215738/216052 co-relation queries the response was YES. [2024-05-12 10:34:26,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49412 conditions, 9468 events. 4737/9468 cut-off events. For 215738/216052 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 75211 event pairs, 2227 based on Foata normal form. 83/9347 useless extension candidates. Maximal degree in co-relation 32816. Up to 4297 conditions per place. [2024-05-12 10:34:26,511 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 145 selfloop transitions, 23 changer transitions 2/267 dead transitions. [2024-05-12 10:34:26,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 267 transitions, 3367 flow [2024-05-12 10:34:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2024-05-12 10:34:26,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6675324675324675 [2024-05-12 10:34:26,513 INFO L175 Difference]: Start difference. First operand has 179 places, 224 transitions, 2547 flow. Second operand 5 states and 257 transitions. [2024-05-12 10:34:26,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 267 transitions, 3367 flow [2024-05-12 10:34:26,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 267 transitions, 3329 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-05-12 10:34:26,756 INFO L231 Difference]: Finished difference. Result has 182 places, 230 transitions, 2653 flow [2024-05-12 10:34:26,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2513, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2653, PETRI_PLACES=182, PETRI_TRANSITIONS=230} [2024-05-12 10:34:26,757 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 114 predicate places. [2024-05-12 10:34:26,757 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 230 transitions, 2653 flow [2024-05-12 10:34:26,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:26,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:26,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:26,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 10:34:26,758 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:26,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:26,758 INFO L85 PathProgramCache]: Analyzing trace with hash 273811669, now seen corresponding path program 3 times [2024-05-12 10:34:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:26,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164440642] [2024-05-12 10:34:26,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:26,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:26,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:26,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164440642] [2024-05-12 10:34:26,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164440642] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:26,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:26,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:26,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233992953] [2024-05-12 10:34:26,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:26,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:26,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:26,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:26,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:26,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:26,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 230 transitions, 2653 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:26,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:26,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:26,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:28,119 INFO L124 PetriNetUnfolderBase]: 4488/9016 cut-off events. [2024-05-12 10:34:28,119 INFO L125 PetriNetUnfolderBase]: For 221347/221660 co-relation queries the response was YES. [2024-05-12 10:34:28,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48145 conditions, 9016 events. 4488/9016 cut-off events. For 221347/221660 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 71130 event pairs, 2012 based on Foata normal form. 206/9040 useless extension candidates. Maximal degree in co-relation 32618. Up to 4291 conditions per place. [2024-05-12 10:34:28,182 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 148 selfloop transitions, 26 changer transitions 4/275 dead transitions. [2024-05-12 10:34:28,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 275 transitions, 3483 flow [2024-05-12 10:34:28,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2024-05-12 10:34:28,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6935064935064935 [2024-05-12 10:34:28,183 INFO L175 Difference]: Start difference. First operand has 182 places, 230 transitions, 2653 flow. Second operand 5 states and 267 transitions. [2024-05-12 10:34:28,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 275 transitions, 3483 flow [2024-05-12 10:34:28,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 275 transitions, 3463 flow, removed 10 selfloop flow, removed 0 redundant places. [2024-05-12 10:34:28,421 INFO L231 Difference]: Finished difference. Result has 188 places, 231 transitions, 2726 flow [2024-05-12 10:34:28,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2633, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2726, PETRI_PLACES=188, PETRI_TRANSITIONS=231} [2024-05-12 10:34:28,421 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 120 predicate places. [2024-05-12 10:34:28,421 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 231 transitions, 2726 flow [2024-05-12 10:34:28,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:28,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:28,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:28,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 10:34:28,422 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:28,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1628283083, now seen corresponding path program 1 times [2024-05-12 10:34:28,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:28,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295552412] [2024-05-12 10:34:28,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:28,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:28,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-05-12 10:34:28,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:28,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295552412] [2024-05-12 10:34:28,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295552412] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:28,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:28,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:28,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960327071] [2024-05-12 10:34:28,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:28,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:28,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:28,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:28,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:28,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:28,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 231 transitions, 2726 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:28,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:28,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:28,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:29,597 INFO L124 PetriNetUnfolderBase]: 4365/8869 cut-off events. [2024-05-12 10:34:29,598 INFO L125 PetriNetUnfolderBase]: For 232592/232988 co-relation queries the response was YES. [2024-05-12 10:34:29,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48906 conditions, 8869 events. 4365/8869 cut-off events. For 232592/232988 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 70816 event pairs, 1785 based on Foata normal form. 58/8707 useless extension candidates. Maximal degree in co-relation 33573. Up to 3574 conditions per place. [2024-05-12 10:34:29,669 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 133 selfloop transitions, 29 changer transitions 2/261 dead transitions. [2024-05-12 10:34:29,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 261 transitions, 3385 flow [2024-05-12 10:34:29,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 259 transitions. [2024-05-12 10:34:29,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2024-05-12 10:34:29,671 INFO L175 Difference]: Start difference. First operand has 188 places, 231 transitions, 2726 flow. Second operand 5 states and 259 transitions. [2024-05-12 10:34:29,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 261 transitions, 3385 flow [2024-05-12 10:34:29,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 261 transitions, 3345 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-05-12 10:34:29,924 INFO L231 Difference]: Finished difference. Result has 190 places, 235 transitions, 2820 flow [2024-05-12 10:34:29,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2689, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2820, PETRI_PLACES=190, PETRI_TRANSITIONS=235} [2024-05-12 10:34:29,925 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 122 predicate places. [2024-05-12 10:34:29,925 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 235 transitions, 2820 flow [2024-05-12 10:34:29,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:29,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:29,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:29,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 10:34:29,927 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:29,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash 811656197, now seen corresponding path program 1 times [2024-05-12 10:34:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:29,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826258167] [2024-05-12 10:34:29,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:30,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:30,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826258167] [2024-05-12 10:34:30,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826258167] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:30,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:30,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:30,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196501558] [2024-05-12 10:34:30,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:30,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:30,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:30,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:30,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:30,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:30,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 235 transitions, 2820 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:30,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:30,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:30,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:31,225 INFO L124 PetriNetUnfolderBase]: 4403/8987 cut-off events. [2024-05-12 10:34:31,225 INFO L125 PetriNetUnfolderBase]: For 248907/249340 co-relation queries the response was YES. [2024-05-12 10:34:31,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49824 conditions, 8987 events. 4403/8987 cut-off events. For 248907/249340 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 72280 event pairs, 1695 based on Foata normal form. 106/8876 useless extension candidates. Maximal degree in co-relation 33497. Up to 3419 conditions per place. [2024-05-12 10:34:31,305 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 132 selfloop transitions, 40 changer transitions 4/273 dead transitions. [2024-05-12 10:34:31,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 273 transitions, 3578 flow [2024-05-12 10:34:31,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 266 transitions. [2024-05-12 10:34:31,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-05-12 10:34:31,307 INFO L175 Difference]: Start difference. First operand has 190 places, 235 transitions, 2820 flow. Second operand 5 states and 266 transitions. [2024-05-12 10:34:31,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 273 transitions, 3578 flow [2024-05-12 10:34:31,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 273 transitions, 3545 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-05-12 10:34:31,593 INFO L231 Difference]: Finished difference. Result has 195 places, 242 transitions, 3040 flow [2024-05-12 10:34:31,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2787, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3040, PETRI_PLACES=195, PETRI_TRANSITIONS=242} [2024-05-12 10:34:31,594 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 127 predicate places. [2024-05-12 10:34:31,594 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 242 transitions, 3040 flow [2024-05-12 10:34:31,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:31,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:31,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:31,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 10:34:31,595 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:31,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash 840345767, now seen corresponding path program 2 times [2024-05-12 10:34:31,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:31,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234197355] [2024-05-12 10:34:31,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:31,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:31,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:31,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234197355] [2024-05-12 10:34:31,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234197355] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:31,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:31,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:31,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504614300] [2024-05-12 10:34:31,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:31,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:34:31,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:31,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:34:31,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:34:31,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 77 [2024-05-12 10:34:31,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 242 transitions, 3040 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:31,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:31,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 77 [2024-05-12 10:34:31,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:32,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L749-1-->L756: Formula: (= v_~flag1~0_11 0) InVars {} OutVars{~flag1~0=v_~flag1~0_11} AuxVars[] AssignedVars[~flag1~0][279], [Black: 127#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 3)), Black: 260#(and (= ~flag2~0 4) (= ~flag1~0 1) (= ~x~0 1)), 32#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), 283#(= ~x~0 0), 186#(<= 3 thr2Thread1of1ForFork1_~f12~0), Black: 266#(and (= ~flag2~0 4) (= ~flag1~0 1) (= ~x~0 1)), Black: 140#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 3)), Black: 271#(and (= ~flag2~0 4) (= ~x~0 1)), Black: 272#(and (= ~flag2~0 4) (= ~flag1~0 1) (= ~x~0 1)), 277#(= ~x~0 0), Black: 146#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), 90#true, Black: 279#(and (= ~x~0 0) (= 2 ~flag1~0) (= ~flag2~0 3)), Black: 152#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 3)), Black: 284#(and (= ~x~0 0) (= ~flag2~0 3)), Black: 285#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 4)), Black: 157#(= thr2Thread1of1ForFork1_~f12~0 0), Black: 159#(and (= ~flag1~0 0) (= thr2Thread1of1ForFork1_~f12~0 0)), Black: 166#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 4)), Black: 171#(and (= ~x~0 0) (= ~flag1~0 4)), Black: 172#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 150#(= ~x~0 0), Black: 179#(and (= ~x~0 0) (= ~flag2~0 1)), Black: 180#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 4)), 144#(= ~x~0 0), Black: 183#true, Black: 185#(<= 3 ~flag1~0), Black: 188#(and (<= 3 ~flag1~0) (<= 3 thr2Thread1of1ForFork1_~f12~0)), 170#(= ~x~0 0), 288#true, Black: 198#(and (= ~x~0 0) (= ~flag2~0 1) (= 2 ~flag1~0)), thr2Thread1of1ForFork1InUse, Black: 204#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), Black: 77#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), Black: 82#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 210#(and (= ~x~0 0) (= ~flag2~0 3) (= ~flag1~0 3)), 156#(= ~flag1~0 0), 61#L809true, Black: 88#(and (= ~x~0 0) (= ~flag1~0 3) (= ~flag2~0 0)), 242#(= ~flag1~0 0), Black: 214#(= ~flag1~0 1), Black: 215#(= thr2Thread1of1ForFork1_~f12~0 1), 19#L756true, Black: 217#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1)), 264#(= ~flag2~0 4), Black: 93#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1)), 270#(= ~flag2~0 4), 202#(= ~x~0 0), Black: 92#(and (= ~flag1~0 0) (= ~x~0 0)), Black: 226#(and (= ~x~0 0) (= ~flag1~0 1) (= 2 ~flag2~0)), Black: 96#true, Black: 100#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), 110#true, Black: 232#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 108#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 238#(and (= ~x~0 0) (= ~flag2~0 4) (= ~flag1~0 1)), Black: 113#(= thr1Thread1of1ForFork0_~f21~0 0), Black: 243#(and (= ~flag1~0 0) (= ~flag2~0 4)), Black: 115#(and (= thr1Thread1of1ForFork0_~f21~0 0) (= ~flag2~0 0)), Black: 244#(and (= ~flag1~0 0) (= ~flag2~0 4) (= ~x~0 1)), Black: 112#(= ~flag2~0 0), Black: 122#(and (= ~x~0 0) (= ~flag1~0 4) (= ~flag2~0 0)), Black: 251#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 252#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 0)), 212#true]) [2024-05-12 10:34:32,691 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-05-12 10:34:32,691 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-05-12 10:34:32,691 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 10:34:32,691 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 10:34:32,810 INFO L124 PetriNetUnfolderBase]: 4695/9196 cut-off events. [2024-05-12 10:34:32,810 INFO L125 PetriNetUnfolderBase]: For 154396/155181 co-relation queries the response was YES. [2024-05-12 10:34:32,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45461 conditions, 9196 events. 4695/9196 cut-off events. For 154396/155181 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 72057 event pairs, 2433 based on Foata normal form. 197/8930 useless extension candidates. Maximal degree in co-relation 35322. Up to 5816 conditions per place. [2024-05-12 10:34:32,898 INFO L140 encePairwiseOnDemand]: 63/77 looper letters, 119 selfloop transitions, 26 changer transitions 6/294 dead transitions. [2024-05-12 10:34:32,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 294 transitions, 3696 flow [2024-05-12 10:34:32,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2024-05-12 10:34:32,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6675324675324675 [2024-05-12 10:34:32,899 INFO L175 Difference]: Start difference. First operand has 195 places, 242 transitions, 3040 flow. Second operand 5 states and 257 transitions. [2024-05-12 10:34:32,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 294 transitions, 3696 flow [2024-05-12 10:34:33,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 294 transitions, 3584 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-05-12 10:34:33,348 INFO L231 Difference]: Finished difference. Result has 200 places, 247 transitions, 3084 flow [2024-05-12 10:34:33,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2852, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3084, PETRI_PLACES=200, PETRI_TRANSITIONS=247} [2024-05-12 10:34:33,349 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 132 predicate places. [2024-05-12 10:34:33,349 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 247 transitions, 3084 flow [2024-05-12 10:34:33,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:33,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:33,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:33,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 10:34:33,350 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:33,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash -592207219, now seen corresponding path program 1 times [2024-05-12 10:34:33,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:33,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923128465] [2024-05-12 10:34:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:33,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:33,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:33,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923128465] [2024-05-12 10:34:33,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923128465] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:33,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:33,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:33,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248464345] [2024-05-12 10:34:33,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:33,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:33,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:33,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:33,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:33,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:33,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 247 transitions, 3084 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:33,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:33,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:33,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:34,889 INFO L124 PetriNetUnfolderBase]: 4360/9033 cut-off events. [2024-05-12 10:34:34,890 INFO L125 PetriNetUnfolderBase]: For 264467/264851 co-relation queries the response was YES. [2024-05-12 10:34:34,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52232 conditions, 9033 events. 4360/9033 cut-off events. For 264467/264851 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 73408 event pairs, 1683 based on Foata normal form. 53/8875 useless extension candidates. Maximal degree in co-relation 39451. Up to 3516 conditions per place. [2024-05-12 10:34:34,977 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 127 selfloop transitions, 45 changer transitions 2/277 dead transitions. [2024-05-12 10:34:34,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 277 transitions, 3746 flow [2024-05-12 10:34:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 263 transitions. [2024-05-12 10:34:34,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6831168831168831 [2024-05-12 10:34:34,978 INFO L175 Difference]: Start difference. First operand has 200 places, 247 transitions, 3084 flow. Second operand 5 states and 263 transitions. [2024-05-12 10:34:34,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 277 transitions, 3746 flow [2024-05-12 10:34:35,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 277 transitions, 3742 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-05-12 10:34:35,370 INFO L231 Difference]: Finished difference. Result has 205 places, 251 transitions, 3242 flow [2024-05-12 10:34:35,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=3080, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3242, PETRI_PLACES=205, PETRI_TRANSITIONS=251} [2024-05-12 10:34:35,371 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 137 predicate places. [2024-05-12 10:34:35,371 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 251 transitions, 3242 flow [2024-05-12 10:34:35,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:35,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:35,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:35,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 10:34:35,371 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:35,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:35,372 INFO L85 PathProgramCache]: Analyzing trace with hash -47186775, now seen corresponding path program 2 times [2024-05-12 10:34:35,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:35,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316973126] [2024-05-12 10:34:35,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:35,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:35,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:35,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316973126] [2024-05-12 10:34:35,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316973126] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:35,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:35,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112388207] [2024-05-12 10:34:35,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:35,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:35,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:35,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:35,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:35,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:35,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 251 transitions, 3242 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:35,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:35,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:35,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:36,659 INFO L124 PetriNetUnfolderBase]: 4311/8929 cut-off events. [2024-05-12 10:34:36,659 INFO L125 PetriNetUnfolderBase]: For 279882/280223 co-relation queries the response was YES. [2024-05-12 10:34:36,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52646 conditions, 8929 events. 4311/8929 cut-off events. For 279882/280223 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 72338 event pairs, 1692 based on Foata normal form. 48/8773 useless extension candidates. Maximal degree in co-relation 39607. Up to 3276 conditions per place. [2024-05-12 10:34:36,910 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 154 selfloop transitions, 25 changer transitions 4/286 dead transitions. [2024-05-12 10:34:36,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 286 transitions, 4003 flow [2024-05-12 10:34:36,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2024-05-12 10:34:36,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-05-12 10:34:36,911 INFO L175 Difference]: Start difference. First operand has 205 places, 251 transitions, 3242 flow. Second operand 5 states and 264 transitions. [2024-05-12 10:34:36,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 286 transitions, 4003 flow [2024-05-12 10:34:37,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 286 transitions, 3921 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-05-12 10:34:37,270 INFO L231 Difference]: Finished difference. Result has 208 places, 255 transitions, 3294 flow [2024-05-12 10:34:37,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=3163, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3294, PETRI_PLACES=208, PETRI_TRANSITIONS=255} [2024-05-12 10:34:37,271 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 140 predicate places. [2024-05-12 10:34:37,271 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 255 transitions, 3294 flow [2024-05-12 10:34:37,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:37,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:37,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:37,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 10:34:37,272 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:37,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:37,272 INFO L85 PathProgramCache]: Analyzing trace with hash 810732707, now seen corresponding path program 1 times [2024-05-12 10:34:37,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:37,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167343156] [2024-05-12 10:34:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:37,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:37,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:37,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167343156] [2024-05-12 10:34:37,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167343156] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:37,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:37,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:37,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929408332] [2024-05-12 10:34:37,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:37,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:37,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:37,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:37,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:37,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:37,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 255 transitions, 3294 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:37,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:37,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:37,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:38,618 INFO L124 PetriNetUnfolderBase]: 4334/8967 cut-off events. [2024-05-12 10:34:38,618 INFO L125 PetriNetUnfolderBase]: For 294196/294596 co-relation queries the response was YES. [2024-05-12 10:34:38,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53291 conditions, 8967 events. 4334/8967 cut-off events. For 294196/294596 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 72723 event pairs, 1700 based on Foata normal form. 66/8823 useless extension candidates. Maximal degree in co-relation 40116. Up to 3514 conditions per place. [2024-05-12 10:34:38,705 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 124 selfloop transitions, 53 changer transitions 2/282 dead transitions. [2024-05-12 10:34:38,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 282 transitions, 3947 flow [2024-05-12 10:34:38,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 261 transitions. [2024-05-12 10:34:38,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6779220779220779 [2024-05-12 10:34:38,707 INFO L175 Difference]: Start difference. First operand has 208 places, 255 transitions, 3294 flow. Second operand 5 states and 261 transitions. [2024-05-12 10:34:38,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 282 transitions, 3947 flow [2024-05-12 10:34:39,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 282 transitions, 3848 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-05-12 10:34:39,165 INFO L231 Difference]: Finished difference. Result has 210 places, 258 transitions, 3368 flow [2024-05-12 10:34:39,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=3195, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3368, PETRI_PLACES=210, PETRI_TRANSITIONS=258} [2024-05-12 10:34:39,166 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 142 predicate places. [2024-05-12 10:34:39,166 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 258 transitions, 3368 flow [2024-05-12 10:34:39,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:39,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:39,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:39,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 10:34:39,167 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:39,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:39,167 INFO L85 PathProgramCache]: Analyzing trace with hash 839360835, now seen corresponding path program 2 times [2024-05-12 10:34:39,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:39,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52345755] [2024-05-12 10:34:39,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:39,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:39,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:39,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52345755] [2024-05-12 10:34:39,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52345755] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:39,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:39,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:39,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588571732] [2024-05-12 10:34:39,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:39,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:39,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:39,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:39,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:39,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:39,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 258 transitions, 3368 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:39,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:39,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:39,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:40,633 INFO L124 PetriNetUnfolderBase]: 4251/8795 cut-off events. [2024-05-12 10:34:40,633 INFO L125 PetriNetUnfolderBase]: For 303932/304326 co-relation queries the response was YES. [2024-05-12 10:34:40,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52427 conditions, 8795 events. 4251/8795 cut-off events. For 303932/304326 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 71080 event pairs, 1592 based on Foata normal form. 77/8660 useless extension candidates. Maximal degree in co-relation 39385. Up to 3209 conditions per place. [2024-05-12 10:34:40,697 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 137 selfloop transitions, 42 changer transitions 4/286 dead transitions. [2024-05-12 10:34:40,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 286 transitions, 3997 flow [2024-05-12 10:34:40,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 265 transitions. [2024-05-12 10:34:40,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6883116883116883 [2024-05-12 10:34:40,698 INFO L175 Difference]: Start difference. First operand has 210 places, 258 transitions, 3368 flow. Second operand 5 states and 265 transitions. [2024-05-12 10:34:40,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 286 transitions, 3997 flow [2024-05-12 10:34:41,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 286 transitions, 3914 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-05-12 10:34:41,044 INFO L231 Difference]: Finished difference. Result has 213 places, 259 transitions, 3392 flow [2024-05-12 10:34:41,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=3285, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3392, PETRI_PLACES=213, PETRI_TRANSITIONS=259} [2024-05-12 10:34:41,045 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 145 predicate places. [2024-05-12 10:34:41,046 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 259 transitions, 3392 flow [2024-05-12 10:34:41,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:41,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:41,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:41,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 10:34:41,046 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:41,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:41,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1707249399, now seen corresponding path program 2 times [2024-05-12 10:34:41,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:41,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486693353] [2024-05-12 10:34:41,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:41,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:41,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:41,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486693353] [2024-05-12 10:34:41,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486693353] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:41,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:41,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:41,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589845476] [2024-05-12 10:34:41,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:41,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:34:41,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:41,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:34:41,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:34:41,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 77 [2024-05-12 10:34:41,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 259 transitions, 3392 flow. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:41,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:41,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 77 [2024-05-12 10:34:41,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:41,937 INFO L124 PetriNetUnfolderBase]: 3034/6271 cut-off events. [2024-05-12 10:34:41,938 INFO L125 PetriNetUnfolderBase]: For 117714/118196 co-relation queries the response was YES. [2024-05-12 10:34:41,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32918 conditions, 6271 events. 3034/6271 cut-off events. For 117714/118196 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 47753 event pairs, 1119 based on Foata normal form. 259/6315 useless extension candidates. Maximal degree in co-relation 27786. Up to 2670 conditions per place. [2024-05-12 10:34:41,991 INFO L140 encePairwiseOnDemand]: 60/77 looper letters, 113 selfloop transitions, 44 changer transitions 8/292 dead transitions. [2024-05-12 10:34:41,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 292 transitions, 3825 flow [2024-05-12 10:34:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 269 transitions. [2024-05-12 10:34:41,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6987012987012987 [2024-05-12 10:34:41,993 INFO L175 Difference]: Start difference. First operand has 213 places, 259 transitions, 3392 flow. Second operand 5 states and 269 transitions. [2024-05-12 10:34:41,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 292 transitions, 3825 flow [2024-05-12 10:34:42,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 292 transitions, 3626 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-05-12 10:34:42,287 INFO L231 Difference]: Finished difference. Result has 211 places, 250 transitions, 3286 flow [2024-05-12 10:34:42,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2869, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3286, PETRI_PLACES=211, PETRI_TRANSITIONS=250} [2024-05-12 10:34:42,288 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 143 predicate places. [2024-05-12 10:34:42,288 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 250 transitions, 3286 flow [2024-05-12 10:34:42,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:42,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:42,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:42,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 10:34:42,288 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:42,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:42,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1028245239, now seen corresponding path program 3 times [2024-05-12 10:34:42,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:42,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341481062] [2024-05-12 10:34:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:42,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:42,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:42,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341481062] [2024-05-12 10:34:42,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341481062] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:42,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:42,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:42,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122303386] [2024-05-12 10:34:42,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:42,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:34:42,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:42,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:34:42,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:34:42,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 77 [2024-05-12 10:34:42,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 250 transitions, 3286 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:42,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:42,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 77 [2024-05-12 10:34:42,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:43,025 INFO L124 PetriNetUnfolderBase]: 2304/4873 cut-off events. [2024-05-12 10:34:43,025 INFO L125 PetriNetUnfolderBase]: For 87170/87610 co-relation queries the response was YES. [2024-05-12 10:34:43,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26065 conditions, 4873 events. 2304/4873 cut-off events. For 87170/87610 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 35402 event pairs, 705 based on Foata normal form. 152/4872 useless extension candidates. Maximal degree in co-relation 21746. Up to 1547 conditions per place. [2024-05-12 10:34:43,068 INFO L140 encePairwiseOnDemand]: 59/77 looper letters, 111 selfloop transitions, 69 changer transitions 0/289 dead transitions. [2024-05-12 10:34:43,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 289 transitions, 3886 flow [2024-05-12 10:34:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:43,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2024-05-12 10:34:43,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-05-12 10:34:43,069 INFO L175 Difference]: Start difference. First operand has 211 places, 250 transitions, 3286 flow. Second operand 5 states and 264 transitions. [2024-05-12 10:34:43,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 289 transitions, 3886 flow [2024-05-12 10:34:43,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 289 transitions, 3642 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-05-12 10:34:43,304 INFO L231 Difference]: Finished difference. Result has 210 places, 254 transitions, 3324 flow [2024-05-12 10:34:43,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2737, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3324, PETRI_PLACES=210, PETRI_TRANSITIONS=254} [2024-05-12 10:34:43,304 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 142 predicate places. [2024-05-12 10:34:43,305 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 254 transitions, 3324 flow [2024-05-12 10:34:43,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:43,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:43,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:43,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 10:34:43,305 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:43,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1131571953, now seen corresponding path program 1 times [2024-05-12 10:34:43,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:43,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726530526] [2024-05-12 10:34:43,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:43,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:43,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726530526] [2024-05-12 10:34:43,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726530526] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:43,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:43,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:43,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415856990] [2024-05-12 10:34:43,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:43,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:43,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:43,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:43,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:43,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:43,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 254 transitions, 3324 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:43,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:43,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:43,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:44,091 INFO L124 PetriNetUnfolderBase]: 2166/4786 cut-off events. [2024-05-12 10:34:44,092 INFO L125 PetriNetUnfolderBase]: For 147080/147423 co-relation queries the response was YES. [2024-05-12 10:34:44,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29083 conditions, 4786 events. 2166/4786 cut-off events. For 147080/147423 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 35423 event pairs, 461 based on Foata normal form. 116/4818 useless extension candidates. Maximal degree in co-relation 28592. Up to 2180 conditions per place. [2024-05-12 10:34:44,231 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 137 selfloop transitions, 25 changer transitions 2/275 dead transitions. [2024-05-12 10:34:44,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 275 transitions, 3880 flow [2024-05-12 10:34:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2024-05-12 10:34:44,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6415584415584416 [2024-05-12 10:34:44,233 INFO L175 Difference]: Start difference. First operand has 210 places, 254 transitions, 3324 flow. Second operand 5 states and 247 transitions. [2024-05-12 10:34:44,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 275 transitions, 3880 flow [2024-05-12 10:34:44,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 275 transitions, 3870 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-05-12 10:34:44,452 INFO L231 Difference]: Finished difference. Result has 216 places, 256 transitions, 3423 flow [2024-05-12 10:34:44,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=3314, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3423, PETRI_PLACES=216, PETRI_TRANSITIONS=256} [2024-05-12 10:34:44,453 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 148 predicate places. [2024-05-12 10:34:44,453 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 256 transitions, 3423 flow [2024-05-12 10:34:44,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:44,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:44,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:44,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 10:34:44,453 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:44,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:44,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1791808842, now seen corresponding path program 1 times [2024-05-12 10:34:44,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:44,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042450671] [2024-05-12 10:34:44,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:44,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:44,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:44,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042450671] [2024-05-12 10:34:44,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042450671] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:44,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:44,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:44,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838359219] [2024-05-12 10:34:44,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:44,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:44,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:44,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:44,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:44,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:44,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 256 transitions, 3423 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:44,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:44,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:44,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:45,273 INFO L124 PetriNetUnfolderBase]: 2128/4594 cut-off events. [2024-05-12 10:34:45,273 INFO L125 PetriNetUnfolderBase]: For 146972/147375 co-relation queries the response was YES. [2024-05-12 10:34:45,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28419 conditions, 4594 events. 2128/4594 cut-off events. For 146972/147375 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 33628 event pairs, 645 based on Foata normal form. 123/4545 useless extension candidates. Maximal degree in co-relation 23656. Up to 1624 conditions per place. [2024-05-12 10:34:45,316 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 138 selfloop transitions, 30 changer transitions 0/279 dead transitions. [2024-05-12 10:34:45,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 279 transitions, 4052 flow [2024-05-12 10:34:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2024-05-12 10:34:45,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6493506493506493 [2024-05-12 10:34:45,317 INFO L175 Difference]: Start difference. First operand has 216 places, 256 transitions, 3423 flow. Second operand 5 states and 250 transitions. [2024-05-12 10:34:45,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 279 transitions, 4052 flow [2024-05-12 10:34:45,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 279 transitions, 3915 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-05-12 10:34:45,580 INFO L231 Difference]: Finished difference. Result has 215 places, 257 transitions, 3381 flow [2024-05-12 10:34:45,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=3286, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3381, PETRI_PLACES=215, PETRI_TRANSITIONS=257} [2024-05-12 10:34:45,581 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 147 predicate places. [2024-05-12 10:34:45,581 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 257 transitions, 3381 flow [2024-05-12 10:34:45,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:45,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:45,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:45,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 10:34:45,582 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:45,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1837634090, now seen corresponding path program 2 times [2024-05-12 10:34:45,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:45,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81603411] [2024-05-12 10:34:45,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:45,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:45,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81603411] [2024-05-12 10:34:45,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81603411] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:45,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:45,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:45,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544682855] [2024-05-12 10:34:45,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:45,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:45,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:45,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:45,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:45,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:45,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 257 transitions, 3381 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:45,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:45,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:45,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:46,381 INFO L124 PetriNetUnfolderBase]: 2181/4758 cut-off events. [2024-05-12 10:34:46,381 INFO L125 PetriNetUnfolderBase]: For 144772/145169 co-relation queries the response was YES. [2024-05-12 10:34:46,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28866 conditions, 4758 events. 2181/4758 cut-off events. For 144772/145169 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 34959 event pairs, 332 based on Foata normal form. 113/4763 useless extension candidates. Maximal degree in co-relation 27594. Up to 1477 conditions per place. [2024-05-12 10:34:46,428 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 143 selfloop transitions, 28 changer transitions 0/282 dead transitions. [2024-05-12 10:34:46,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 282 transitions, 4005 flow [2024-05-12 10:34:46,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:46,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 252 transitions. [2024-05-12 10:34:46,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2024-05-12 10:34:46,429 INFO L175 Difference]: Start difference. First operand has 215 places, 257 transitions, 3381 flow. Second operand 5 states and 252 transitions. [2024-05-12 10:34:46,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 282 transitions, 4005 flow [2024-05-12 10:34:46,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 282 transitions, 3926 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-05-12 10:34:46,667 INFO L231 Difference]: Finished difference. Result has 217 places, 257 transitions, 3370 flow [2024-05-12 10:34:46,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=3306, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3370, PETRI_PLACES=217, PETRI_TRANSITIONS=257} [2024-05-12 10:34:46,668 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 149 predicate places. [2024-05-12 10:34:46,668 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 257 transitions, 3370 flow [2024-05-12 10:34:46,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:46,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:46,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:46,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 10:34:46,669 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:46,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1134032994, now seen corresponding path program 1 times [2024-05-12 10:34:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:46,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339849156] [2024-05-12 10:34:46,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:46,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:46,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:46,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339849156] [2024-05-12 10:34:46,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339849156] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:46,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:46,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:46,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692162807] [2024-05-12 10:34:46,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:46,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:46,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:46,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:46,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:46,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:46,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 257 transitions, 3370 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:46,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:46,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:46,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:47,502 INFO L124 PetriNetUnfolderBase]: 2207/4802 cut-off events. [2024-05-12 10:34:47,502 INFO L125 PetriNetUnfolderBase]: For 142993/143385 co-relation queries the response was YES. [2024-05-12 10:34:47,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28918 conditions, 4802 events. 2207/4802 cut-off events. For 142993/143385 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 35321 event pairs, 708 based on Foata normal form. 113/4804 useless extension candidates. Maximal degree in co-relation 24067. Up to 1628 conditions per place. [2024-05-12 10:34:47,547 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 137 selfloop transitions, 35 changer transitions 0/283 dead transitions. [2024-05-12 10:34:47,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 283 transitions, 4101 flow [2024-05-12 10:34:47,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 248 transitions. [2024-05-12 10:34:47,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6441558441558441 [2024-05-12 10:34:47,548 INFO L175 Difference]: Start difference. First operand has 217 places, 257 transitions, 3370 flow. Second operand 5 states and 248 transitions. [2024-05-12 10:34:47,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 283 transitions, 4101 flow [2024-05-12 10:34:47,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 283 transitions, 3979 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-05-12 10:34:47,825 INFO L231 Difference]: Finished difference. Result has 216 places, 263 transitions, 3475 flow [2024-05-12 10:34:47,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=3254, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3475, PETRI_PLACES=216, PETRI_TRANSITIONS=263} [2024-05-12 10:34:47,826 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 148 predicate places. [2024-05-12 10:34:47,826 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 263 transitions, 3475 flow [2024-05-12 10:34:47,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:47,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:47,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:47,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 10:34:47,827 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:47,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash 822684592, now seen corresponding path program 1 times [2024-05-12 10:34:47,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:47,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82899895] [2024-05-12 10:34:47,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:47,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:47,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-05-12 10:34:47,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:47,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82899895] [2024-05-12 10:34:47,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82899895] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:47,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:47,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:47,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102621480] [2024-05-12 10:34:47,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:47,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:34:47,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:47,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:34:47,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:34:47,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 77 [2024-05-12 10:34:47,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 263 transitions, 3475 flow. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:47,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:47,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 77 [2024-05-12 10:34:47,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:48,562 INFO L124 PetriNetUnfolderBase]: 2010/4284 cut-off events. [2024-05-12 10:34:48,563 INFO L125 PetriNetUnfolderBase]: For 65732/66108 co-relation queries the response was YES. [2024-05-12 10:34:48,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22973 conditions, 4284 events. 2010/4284 cut-off events. For 65732/66108 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 30611 event pairs, 1021 based on Foata normal form. 125/4233 useless extension candidates. Maximal degree in co-relation 20171. Up to 2406 conditions per place. [2024-05-12 10:34:48,600 INFO L140 encePairwiseOnDemand]: 64/77 looper letters, 110 selfloop transitions, 35 changer transitions 0/260 dead transitions. [2024-05-12 10:34:48,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 260 transitions, 3623 flow [2024-05-12 10:34:48,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 253 transitions. [2024-05-12 10:34:48,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2024-05-12 10:34:48,602 INFO L175 Difference]: Start difference. First operand has 216 places, 263 transitions, 3475 flow. Second operand 5 states and 253 transitions. [2024-05-12 10:34:48,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 260 transitions, 3623 flow [2024-05-12 10:34:48,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 260 transitions, 3444 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-05-12 10:34:48,812 INFO L231 Difference]: Finished difference. Result has 213 places, 237 transitions, 3049 flow [2024-05-12 10:34:48,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2923, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3049, PETRI_PLACES=213, PETRI_TRANSITIONS=237} [2024-05-12 10:34:48,812 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 145 predicate places. [2024-05-12 10:34:48,813 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 237 transitions, 3049 flow [2024-05-12 10:34:48,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:48,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:48,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:48,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 10:34:48,814 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:48,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:48,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1108435190, now seen corresponding path program 1 times [2024-05-12 10:34:48,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:48,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934550279] [2024-05-12 10:34:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:48,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:48,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:48,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934550279] [2024-05-12 10:34:48,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934550279] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:48,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:48,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:48,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469032279] [2024-05-12 10:34:48,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:48,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:48,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:48,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:48,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:48,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:48,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 237 transitions, 3049 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:48,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:48,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:48,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:49,585 INFO L124 PetriNetUnfolderBase]: 1816/4072 cut-off events. [2024-05-12 10:34:49,585 INFO L125 PetriNetUnfolderBase]: For 101404/101674 co-relation queries the response was YES. [2024-05-12 10:34:49,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23026 conditions, 4072 events. 1816/4072 cut-off events. For 101404/101674 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 29822 event pairs, 584 based on Foata normal form. 76/4067 useless extension candidates. Maximal degree in co-relation 18448. Up to 1337 conditions per place. [2024-05-12 10:34:49,623 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 127 selfloop transitions, 36 changer transitions 0/260 dead transitions. [2024-05-12 10:34:49,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 260 transitions, 3665 flow [2024-05-12 10:34:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2024-05-12 10:34:49,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6519480519480519 [2024-05-12 10:34:49,624 INFO L175 Difference]: Start difference. First operand has 213 places, 237 transitions, 3049 flow. Second operand 5 states and 251 transitions. [2024-05-12 10:34:49,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 260 transitions, 3665 flow [2024-05-12 10:34:49,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 260 transitions, 3607 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-05-12 10:34:49,851 INFO L231 Difference]: Finished difference. Result has 216 places, 241 transitions, 3160 flow [2024-05-12 10:34:49,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2991, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3160, PETRI_PLACES=216, PETRI_TRANSITIONS=241} [2024-05-12 10:34:49,851 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 148 predicate places. [2024-05-12 10:34:49,852 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 241 transitions, 3160 flow [2024-05-12 10:34:49,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:49,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:49,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:49,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 10:34:49,852 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:49,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash -539506698, now seen corresponding path program 2 times [2024-05-12 10:34:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:49,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712068868] [2024-05-12 10:34:49,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:49,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:49,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:49,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712068868] [2024-05-12 10:34:49,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712068868] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:49,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:49,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:49,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137394423] [2024-05-12 10:34:49,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:49,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:49,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:49,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:49,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:50,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:50,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 241 transitions, 3160 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:50,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:50,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:50,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:50,607 INFO L124 PetriNetUnfolderBase]: 1795/4043 cut-off events. [2024-05-12 10:34:50,607 INFO L125 PetriNetUnfolderBase]: For 102095/102364 co-relation queries the response was YES. [2024-05-12 10:34:50,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22555 conditions, 4043 events. 1795/4043 cut-off events. For 102095/102364 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 29614 event pairs, 563 based on Foata normal form. 79/4039 useless extension candidates. Maximal degree in co-relation 17885. Up to 1342 conditions per place. [2024-05-12 10:34:50,646 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 133 selfloop transitions, 32 changer transitions 0/262 dead transitions. [2024-05-12 10:34:50,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 262 transitions, 3774 flow [2024-05-12 10:34:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 252 transitions. [2024-05-12 10:34:50,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2024-05-12 10:34:50,648 INFO L175 Difference]: Start difference. First operand has 216 places, 241 transitions, 3160 flow. Second operand 5 states and 252 transitions. [2024-05-12 10:34:50,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 262 transitions, 3774 flow [2024-05-12 10:34:50,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 262 transitions, 3699 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-05-12 10:34:50,911 INFO L231 Difference]: Finished difference. Result has 220 places, 244 transitions, 3259 flow [2024-05-12 10:34:50,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=3088, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3259, PETRI_PLACES=220, PETRI_TRANSITIONS=244} [2024-05-12 10:34:50,912 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 152 predicate places. [2024-05-12 10:34:50,912 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 244 transitions, 3259 flow [2024-05-12 10:34:50,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:50,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:50,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:50,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 10:34:50,913 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:50,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:50,914 INFO L85 PathProgramCache]: Analyzing trace with hash -614110698, now seen corresponding path program 1 times [2024-05-12 10:34:50,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:50,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821697854] [2024-05-12 10:34:50,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:50,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:51,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:51,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821697854] [2024-05-12 10:34:51,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821697854] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:51,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:51,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:51,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141990070] [2024-05-12 10:34:51,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:51,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:51,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:51,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:51,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:51,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:51,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 244 transitions, 3259 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:51,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:51,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:51,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:51,651 INFO L124 PetriNetUnfolderBase]: 1812/4105 cut-off events. [2024-05-12 10:34:51,651 INFO L125 PetriNetUnfolderBase]: For 97898/98150 co-relation queries the response was YES. [2024-05-12 10:34:51,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22876 conditions, 4105 events. 1812/4105 cut-off events. For 97898/98150 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 30297 event pairs, 574 based on Foata normal form. 72/4100 useless extension candidates. Maximal degree in co-relation 18131. Up to 1336 conditions per place. [2024-05-12 10:34:51,686 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 122 selfloop transitions, 36 changer transitions 9/262 dead transitions. [2024-05-12 10:34:51,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 262 transitions, 3793 flow [2024-05-12 10:34:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 249 transitions. [2024-05-12 10:34:51,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6467532467532467 [2024-05-12 10:34:51,690 INFO L175 Difference]: Start difference. First operand has 220 places, 244 transitions, 3259 flow. Second operand 5 states and 249 transitions. [2024-05-12 10:34:51,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 262 transitions, 3793 flow [2024-05-12 10:34:51,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 262 transitions, 3676 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-05-12 10:34:51,923 INFO L231 Difference]: Finished difference. Result has 222 places, 235 transitions, 3086 flow [2024-05-12 10:34:51,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=3142, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3086, PETRI_PLACES=222, PETRI_TRANSITIONS=235} [2024-05-12 10:34:51,924 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 154 predicate places. [2024-05-12 10:34:51,924 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 235 transitions, 3086 flow [2024-05-12 10:34:51,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:51,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:51,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:51,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 10:34:51,925 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:51,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:51,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1559647278, now seen corresponding path program 2 times [2024-05-12 10:34:51,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:51,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434978511] [2024-05-12 10:34:51,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:51,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:52,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:52,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434978511] [2024-05-12 10:34:52,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434978511] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:52,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:52,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:52,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475191218] [2024-05-12 10:34:52,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:52,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:52,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:52,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:52,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:52,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:52,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 235 transitions, 3086 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:52,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:52,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:52,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:52,607 INFO L124 PetriNetUnfolderBase]: 1771/4036 cut-off events. [2024-05-12 10:34:52,607 INFO L125 PetriNetUnfolderBase]: For 93038/93289 co-relation queries the response was YES. [2024-05-12 10:34:52,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22192 conditions, 4036 events. 1771/4036 cut-off events. For 93038/93289 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 29708 event pairs, 602 based on Foata normal form. 63/4019 useless extension candidates. Maximal degree in co-relation 17403. Up to 1360 conditions per place. [2024-05-12 10:34:52,641 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 109 selfloop transitions, 24 changer transitions 36/249 dead transitions. [2024-05-12 10:34:52,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 249 transitions, 3586 flow [2024-05-12 10:34:52,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:52,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 245 transitions. [2024-05-12 10:34:52,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-05-12 10:34:52,642 INFO L175 Difference]: Start difference. First operand has 222 places, 235 transitions, 3086 flow. Second operand 5 states and 245 transitions. [2024-05-12 10:34:52,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 249 transitions, 3586 flow [2024-05-12 10:34:52,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 249 transitions, 3432 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-05-12 10:34:52,896 INFO L231 Difference]: Finished difference. Result has 221 places, 199 transitions, 2514 flow [2024-05-12 10:34:52,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2932, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2514, PETRI_PLACES=221, PETRI_TRANSITIONS=199} [2024-05-12 10:34:52,896 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 153 predicate places. [2024-05-12 10:34:52,897 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 199 transitions, 2514 flow [2024-05-12 10:34:52,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:52,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:52,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:52,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 10:34:52,897 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:52,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:52,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2010011960, now seen corresponding path program 2 times [2024-05-12 10:34:52,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:52,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600104085] [2024-05-12 10:34:52,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:52,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:52,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:52,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600104085] [2024-05-12 10:34:52,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600104085] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:52,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:52,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:52,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677817764] [2024-05-12 10:34:52,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:52,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:34:52,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:52,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:34:52,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:34:52,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 77 [2024-05-12 10:34:52,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 199 transitions, 2514 flow. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:52,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:52,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 77 [2024-05-12 10:34:52,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:53,315 INFO L124 PetriNetUnfolderBase]: 1200/2730 cut-off events. [2024-05-12 10:34:53,315 INFO L125 PetriNetUnfolderBase]: For 37679/37840 co-relation queries the response was YES. [2024-05-12 10:34:53,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13506 conditions, 2730 events. 1200/2730 cut-off events. For 37679/37840 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 19008 event pairs, 719 based on Foata normal form. 86/2734 useless extension candidates. Maximal degree in co-relation 12237. Up to 1599 conditions per place. [2024-05-12 10:34:53,335 INFO L140 encePairwiseOnDemand]: 67/77 looper letters, 64 selfloop transitions, 0 changer transitions 52/170 dead transitions. [2024-05-12 10:34:53,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 170 transitions, 2246 flow [2024-05-12 10:34:53,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-05-12 10:34:53,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6233766233766234 [2024-05-12 10:34:53,336 INFO L175 Difference]: Start difference. First operand has 221 places, 199 transitions, 2514 flow. Second operand 5 states and 240 transitions. [2024-05-12 10:34:53,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 170 transitions, 2246 flow [2024-05-12 10:34:53,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 170 transitions, 1922 flow, removed 35 selfloop flow, removed 24 redundant places. [2024-05-12 10:34:53,463 INFO L231 Difference]: Finished difference. Result has 197 places, 118 transitions, 1231 flow [2024-05-12 10:34:53,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1231, PETRI_PLACES=197, PETRI_TRANSITIONS=118} [2024-05-12 10:34:53,464 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 129 predicate places. [2024-05-12 10:34:53,464 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 118 transitions, 1231 flow [2024-05-12 10:34:53,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:53,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:53,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:53,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 10:34:53,465 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:53,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:53,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1550897638, now seen corresponding path program 2 times [2024-05-12 10:34:53,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:53,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888723130] [2024-05-12 10:34:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:53,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:53,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888723130] [2024-05-12 10:34:53,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888723130] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:53,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:53,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:34:53,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796567078] [2024-05-12 10:34:53,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:53,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:53,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:53,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:53,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:53,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:53,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 118 transitions, 1231 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:53,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:53,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:53,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:53,803 INFO L124 PetriNetUnfolderBase]: 699/1743 cut-off events. [2024-05-12 10:34:53,803 INFO L125 PetriNetUnfolderBase]: For 32187/32322 co-relation queries the response was YES. [2024-05-12 10:34:53,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8129 conditions, 1743 events. 699/1743 cut-off events. For 32187/32322 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 11096 event pairs, 303 based on Foata normal form. 58/1782 useless extension candidates. Maximal degree in co-relation 8063. Up to 628 conditions per place. [2024-05-12 10:34:53,814 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 62 selfloop transitions, 9 changer transitions 31/130 dead transitions. [2024-05-12 10:34:53,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 130 transitions, 1567 flow [2024-05-12 10:34:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2024-05-12 10:34:53,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-05-12 10:34:53,815 INFO L175 Difference]: Start difference. First operand has 197 places, 118 transitions, 1231 flow. Second operand 5 states and 238 transitions. [2024-05-12 10:34:53,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 130 transitions, 1567 flow [2024-05-12 10:34:53,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 130 transitions, 1424 flow, removed 42 selfloop flow, removed 17 redundant places. [2024-05-12 10:34:53,870 INFO L231 Difference]: Finished difference. Result has 170 places, 89 transitions, 880 flow [2024-05-12 10:34:53,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=880, PETRI_PLACES=170, PETRI_TRANSITIONS=89} [2024-05-12 10:34:53,870 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 102 predicate places. [2024-05-12 10:34:53,871 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 89 transitions, 880 flow [2024-05-12 10:34:53,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:53,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:53,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:53,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 10:34:53,871 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:53,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash 155148752, now seen corresponding path program 1 times [2024-05-12 10:34:53,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:53,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146528491] [2024-05-12 10:34:53,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:53,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:53,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:53,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146528491] [2024-05-12 10:34:53,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146528491] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:53,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:53,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573020685] [2024-05-12 10:34:53,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:53,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:53,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:53,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:53,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:53,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:54,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 89 transitions, 880 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:54,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:54,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:54,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:54,162 INFO L124 PetriNetUnfolderBase]: 561/1336 cut-off events. [2024-05-12 10:34:54,162 INFO L125 PetriNetUnfolderBase]: For 22013/22153 co-relation queries the response was YES. [2024-05-12 10:34:54,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5937 conditions, 1336 events. 561/1336 cut-off events. For 22013/22153 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7856 event pairs, 357 based on Foata normal form. 62/1370 useless extension candidates. Maximal degree in co-relation 5883. Up to 761 conditions per place. [2024-05-12 10:34:54,171 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 61 selfloop transitions, 16 changer transitions 0/105 dead transitions. [2024-05-12 10:34:54,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 105 transitions, 1135 flow [2024-05-12 10:34:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2024-05-12 10:34:54,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-05-12 10:34:54,173 INFO L175 Difference]: Start difference. First operand has 170 places, 89 transitions, 880 flow. Second operand 5 states and 238 transitions. [2024-05-12 10:34:54,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 105 transitions, 1135 flow [2024-05-12 10:34:54,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 105 transitions, 992 flow, removed 31 selfloop flow, removed 19 redundant places. [2024-05-12 10:34:54,200 INFO L231 Difference]: Finished difference. Result has 140 places, 90 transitions, 804 flow [2024-05-12 10:34:54,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=804, PETRI_PLACES=140, PETRI_TRANSITIONS=90} [2024-05-12 10:34:54,201 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 72 predicate places. [2024-05-12 10:34:54,201 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 90 transitions, 804 flow [2024-05-12 10:34:54,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:54,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:54,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:54,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 10:34:54,202 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:54,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:54,202 INFO L85 PathProgramCache]: Analyzing trace with hash 123813536, now seen corresponding path program 2 times [2024-05-12 10:34:54,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:54,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229307681] [2024-05-12 10:34:54,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:54,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:54,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:54,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229307681] [2024-05-12 10:34:54,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229307681] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:54,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:54,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:54,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010304353] [2024-05-12 10:34:54,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:54,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:54,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:54,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:54,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:54,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:54,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 90 transitions, 804 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:54,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:54,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:54,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:54,529 INFO L124 PetriNetUnfolderBase]: 580/1409 cut-off events. [2024-05-12 10:34:54,530 INFO L125 PetriNetUnfolderBase]: For 13552/13658 co-relation queries the response was YES. [2024-05-12 10:34:54,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5242 conditions, 1409 events. 580/1409 cut-off events. For 13552/13658 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 8362 event pairs, 260 based on Foata normal form. 60/1455 useless extension candidates. Maximal degree in co-relation 5199. Up to 587 conditions per place. [2024-05-12 10:34:54,540 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 67 selfloop transitions, 12 changer transitions 0/107 dead transitions. [2024-05-12 10:34:54,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 107 transitions, 1097 flow [2024-05-12 10:34:54,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-05-12 10:34:54,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625974025974026 [2024-05-12 10:34:54,541 INFO L175 Difference]: Start difference. First operand has 140 places, 90 transitions, 804 flow. Second operand 5 states and 241 transitions. [2024-05-12 10:34:54,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 107 transitions, 1097 flow [2024-05-12 10:34:54,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 107 transitions, 1067 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-05-12 10:34:54,570 INFO L231 Difference]: Finished difference. Result has 141 places, 91 transitions, 815 flow [2024-05-12 10:34:54,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=815, PETRI_PLACES=141, PETRI_TRANSITIONS=91} [2024-05-12 10:34:54,570 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 73 predicate places. [2024-05-12 10:34:54,570 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 91 transitions, 815 flow [2024-05-12 10:34:54,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:54,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:54,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:54,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 10:34:54,572 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:54,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash 814008208, now seen corresponding path program 3 times [2024-05-12 10:34:54,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:54,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416681597] [2024-05-12 10:34:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:54,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:54,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:54,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416681597] [2024-05-12 10:34:54,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416681597] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:54,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:54,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:54,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689371510] [2024-05-12 10:34:54,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:54,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:54,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:54,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:54,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:54,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:54,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 91 transitions, 815 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:54,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:54,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:54,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:54,860 INFO L124 PetriNetUnfolderBase]: 571/1399 cut-off events. [2024-05-12 10:34:54,860 INFO L125 PetriNetUnfolderBase]: For 11829/11940 co-relation queries the response was YES. [2024-05-12 10:34:54,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5166 conditions, 1399 events. 571/1399 cut-off events. For 11829/11940 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8269 event pairs, 264 based on Foata normal form. 55/1442 useless extension candidates. Maximal degree in co-relation 5124. Up to 587 conditions per place. [2024-05-12 10:34:54,867 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 59 selfloop transitions, 16 changer transitions 1/104 dead transitions. [2024-05-12 10:34:54,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 104 transitions, 1043 flow [2024-05-12 10:34:54,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2024-05-12 10:34:54,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6155844155844156 [2024-05-12 10:34:54,868 INFO L175 Difference]: Start difference. First operand has 141 places, 91 transitions, 815 flow. Second operand 5 states and 237 transitions. [2024-05-12 10:34:54,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 104 transitions, 1043 flow [2024-05-12 10:34:54,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 104 transitions, 1011 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-05-12 10:34:54,889 INFO L231 Difference]: Finished difference. Result has 143 places, 91 transitions, 819 flow [2024-05-12 10:34:54,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=819, PETRI_PLACES=143, PETRI_TRANSITIONS=91} [2024-05-12 10:34:54,889 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 75 predicate places. [2024-05-12 10:34:54,889 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 91 transitions, 819 flow [2024-05-12 10:34:54,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:54,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:54,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:54,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 10:34:54,890 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:54,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash -316251032, now seen corresponding path program 1 times [2024-05-12 10:34:54,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:54,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611682362] [2024-05-12 10:34:54,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:54,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:54,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:54,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611682362] [2024-05-12 10:34:54,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611682362] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:54,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:54,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:54,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071247032] [2024-05-12 10:34:54,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:54,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:54,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:54,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:55,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:55,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 91 transitions, 819 flow. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:55,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:55,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:55,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:55,178 INFO L124 PetriNetUnfolderBase]: 558/1381 cut-off events. [2024-05-12 10:34:55,178 INFO L125 PetriNetUnfolderBase]: For 10742/10844 co-relation queries the response was YES. [2024-05-12 10:34:55,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4983 conditions, 1381 events. 558/1381 cut-off events. For 10742/10844 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8196 event pairs, 139 based on Foata normal form. 58/1428 useless extension candidates. Maximal degree in co-relation 4941. Up to 493 conditions per place. [2024-05-12 10:34:55,185 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 56 selfloop transitions, 22 changer transitions 1/107 dead transitions. [2024-05-12 10:34:55,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 107 transitions, 1103 flow [2024-05-12 10:34:55,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2024-05-12 10:34:55,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-05-12 10:34:55,186 INFO L175 Difference]: Start difference. First operand has 143 places, 91 transitions, 819 flow. Second operand 5 states and 242 transitions. [2024-05-12 10:34:55,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 107 transitions, 1103 flow [2024-05-12 10:34:55,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 107 transitions, 1070 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-05-12 10:34:55,204 INFO L231 Difference]: Finished difference. Result has 144 places, 91 transitions, 839 flow [2024-05-12 10:34:55,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=139, 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=5, PETRI_FLOW=839, PETRI_PLACES=144, PETRI_TRANSITIONS=91} [2024-05-12 10:34:55,204 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 76 predicate places. [2024-05-12 10:34:55,204 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 91 transitions, 839 flow [2024-05-12 10:34:55,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:55,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:55,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:55,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 10:34:55,205 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:55,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:55,205 INFO L85 PathProgramCache]: Analyzing trace with hash -288669408, now seen corresponding path program 1 times [2024-05-12 10:34:55,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:55,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235039189] [2024-05-12 10:34:55,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:55,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:55,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-05-12 10:34:55,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:55,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235039189] [2024-05-12 10:34:55,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235039189] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:55,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:55,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:55,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476928318] [2024-05-12 10:34:55,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:55,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:55,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:55,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:55,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:55,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:55,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 91 transitions, 839 flow. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:55,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:55,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:55,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:55,455 INFO L124 PetriNetUnfolderBase]: 559/1379 cut-off events. [2024-05-12 10:34:55,456 INFO L125 PetriNetUnfolderBase]: For 11322/11409 co-relation queries the response was YES. [2024-05-12 10:34:55,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5023 conditions, 1379 events. 559/1379 cut-off events. For 11322/11409 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8146 event pairs, 252 based on Foata normal form. 55/1430 useless extension candidates. Maximal degree in co-relation 4980. Up to 577 conditions per place. [2024-05-12 10:34:55,461 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 55 selfloop transitions, 19 changer transitions 1/103 dead transitions. [2024-05-12 10:34:55,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 103 transitions, 1063 flow [2024-05-12 10:34:55,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2024-05-12 10:34:55,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6103896103896104 [2024-05-12 10:34:55,469 INFO L175 Difference]: Start difference. First operand has 144 places, 91 transitions, 839 flow. Second operand 5 states and 235 transitions. [2024-05-12 10:34:55,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 103 transitions, 1063 flow [2024-05-12 10:34:55,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 103 transitions, 1015 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 10:34:55,498 INFO L231 Difference]: Finished difference. Result has 145 places, 91 transitions, 838 flow [2024-05-12 10:34:55,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=838, PETRI_PLACES=145, PETRI_TRANSITIONS=91} [2024-05-12 10:34:55,499 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 77 predicate places. [2024-05-12 10:34:55,499 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 91 transitions, 838 flow [2024-05-12 10:34:55,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:55,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:55,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:55,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 10:34:55,500 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:55,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:55,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1863466917, now seen corresponding path program 1 times [2024-05-12 10:34:55,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:55,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177651686] [2024-05-12 10:34:55,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:55,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:55,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:55,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177651686] [2024-05-12 10:34:55,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177651686] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:55,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:55,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:55,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741803799] [2024-05-12 10:34:55,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:55,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:55,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:55,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:55,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:55,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:55,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 91 transitions, 838 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:55,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:55,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:55,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:55,776 INFO L124 PetriNetUnfolderBase]: 540/1331 cut-off events. [2024-05-12 10:34:55,776 INFO L125 PetriNetUnfolderBase]: For 9120/9200 co-relation queries the response was YES. [2024-05-12 10:34:55,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4706 conditions, 1331 events. 540/1331 cut-off events. For 9120/9200 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7802 event pairs, 131 based on Foata normal form. 55/1379 useless extension candidates. Maximal degree in co-relation 4662. Up to 453 conditions per place. [2024-05-12 10:34:55,782 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 41 selfloop transitions, 10 changer transitions 33/106 dead transitions. [2024-05-12 10:34:55,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 106 transitions, 1076 flow [2024-05-12 10:34:55,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-05-12 10:34:55,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625974025974026 [2024-05-12 10:34:55,783 INFO L175 Difference]: Start difference. First operand has 145 places, 91 transitions, 838 flow. Second operand 5 states and 241 transitions. [2024-05-12 10:34:55,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 106 transitions, 1076 flow [2024-05-12 10:34:55,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 106 transitions, 1035 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-05-12 10:34:55,800 INFO L231 Difference]: Finished difference. Result has 147 places, 66 transitions, 575 flow [2024-05-12 10:34:55,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=575, PETRI_PLACES=147, PETRI_TRANSITIONS=66} [2024-05-12 10:34:55,800 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 79 predicate places. [2024-05-12 10:34:55,801 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 66 transitions, 575 flow [2024-05-12 10:34:55,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:55,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:55,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:55,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 10:34:55,801 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:55,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:55,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1296296907, now seen corresponding path program 1 times [2024-05-12 10:34:55,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:55,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517424893] [2024-05-12 10:34:55,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:55,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:34:55,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:55,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517424893] [2024-05-12 10:34:55,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517424893] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:55,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:55,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:55,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813187757] [2024-05-12 10:34:55,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:55,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:55,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:55,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:55,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:55,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:55,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 66 transitions, 575 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:55,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:55,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:55,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:56,053 INFO L124 PetriNetUnfolderBase]: 289/705 cut-off events. [2024-05-12 10:34:56,053 INFO L125 PetriNetUnfolderBase]: For 7109/7154 co-relation queries the response was YES. [2024-05-12 10:34:56,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 705 events. 289/705 cut-off events. For 7109/7154 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3321 event pairs, 92 based on Foata normal form. 28/718 useless extension candidates. Maximal degree in co-relation 2661. Up to 228 conditions per place. [2024-05-12 10:34:56,057 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 38 selfloop transitions, 13 changer transitions 1/74 dead transitions. [2024-05-12 10:34:56,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 74 transitions, 695 flow [2024-05-12 10:34:56,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-05-12 10:34:56,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5922077922077922 [2024-05-12 10:34:56,059 INFO L175 Difference]: Start difference. First operand has 147 places, 66 transitions, 575 flow. Second operand 5 states and 228 transitions. [2024-05-12 10:34:56,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 74 transitions, 695 flow [2024-05-12 10:34:56,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 74 transitions, 528 flow, removed 17 selfloop flow, removed 40 redundant places. [2024-05-12 10:34:56,073 INFO L231 Difference]: Finished difference. Result has 100 places, 66 transitions, 438 flow [2024-05-12 10:34:56,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=438, PETRI_PLACES=100, PETRI_TRANSITIONS=66} [2024-05-12 10:34:56,074 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 32 predicate places. [2024-05-12 10:34:56,074 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 66 transitions, 438 flow [2024-05-12 10:34:56,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:56,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:34:56,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:56,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 10:34:56,075 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:34:56,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:34:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1630873305, now seen corresponding path program 1 times [2024-05-12 10:34:56,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:34:56,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794058462] [2024-05-12 10:34:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:34:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:34:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:34:56,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-05-12 10:34:56,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:34:56,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794058462] [2024-05-12 10:34:56,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794058462] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:34:56,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:34:56,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:34:56,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662365799] [2024-05-12 10:34:56,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:34:56,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:34:56,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:34:56,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:34:56,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:34:56,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-05-12 10:34:56,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 66 transitions, 438 flow. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:56,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:34:56,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-05-12 10:34:56,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:34:56,303 INFO L124 PetriNetUnfolderBase]: 264/656 cut-off events. [2024-05-12 10:34:56,303 INFO L125 PetriNetUnfolderBase]: For 2568/2617 co-relation queries the response was YES. [2024-05-12 10:34:56,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1933 conditions, 656 events. 264/656 cut-off events. For 2568/2617 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3154 event pairs, 115 based on Foata normal form. 44/690 useless extension candidates. Maximal degree in co-relation 1905. Up to 250 conditions per place. [2024-05-12 10:34:56,305 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 0 selfloop transitions, 0 changer transitions 73/73 dead transitions. [2024-05-12 10:34:56,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 73 transitions, 520 flow [2024-05-12 10:34:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:34:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:34:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2024-05-12 10:34:56,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.587012987012987 [2024-05-12 10:34:56,307 INFO L175 Difference]: Start difference. First operand has 100 places, 66 transitions, 438 flow. Second operand 5 states and 226 transitions. [2024-05-12 10:34:56,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 73 transitions, 520 flow [2024-05-12 10:34:56,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 73 transitions, 442 flow, removed 0 selfloop flow, removed 21 redundant places. [2024-05-12 10:34:56,311 INFO L231 Difference]: Finished difference. Result has 82 places, 0 transitions, 0 flow [2024-05-12 10:34:56,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=82, PETRI_TRANSITIONS=0} [2024-05-12 10:34:56,311 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 14 predicate places. [2024-05-12 10:34:56,312 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 0 transitions, 0 flow [2024-05-12 10:34:56,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:34:56,314 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-05-12 10:34:56,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-05-12 10:34:56,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-05-12 10:34:56,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 8 remaining) [2024-05-12 10:34:56,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-05-12 10:34:56,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-05-12 10:34:56,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-05-12 10:34:56,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2024-05-12 10:34:56,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 10:34:56,317 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:34:56,322 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 10:34:56,322 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 10:34:56,325 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-05-12 10:34:56,325 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-05-12 10:34:56,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 10:34:56 BasicIcfg [2024-05-12 10:34:56,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 10:34:56,326 INFO L158 Benchmark]: Toolchain (without parser) took 59803.93ms. Allocated memory was 144.7MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 83.0MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 921.1MB. Max. memory is 16.1GB. [2024-05-12 10:34:56,327 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 144.7MB. Free memory was 111.4MB in the beginning and 111.3MB in the end (delta: 121.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 10:34:56,327 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 144.7MB. Free memory was 107.9MB in the beginning and 107.7MB in the end (delta: 120.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 10:34:56,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 639.34ms. Allocated memory is still 144.7MB. Free memory was 82.9MB in the beginning and 110.9MB in the end (delta: -28.0MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2024-05-12 10:34:56,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.42ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 110.9MB in the beginning and 155.8MB in the end (delta: -45.0MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-05-12 10:34:56,328 INFO L158 Benchmark]: Boogie Preprocessor took 55.13ms. Allocated memory is still 186.6MB. Free memory was 155.8MB in the beginning and 152.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-05-12 10:34:56,328 INFO L158 Benchmark]: RCFGBuilder took 514.36ms. Allocated memory is still 186.6MB. Free memory was 152.7MB in the beginning and 126.6MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-05-12 10:34:56,328 INFO L158 Benchmark]: TraceAbstraction took 58528.58ms. Allocated memory was 186.6MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 126.6MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 920.9MB. Max. memory is 16.1GB. [2024-05-12 10:34:56,334 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.21ms. Allocated memory is still 144.7MB. Free memory was 111.4MB in the beginning and 111.3MB in the end (delta: 121.4kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.19ms. Allocated memory is still 144.7MB. Free memory was 107.9MB in the beginning and 107.7MB in the end (delta: 120.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 639.34ms. Allocated memory is still 144.7MB. Free memory was 82.9MB in the beginning and 110.9MB in the end (delta: -28.0MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.42ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 110.9MB in the beginning and 155.8MB in the end (delta: -45.0MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.13ms. Allocated memory is still 186.6MB. Free memory was 155.8MB in the beginning and 152.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 514.36ms. Allocated memory is still 186.6MB. Free memory was 152.7MB in the beginning and 126.6MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 58528.58ms. Allocated memory was 186.6MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 126.6MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 920.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 802]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 745]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 819]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 820]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 118 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 58.4s, OverallIterations: 58, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 52.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7477 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4733 mSDsluCounter, 2821 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1924 mSDsCounter, 412 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9790 IncrementalHoareTripleChecker+Invalid, 10202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 412 mSolverCounterUnsat, 897 mSDtfsCounter, 9790 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3475occurred in iteration=43, InterpolantAutomatonStates: 282, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1191 NumberOfCodeBlocks, 1191 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1133 ConstructedInterpolants, 0 QuantifiedInterpolants, 3831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 58 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-12 10:34:56,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE