./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/peterson.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/peterson.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/peterson.i ./goblint.2024-05-07_14-17-48.files/protection/peterson.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 12:37:47,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:37:47,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:37:47,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:37:47,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:37:47,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:37:47,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:37:47,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:37:47,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:37:47,324 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:37:47,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:37:47,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:37:47,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:37:47,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:37:47,327 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:37:47,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:37:47,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:37:47,327 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:37:47,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:37:47,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:37:47,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:37:47,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:37:47,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:37:47,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:37:47,329 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:37:47,329 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:37:47,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:37:47,330 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:37:47,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:37:47,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:37:47,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:37:47,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:37:47,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:37:47,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:37:47,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:37:47,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:37:47,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:37:47,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:37:47,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:37:47,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:37:47,333 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:37:47,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:37:47,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:37:47,333 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 12:37:47,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:37:47,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:37:47,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:37:47,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:37:47,587 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:37:47,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/peterson.i [2024-05-12 12:37:48,675 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:37:48,896 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:37:48,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i [2024-05-12 12:37:48,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b013d3649/794ce41c8f2a42d1a158ff383578ebe6/FLAG9b32329b4 [2024-05-12 12:37:48,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b013d3649/794ce41c8f2a42d1a158ff383578ebe6 [2024-05-12 12:37:48,926 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:37:48,932 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:37:48,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/peterson.yml/witness.yml [2024-05-12 12:37:49,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:37:49,034 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:37:49,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:37:49,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:37:49,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:37:49,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:37:48" (1/2) ... [2024-05-12 12:37:49,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d093da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:37:49, skipping insertion in model container [2024-05-12 12:37:49,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:37:48" (1/2) ... [2024-05-12 12:37:49,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4aea351d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:37:49, skipping insertion in model container [2024-05-12 12:37:49,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:37:49" (2/2) ... [2024-05-12 12:37:49,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d093da and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49, skipping insertion in model container [2024-05-12 12:37:49,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:37:49" (2/2) ... [2024-05-12 12:37:49,043 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:37:49,068 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:37:49,069 INFO L97 edCorrectnessWitness]: Location invariant before [L763-L763] (((! multithreaded || ((0 <= turn && turn <= 1) && (turn == 0 || turn == 1))) && (! multithreaded || ((0 <= flag2 && flag2 <= 1) && (flag2 == 0 || flag2 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= flag1 && flag1 <= 1) && (flag1 == 0 || flag1 == 1))) [2024-05-12 12:37:49,069 INFO L97 edCorrectnessWitness]: Location invariant before [L762-L762] (((! multithreaded || ((0 <= turn && turn <= 1) && (turn == 0 || turn == 1))) && (! multithreaded || ((0 <= flag2 && flag2 <= 1) && (flag2 == 0 || flag2 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= flag1 && flag1 <= 1) && (flag1 == 0 || flag1 == 1))) [2024-05-12 12:37:49,070 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:37:49,070 INFO L106 edCorrectnessWitness]: ghost_update [L761-L761] multithreaded = 1; [2024-05-12 12:37:49,112 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:37:49,417 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/peterson.i[30997,31010] [2024-05-12 12:37:49,424 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/peterson.i[31682,31695] [2024-05-12 12:37:49,432 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:37:49,438 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 12:37:49,512 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/peterson.i[30997,31010] [2024-05-12 12:37:49,516 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/peterson.i[31682,31695] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:37:49,534 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:37:49,567 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:37:49,568 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49 WrapperNode [2024-05-12 12:37:49,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:37:49,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:37:49,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:37:49,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:37:49,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49" (1/1) ... [2024-05-12 12:37:49,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49" (1/1) ... [2024-05-12 12:37:49,656 INFO L138 Inliner]: procedures = 170, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-05-12 12:37:49,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:37:49,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:37:49,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:37:49,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:37:49,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49" (1/1) ... [2024-05-12 12:37:49,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49" (1/1) ... [2024-05-12 12:37:49,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49" (1/1) ... [2024-05-12 12:37:49,707 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 12:37:49,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49" (1/1) ... [2024-05-12 12:37:49,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49" (1/1) ... [2024-05-12 12:37:49,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49" (1/1) ... [2024-05-12 12:37:49,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49" (1/1) ... [2024-05-12 12:37:49,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49" (1/1) ... [2024-05-12 12:37:49,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49" (1/1) ... [2024-05-12 12:37:49,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:37:49,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:37:49,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:37:49,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:37:49,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49" (1/1) ... [2024-05-12 12:37:49,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:37:49,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:37:49,776 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 12:37:49,797 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 12:37:49,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 12:37:49,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 12:37:49,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 12:37:49,818 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-05-12 12:37:49,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-05-12 12:37:49,818 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-05-12 12:37:49,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-05-12 12:37:49,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:37:49,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:37:49,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:37:49,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:37:49,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:37:49,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:37:49,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:37:49,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:37:49,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:37:49,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:37:49,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:37:49,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:37:49,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:37:49,821 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 12:37:49,912 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:37:49,913 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:37:50,039 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:37:50,039 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:37:50,090 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:37:50,090 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-12 12:37:50,091 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:37:50 BoogieIcfgContainer [2024-05-12 12:37:50,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:37:50,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:37:50,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:37:50,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:37:50,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:37:48" (1/4) ... [2024-05-12 12:37:50,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd85e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:37:50, skipping insertion in model container [2024-05-12 12:37:50,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:37:49" (2/4) ... [2024-05-12 12:37:50,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd85e0c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:37:50, skipping insertion in model container [2024-05-12 12:37:50,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49" (3/4) ... [2024-05-12 12:37:50,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd85e0c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:37:50, skipping insertion in model container [2024-05-12 12:37:50,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:37:50" (4/4) ... [2024-05-12 12:37:50,097 INFO L112 eAbstractionObserver]: Analyzing ICFG peterson.i [2024-05-12 12:37:50,109 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:37:50,109 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 12:37:50,110 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:37:50,164 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-12 12:37:50,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 108 flow [2024-05-12 12:37:50,210 INFO L124 PetriNetUnfolderBase]: 4/45 cut-off events. [2024-05-12 12:37:50,211 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-05-12 12:37:50,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 45 events. 4/45 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-05-12 12:37:50,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 47 transitions, 108 flow [2024-05-12 12:37:50,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 43 transitions, 95 flow [2024-05-12 12:37:50,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:37:50,232 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;@4203b809, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:37:50,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-05-12 12:37:50,235 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:37:50,236 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 12:37:50,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:37:50,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:50,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:37:50,237 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 12:37:50,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2136088186, now seen corresponding path program 1 times [2024-05-12 12:37:50,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:50,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779689321] [2024-05-12 12:37:50,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:50,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:50,602 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 12:37:50,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:50,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779689321] [2024-05-12 12:37:50,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779689321] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:50,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:50,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:37:50,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202529572] [2024-05-12 12:37:50,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:50,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:37:50,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:50,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:37:50,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:37:50,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-05-12 12:37:50,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:37:50,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:50,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-05-12 12:37:50,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:50,854 INFO L124 PetriNetUnfolderBase]: 213/551 cut-off events. [2024-05-12 12:37:50,854 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-05-12 12:37:50,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 551 events. 213/551 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3136 event pairs, 103 based on Foata normal form. 42/536 useless extension candidates. Maximal degree in co-relation 866. Up to 339 conditions per place. [2024-05-12 12:37:50,865 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 26 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2024-05-12 12:37:50,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 166 flow [2024-05-12 12:37:50,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:37:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:37:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-05-12 12:37:50,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6808510638297872 [2024-05-12 12:37:50,909 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 95 flow. Second operand 3 states and 96 transitions. [2024-05-12 12:37:50,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 166 flow [2024-05-12 12:37:50,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 12:37:50,917 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 107 flow [2024-05-12 12:37:50,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2024-05-12 12:37:50,923 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2024-05-12 12:37:50,924 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 107 flow [2024-05-12 12:37:50,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:37:50,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:50,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:50,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:37:50,925 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 12:37:50,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:50,926 INFO L85 PathProgramCache]: Analyzing trace with hash -212082223, now seen corresponding path program 1 times [2024-05-12 12:37:50,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:50,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816894851] [2024-05-12 12:37:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:51,102 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 12:37:51,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:51,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816894851] [2024-05-12 12:37:51,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816894851] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:51,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:51,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:37:51,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065847649] [2024-05-12 12:37:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:51,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:37:51,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:51,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:37:51,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:37:51,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-05-12 12:37:51,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:37:51,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:51,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-05-12 12:37:51,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:51,259 INFO L124 PetriNetUnfolderBase]: 245/603 cut-off events. [2024-05-12 12:37:51,259 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-05-12 12:37:51,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 603 events. 245/603 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3379 event pairs, 106 based on Foata normal form. 2/582 useless extension candidates. Maximal degree in co-relation 964. Up to 382 conditions per place. [2024-05-12 12:37:51,263 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 32 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-05-12 12:37:51,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 211 flow [2024-05-12 12:37:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:37:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:37:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-05-12 12:37:51,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6329787234042553 [2024-05-12 12:37:51,265 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 107 flow. Second operand 4 states and 119 transitions. [2024-05-12 12:37:51,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 211 flow [2024-05-12 12:37:51,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:37:51,267 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 131 flow [2024-05-12 12:37:51,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2024-05-12 12:37:51,268 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2024-05-12 12:37:51,268 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 131 flow [2024-05-12 12:37:51,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:37:51,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:51,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:51,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:37:51,269 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 12:37:51,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2015386970, now seen corresponding path program 1 times [2024-05-12 12:37:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:51,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094193125] [2024-05-12 12:37:51,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:51,347 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 12:37:51,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:51,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094193125] [2024-05-12 12:37:51,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094193125] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:51,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:51,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:37:51,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78276049] [2024-05-12 12:37:51,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:51,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:37:51,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:51,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:37:51,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:37:51,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 12:37:51,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:37:51,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:51,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 12:37:51,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:51,504 INFO L124 PetriNetUnfolderBase]: 272/608 cut-off events. [2024-05-12 12:37:51,505 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2024-05-12 12:37:51,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 608 events. 272/608 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3216 event pairs, 99 based on Foata normal form. 10/607 useless extension candidates. Maximal degree in co-relation 1063. Up to 378 conditions per place. [2024-05-12 12:37:51,508 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 39 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2024-05-12 12:37:51,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 276 flow [2024-05-12 12:37:51,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:37:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:37:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-05-12 12:37:51,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6127659574468085 [2024-05-12 12:37:51,512 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 131 flow. Second operand 5 states and 144 transitions. [2024-05-12 12:37:51,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 276 flow [2024-05-12 12:37:51,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 267 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-05-12 12:37:51,515 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 157 flow [2024-05-12 12:37:51,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2024-05-12 12:37:51,516 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2024-05-12 12:37:51,517 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 157 flow [2024-05-12 12:37:51,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:37:51,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:51,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:51,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:37:51,518 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 12:37:51,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:51,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1409831179, now seen corresponding path program 1 times [2024-05-12 12:37:51,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:51,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815401014] [2024-05-12 12:37:51,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:51,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:51,651 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 12:37:51,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:51,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815401014] [2024-05-12 12:37:51,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815401014] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:51,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:51,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:37:51,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219962458] [2024-05-12 12:37:51,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:51,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:37:51,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:51,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:37:51,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:37:51,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-05-12 12:37:51,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 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 12:37:51,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:51,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-05-12 12:37:51,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:51,751 INFO L124 PetriNetUnfolderBase]: 241/555 cut-off events. [2024-05-12 12:37:51,751 INFO L125 PetriNetUnfolderBase]: For 361/375 co-relation queries the response was YES. [2024-05-12 12:37:51,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 555 events. 241/555 cut-off events. For 361/375 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2932 event pairs, 94 based on Foata normal form. 1/539 useless extension candidates. Maximal degree in co-relation 1119. Up to 381 conditions per place. [2024-05-12 12:37:51,755 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 32 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2024-05-12 12:37:51,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 253 flow [2024-05-12 12:37:51,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:37:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:37:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-05-12 12:37:51,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6117021276595744 [2024-05-12 12:37:51,757 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 157 flow. Second operand 4 states and 115 transitions. [2024-05-12 12:37:51,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 253 flow [2024-05-12 12:37:51,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 241 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-05-12 12:37:51,761 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 170 flow [2024-05-12 12:37:51,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2024-05-12 12:37:51,763 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2024-05-12 12:37:51,763 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 170 flow [2024-05-12 12:37:51,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 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 12:37:51,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:51,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:51,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:37:51,764 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 12:37:51,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1947411018, now seen corresponding path program 1 times [2024-05-12 12:37:51,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:51,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268772738] [2024-05-12 12:37:51,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:51,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:51,900 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 12:37:51,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:51,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268772738] [2024-05-12 12:37:51,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268772738] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:51,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:51,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:37:51,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6047213] [2024-05-12 12:37:51,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:51,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:37:51,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:51,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:37:51,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:37:51,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 12:37:51,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:37:51,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:51,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 12:37:51,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:52,032 INFO L124 PetriNetUnfolderBase]: 273/592 cut-off events. [2024-05-12 12:37:52,033 INFO L125 PetriNetUnfolderBase]: For 569/586 co-relation queries the response was YES. [2024-05-12 12:37:52,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 592 events. 273/592 cut-off events. For 569/586 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3016 event pairs, 109 based on Foata normal form. 3/578 useless extension candidates. Maximal degree in co-relation 1287. Up to 419 conditions per place. [2024-05-12 12:37:52,036 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 39 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2024-05-12 12:37:52,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 322 flow [2024-05-12 12:37:52,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:37:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:37:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2024-05-12 12:37:52,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-05-12 12:37:52,038 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 170 flow. Second operand 5 states and 141 transitions. [2024-05-12 12:37:52,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 322 flow [2024-05-12 12:37:52,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 313 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-05-12 12:37:52,040 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 206 flow [2024-05-12 12:37:52,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-05-12 12:37:52,041 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2024-05-12 12:37:52,041 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 206 flow [2024-05-12 12:37:52,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:37:52,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:52,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:52,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:37:52,042 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 12:37:52,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:52,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1959720238, now seen corresponding path program 2 times [2024-05-12 12:37:52,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:52,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177652280] [2024-05-12 12:37:52,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:52,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:52,132 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 12:37:52,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:52,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177652280] [2024-05-12 12:37:52,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177652280] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:52,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:52,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:37:52,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977509855] [2024-05-12 12:37:52,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:52,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:37:52,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:52,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:37:52,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:37:52,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 12:37:52,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:37:52,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:52,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 12:37:52,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:52,265 INFO L124 PetriNetUnfolderBase]: 273/602 cut-off events. [2024-05-12 12:37:52,266 INFO L125 PetriNetUnfolderBase]: For 849/865 co-relation queries the response was YES. [2024-05-12 12:37:52,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 602 events. 273/602 cut-off events. For 849/865 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3112 event pairs, 112 based on Foata normal form. 9/596 useless extension candidates. Maximal degree in co-relation 1137. Up to 417 conditions per place. [2024-05-12 12:37:52,270 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 35 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2024-05-12 12:37:52,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 62 transitions, 316 flow [2024-05-12 12:37:52,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:37:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:37:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-05-12 12:37:52,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5829787234042553 [2024-05-12 12:37:52,271 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 206 flow. Second operand 5 states and 137 transitions. [2024-05-12 12:37:52,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 62 transitions, 316 flow [2024-05-12 12:37:52,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 306 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-05-12 12:37:52,277 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 221 flow [2024-05-12 12:37:52,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-05-12 12:37:52,279 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2024-05-12 12:37:52,280 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 221 flow [2024-05-12 12:37:52,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:37:52,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:52,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:52,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:37:52,283 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 12:37:52,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1077928913, now seen corresponding path program 1 times [2024-05-12 12:37:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:52,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094095675] [2024-05-12 12:37:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:52,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:52,398 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 12:37:52,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:52,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094095675] [2024-05-12 12:37:52,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094095675] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:52,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:52,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:37:52,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064212946] [2024-05-12 12:37:52,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:52,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:52,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:52,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:52,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:52,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:52,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:52,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:52,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:52,561 INFO L124 PetriNetUnfolderBase]: 388/868 cut-off events. [2024-05-12 12:37:52,561 INFO L125 PetriNetUnfolderBase]: For 1427/1446 co-relation queries the response was YES. [2024-05-12 12:37:52,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2226 conditions, 868 events. 388/868 cut-off events. For 1427/1446 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5000 event pairs, 83 based on Foata normal form. 59/912 useless extension candidates. Maximal degree in co-relation 1992. Up to 298 conditions per place. [2024-05-12 12:37:52,567 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 51 selfloop transitions, 20 changer transitions 0/87 dead transitions. [2024-05-12 12:37:52,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 488 flow [2024-05-12 12:37:52,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:52,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2024-05-12 12:37:52,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6276595744680851 [2024-05-12 12:37:52,569 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 221 flow. Second operand 6 states and 177 transitions. [2024-05-12 12:37:52,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 488 flow [2024-05-12 12:37:52,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 87 transitions, 463 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-05-12 12:37:52,573 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 332 flow [2024-05-12 12:37:52,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2024-05-12 12:37:52,574 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2024-05-12 12:37:52,574 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 332 flow [2024-05-12 12:37:52,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:52,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:52,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:52,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:37:52,575 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 12:37:52,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:52,575 INFO L85 PathProgramCache]: Analyzing trace with hash -246877933, now seen corresponding path program 2 times [2024-05-12 12:37:52,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:52,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960113904] [2024-05-12 12:37:52,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:52,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:52,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 12:37:52,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:52,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960113904] [2024-05-12 12:37:52,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960113904] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:52,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:52,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:37:52,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675361565] [2024-05-12 12:37:52,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:52,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:52,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:52,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:52,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:52,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:52,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:52,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:52,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:52,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:52,830 INFO L124 PetriNetUnfolderBase]: 434/988 cut-off events. [2024-05-12 12:37:52,830 INFO L125 PetriNetUnfolderBase]: For 2753/2782 co-relation queries the response was YES. [2024-05-12 12:37:52,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2957 conditions, 988 events. 434/988 cut-off events. For 2753/2782 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5963 event pairs, 89 based on Foata normal form. 22/990 useless extension candidates. Maximal degree in co-relation 2701. Up to 312 conditions per place. [2024-05-12 12:37:52,837 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 52 selfloop transitions, 22 changer transitions 0/90 dead transitions. [2024-05-12 12:37:52,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 90 transitions, 625 flow [2024-05-12 12:37:52,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-05-12 12:37:52,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-05-12 12:37:52,838 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 332 flow. Second operand 6 states and 170 transitions. [2024-05-12 12:37:52,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 90 transitions, 625 flow [2024-05-12 12:37:52,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 619 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-05-12 12:37:52,844 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 420 flow [2024-05-12 12:37:52,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=420, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2024-05-12 12:37:52,846 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2024-05-12 12:37:52,846 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 420 flow [2024-05-12 12:37:52,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:52,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:52,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:52,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:37:52,847 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 12:37:52,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:52,847 INFO L85 PathProgramCache]: Analyzing trace with hash -647701423, now seen corresponding path program 3 times [2024-05-12 12:37:52,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:52,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287822365] [2024-05-12 12:37:52,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:52,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:52,938 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 12:37:52,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:52,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287822365] [2024-05-12 12:37:52,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287822365] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:52,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:52,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:37:52,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62629695] [2024-05-12 12:37:52,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:52,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:52,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:52,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:52,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:52,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:52,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 420 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:52,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:52,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:52,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:53,072 INFO L124 PetriNetUnfolderBase]: 421/964 cut-off events. [2024-05-12 12:37:53,072 INFO L125 PetriNetUnfolderBase]: For 3546/3576 co-relation queries the response was YES. [2024-05-12 12:37:53,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3060 conditions, 964 events. 421/964 cut-off events. For 3546/3576 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5770 event pairs, 79 based on Foata normal form. 13/964 useless extension candidates. Maximal degree in co-relation 2196. Up to 310 conditions per place. [2024-05-12 12:37:53,078 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 55 selfloop transitions, 19 changer transitions 0/90 dead transitions. [2024-05-12 12:37:53,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 90 transitions, 674 flow [2024-05-12 12:37:53,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-05-12 12:37:53,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-05-12 12:37:53,079 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 420 flow. Second operand 6 states and 170 transitions. [2024-05-12 12:37:53,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 90 transitions, 674 flow [2024-05-12 12:37:53,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 90 transitions, 646 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-05-12 12:37:53,086 INFO L231 Difference]: Finished difference. Result has 77 places, 67 transitions, 436 flow [2024-05-12 12:37:53,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=436, PETRI_PLACES=77, PETRI_TRANSITIONS=67} [2024-05-12 12:37:53,087 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 31 predicate places. [2024-05-12 12:37:53,087 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 67 transitions, 436 flow [2024-05-12 12:37:53,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:53,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:53,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:53,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 12:37:53,088 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 12:37:53,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:53,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1676968692, now seen corresponding path program 1 times [2024-05-12 12:37:53,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:53,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750192135] [2024-05-12 12:37:53,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:53,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:53,168 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 12:37:53,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:53,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750192135] [2024-05-12 12:37:53,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750192135] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:53,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:53,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:37:53,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166614246] [2024-05-12 12:37:53,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:53,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:53,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:53,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:53,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:53,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:53,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 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 12:37:53,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:53,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:53,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:53,320 INFO L124 PetriNetUnfolderBase]: 468/1110 cut-off events. [2024-05-12 12:37:53,321 INFO L125 PetriNetUnfolderBase]: For 4375/4414 co-relation queries the response was YES. [2024-05-12 12:37:53,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3382 conditions, 1110 events. 468/1110 cut-off events. For 4375/4414 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7029 event pairs, 76 based on Foata normal form. 16/1114 useless extension candidates. Maximal degree in co-relation 2466. Up to 399 conditions per place. [2024-05-12 12:37:53,327 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 74 selfloop transitions, 13 changer transitions 2/105 dead transitions. [2024-05-12 12:37:53,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 105 transitions, 800 flow [2024-05-12 12:37:53,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2024-05-12 12:37:53,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6134751773049646 [2024-05-12 12:37:53,329 INFO L175 Difference]: Start difference. First operand has 77 places, 67 transitions, 436 flow. Second operand 6 states and 173 transitions. [2024-05-12 12:37:53,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 105 transitions, 800 flow [2024-05-12 12:37:53,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 105 transitions, 750 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-05-12 12:37:53,335 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 471 flow [2024-05-12 12:37:53,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2024-05-12 12:37:53,336 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2024-05-12 12:37:53,336 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 471 flow [2024-05-12 12:37:53,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 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 12:37:53,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:53,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:53,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:37:53,337 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 12:37:53,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:53,337 INFO L85 PathProgramCache]: Analyzing trace with hash -943940549, now seen corresponding path program 1 times [2024-05-12 12:37:53,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:53,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408453330] [2024-05-12 12:37:53,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:53,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:37:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408453330] [2024-05-12 12:37:53,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408453330] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:53,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:53,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:37:53,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310393832] [2024-05-12 12:37:53,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:53,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:53,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:53,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:53,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:53,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:53,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 471 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 12:37:53,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:53,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:53,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:53,577 INFO L124 PetriNetUnfolderBase]: 456/1068 cut-off events. [2024-05-12 12:37:53,578 INFO L125 PetriNetUnfolderBase]: For 4569/4600 co-relation queries the response was YES. [2024-05-12 12:37:53,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3467 conditions, 1068 events. 456/1068 cut-off events. For 4569/4600 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6640 event pairs, 116 based on Foata normal form. 26/1076 useless extension candidates. Maximal degree in co-relation 2737. Up to 318 conditions per place. [2024-05-12 12:37:53,583 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 52 selfloop transitions, 26 changer transitions 0/94 dead transitions. [2024-05-12 12:37:53,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 94 transitions, 744 flow [2024-05-12 12:37:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-05-12 12:37:53,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-05-12 12:37:53,584 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 471 flow. Second operand 6 states and 168 transitions. [2024-05-12 12:37:53,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 94 transitions, 744 flow [2024-05-12 12:37:53,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 94 transitions, 730 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-05-12 12:37:53,593 INFO L231 Difference]: Finished difference. Result has 87 places, 73 transitions, 550 flow [2024-05-12 12:37:53,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=87, PETRI_TRANSITIONS=73} [2024-05-12 12:37:53,594 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 41 predicate places. [2024-05-12 12:37:53,594 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 73 transitions, 550 flow [2024-05-12 12:37:53,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 12:37:53,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:53,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:53,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 12:37:53,595 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 12:37:53,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2095410143, now seen corresponding path program 2 times [2024-05-12 12:37:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:53,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574386604] [2024-05-12 12:37:53,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:53,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:53,672 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 12:37:53,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:53,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574386604] [2024-05-12 12:37:53,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574386604] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:53,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:53,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:37:53,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493610367] [2024-05-12 12:37:53,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:53,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:53,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:53,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:53,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:53,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:53,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 73 transitions, 550 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 12:37:53,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:53,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:53,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:53,820 INFO L124 PetriNetUnfolderBase]: 463/1106 cut-off events. [2024-05-12 12:37:53,820 INFO L125 PetriNetUnfolderBase]: For 5584/5613 co-relation queries the response was YES. [2024-05-12 12:37:53,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3711 conditions, 1106 events. 463/1106 cut-off events. For 5584/5613 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6945 event pairs, 103 based on Foata normal form. 13/1109 useless extension candidates. Maximal degree in co-relation 2751. Up to 319 conditions per place. [2024-05-12 12:37:53,827 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 57 selfloop transitions, 23 changer transitions 0/96 dead transitions. [2024-05-12 12:37:53,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 96 transitions, 837 flow [2024-05-12 12:37:53,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:53,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-05-12 12:37:53,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-05-12 12:37:53,829 INFO L175 Difference]: Start difference. First operand has 87 places, 73 transitions, 550 flow. Second operand 6 states and 168 transitions. [2024-05-12 12:37:53,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 96 transitions, 837 flow [2024-05-12 12:37:53,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 96 transitions, 769 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-05-12 12:37:53,839 INFO L231 Difference]: Finished difference. Result has 89 places, 76 transitions, 578 flow [2024-05-12 12:37:53,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=578, PETRI_PLACES=89, PETRI_TRANSITIONS=76} [2024-05-12 12:37:53,839 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 43 predicate places. [2024-05-12 12:37:53,840 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 76 transitions, 578 flow [2024-05-12 12:37:53,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 12:37:53,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:53,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:53,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 12:37:53,840 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 12:37:53,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:53,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1385472396, now seen corresponding path program 1 times [2024-05-12 12:37:53,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:53,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298046523] [2024-05-12 12:37:53,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:53,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:37:53,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:53,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298046523] [2024-05-12 12:37:53,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298046523] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:53,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:53,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:37:53,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330906891] [2024-05-12 12:37:53,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:53,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:53,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:53,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:53,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:53,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:53,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 76 transitions, 578 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:53,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:53,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:53,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:54,093 INFO L124 PetriNetUnfolderBase]: 606/1332 cut-off events. [2024-05-12 12:37:54,093 INFO L125 PetriNetUnfolderBase]: For 7729/7758 co-relation queries the response was YES. [2024-05-12 12:37:54,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4641 conditions, 1332 events. 606/1332 cut-off events. For 7729/7758 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8380 event pairs, 196 based on Foata normal form. 27/1343 useless extension candidates. Maximal degree in co-relation 3919. Up to 535 conditions per place. [2024-05-12 12:37:54,102 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 64 selfloop transitions, 21 changer transitions 6/107 dead transitions. [2024-05-12 12:37:54,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 107 transitions, 938 flow [2024-05-12 12:37:54,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2024-05-12 12:37:54,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.599290780141844 [2024-05-12 12:37:54,103 INFO L175 Difference]: Start difference. First operand has 89 places, 76 transitions, 578 flow. Second operand 6 states and 169 transitions. [2024-05-12 12:37:54,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 107 transitions, 938 flow [2024-05-12 12:37:54,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 107 transitions, 889 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 12:37:54,113 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 640 flow [2024-05-12 12:37:54,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=640, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2024-05-12 12:37:54,113 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 47 predicate places. [2024-05-12 12:37:54,114 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 640 flow [2024-05-12 12:37:54,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:37:54,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:54,114 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 12:37:54,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 12:37:54,114 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 12:37:54,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:54,115 INFO L85 PathProgramCache]: Analyzing trace with hash 411927719, now seen corresponding path program 1 times [2024-05-12 12:37:54,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:54,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508582145] [2024-05-12 12:37:54,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:54,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:54,177 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 12:37:54,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:54,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508582145] [2024-05-12 12:37:54,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508582145] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:54,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:54,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:37:54,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359618900] [2024-05-12 12:37:54,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:54,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:54,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:54,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:54,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:54,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 12:37:54,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 640 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 12:37:54,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:54,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 12:37:54,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:54,437 INFO L124 PetriNetUnfolderBase]: 803/1720 cut-off events. [2024-05-12 12:37:54,437 INFO L125 PetriNetUnfolderBase]: For 7075/7085 co-relation queries the response was YES. [2024-05-12 12:37:54,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5493 conditions, 1720 events. 803/1720 cut-off events. For 7075/7085 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11338 event pairs, 200 based on Foata normal form. 51/1732 useless extension candidates. Maximal degree in co-relation 4753. Up to 451 conditions per place. [2024-05-12 12:37:54,452 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 78 selfloop transitions, 41 changer transitions 0/140 dead transitions. [2024-05-12 12:37:54,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 140 transitions, 1100 flow [2024-05-12 12:37:54,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:37:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:37:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 280 transitions. [2024-05-12 12:37:54,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-05-12 12:37:54,454 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 640 flow. Second operand 10 states and 280 transitions. [2024-05-12 12:37:54,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 140 transitions, 1100 flow [2024-05-12 12:37:54,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 140 transitions, 1068 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-05-12 12:37:54,467 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 899 flow [2024-05-12 12:37:54,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=899, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2024-05-12 12:37:54,468 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 63 predicate places. [2024-05-12 12:37:54,468 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 899 flow [2024-05-12 12:37:54,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 12:37:54,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:54,469 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 12:37:54,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 12:37:54,469 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 12:37:54,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:54,470 INFO L85 PathProgramCache]: Analyzing trace with hash -914918837, now seen corresponding path program 2 times [2024-05-12 12:37:54,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:54,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34775784] [2024-05-12 12:37:54,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:54,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:54,570 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 12:37:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:54,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34775784] [2024-05-12 12:37:54,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34775784] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:54,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:54,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:37:54,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666980767] [2024-05-12 12:37:54,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:54,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:54,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:54,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:54,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:54,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:54,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 899 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 12:37:54,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:54,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:54,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:54,806 INFO L124 PetriNetUnfolderBase]: 765/1715 cut-off events. [2024-05-12 12:37:54,807 INFO L125 PetriNetUnfolderBase]: For 12543/12594 co-relation queries the response was YES. [2024-05-12 12:37:54,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7024 conditions, 1715 events. 765/1715 cut-off events. For 12543/12594 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11704 event pairs, 256 based on Foata normal form. 15/1703 useless extension candidates. Maximal degree in co-relation 5907. Up to 500 conditions per place. [2024-05-12 12:37:54,824 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 71 selfloop transitions, 30 changer transitions 2/128 dead transitions. [2024-05-12 12:37:54,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 128 transitions, 1323 flow [2024-05-12 12:37:54,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:54,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:54,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-05-12 12:37:54,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-05-12 12:37:54,826 INFO L175 Difference]: Start difference. First operand has 109 places, 97 transitions, 899 flow. Second operand 6 states and 170 transitions. [2024-05-12 12:37:54,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 128 transitions, 1323 flow [2024-05-12 12:37:54,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 128 transitions, 1323 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-05-12 12:37:54,850 INFO L231 Difference]: Finished difference. Result has 116 places, 102 transitions, 1012 flow [2024-05-12 12:37:54,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1012, PETRI_PLACES=116, PETRI_TRANSITIONS=102} [2024-05-12 12:37:54,851 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 70 predicate places. [2024-05-12 12:37:54,851 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 102 transitions, 1012 flow [2024-05-12 12:37:54,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 12:37:54,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:54,852 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 12:37:54,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 12:37:54,852 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 12:37:54,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:54,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1079164697, now seen corresponding path program 3 times [2024-05-12 12:37:54,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:54,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118015744] [2024-05-12 12:37:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:54,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:54,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 12:37:54,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:54,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118015744] [2024-05-12 12:37:54,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118015744] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:54,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:54,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:37:54,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325434077] [2024-05-12 12:37:54,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:54,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:54,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:54,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:54,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:54,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:54,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 102 transitions, 1012 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 12:37:54,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:54,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:54,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:55,204 INFO L124 PetriNetUnfolderBase]: 795/1753 cut-off events. [2024-05-12 12:37:55,204 INFO L125 PetriNetUnfolderBase]: For 14833/14925 co-relation queries the response was YES. [2024-05-12 12:37:55,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7651 conditions, 1753 events. 795/1753 cut-off events. For 14833/14925 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11852 event pairs, 240 based on Foata normal form. 28/1742 useless extension candidates. Maximal degree in co-relation 6369. Up to 559 conditions per place. [2024-05-12 12:37:55,217 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 67 selfloop transitions, 31 changer transitions 6/129 dead transitions. [2024-05-12 12:37:55,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 129 transitions, 1406 flow [2024-05-12 12:37:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-05-12 12:37:55,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6063829787234043 [2024-05-12 12:37:55,219 INFO L175 Difference]: Start difference. First operand has 116 places, 102 transitions, 1012 flow. Second operand 6 states and 171 transitions. [2024-05-12 12:37:55,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 129 transitions, 1406 flow [2024-05-12 12:37:55,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 129 transitions, 1370 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-05-12 12:37:55,245 INFO L231 Difference]: Finished difference. Result has 122 places, 103 transitions, 1093 flow [2024-05-12 12:37:55,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1093, PETRI_PLACES=122, PETRI_TRANSITIONS=103} [2024-05-12 12:37:55,247 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 76 predicate places. [2024-05-12 12:37:55,247 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 103 transitions, 1093 flow [2024-05-12 12:37:55,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 12:37:55,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:55,247 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 12:37:55,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 12:37:55,247 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 12:37:55,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:55,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1318035796, now seen corresponding path program 1 times [2024-05-12 12:37:55,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:55,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442595427] [2024-05-12 12:37:55,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:55,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:55,332 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 12:37:55,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:55,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442595427] [2024-05-12 12:37:55,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442595427] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:55,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:55,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:37:55,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125182555] [2024-05-12 12:37:55,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:55,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:55,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:55,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:55,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:55,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:55,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 103 transitions, 1093 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 12:37:55,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:55,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:55,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:55,614 INFO L124 PetriNetUnfolderBase]: 825/1828 cut-off events. [2024-05-12 12:37:55,614 INFO L125 PetriNetUnfolderBase]: For 18914/19007 co-relation queries the response was YES. [2024-05-12 12:37:55,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8339 conditions, 1828 events. 825/1828 cut-off events. For 18914/19007 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12509 event pairs, 150 based on Foata normal form. 15/1789 useless extension candidates. Maximal degree in co-relation 8111. Up to 595 conditions per place. [2024-05-12 12:37:55,628 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 76 selfloop transitions, 29 changer transitions 6/136 dead transitions. [2024-05-12 12:37:55,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 1529 flow [2024-05-12 12:37:55,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2024-05-12 12:37:55,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6099290780141844 [2024-05-12 12:37:55,630 INFO L175 Difference]: Start difference. First operand has 122 places, 103 transitions, 1093 flow. Second operand 6 states and 172 transitions. [2024-05-12 12:37:55,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 1529 flow [2024-05-12 12:37:55,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 136 transitions, 1489 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-05-12 12:37:55,655 INFO L231 Difference]: Finished difference. Result has 129 places, 106 transitions, 1200 flow [2024-05-12 12:37:55,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1200, PETRI_PLACES=129, PETRI_TRANSITIONS=106} [2024-05-12 12:37:55,656 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 83 predicate places. [2024-05-12 12:37:55,656 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 106 transitions, 1200 flow [2024-05-12 12:37:55,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 12:37:55,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:55,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:55,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 12:37:55,656 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 12:37:55,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:55,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1216506758, now seen corresponding path program 1 times [2024-05-12 12:37:55,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:55,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103347295] [2024-05-12 12:37:55,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:55,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:55,742 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 12:37:55,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:55,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103347295] [2024-05-12 12:37:55,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103347295] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:55,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:55,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:37:55,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100301320] [2024-05-12 12:37:55,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:55,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:55,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:55,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:55,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:55,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:55,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 106 transitions, 1200 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:37:55,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:55,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:55,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:55,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), 24#L728true, Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, 190#(= ~flag1~0 0), Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 6#L763true, Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 12:37:55,994 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-05-12 12:37:55,994 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-05-12 12:37:55,994 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-05-12 12:37:55,994 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-05-12 12:37:55,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, 190#(= ~flag1~0 0), Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 39#thr1EXITtrue, 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 6#L763true, Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 12:37:55,994 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-05-12 12:37:55,994 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 12:37:55,994 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 12:37:55,995 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 12:37:55,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [24#L728true, Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, 190#(= ~flag1~0 0), Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 43#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 198#true, Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 12:37:55,995 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-05-12 12:37:55,995 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 12:37:55,995 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 12:37:55,995 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 12:37:55,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), 20#L753true, Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), 190#(= ~flag1~0 0), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 39#thr1EXITtrue, 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 73#true, Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, 17#L763-2true, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 12:37:55,995 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-05-12 12:37:55,996 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 12:37:55,996 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-05-12 12:37:55,996 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 12:37:55,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), 24#L728true, Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), 190#(= ~flag1~0 0), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 73#true, Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, 17#L763-2true, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 12:37:55,996 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-05-12 12:37:55,996 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 12:37:55,996 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 12:37:55,996 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 12:37:55,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), 190#(= ~flag1~0 0), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 39#thr1EXITtrue, 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 73#true, Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 43#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 12:37:55,997 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-05-12 12:37:55,997 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 12:37:55,997 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 12:37:55,997 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-05-12 12:37:56,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, 190#(= ~flag1~0 0), Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), 27#L763-3true, Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 12:37:56,008 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-05-12 12:37:56,008 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-05-12 12:37:56,008 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-05-12 12:37:56,009 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-05-12 12:37:56,012 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), 24#L728true, Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, 190#(= ~flag1~0 0), Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), 17#L763-2true, Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 12:37:56,013 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-05-12 12:37:56,013 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 12:37:56,013 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 12:37:56,013 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 12:37:56,013 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 12:37:56,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, 190#(= ~flag1~0 0), Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, 11#L764-1true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 12:37:56,017 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-05-12 12:37:56,018 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 12:37:56,018 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 12:37:56,018 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 12:37:56,020 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), 190#(= ~flag1~0 0), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 39#thr1EXITtrue, 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 73#true, Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), 17#L763-2true, Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 12:37:56,020 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-05-12 12:37:56,020 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 12:37:56,020 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-05-12 12:37:56,020 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-05-12 12:37:56,020 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 12:37:56,065 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), 190#(= ~flag1~0 0), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 73#true, Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), 27#L763-3true, Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 12:37:56,065 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-05-12 12:37:56,065 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-05-12 12:37:56,065 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-05-12 12:37:56,065 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-05-12 12:37:56,065 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-05-12 12:37:56,067 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, 190#(= ~flag1~0 0), Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 11#L764-1true, Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 12:37:56,067 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-05-12 12:37:56,067 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 12:37:56,067 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 12:37:56,067 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 12:37:56,067 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 12:37:56,067 INFO L124 PetriNetUnfolderBase]: 878/1948 cut-off events. [2024-05-12 12:37:56,067 INFO L125 PetriNetUnfolderBase]: For 24168/24300 co-relation queries the response was YES. [2024-05-12 12:37:56,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9215 conditions, 1948 events. 878/1948 cut-off events. For 24168/24300 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13715 event pairs, 324 based on Foata normal form. 32/1921 useless extension candidates. Maximal degree in co-relation 8324. Up to 747 conditions per place. [2024-05-12 12:37:56,081 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 72 selfloop transitions, 35 changer transitions 0/132 dead transitions. [2024-05-12 12:37:56,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 132 transitions, 1600 flow [2024-05-12 12:37:56,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2024-05-12 12:37:56,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.599290780141844 [2024-05-12 12:37:56,082 INFO L175 Difference]: Start difference. First operand has 129 places, 106 transitions, 1200 flow. Second operand 6 states and 169 transitions. [2024-05-12 12:37:56,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 132 transitions, 1600 flow [2024-05-12 12:37:56,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 132 transitions, 1514 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-05-12 12:37:56,115 INFO L231 Difference]: Finished difference. Result has 132 places, 111 transitions, 1261 flow [2024-05-12 12:37:56,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1261, PETRI_PLACES=132, PETRI_TRANSITIONS=111} [2024-05-12 12:37:56,116 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 86 predicate places. [2024-05-12 12:37:56,116 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 111 transitions, 1261 flow [2024-05-12 12:37:56,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:37:56,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:56,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:56,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 12:37:56,117 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 12:37:56,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:56,117 INFO L85 PathProgramCache]: Analyzing trace with hash 782100618, now seen corresponding path program 2 times [2024-05-12 12:37:56,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:56,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077433422] [2024-05-12 12:37:56,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:56,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:37:56,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:56,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077433422] [2024-05-12 12:37:56,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077433422] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:56,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:56,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:37:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189396977] [2024-05-12 12:37:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:56,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:56,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:56,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:56,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:56,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 111 transitions, 1261 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:37:56,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:56,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:56,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:56,477 INFO L124 PetriNetUnfolderBase]: 865/1938 cut-off events. [2024-05-12 12:37:56,477 INFO L125 PetriNetUnfolderBase]: For 23514/23633 co-relation queries the response was YES. [2024-05-12 12:37:56,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9184 conditions, 1938 events. 865/1938 cut-off events. For 23514/23633 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13673 event pairs, 256 based on Foata normal form. 37/1924 useless extension candidates. Maximal degree in co-relation 8213. Up to 637 conditions per place. [2024-05-12 12:37:56,491 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 73 selfloop transitions, 36 changer transitions 2/136 dead transitions. [2024-05-12 12:37:56,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 136 transitions, 1684 flow [2024-05-12 12:37:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-05-12 12:37:56,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-05-12 12:37:56,493 INFO L175 Difference]: Start difference. First operand has 132 places, 111 transitions, 1261 flow. Second operand 6 states and 170 transitions. [2024-05-12 12:37:56,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 136 transitions, 1684 flow [2024-05-12 12:37:56,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 136 transitions, 1639 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-05-12 12:37:56,578 INFO L231 Difference]: Finished difference. Result has 137 places, 116 transitions, 1378 flow [2024-05-12 12:37:56,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1378, PETRI_PLACES=137, PETRI_TRANSITIONS=116} [2024-05-12 12:37:56,578 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 91 predicate places. [2024-05-12 12:37:56,578 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 116 transitions, 1378 flow [2024-05-12 12:37:56,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:37:56,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:56,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:56,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 12:37:56,579 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 12:37:56,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash -988781036, now seen corresponding path program 3 times [2024-05-12 12:37:56,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:56,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148045992] [2024-05-12 12:37:56,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:56,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:56,618 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 12:37:56,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:56,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148045992] [2024-05-12 12:37:56,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148045992] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:56,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:56,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:37:56,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961813851] [2024-05-12 12:37:56,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:56,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:56,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:56,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:56,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:56,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 12:37:56,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 116 transitions, 1378 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 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 12:37:56,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:56,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 12:37:56,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:56,930 INFO L124 PetriNetUnfolderBase]: 1085/2300 cut-off events. [2024-05-12 12:37:56,930 INFO L125 PetriNetUnfolderBase]: For 21807/21874 co-relation queries the response was YES. [2024-05-12 12:37:56,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10047 conditions, 2300 events. 1085/2300 cut-off events. For 21807/21874 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16250 event pairs, 232 based on Foata normal form. 32/2289 useless extension candidates. Maximal degree in co-relation 9812. Up to 670 conditions per place. [2024-05-12 12:37:56,947 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 102 selfloop transitions, 43 changer transitions 4/178 dead transitions. [2024-05-12 12:37:56,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 178 transitions, 2008 flow [2024-05-12 12:37:56,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:37:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:37:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 235 transitions. [2024-05-12 12:37:56,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-05-12 12:37:56,949 INFO L175 Difference]: Start difference. First operand has 137 places, 116 transitions, 1378 flow. Second operand 8 states and 235 transitions. [2024-05-12 12:37:56,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 178 transitions, 2008 flow [2024-05-12 12:37:56,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 178 transitions, 1957 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-05-12 12:37:56,997 INFO L231 Difference]: Finished difference. Result has 148 places, 132 transitions, 1637 flow [2024-05-12 12:37:56,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1637, PETRI_PLACES=148, PETRI_TRANSITIONS=132} [2024-05-12 12:37:56,997 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 102 predicate places. [2024-05-12 12:37:56,997 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 132 transitions, 1637 flow [2024-05-12 12:37:56,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 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 12:37:56,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:56,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:56,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 12:37:56,998 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 12:37:56,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:56,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1702289106, now seen corresponding path program 4 times [2024-05-12 12:37:56,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:56,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485820843] [2024-05-12 12:37:56,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:56,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:57,085 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 12:37:57,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:57,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485820843] [2024-05-12 12:37:57,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485820843] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:57,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:57,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:37:57,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820152664] [2024-05-12 12:37:57,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:57,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:57,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:57,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:57,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:57,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:57,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 132 transitions, 1637 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:37:57,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:57,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:57,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:57,428 INFO L124 PetriNetUnfolderBase]: 940/2132 cut-off events. [2024-05-12 12:37:57,428 INFO L125 PetriNetUnfolderBase]: For 29788/29900 co-relation queries the response was YES. [2024-05-12 12:37:57,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10822 conditions, 2132 events. 940/2132 cut-off events. For 29788/29900 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15581 event pairs, 290 based on Foata normal form. 6/2093 useless extension candidates. Maximal degree in co-relation 9605. Up to 685 conditions per place. [2024-05-12 12:37:57,447 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 79 selfloop transitions, 32 changer transitions 2/152 dead transitions. [2024-05-12 12:37:57,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 152 transitions, 2028 flow [2024-05-12 12:37:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2024-05-12 12:37:57,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5886524822695035 [2024-05-12 12:37:57,449 INFO L175 Difference]: Start difference. First operand has 148 places, 132 transitions, 1637 flow. Second operand 6 states and 166 transitions. [2024-05-12 12:37:57,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 152 transitions, 2028 flow [2024-05-12 12:37:57,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 152 transitions, 1999 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-05-12 12:37:57,510 INFO L231 Difference]: Finished difference. Result has 153 places, 134 transitions, 1703 flow [2024-05-12 12:37:57,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1608, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1703, PETRI_PLACES=153, PETRI_TRANSITIONS=134} [2024-05-12 12:37:57,511 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 107 predicate places. [2024-05-12 12:37:57,511 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 134 transitions, 1703 flow [2024-05-12 12:37:57,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:37:57,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:57,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:57,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 12:37:57,512 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 12:37:57,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:57,513 INFO L85 PathProgramCache]: Analyzing trace with hash 905634742, now seen corresponding path program 5 times [2024-05-12 12:37:57,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:57,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061163676] [2024-05-12 12:37:57,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:57,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:57,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 12:37:57,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:57,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061163676] [2024-05-12 12:37:57,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061163676] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:57,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:57,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:37:57,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294102582] [2024-05-12 12:37:57,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:57,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:57,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:57,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:57,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:57,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:57,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 134 transitions, 1703 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:37:57,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:57,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:57,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:57,919 INFO L124 PetriNetUnfolderBase]: 918/2097 cut-off events. [2024-05-12 12:37:57,919 INFO L125 PetriNetUnfolderBase]: For 31960/32037 co-relation queries the response was YES. [2024-05-12 12:37:57,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10872 conditions, 2097 events. 918/2097 cut-off events. For 31960/32037 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15257 event pairs, 265 based on Foata normal form. 16/2073 useless extension candidates. Maximal degree in co-relation 9761. Up to 756 conditions per place. [2024-05-12 12:37:57,932 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 79 selfloop transitions, 32 changer transitions 4/154 dead transitions. [2024-05-12 12:37:57,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 154 transitions, 2088 flow [2024-05-12 12:37:57,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-05-12 12:37:57,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5851063829787234 [2024-05-12 12:37:57,933 INFO L175 Difference]: Start difference. First operand has 153 places, 134 transitions, 1703 flow. Second operand 6 states and 165 transitions. [2024-05-12 12:37:57,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 154 transitions, 2088 flow [2024-05-12 12:37:57,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 154 transitions, 2028 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-05-12 12:37:57,989 INFO L231 Difference]: Finished difference. Result has 157 places, 137 transitions, 1777 flow [2024-05-12 12:37:57,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1777, PETRI_PLACES=157, PETRI_TRANSITIONS=137} [2024-05-12 12:37:57,990 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 111 predicate places. [2024-05-12 12:37:57,990 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 137 transitions, 1777 flow [2024-05-12 12:37:57,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:37:57,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:57,990 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 12:37:57,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 12:37:57,991 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 12:37:57,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash 216432201, now seen corresponding path program 1 times [2024-05-12 12:37:57,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:57,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817262649] [2024-05-12 12:37:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:58,065 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 12:37:58,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:58,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817262649] [2024-05-12 12:37:58,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817262649] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:58,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:58,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:37:58,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060489725] [2024-05-12 12:37:58,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:58,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:58,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:58,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:58,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:58,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:58,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 137 transitions, 1777 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:37:58,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:58,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:58,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:58,381 INFO L124 PetriNetUnfolderBase]: 924/2109 cut-off events. [2024-05-12 12:37:58,381 INFO L125 PetriNetUnfolderBase]: For 36246/36333 co-relation queries the response was YES. [2024-05-12 12:37:58,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11005 conditions, 2109 events. 924/2109 cut-off events. For 36246/36333 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15281 event pairs, 229 based on Foata normal form. 10/2081 useless extension candidates. Maximal degree in co-relation 10157. Up to 502 conditions per place. [2024-05-12 12:37:58,399 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 88 selfloop transitions, 45 changer transitions 4/176 dead transitions. [2024-05-12 12:37:58,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 176 transitions, 2358 flow [2024-05-12 12:37:58,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-05-12 12:37:58,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6453900709219859 [2024-05-12 12:37:58,400 INFO L175 Difference]: Start difference. First operand has 157 places, 137 transitions, 1777 flow. Second operand 6 states and 182 transitions. [2024-05-12 12:37:58,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 176 transitions, 2358 flow [2024-05-12 12:37:58,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 176 transitions, 2306 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-05-12 12:37:58,464 INFO L231 Difference]: Finished difference. Result has 162 places, 143 transitions, 1987 flow [2024-05-12 12:37:58,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1725, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1987, PETRI_PLACES=162, PETRI_TRANSITIONS=143} [2024-05-12 12:37:58,465 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 116 predicate places. [2024-05-12 12:37:58,465 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 143 transitions, 1987 flow [2024-05-12 12:37:58,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:37:58,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:58,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] [2024-05-12 12:37:58,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 12:37:58,466 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 12:37:58,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:58,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1282095651, now seen corresponding path program 2 times [2024-05-12 12:37:58,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:58,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374836376] [2024-05-12 12:37:58,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:58,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:58,549 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 12:37:58,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:58,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374836376] [2024-05-12 12:37:58,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374836376] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:58,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:58,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:37:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233278583] [2024-05-12 12:37:58,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:58,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:58,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:58,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:58,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:58,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 143 transitions, 1987 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:37:58,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:58,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:58,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:58,863 INFO L124 PetriNetUnfolderBase]: 934/2127 cut-off events. [2024-05-12 12:37:58,864 INFO L125 PetriNetUnfolderBase]: For 41723/41842 co-relation queries the response was YES. [2024-05-12 12:37:58,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11571 conditions, 2127 events. 934/2127 cut-off events. For 41723/41842 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15411 event pairs, 236 based on Foata normal form. 22/2109 useless extension candidates. Maximal degree in co-relation 10729. Up to 513 conditions per place. [2024-05-12 12:37:58,880 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 93 selfloop transitions, 39 changer transitions 6/177 dead transitions. [2024-05-12 12:37:58,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 177 transitions, 2478 flow [2024-05-12 12:37:58,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2024-05-12 12:37:58,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6312056737588653 [2024-05-12 12:37:58,882 INFO L175 Difference]: Start difference. First operand has 162 places, 143 transitions, 1987 flow. Second operand 6 states and 178 transitions. [2024-05-12 12:37:58,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 177 transitions, 2478 flow [2024-05-12 12:37:58,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 177 transitions, 2388 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-05-12 12:37:58,953 INFO L231 Difference]: Finished difference. Result has 165 places, 146 transitions, 2045 flow [2024-05-12 12:37:58,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2045, PETRI_PLACES=165, PETRI_TRANSITIONS=146} [2024-05-12 12:37:58,955 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 119 predicate places. [2024-05-12 12:37:58,955 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 146 transitions, 2045 flow [2024-05-12 12:37:58,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:37:58,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:58,955 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 12:37:58,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 12:37:58,955 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 12:37:58,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:58,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1113338885, now seen corresponding path program 3 times [2024-05-12 12:37:58,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:58,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606366895] [2024-05-12 12:37:58,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:58,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:58,994 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 12:37:58,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:58,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606366895] [2024-05-12 12:37:58,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606366895] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:58,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:58,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:37:58,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064757434] [2024-05-12 12:37:58,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:58,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:58,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:58,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:58,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:59,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 12:37:59,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 146 transitions, 2045 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 12:37:59,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:59,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 12:37:59,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:59,349 INFO L124 PetriNetUnfolderBase]: 1121/2379 cut-off events. [2024-05-12 12:37:59,350 INFO L125 PetriNetUnfolderBase]: For 39306/39460 co-relation queries the response was YES. [2024-05-12 12:37:59,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12412 conditions, 2379 events. 1121/2379 cut-off events. For 39306/39460 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16976 event pairs, 214 based on Foata normal form. 13/2299 useless extension candidates. Maximal degree in co-relation 12139. Up to 1012 conditions per place. [2024-05-12 12:37:59,367 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 93 selfloop transitions, 42 changer transitions 2/200 dead transitions. [2024-05-12 12:37:59,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 200 transitions, 2628 flow [2024-05-12 12:37:59,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:37:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:37:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 232 transitions. [2024-05-12 12:37:59,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2024-05-12 12:37:59,368 INFO L175 Difference]: Start difference. First operand has 165 places, 146 transitions, 2045 flow. Second operand 8 states and 232 transitions. [2024-05-12 12:37:59,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 200 transitions, 2628 flow [2024-05-12 12:37:59,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 200 transitions, 2562 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-05-12 12:37:59,449 INFO L231 Difference]: Finished difference. Result has 174 places, 161 transitions, 2252 flow [2024-05-12 12:37:59,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1989, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2252, PETRI_PLACES=174, PETRI_TRANSITIONS=161} [2024-05-12 12:37:59,450 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 128 predicate places. [2024-05-12 12:37:59,450 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 161 transitions, 2252 flow [2024-05-12 12:37:59,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 12:37:59,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:59,451 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 12:37:59,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 12:37:59,451 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 12:37:59,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash 682402821, now seen corresponding path program 4 times [2024-05-12 12:37:59,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:59,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922491767] [2024-05-12 12:37:59,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:59,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:59,525 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 12:37:59,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:59,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922491767] [2024-05-12 12:37:59,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922491767] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:59,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:59,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:37:59,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849848156] [2024-05-12 12:37:59,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:59,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:59,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:59,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:59,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:37:59,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:37:59,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 161 transitions, 2252 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:37:59,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:59,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:37:59,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:59,832 INFO L124 PetriNetUnfolderBase]: 1000/2268 cut-off events. [2024-05-12 12:37:59,833 INFO L125 PetriNetUnfolderBase]: For 46070/46189 co-relation queries the response was YES. [2024-05-12 12:37:59,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12795 conditions, 2268 events. 1000/2268 cut-off events. For 46070/46189 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 16653 event pairs, 284 based on Foata normal form. 10/2235 useless extension candidates. Maximal degree in co-relation 12096. Up to 910 conditions per place. [2024-05-12 12:37:59,852 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 97 selfloop transitions, 36 changer transitions 4/185 dead transitions. [2024-05-12 12:37:59,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 185 transitions, 2636 flow [2024-05-12 12:37:59,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:37:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:37:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-05-12 12:37:59,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-05-12 12:37:59,854 INFO L175 Difference]: Start difference. First operand has 174 places, 161 transitions, 2252 flow. Second operand 6 states and 168 transitions. [2024-05-12 12:37:59,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 185 transitions, 2636 flow [2024-05-12 12:37:59,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 185 transitions, 2636 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-05-12 12:37:59,947 INFO L231 Difference]: Finished difference. Result has 181 places, 162 transitions, 2354 flow [2024-05-12 12:37:59,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2252, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2354, PETRI_PLACES=181, PETRI_TRANSITIONS=162} [2024-05-12 12:37:59,948 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 135 predicate places. [2024-05-12 12:37:59,948 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 162 transitions, 2354 flow [2024-05-12 12:37:59,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:37:59,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:59,949 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 12:37:59,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 12:37:59,949 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 12:37:59,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash -97733755, now seen corresponding path program 5 times [2024-05-12 12:37:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:59,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110437821] [2024-05-12 12:37:59,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:59,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:59,985 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 12:37:59,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:59,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110437821] [2024-05-12 12:37:59,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110437821] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:59,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:59,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:37:59,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367799068] [2024-05-12 12:37:59,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:59,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:37:59,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:59,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:37:59,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:00,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 12:38:00,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 162 transitions, 2354 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 12:38:00,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:00,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 12:38:00,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:00,345 INFO L124 PetriNetUnfolderBase]: 894/1947 cut-off events. [2024-05-12 12:38:00,345 INFO L125 PetriNetUnfolderBase]: For 26859/26910 co-relation queries the response was YES. [2024-05-12 12:38:00,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9873 conditions, 1947 events. 894/1947 cut-off events. For 26859/26910 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13256 event pairs, 191 based on Foata normal form. 59/1979 useless extension candidates. Maximal degree in co-relation 9113. Up to 397 conditions per place. [2024-05-12 12:38:00,357 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 77 selfloop transitions, 56 changer transitions 7/185 dead transitions. [2024-05-12 12:38:00,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 185 transitions, 2534 flow [2024-05-12 12:38:00,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:38:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:38:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 271 transitions. [2024-05-12 12:38:00,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5765957446808511 [2024-05-12 12:38:00,358 INFO L175 Difference]: Start difference. First operand has 181 places, 162 transitions, 2354 flow. Second operand 10 states and 271 transitions. [2024-05-12 12:38:00,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 185 transitions, 2534 flow [2024-05-12 12:38:00,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 185 transitions, 2176 flow, removed 16 selfloop flow, removed 16 redundant places. [2024-05-12 12:38:00,432 INFO L231 Difference]: Finished difference. Result has 177 places, 147 transitions, 1966 flow [2024-05-12 12:38:00,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1966, PETRI_PLACES=177, PETRI_TRANSITIONS=147} [2024-05-12 12:38:00,433 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 131 predicate places. [2024-05-12 12:38:00,433 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 147 transitions, 1966 flow [2024-05-12 12:38:00,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 12:38:00,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:00,433 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 12:38:00,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 12:38:00,433 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 12:38:00,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1744327733, now seen corresponding path program 1 times [2024-05-12 12:38:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:00,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721691082] [2024-05-12 12:38:00,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:00,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:00,502 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 12:38:00,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:00,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721691082] [2024-05-12 12:38:00,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721691082] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:00,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:00,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:00,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172865717] [2024-05-12 12:38:00,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:00,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:00,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:00,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:00,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:00,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:00,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 147 transitions, 1966 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:38:00,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:00,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:00,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:00,725 INFO L124 PetriNetUnfolderBase]: 644/1505 cut-off events. [2024-05-12 12:38:00,726 INFO L125 PetriNetUnfolderBase]: For 26071/26138 co-relation queries the response was YES. [2024-05-12 12:38:00,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8454 conditions, 1505 events. 644/1505 cut-off events. For 26071/26138 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10381 event pairs, 156 based on Foata normal form. 5/1475 useless extension candidates. Maximal degree in co-relation 8134. Up to 480 conditions per place. [2024-05-12 12:38:00,738 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 78 selfloop transitions, 41 changer transitions 2/169 dead transitions. [2024-05-12 12:38:00,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 169 transitions, 2366 flow [2024-05-12 12:38:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2024-05-12 12:38:00,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5815602836879432 [2024-05-12 12:38:00,740 INFO L175 Difference]: Start difference. First operand has 177 places, 147 transitions, 1966 flow. Second operand 6 states and 164 transitions. [2024-05-12 12:38:00,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 169 transitions, 2366 flow [2024-05-12 12:38:00,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 169 transitions, 2327 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-05-12 12:38:00,810 INFO L231 Difference]: Finished difference. Result has 179 places, 148 transitions, 2029 flow [2024-05-12 12:38:00,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1927, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2029, PETRI_PLACES=179, PETRI_TRANSITIONS=148} [2024-05-12 12:38:00,813 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 133 predicate places. [2024-05-12 12:38:00,814 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 148 transitions, 2029 flow [2024-05-12 12:38:00,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:38:00,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:00,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 12:38:00,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 12:38:00,814 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 12:38:00,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash 962245191, now seen corresponding path program 2 times [2024-05-12 12:38:00,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:00,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683978489] [2024-05-12 12:38:00,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:00,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:00,877 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 12:38:00,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:00,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683978489] [2024-05-12 12:38:00,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683978489] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:00,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:00,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:00,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852035857] [2024-05-12 12:38:00,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:00,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:00,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:00,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:00,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:00,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:00,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 148 transitions, 2029 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:38:00,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:00,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:00,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:01,129 INFO L124 PetriNetUnfolderBase]: 657/1553 cut-off events. [2024-05-12 12:38:01,130 INFO L125 PetriNetUnfolderBase]: For 28410/28480 co-relation queries the response was YES. [2024-05-12 12:38:01,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8679 conditions, 1553 events. 657/1553 cut-off events. For 28410/28480 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10805 event pairs, 120 based on Foata normal form. 7/1529 useless extension candidates. Maximal degree in co-relation 8120. Up to 486 conditions per place. [2024-05-12 12:38:01,139 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 76 selfloop transitions, 42 changer transitions 3/169 dead transitions. [2024-05-12 12:38:01,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 169 transitions, 2479 flow [2024-05-12 12:38:01,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-05-12 12:38:01,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5709219858156028 [2024-05-12 12:38:01,140 INFO L175 Difference]: Start difference. First operand has 179 places, 148 transitions, 2029 flow. Second operand 6 states and 161 transitions. [2024-05-12 12:38:01,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 169 transitions, 2479 flow [2024-05-12 12:38:01,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 169 transitions, 2415 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 12:38:01,207 INFO L231 Difference]: Finished difference. Result has 182 places, 149 transitions, 2071 flow [2024-05-12 12:38:01,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2071, PETRI_PLACES=182, PETRI_TRANSITIONS=149} [2024-05-12 12:38:01,209 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 136 predicate places. [2024-05-12 12:38:01,209 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 149 transitions, 2071 flow [2024-05-12 12:38:01,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:38:01,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:01,209 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 12:38:01,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 12:38:01,210 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 12:38:01,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash 962184741, now seen corresponding path program 3 times [2024-05-12 12:38:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:01,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088370591] [2024-05-12 12:38:01,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:01,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:38:01,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:01,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088370591] [2024-05-12 12:38:01,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088370591] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:01,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:01,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:01,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196840044] [2024-05-12 12:38:01,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:01,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:01,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:01,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:01,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:01,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 149 transitions, 2071 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:38:01,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:01,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:01,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:01,510 INFO L124 PetriNetUnfolderBase]: 654/1548 cut-off events. [2024-05-12 12:38:01,510 INFO L125 PetriNetUnfolderBase]: For 29518/29588 co-relation queries the response was YES. [2024-05-12 12:38:01,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8681 conditions, 1548 events. 654/1548 cut-off events. For 29518/29588 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10764 event pairs, 120 based on Foata normal form. 7/1524 useless extension candidates. Maximal degree in co-relation 8119. Up to 484 conditions per place. [2024-05-12 12:38:01,520 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 73 selfloop transitions, 45 changer transitions 3/169 dead transitions. [2024-05-12 12:38:01,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 169 transitions, 2509 flow [2024-05-12 12:38:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-05-12 12:38:01,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5709219858156028 [2024-05-12 12:38:01,522 INFO L175 Difference]: Start difference. First operand has 182 places, 149 transitions, 2071 flow. Second operand 6 states and 161 transitions. [2024-05-12 12:38:01,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 169 transitions, 2509 flow [2024-05-12 12:38:01,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 169 transitions, 2402 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 12:38:01,584 INFO L231 Difference]: Finished difference. Result has 184 places, 149 transitions, 2058 flow [2024-05-12 12:38:01,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1964, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2058, PETRI_PLACES=184, PETRI_TRANSITIONS=149} [2024-05-12 12:38:01,584 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 138 predicate places. [2024-05-12 12:38:01,584 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 149 transitions, 2058 flow [2024-05-12 12:38:01,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 12:38:01,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:01,585 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 12:38:01,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 12:38:01,585 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 12:38:01,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:01,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1868522233, now seen corresponding path program 1 times [2024-05-12 12:38:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:01,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754701839] [2024-05-12 12:38:01,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:01,644 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 12:38:01,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:01,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754701839] [2024-05-12 12:38:01,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754701839] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:01,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:01,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:01,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259985345] [2024-05-12 12:38:01,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:01,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:01,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:01,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:01,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:01,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:01,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 149 transitions, 2058 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:01,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:01,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:01,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:01,914 INFO L124 PetriNetUnfolderBase]: 692/1675 cut-off events. [2024-05-12 12:38:01,914 INFO L125 PetriNetUnfolderBase]: For 30548/30601 co-relation queries the response was YES. [2024-05-12 12:38:01,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9141 conditions, 1675 events. 692/1675 cut-off events. For 30548/30601 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12012 event pairs, 90 based on Foata normal form. 14/1673 useless extension candidates. Maximal degree in co-relation 8450. Up to 414 conditions per place. [2024-05-12 12:38:01,927 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 88 selfloop transitions, 25 changer transitions 6/167 dead transitions. [2024-05-12 12:38:01,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 167 transitions, 2438 flow [2024-05-12 12:38:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2024-05-12 12:38:01,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5602836879432624 [2024-05-12 12:38:01,928 INFO L175 Difference]: Start difference. First operand has 184 places, 149 transitions, 2058 flow. Second operand 6 states and 158 transitions. [2024-05-12 12:38:01,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 167 transitions, 2438 flow [2024-05-12 12:38:02,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 167 transitions, 2321 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 12:38:02,005 INFO L231 Difference]: Finished difference. Result has 184 places, 145 transitions, 1919 flow [2024-05-12 12:38:02,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1941, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1919, PETRI_PLACES=184, PETRI_TRANSITIONS=145} [2024-05-12 12:38:02,006 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 138 predicate places. [2024-05-12 12:38:02,006 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 145 transitions, 1919 flow [2024-05-12 12:38:02,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:02,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:02,006 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 12:38:02,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 12:38:02,006 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 12:38:02,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:02,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2003600341, now seen corresponding path program 2 times [2024-05-12 12:38:02,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:02,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329138098] [2024-05-12 12:38:02,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:02,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:38:02,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:02,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329138098] [2024-05-12 12:38:02,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329138098] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:02,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:02,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:02,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551189326] [2024-05-12 12:38:02,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:02,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:02,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:02,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:02,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:02,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:02,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 145 transitions, 1919 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:02,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:02,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:02,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:02,294 INFO L124 PetriNetUnfolderBase]: 638/1541 cut-off events. [2024-05-12 12:38:02,294 INFO L125 PetriNetUnfolderBase]: For 29308/29363 co-relation queries the response was YES. [2024-05-12 12:38:02,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8346 conditions, 1541 events. 638/1541 cut-off events. For 29308/29363 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10869 event pairs, 71 based on Foata normal form. 14/1530 useless extension candidates. Maximal degree in co-relation 7693. Up to 380 conditions per place. [2024-05-12 12:38:02,305 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 87 selfloop transitions, 24 changer transitions 0/159 dead transitions. [2024-05-12 12:38:02,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 159 transitions, 2277 flow [2024-05-12 12:38:02,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-05-12 12:38:02,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460992907801419 [2024-05-12 12:38:02,306 INFO L175 Difference]: Start difference. First operand has 184 places, 145 transitions, 1919 flow. Second operand 6 states and 154 transitions. [2024-05-12 12:38:02,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 159 transitions, 2277 flow [2024-05-12 12:38:02,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 159 transitions, 2202 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-05-12 12:38:02,375 INFO L231 Difference]: Finished difference. Result has 180 places, 145 transitions, 1905 flow [2024-05-12 12:38:02,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1905, PETRI_PLACES=180, PETRI_TRANSITIONS=145} [2024-05-12 12:38:02,376 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 134 predicate places. [2024-05-12 12:38:02,376 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 145 transitions, 1905 flow [2024-05-12 12:38:02,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:02,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:02,376 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 12:38:02,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 12:38:02,376 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 12:38:02,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:02,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1702480251, now seen corresponding path program 3 times [2024-05-12 12:38:02,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:02,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010011893] [2024-05-12 12:38:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:02,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:38:02,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:02,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010011893] [2024-05-12 12:38:02,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010011893] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:02,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:02,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:02,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973714129] [2024-05-12 12:38:02,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:02,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:02,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:02,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:02,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:02,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:02,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 145 transitions, 1905 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:02,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:02,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:02,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:02,639 INFO L124 PetriNetUnfolderBase]: 624/1507 cut-off events. [2024-05-12 12:38:02,639 INFO L125 PetriNetUnfolderBase]: For 26912/26961 co-relation queries the response was YES. [2024-05-12 12:38:02,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7963 conditions, 1507 events. 624/1507 cut-off events. For 26912/26961 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10531 event pairs, 70 based on Foata normal form. 14/1497 useless extension candidates. Maximal degree in co-relation 7385. Up to 375 conditions per place. [2024-05-12 12:38:02,649 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 64 selfloop transitions, 47 changer transitions 0/159 dead transitions. [2024-05-12 12:38:02,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 159 transitions, 2207 flow [2024-05-12 12:38:02,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-05-12 12:38:02,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5567375886524822 [2024-05-12 12:38:02,650 INFO L175 Difference]: Start difference. First operand has 180 places, 145 transitions, 1905 flow. Second operand 6 states and 157 transitions. [2024-05-12 12:38:02,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 159 transitions, 2207 flow [2024-05-12 12:38:02,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 159 transitions, 2100 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-05-12 12:38:02,711 INFO L231 Difference]: Finished difference. Result has 178 places, 145 transitions, 1901 flow [2024-05-12 12:38:02,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1798, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1901, PETRI_PLACES=178, PETRI_TRANSITIONS=145} [2024-05-12 12:38:02,711 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 132 predicate places. [2024-05-12 12:38:02,711 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 145 transitions, 1901 flow [2024-05-12 12:38:02,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:02,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:02,712 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 12:38:02,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 12:38:02,712 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 12:38:02,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2068029930, now seen corresponding path program 1 times [2024-05-12 12:38:02,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:02,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198705096] [2024-05-12 12:38:02,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:02,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:02,767 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 12:38:02,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:02,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198705096] [2024-05-12 12:38:02,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198705096] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:02,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:02,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:02,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953865267] [2024-05-12 12:38:02,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:02,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:02,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:02,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:02,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:02,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:02,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 145 transitions, 1901 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:02,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:02,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:02,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:02,992 INFO L124 PetriNetUnfolderBase]: 644/1568 cut-off events. [2024-05-12 12:38:02,992 INFO L125 PetriNetUnfolderBase]: For 26609/26652 co-relation queries the response was YES. [2024-05-12 12:38:02,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8153 conditions, 1568 events. 644/1568 cut-off events. For 26609/26652 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11220 event pairs, 136 based on Foata normal form. 20/1572 useless extension candidates. Maximal degree in co-relation 7900. Up to 329 conditions per place. [2024-05-12 12:38:03,003 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 62 selfloop transitions, 55 changer transitions 0/165 dead transitions. [2024-05-12 12:38:03,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 165 transitions, 2257 flow [2024-05-12 12:38:03,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:03,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-05-12 12:38:03,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5709219858156028 [2024-05-12 12:38:03,005 INFO L175 Difference]: Start difference. First operand has 178 places, 145 transitions, 1901 flow. Second operand 6 states and 161 transitions. [2024-05-12 12:38:03,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 165 transitions, 2257 flow [2024-05-12 12:38:03,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 165 transitions, 2162 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-05-12 12:38:03,074 INFO L231 Difference]: Finished difference. Result has 179 places, 146 transitions, 1949 flow [2024-05-12 12:38:03,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1949, PETRI_PLACES=179, PETRI_TRANSITIONS=146} [2024-05-12 12:38:03,075 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 133 predicate places. [2024-05-12 12:38:03,075 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 146 transitions, 1949 flow [2024-05-12 12:38:03,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:03,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:03,075 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 12:38:03,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 12:38:03,076 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 12:38:03,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:03,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2058924984, now seen corresponding path program 2 times [2024-05-12 12:38:03,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:03,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025236537] [2024-05-12 12:38:03,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:03,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:03,149 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 12:38:03,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:03,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025236537] [2024-05-12 12:38:03,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025236537] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:03,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:03,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:03,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740914879] [2024-05-12 12:38:03,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:03,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:03,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:03,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:03,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:03,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:03,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 146 transitions, 1949 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:03,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:03,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:03,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:03,400 INFO L124 PetriNetUnfolderBase]: 671/1651 cut-off events. [2024-05-12 12:38:03,401 INFO L125 PetriNetUnfolderBase]: For 29204/29250 co-relation queries the response was YES. [2024-05-12 12:38:03,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8593 conditions, 1651 events. 671/1651 cut-off events. For 29204/29250 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12028 event pairs, 136 based on Foata normal form. 14/1644 useless extension candidates. Maximal degree in co-relation 8334. Up to 499 conditions per place. [2024-05-12 12:38:03,414 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 90 selfloop transitions, 27 changer transitions 0/165 dead transitions. [2024-05-12 12:38:03,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 165 transitions, 2365 flow [2024-05-12 12:38:03,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-05-12 12:38:03,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5567375886524822 [2024-05-12 12:38:03,415 INFO L175 Difference]: Start difference. First operand has 179 places, 146 transitions, 1949 flow. Second operand 6 states and 157 transitions. [2024-05-12 12:38:03,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 165 transitions, 2365 flow [2024-05-12 12:38:03,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 165 transitions, 2252 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-05-12 12:38:03,490 INFO L231 Difference]: Finished difference. Result has 182 places, 148 transitions, 1940 flow [2024-05-12 12:38:03,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1940, PETRI_PLACES=182, PETRI_TRANSITIONS=148} [2024-05-12 12:38:03,490 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 136 predicate places. [2024-05-12 12:38:03,491 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 148 transitions, 1940 flow [2024-05-12 12:38:03,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:03,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:03,491 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 12:38:03,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 12:38:03,491 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 12:38:03,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1358213680, now seen corresponding path program 3 times [2024-05-12 12:38:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:03,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079504979] [2024-05-12 12:38:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:03,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:03,551 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 12:38:03,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:03,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079504979] [2024-05-12 12:38:03,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079504979] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:03,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:03,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:03,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702444360] [2024-05-12 12:38:03,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:03,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:03,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:03,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:03,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:03,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:03,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 148 transitions, 1940 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:03,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:03,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:03,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:03,783 INFO L124 PetriNetUnfolderBase]: 665/1631 cut-off events. [2024-05-12 12:38:03,784 INFO L125 PetriNetUnfolderBase]: For 26132/26181 co-relation queries the response was YES. [2024-05-12 12:38:03,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8398 conditions, 1631 events. 665/1631 cut-off events. For 26132/26181 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11869 event pairs, 138 based on Foata normal form. 8/1618 useless extension candidates. Maximal degree in co-relation 8140. Up to 497 conditions per place. [2024-05-12 12:38:03,796 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 82 selfloop transitions, 33 changer transitions 0/163 dead transitions. [2024-05-12 12:38:03,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 163 transitions, 2260 flow [2024-05-12 12:38:03,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-05-12 12:38:03,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460992907801419 [2024-05-12 12:38:03,797 INFO L175 Difference]: Start difference. First operand has 182 places, 148 transitions, 1940 flow. Second operand 6 states and 154 transitions. [2024-05-12 12:38:03,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 163 transitions, 2260 flow [2024-05-12 12:38:03,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 163 transitions, 2204 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-05-12 12:38:03,884 INFO L231 Difference]: Finished difference. Result has 185 places, 148 transitions, 1954 flow [2024-05-12 12:38:03,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1884, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1954, PETRI_PLACES=185, PETRI_TRANSITIONS=148} [2024-05-12 12:38:03,884 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 139 predicate places. [2024-05-12 12:38:03,884 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 148 transitions, 1954 flow [2024-05-12 12:38:03,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:03,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:03,885 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 12:38:03,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 12:38:03,885 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 12:38:03,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash -62678280, now seen corresponding path program 4 times [2024-05-12 12:38:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:03,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801164576] [2024-05-12 12:38:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:03,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:03,950 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 12:38:03,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:03,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801164576] [2024-05-12 12:38:03,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801164576] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:03,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:03,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068856560] [2024-05-12 12:38:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:03,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:03,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:03,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:03,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:03,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:03,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 148 transitions, 1954 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:03,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:03,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:03,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:04,173 INFO L124 PetriNetUnfolderBase]: 682/1690 cut-off events. [2024-05-12 12:38:04,173 INFO L125 PetriNetUnfolderBase]: For 27636/27693 co-relation queries the response was YES. [2024-05-12 12:38:04,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8660 conditions, 1690 events. 682/1690 cut-off events. For 27636/27693 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12454 event pairs, 195 based on Foata normal form. 14/1675 useless extension candidates. Maximal degree in co-relation 8079. Up to 576 conditions per place. [2024-05-12 12:38:04,185 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 98 selfloop transitions, 19 changer transitions 0/165 dead transitions. [2024-05-12 12:38:04,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 165 transitions, 2414 flow [2024-05-12 12:38:04,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-05-12 12:38:04,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.549645390070922 [2024-05-12 12:38:04,186 INFO L175 Difference]: Start difference. First operand has 185 places, 148 transitions, 1954 flow. Second operand 6 states and 155 transitions. [2024-05-12 12:38:04,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 165 transitions, 2414 flow [2024-05-12 12:38:04,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 165 transitions, 2344 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-05-12 12:38:04,267 INFO L231 Difference]: Finished difference. Result has 186 places, 149 transitions, 1940 flow [2024-05-12 12:38:04,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1884, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1940, PETRI_PLACES=186, PETRI_TRANSITIONS=149} [2024-05-12 12:38:04,268 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 140 predicate places. [2024-05-12 12:38:04,268 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 149 transitions, 1940 flow [2024-05-12 12:38:04,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:04,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:04,268 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 12:38:04,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 12:38:04,268 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 12:38:04,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash -62443920, now seen corresponding path program 5 times [2024-05-12 12:38:04,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:04,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594157722] [2024-05-12 12:38:04,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:04,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:38:04,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594157722] [2024-05-12 12:38:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594157722] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:04,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:04,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009670344] [2024-05-12 12:38:04,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:04,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:04,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:04,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:04,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 149 transitions, 1940 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:04,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:04,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:04,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:04,560 INFO L124 PetriNetUnfolderBase]: 668/1656 cut-off events. [2024-05-12 12:38:04,561 INFO L125 PetriNetUnfolderBase]: For 27048/27084 co-relation queries the response was YES. [2024-05-12 12:38:04,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8259 conditions, 1656 events. 668/1656 cut-off events. For 27048/27084 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12097 event pairs, 186 based on Foata normal form. 14/1642 useless extension candidates. Maximal degree in co-relation 7689. Up to 572 conditions per place. [2024-05-12 12:38:04,573 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 95 selfloop transitions, 20 changer transitions 1/164 dead transitions. [2024-05-12 12:38:04,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 164 transitions, 2326 flow [2024-05-12 12:38:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:04,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-05-12 12:38:04,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5425531914893617 [2024-05-12 12:38:04,576 INFO L175 Difference]: Start difference. First operand has 186 places, 149 transitions, 1940 flow. Second operand 6 states and 153 transitions. [2024-05-12 12:38:04,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 164 transitions, 2326 flow [2024-05-12 12:38:04,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 164 transitions, 2256 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-05-12 12:38:04,653 INFO L231 Difference]: Finished difference. Result has 187 places, 149 transitions, 1916 flow [2024-05-12 12:38:04,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1870, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1916, PETRI_PLACES=187, PETRI_TRANSITIONS=149} [2024-05-12 12:38:04,654 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 141 predicate places. [2024-05-12 12:38:04,654 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 149 transitions, 1916 flow [2024-05-12 12:38:04,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:04,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:04,654 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 12:38:04,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 12:38:04,655 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 12:38:04,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash -237042120, now seen corresponding path program 6 times [2024-05-12 12:38:04,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:04,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296920333] [2024-05-12 12:38:04,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:04,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:04,715 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 12:38:04,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:04,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296920333] [2024-05-12 12:38:04,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296920333] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:04,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:04,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:04,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622192935] [2024-05-12 12:38:04,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:04,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:04,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:04,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:04,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:04,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:04,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 149 transitions, 1916 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:04,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:04,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:04,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:04,939 INFO L124 PetriNetUnfolderBase]: 665/1651 cut-off events. [2024-05-12 12:38:04,939 INFO L125 PetriNetUnfolderBase]: For 23297/23333 co-relation queries the response was YES. [2024-05-12 12:38:04,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8099 conditions, 1651 events. 665/1651 cut-off events. For 23297/23333 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12049 event pairs, 185 based on Foata normal form. 8/1633 useless extension candidates. Maximal degree in co-relation 7531. Up to 570 conditions per place. [2024-05-12 12:38:04,948 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 84 selfloop transitions, 31 changer transitions 1/164 dead transitions. [2024-05-12 12:38:04,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 164 transitions, 2306 flow [2024-05-12 12:38:04,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-05-12 12:38:04,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2024-05-12 12:38:04,949 INFO L175 Difference]: Start difference. First operand has 187 places, 149 transitions, 1916 flow. Second operand 6 states and 152 transitions. [2024-05-12 12:38:04,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 164 transitions, 2306 flow [2024-05-12 12:38:05,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 164 transitions, 2272 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-05-12 12:38:05,020 INFO L231 Difference]: Finished difference. Result has 189 places, 149 transitions, 1948 flow [2024-05-12 12:38:05,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1882, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1948, PETRI_PLACES=189, PETRI_TRANSITIONS=149} [2024-05-12 12:38:05,021 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 143 predicate places. [2024-05-12 12:38:05,021 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 149 transitions, 1948 flow [2024-05-12 12:38:05,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:38:05,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:05,022 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 12:38:05,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 12:38:05,022 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 12:38:05,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:05,022 INFO L85 PathProgramCache]: Analyzing trace with hash 637143496, now seen corresponding path program 1 times [2024-05-12 12:38:05,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:05,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284432389] [2024-05-12 12:38:05,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:05,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:05,080 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 12:38:05,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:05,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284432389] [2024-05-12 12:38:05,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284432389] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:05,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:05,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:05,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365074471] [2024-05-12 12:38:05,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:05,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:05,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:05,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:05,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:05,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:05,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 149 transitions, 1948 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 12:38:05,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:05,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:05,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:05,296 INFO L124 PetriNetUnfolderBase]: 650/1620 cut-off events. [2024-05-12 12:38:05,296 INFO L125 PetriNetUnfolderBase]: For 23188/23218 co-relation queries the response was YES. [2024-05-12 12:38:05,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8013 conditions, 1620 events. 650/1620 cut-off events. For 23188/23218 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11816 event pairs, 201 based on Foata normal form. 2/1596 useless extension candidates. Maximal degree in co-relation 7432. Up to 494 conditions per place. [2024-05-12 12:38:05,309 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 57 selfloop transitions, 58 changer transitions 1/164 dead transitions. [2024-05-12 12:38:05,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 164 transitions, 2284 flow [2024-05-12 12:38:05,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-05-12 12:38:05,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5567375886524822 [2024-05-12 12:38:05,310 INFO L175 Difference]: Start difference. First operand has 189 places, 149 transitions, 1948 flow. Second operand 6 states and 157 transitions. [2024-05-12 12:38:05,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 164 transitions, 2284 flow [2024-05-12 12:38:05,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 164 transitions, 2209 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 12:38:05,383 INFO L231 Difference]: Finished difference. Result has 189 places, 149 transitions, 1993 flow [2024-05-12 12:38:05,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1993, PETRI_PLACES=189, PETRI_TRANSITIONS=149} [2024-05-12 12:38:05,384 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 143 predicate places. [2024-05-12 12:38:05,384 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 149 transitions, 1993 flow [2024-05-12 12:38:05,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 12:38:05,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:05,384 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 12:38:05,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 12:38:05,384 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 12:38:05,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:05,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1357489876, now seen corresponding path program 2 times [2024-05-12 12:38:05,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:05,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709403878] [2024-05-12 12:38:05,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:05,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:38:05,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:05,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709403878] [2024-05-12 12:38:05,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709403878] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:05,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:05,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:05,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057266767] [2024-05-12 12:38:05,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:05,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:05,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:05,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:05,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:05,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:05,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 149 transitions, 1993 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 12:38:05,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:05,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:05,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:05,666 INFO L124 PetriNetUnfolderBase]: 655/1628 cut-off events. [2024-05-12 12:38:05,666 INFO L125 PetriNetUnfolderBase]: For 23482/23509 co-relation queries the response was YES. [2024-05-12 12:38:05,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8109 conditions, 1628 events. 655/1628 cut-off events. For 23482/23509 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11945 event pairs, 207 based on Foata normal form. 2/1604 useless extension candidates. Maximal degree in co-relation 7518. Up to 488 conditions per place. [2024-05-12 12:38:05,677 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 74 selfloop transitions, 27 changer transitions 12/161 dead transitions. [2024-05-12 12:38:05,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 161 transitions, 2247 flow [2024-05-12 12:38:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-05-12 12:38:05,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5354609929078015 [2024-05-12 12:38:05,678 INFO L175 Difference]: Start difference. First operand has 189 places, 149 transitions, 1993 flow. Second operand 6 states and 151 transitions. [2024-05-12 12:38:05,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 161 transitions, 2247 flow [2024-05-12 12:38:05,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 161 transitions, 2066 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 12:38:05,752 INFO L231 Difference]: Finished difference. Result has 187 places, 143 transitions, 1792 flow [2024-05-12 12:38:05,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1792, PETRI_PLACES=187, PETRI_TRANSITIONS=143} [2024-05-12 12:38:05,753 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 141 predicate places. [2024-05-12 12:38:05,753 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 143 transitions, 1792 flow [2024-05-12 12:38:05,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 12:38:05,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:05,753 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 12:38:05,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 12:38:05,753 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 12:38:05,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:05,754 INFO L85 PathProgramCache]: Analyzing trace with hash 455173286, now seen corresponding path program 1 times [2024-05-12 12:38:05,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:05,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023948615] [2024-05-12 12:38:05,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:05,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:05,825 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 12:38:05,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:05,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023948615] [2024-05-12 12:38:05,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023948615] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:05,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:05,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:05,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081304296] [2024-05-12 12:38:05,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:05,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:05,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:05,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:05,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:05,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:05,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 143 transitions, 1792 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 12:38:05,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:05,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:05,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:06,054 INFO L124 PetriNetUnfolderBase]: 609/1549 cut-off events. [2024-05-12 12:38:06,054 INFO L125 PetriNetUnfolderBase]: For 20156/20190 co-relation queries the response was YES. [2024-05-12 12:38:06,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7328 conditions, 1549 events. 609/1549 cut-off events. For 20156/20190 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11291 event pairs, 92 based on Foata normal form. 4/1538 useless extension candidates. Maximal degree in co-relation 7085. Up to 239 conditions per place. [2024-05-12 12:38:06,068 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 56 selfloop transitions, 59 changer transitions 1/164 dead transitions. [2024-05-12 12:38:06,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 164 transitions, 2140 flow [2024-05-12 12:38:06,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2024-05-12 12:38:06,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5780141843971631 [2024-05-12 12:38:06,069 INFO L175 Difference]: Start difference. First operand has 187 places, 143 transitions, 1792 flow. Second operand 6 states and 163 transitions. [2024-05-12 12:38:06,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 164 transitions, 2140 flow [2024-05-12 12:38:06,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 164 transitions, 2055 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-05-12 12:38:06,137 INFO L231 Difference]: Finished difference. Result has 178 places, 143 transitions, 1839 flow [2024-05-12 12:38:06,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1715, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1839, PETRI_PLACES=178, PETRI_TRANSITIONS=143} [2024-05-12 12:38:06,138 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 132 predicate places. [2024-05-12 12:38:06,138 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 143 transitions, 1839 flow [2024-05-12 12:38:06,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 12:38:06,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:06,138 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 12:38:06,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 12:38:06,138 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 12:38:06,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:06,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1033701822, now seen corresponding path program 2 times [2024-05-12 12:38:06,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:06,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785514465] [2024-05-12 12:38:06,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:06,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:06,203 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 12:38:06,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:06,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785514465] [2024-05-12 12:38:06,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785514465] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:06,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:06,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:06,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787020107] [2024-05-12 12:38:06,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:06,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:06,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:06,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:06,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:06,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:06,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 143 transitions, 1839 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 12:38:06,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:06,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:06,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:06,421 INFO L124 PetriNetUnfolderBase]: 616/1565 cut-off events. [2024-05-12 12:38:06,421 INFO L125 PetriNetUnfolderBase]: For 19875/19909 co-relation queries the response was YES. [2024-05-12 12:38:06,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7524 conditions, 1565 events. 616/1565 cut-off events. For 19875/19909 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11458 event pairs, 99 based on Foata normal form. 4/1554 useless extension candidates. Maximal degree in co-relation 7278. Up to 374 conditions per place. [2024-05-12 12:38:06,433 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 74 selfloop transitions, 26 changer transitions 13/161 dead transitions. [2024-05-12 12:38:06,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 161 transitions, 2183 flow [2024-05-12 12:38:06,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:06,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-05-12 12:38:06,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5531914893617021 [2024-05-12 12:38:06,439 INFO L175 Difference]: Start difference. First operand has 178 places, 143 transitions, 1839 flow. Second operand 6 states and 156 transitions. [2024-05-12 12:38:06,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 161 transitions, 2183 flow [2024-05-12 12:38:06,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 161 transitions, 2022 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-05-12 12:38:06,506 INFO L231 Difference]: Finished difference. Result has 177 places, 137 transitions, 1667 flow [2024-05-12 12:38:06,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1683, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1667, PETRI_PLACES=177, PETRI_TRANSITIONS=137} [2024-05-12 12:38:06,506 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 131 predicate places. [2024-05-12 12:38:06,506 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 137 transitions, 1667 flow [2024-05-12 12:38:06,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 12:38:06,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:06,507 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 12:38:06,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 12:38:06,507 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 12:38:06,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:06,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1323504042, now seen corresponding path program 3 times [2024-05-12 12:38:06,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:06,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81142203] [2024-05-12 12:38:06,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:06,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:06,567 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 12:38:06,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:06,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81142203] [2024-05-12 12:38:06,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81142203] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:06,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:06,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:06,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233876610] [2024-05-12 12:38:06,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:06,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:06,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:06,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:06,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:06,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 137 transitions, 1667 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 12:38:06,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:06,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:06,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:06,786 INFO L124 PetriNetUnfolderBase]: 545/1384 cut-off events. [2024-05-12 12:38:06,787 INFO L125 PetriNetUnfolderBase]: For 15966/15996 co-relation queries the response was YES. [2024-05-12 12:38:06,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6422 conditions, 1384 events. 545/1384 cut-off events. For 15966/15996 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9914 event pairs, 119 based on Foata normal form. 4/1370 useless extension candidates. Maximal degree in co-relation 6185. Up to 395 conditions per place. [2024-05-12 12:38:06,796 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 79 selfloop transitions, 22 changer transitions 9/158 dead transitions. [2024-05-12 12:38:06,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 158 transitions, 1935 flow [2024-05-12 12:38:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:06,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2024-05-12 12:38:06,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5673758865248227 [2024-05-12 12:38:06,797 INFO L175 Difference]: Start difference. First operand has 177 places, 137 transitions, 1667 flow. Second operand 6 states and 160 transitions. [2024-05-12 12:38:06,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 158 transitions, 1935 flow [2024-05-12 12:38:06,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 158 transitions, 1869 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-05-12 12:38:06,846 INFO L231 Difference]: Finished difference. Result has 169 places, 132 transitions, 1589 flow [2024-05-12 12:38:06,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1589, PETRI_PLACES=169, PETRI_TRANSITIONS=132} [2024-05-12 12:38:06,846 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 123 predicate places. [2024-05-12 12:38:06,846 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 132 transitions, 1589 flow [2024-05-12 12:38:06,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 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 12:38:06,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:06,846 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 12:38:06,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 12:38:06,847 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 12:38:06,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:06,847 INFO L85 PathProgramCache]: Analyzing trace with hash -28033144, now seen corresponding path program 1 times [2024-05-12 12:38:06,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:06,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728692303] [2024-05-12 12:38:06,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:06,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:06,907 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 12:38:06,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:06,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728692303] [2024-05-12 12:38:06,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728692303] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:06,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:06,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:06,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970717481] [2024-05-12 12:38:06,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:06,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:06,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:06,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:06,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:06,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:06,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 132 transitions, 1589 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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 12:38:06,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:06,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:06,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:07,081 INFO L124 PetriNetUnfolderBase]: 504/1279 cut-off events. [2024-05-12 12:38:07,081 INFO L125 PetriNetUnfolderBase]: For 12274/12305 co-relation queries the response was YES. [2024-05-12 12:38:07,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5866 conditions, 1279 events. 504/1279 cut-off events. For 12274/12305 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9049 event pairs, 42 based on Foata normal form. 4/1268 useless extension candidates. Maximal degree in co-relation 5673. Up to 372 conditions per place. [2024-05-12 12:38:07,089 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 44 selfloop transitions, 18 changer transitions 58/151 dead transitions. [2024-05-12 12:38:07,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 151 transitions, 1837 flow [2024-05-12 12:38:07,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-05-12 12:38:07,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5638297872340425 [2024-05-12 12:38:07,090 INFO L175 Difference]: Start difference. First operand has 169 places, 132 transitions, 1589 flow. Second operand 6 states and 159 transitions. [2024-05-12 12:38:07,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 151 transitions, 1837 flow [2024-05-12 12:38:07,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 151 transitions, 1759 flow, removed 6 selfloop flow, removed 12 redundant places. [2024-05-12 12:38:07,129 INFO L231 Difference]: Finished difference. Result has 159 places, 85 transitions, 916 flow [2024-05-12 12:38:07,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=916, PETRI_PLACES=159, PETRI_TRANSITIONS=85} [2024-05-12 12:38:07,130 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 113 predicate places. [2024-05-12 12:38:07,130 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 85 transitions, 916 flow [2024-05-12 12:38:07,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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 12:38:07,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:07,130 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 12:38:07,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 12:38:07,130 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 12:38:07,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1810059764, now seen corresponding path program 2 times [2024-05-12 12:38:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:07,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574100030] [2024-05-12 12:38:07,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:07,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:07,195 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 12:38:07,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:07,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574100030] [2024-05-12 12:38:07,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574100030] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:07,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:07,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:07,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870912419] [2024-05-12 12:38:07,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:07,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:07,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:07,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:07,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:07,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 12:38:07,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 85 transitions, 916 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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 12:38:07,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:07,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 12:38:07,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:07,308 INFO L124 PetriNetUnfolderBase]: 289/748 cut-off events. [2024-05-12 12:38:07,308 INFO L125 PetriNetUnfolderBase]: For 6442/6469 co-relation queries the response was YES. [2024-05-12 12:38:07,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3216 conditions, 748 events. 289/748 cut-off events. For 6442/6469 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4606 event pairs, 38 based on Foata normal form. 4/740 useless extension candidates. Maximal degree in co-relation 3159. Up to 132 conditions per place. [2024-05-12 12:38:07,311 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 0 selfloop transitions, 0 changer transitions 95/95 dead transitions. [2024-05-12 12:38:07,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 95 transitions, 1014 flow [2024-05-12 12:38:07,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-05-12 12:38:07,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 12:38:07,319 INFO L175 Difference]: Start difference. First operand has 159 places, 85 transitions, 916 flow. Second operand 6 states and 141 transitions. [2024-05-12 12:38:07,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 95 transitions, 1014 flow [2024-05-12 12:38:07,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 731 flow, removed 11 selfloop flow, removed 46 redundant places. [2024-05-12 12:38:07,330 INFO L231 Difference]: Finished difference. Result has 102 places, 0 transitions, 0 flow [2024-05-12 12:38:07,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=102, PETRI_TRANSITIONS=0} [2024-05-12 12:38:07,331 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 56 predicate places. [2024-05-12 12:38:07,331 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 0 transitions, 0 flow [2024-05-12 12:38:07,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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 12:38:07,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-05-12 12:38:07,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-05-12 12:38:07,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-05-12 12:38:07,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 8 remaining) [2024-05-12 12:38:07,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-05-12 12:38:07,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-05-12 12:38:07,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-05-12 12:38:07,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2024-05-12 12:38:07,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 12:38:07,335 INFO L445 BasicCegarLoop]: Path program histogram: [6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:38:07,339 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 12:38:07,339 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 12:38:07,342 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-05-12 12:38:07,342 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-05-12 12:38:07,342 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 12:38:07 BasicIcfg [2024-05-12 12:38:07,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 12:38:07,343 INFO L158 Benchmark]: Toolchain (without parser) took 18313.88ms. Allocated memory was 199.2MB in the beginning and 775.9MB in the end (delta: 576.7MB). Free memory was 139.2MB in the beginning and 541.3MB in the end (delta: -402.2MB). Peak memory consumption was 176.2MB. Max. memory is 16.1GB. [2024-05-12 12:38:07,343 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 12:38:07,343 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 199.2MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 12:38:07,343 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.69ms. Allocated memory is still 199.2MB. Free memory was 138.9MB in the beginning and 113.3MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-05-12 12:38:07,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.66ms. Allocated memory is still 199.2MB. Free memory was 113.0MB in the beginning and 167.0MB in the end (delta: -54.0MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-05-12 12:38:07,344 INFO L158 Benchmark]: Boogie Preprocessor took 70.24ms. Allocated memory is still 199.2MB. Free memory was 167.0MB in the beginning and 164.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 12:38:07,344 INFO L158 Benchmark]: RCFGBuilder took 353.87ms. Allocated memory is still 199.2MB. Free memory was 164.8MB in the beginning and 142.1MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-05-12 12:38:07,344 INFO L158 Benchmark]: TraceAbstraction took 17250.41ms. Allocated memory was 199.2MB in the beginning and 775.9MB in the end (delta: 576.7MB). Free memory was 141.7MB in the beginning and 541.3MB in the end (delta: -399.6MB). Peak memory consumption was 180.2MB. Max. memory is 16.1GB. [2024-05-12 12:38:07,345 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.18ms. Allocated memory is still 199.2MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.69ms. Allocated memory is still 199.2MB. Free memory was 138.9MB in the beginning and 113.3MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.66ms. Allocated memory is still 199.2MB. Free memory was 113.0MB in the beginning and 167.0MB in the end (delta: -54.0MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.24ms. Allocated memory is still 199.2MB. Free memory was 167.0MB in the beginning and 164.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 353.87ms. Allocated memory is still 199.2MB. Free memory was 164.8MB in the beginning and 142.1MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17250.41ms. Allocated memory was 199.2MB in the beginning and 775.9MB in the end (delta: 576.7MB). Free memory was 141.7MB in the beginning and 541.3MB in the end (delta: -399.6MB). Peak memory consumption was 180.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 753]: 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: 725]: 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: 762]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 763]: 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, 74 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: 17.1s, OverallIterations: 46, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4278 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3101 mSDsluCounter, 1751 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1274 mSDsCounter, 298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7167 IncrementalHoareTripleChecker+Invalid, 7465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 298 mSolverCounterUnsat, 477 mSDtfsCounter, 7167 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2354occurred in iteration=26, InterpolantAutomatonStates: 278, 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.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 816 NumberOfCodeBlocks, 816 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 770 ConstructedInterpolants, 0 QuantifiedInterpolants, 3210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 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 12:38:07,368 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