Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856419000537.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is LeafsetExtension-PT-S64C4, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419000537
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Feb 25 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 25 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679550183561

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C4
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 05:43:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 05:43:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 05:43:05] [INFO ] Load time of PNML (sax parser for PT used): 593 ms
[2023-03-23 05:43:05] [INFO ] Transformed 21462 places.
[2023-03-23 05:43:05] [INFO ] Transformed 21129 transitions.
[2023-03-23 05:43:05] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 770 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Support contains 190 out of 21462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Reduce places removed 4190 places and 0 transitions.
Iterating post reduction 0 with 4190 rules applied. Total rules applied 4190 place count 17272 transition count 21129
Applied a total of 4190 rules in 316 ms. Remains 17272 /21462 variables (removed 4190) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17272 cols
[2023-03-23 05:43:08] [INFO ] Computed 200 place invariants in 1782 ms
[2023-03-23 05:43:09] [INFO ] Implicit Places using invariants in 3424 ms returned []
Implicit Place search using SMT only with invariants took 3451 ms to find 0 implicit places.
[2023-03-23 05:43:09] [INFO ] Invariant cache hit.
[2023-03-23 05:43:11] [INFO ] Dead Transitions using invariants and state equation in 1426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17272/21462 places, 21129/21129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5202 ms. Remains : 17272/21462 places, 21129/21129 transitions.
Support contains 190 out of 17272 places after structural reductions.
[2023-03-23 05:43:12] [INFO ] Flatten gal took : 830 ms
[2023-03-23 05:43:13] [INFO ] Flatten gal took : 567 ms
[2023-03-23 05:43:14] [INFO ] Input system was already deterministic with 21129 transitions.
Incomplete random walk after 10000 steps, including 299 resets, run finished after 774 ms. (steps per millisecond=12 ) properties (out of 110) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 98) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 98) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 97) seen :0
Running SMT prover for 97 properties.
[2023-03-23 05:43:15] [INFO ] Invariant cache hit.
[2023-03-23 05:43:37] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned sat
[2023-03-23 05:43:37] [INFO ] [Real]Absence check using 2 positive and 198 generalized place invariants in 384 ms returned sat
[2023-03-23 05:43:37] [INFO ] After 22427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:97
[2023-03-23 05:43:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2023-03-23 05:43:58] [INFO ] [Nat]Absence check using 2 positive and 198 generalized place invariants in 380 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 05:44:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 05:44:02] [INFO ] After 25068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:97
Fused 97 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 166 out of 17272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17272/17272 places, 21129/21129 transitions.
Graph (complete) has 38197 edges and 17272 vertex of which 5401 are kept as prefixes of interest. Removing 11871 places using SCC suffix rule.37 ms
Discarding 11871 places :
Also discarding 7784 output transitions
Drop transitions removed 7784 transitions
Drop transitions removed 4026 transitions
Reduce isomorphic transitions removed 4026 transitions.
Drop transitions removed 2275 transitions
Trivial Post-agglo rules discarded 2275 transitions
Performed 2275 trivial Post agglomeration. Transition count delta: 2275
Iterating post reduction 0 with 6301 rules applied. Total rules applied 6302 place count 5401 transition count 7044
Reduce places removed 2277 places and 0 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 1 with 2348 rules applied. Total rules applied 8650 place count 3124 transition count 6973
Reduce places removed 71 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 85 rules applied. Total rules applied 8735 place count 3053 transition count 6959
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 8749 place count 3039 transition count 6959
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 91 Pre rules applied. Total rules applied 8749 place count 3039 transition count 6868
Deduced a syphon composed of 91 places in 3 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 8931 place count 2948 transition count 6868
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 8991 place count 2888 transition count 6808
Iterating global reduction 4 with 60 rules applied. Total rules applied 9051 place count 2888 transition count 6808
Free-agglomeration rule (complex) applied 47 times.
Iterating global reduction 4 with 47 rules applied. Total rules applied 9098 place count 2888 transition count 6761
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 9145 place count 2841 transition count 6761
Partial Free-agglomeration rule applied 1561 times.
Drop transitions removed 1561 transitions
Iterating global reduction 5 with 1561 rules applied. Total rules applied 10706 place count 2841 transition count 6761
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 5 with 33 rules applied. Total rules applied 10739 place count 2808 transition count 6761
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 6 with 23 rules applied. Total rules applied 10762 place count 2808 transition count 6738
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 10785 place count 2785 transition count 6738
Applied a total of 10785 rules in 2368 ms. Remains 2785 /17272 variables (removed 14487) and now considering 6738/21129 (removed 14391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2370 ms. Remains : 2785/17272 places, 6738/21129 transitions.
Incomplete random walk after 10000 steps, including 920 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 96) seen :35
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 61) seen :0
Running SMT prover for 61 properties.
[2023-03-23 05:44:05] [INFO ] Flow matrix only has 5013 transitions (discarded 1725 similar events)
// Phase 1: matrix 5013 rows 2785 cols
[2023-03-23 05:44:05] [INFO ] Computed 5 place invariants in 51 ms
[2023-03-23 05:44:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 05:44:08] [INFO ] [Real]Absence check using 1 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-23 05:44:08] [INFO ] After 2740ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:61
[2023-03-23 05:44:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 05:44:11] [INFO ] [Nat]Absence check using 1 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-23 05:44:16] [INFO ] After 3186ms SMT Verify possible using state equation in natural domain returned unsat :48 sat :13
[2023-03-23 05:44:19] [INFO ] After 5855ms SMT Verify possible using trap constraints in natural domain returned unsat :48 sat :13
Attempting to minimize the solution found.
Minimization took 1523 ms.
[2023-03-23 05:44:20] [INFO ] After 12243ms SMT Verify possible using all constraints in natural domain returned unsat :48 sat :13
Fused 61 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 30 out of 2785 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2785/2785 places, 6738/6738 transitions.
Graph (complete) has 9028 edges and 2785 vertex of which 769 are kept as prefixes of interest. Removing 2016 places using SCC suffix rule.2 ms
Discarding 2016 places :
Also discarding 103 output transitions
Drop transitions removed 103 transitions
Drop transitions removed 1853 transitions
Reduce isomorphic transitions removed 1853 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 1858 rules applied. Total rules applied 1859 place count 769 transition count 4777
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 1864 place count 764 transition count 4777
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1865 place count 764 transition count 4776
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1866 place count 763 transition count 4776
Partial Free-agglomeration rule applied 222 times.
Drop transitions removed 222 transitions
Iterating global reduction 3 with 222 rules applied. Total rules applied 2088 place count 763 transition count 4776
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 2099 place count 752 transition count 4776
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 2108 place count 752 transition count 4767
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 2117 place count 743 transition count 4767
Applied a total of 2117 rules in 233 ms. Remains 743 /2785 variables (removed 2042) and now considering 4767/6738 (removed 1971) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 743/2785 places, 4767/6738 transitions.
Incomplete random walk after 10000 steps, including 1075 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 05:44:21] [INFO ] Flow matrix only has 1198 transitions (discarded 3569 similar events)
// Phase 1: matrix 1198 rows 743 cols
[2023-03-23 05:44:21] [INFO ] Computed 2 place invariants in 18 ms
[2023-03-23 05:44:21] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:44:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-23 05:44:22] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 05:44:22] [INFO ] After 563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-23 05:44:22] [INFO ] After 828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 13 out of 743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 743/743 places, 4767/4767 transitions.
Graph (complete) has 1974 edges and 743 vertex of which 435 are kept as prefixes of interest. Removing 308 places using SCC suffix rule.1 ms
Discarding 308 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 0 with 296 rules applied. Total rules applied 297 place count 435 transition count 4460
Applied a total of 297 rules in 43 ms. Remains 435 /743 variables (removed 308) and now considering 4460/4767 (removed 307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 435/743 places, 4460/4767 transitions.
Incomplete random walk after 10000 steps, including 1085 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 51777 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 51777 steps, saw 12490 distinct states, run finished after 3002 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 05:44:25] [INFO ] Flow matrix only has 595 transitions (discarded 3865 similar events)
// Phase 1: matrix 595 rows 435 cols
[2023-03-23 05:44:25] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-23 05:44:25] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:44:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 05:44:26] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 05:44:26] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-23 05:44:26] [INFO ] After 476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 13 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 4460/4460 transitions.
Applied a total of 0 rules in 37 ms. Remains 435 /435 variables (removed 0) and now considering 4460/4460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 435/435 places, 4460/4460 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 4460/4460 transitions.
Applied a total of 0 rules in 37 ms. Remains 435 /435 variables (removed 0) and now considering 4460/4460 (removed 0) transitions.
[2023-03-23 05:44:26] [INFO ] Flow matrix only has 595 transitions (discarded 3865 similar events)
[2023-03-23 05:44:26] [INFO ] Invariant cache hit.
[2023-03-23 05:44:26] [INFO ] Implicit Places using invariants in 400 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 404 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 434/435 places, 4460/4460 transitions.
Applied a total of 0 rules in 37 ms. Remains 434 /434 variables (removed 0) and now considering 4460/4460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 480 ms. Remains : 434/435 places, 4460/4460 transitions.
Incomplete random walk after 10000 steps, including 1088 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 53196 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53196 steps, saw 12845 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 05:44:30] [INFO ] Flow matrix only has 595 transitions (discarded 3865 similar events)
// Phase 1: matrix 595 rows 434 cols
[2023-03-23 05:44:30] [INFO ] Computed 1 place invariants in 5 ms
[2023-03-23 05:44:30] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:44:30] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 05:44:30] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 05:44:30] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-23 05:44:30] [INFO ] After 472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 13 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 4460/4460 transitions.
Applied a total of 0 rules in 41 ms. Remains 434 /434 variables (removed 0) and now considering 4460/4460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 434/434 places, 4460/4460 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 4460/4460 transitions.
Applied a total of 0 rules in 35 ms. Remains 434 /434 variables (removed 0) and now considering 4460/4460 (removed 0) transitions.
[2023-03-23 05:44:30] [INFO ] Flow matrix only has 595 transitions (discarded 3865 similar events)
[2023-03-23 05:44:30] [INFO ] Invariant cache hit.
[2023-03-23 05:44:31] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-23 05:44:31] [INFO ] Flow matrix only has 595 transitions (discarded 3865 similar events)
[2023-03-23 05:44:31] [INFO ] Invariant cache hit.
[2023-03-23 05:44:33] [INFO ] Implicit Places using invariants and state equation in 2071 ms returned [3, 6, 9, 12, 17, 53, 57, 93, 96, 99, 102, 105, 108, 111, 116, 119, 122, 125, 128, 131, 134, 137, 140, 143, 146, 149, 152, 188, 191, 194, 230, 233, 236, 272, 275, 279, 282, 285, 288, 292, 295, 298, 301, 304, 307, 343, 346, 349, 352, 388, 391, 394, 397, 400, 403, 406, 409, 412, 415, 418, 421, 424, 427, 430, 433]
Discarding 65 places :
Implicit Place search using SMT with State Equation took 2476 ms to find 65 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 369/434 places, 4460/4460 transitions.
Discarding 203 places :
Symmetric choice reduction at 0 with 203 rule applications. Total rules 203 place count 166 transition count 4257
Iterating global reduction 0 with 203 rules applied. Total rules applied 406 place count 166 transition count 4257
Free-agglomeration rule (complex) applied 65 times.
Iterating global reduction 0 with 65 rules applied. Total rules applied 471 place count 166 transition count 4192
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 536 place count 101 transition count 4192
Applied a total of 536 rules in 259 ms. Remains 101 /369 variables (removed 268) and now considering 4192/4460 (removed 268) transitions.
[2023-03-23 05:44:33] [INFO ] Flow matrix only has 327 transitions (discarded 3865 similar events)
// Phase 1: matrix 327 rows 101 cols
[2023-03-23 05:44:33] [INFO ] Computed 1 place invariants in 10 ms
[2023-03-23 05:44:33] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-23 05:44:33] [INFO ] Flow matrix only has 327 transitions (discarded 3865 similar events)
[2023-03-23 05:44:33] [INFO ] Invariant cache hit.
[2023-03-23 05:44:34] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 101/434 places, 4192/4460 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3415 ms. Remains : 101/434 places, 4192/4460 transitions.
Incomplete random walk after 10000 steps, including 1908 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 05:44:34] [INFO ] Flow matrix only has 327 transitions (discarded 3865 similar events)
[2023-03-23 05:44:34] [INFO ] Invariant cache hit.
[2023-03-23 05:44:34] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 05:44:34] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 05:44:34] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 05:44:34] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-23 05:44:34] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 4192/4192 transitions.
Graph (complete) has 302 edges and 101 vertex of which 79 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Applied a total of 1 rules in 102 ms. Remains 79 /101 variables (removed 22) and now considering 4172/4192 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 79/101 places, 4172/4192 transitions.
Incomplete random walk after 10000 steps, including 1946 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 34887 steps, run visited all 1 properties in 662 ms. (steps per millisecond=52 )
Probabilistic random walk after 34887 steps, saw 14643 distinct states, run finished after 663 ms. (steps per millisecond=52 ) properties seen :1
Successfully simplified 49 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA LeafsetExtension-PT-S64C4-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C4-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C4-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 05:44:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-23 05:44:36] [INFO ] Flatten gal took : 487 ms
[2023-03-23 05:44:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA LeafsetExtension-PT-S64C4-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C4-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C4-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 05:44:37] [INFO ] Flatten gal took : 535 ms
[2023-03-23 05:44:37] [INFO ] Input system was already deterministic with 21129 transitions.
Support contains 49 out of 17272 places (down from 92) after GAL structural reductions.
Computed a total of 17272 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17272 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA LeafsetExtension-PT-S64C4-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 17272/17272 places, 21129/21129 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 17233 transition count 21129
Applied a total of 39 rules in 85 ms. Remains 17233 /17272 variables (removed 39) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 17233/17272 places, 21129/21129 transitions.
[2023-03-23 05:44:38] [INFO ] Flatten gal took : 482 ms
[2023-03-23 05:44:39] [INFO ] Flatten gal took : 516 ms
[2023-03-23 05:44:40] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17272/17272 places, 21129/21129 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 17233 transition count 21129
Applied a total of 39 rules in 80 ms. Remains 17233 /17272 variables (removed 39) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 17233/17272 places, 21129/21129 transitions.
[2023-03-23 05:44:40] [INFO ] Flatten gal took : 477 ms
[2023-03-23 05:44:41] [INFO ] Flatten gal took : 492 ms
[2023-03-23 05:44:42] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17272/17272 places, 21129/21129 transitions.
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 17235 transition count 21129
Applied a total of 37 rules in 114 ms. Remains 17235 /17272 variables (removed 37) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 17235/17272 places, 21129/21129 transitions.
[2023-03-23 05:44:42] [INFO ] Flatten gal took : 449 ms
[2023-03-23 05:44:43] [INFO ] Flatten gal took : 507 ms
[2023-03-23 05:44:44] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17272/17272 places, 21129/21129 transitions.
Graph (complete) has 42554 edges and 17272 vertex of which 17232 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.54 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8282 transitions
Trivial Post-agglo rules discarded 8282 transitions
Performed 8282 trivial Post agglomeration. Transition count delta: 8282
Iterating post reduction 0 with 8282 rules applied. Total rules applied 8283 place count 17232 transition count 12845
Reduce places removed 8282 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 1 with 8316 rules applied. Total rules applied 16599 place count 8950 transition count 12811
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 16633 place count 8916 transition count 12811
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16633 place count 8916 transition count 12682
Deduced a syphon composed of 129 places in 5 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16891 place count 8787 transition count 12682
Discarding 4026 places :
Symmetric choice reduction at 3 with 4026 rule applications. Total rules 20917 place count 4761 transition count 8656
Iterating global reduction 3 with 4026 rules applied. Total rules applied 24943 place count 4761 transition count 8656
Applied a total of 24943 rules in 2295 ms. Remains 4761 /17272 variables (removed 12511) and now considering 8656/21129 (removed 12473) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2297 ms. Remains : 4761/17272 places, 8656/21129 transitions.
[2023-03-23 05:44:47] [INFO ] Flatten gal took : 205 ms
[2023-03-23 05:44:47] [INFO ] Flatten gal took : 232 ms
[2023-03-23 05:44:47] [INFO ] Input system was already deterministic with 8656 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17272/17272 places, 21129/21129 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 17236 transition count 21129
Applied a total of 36 rules in 81 ms. Remains 17236 /17272 variables (removed 36) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 17236/17272 places, 21129/21129 transitions.
[2023-03-23 05:44:48] [INFO ] Flatten gal took : 454 ms
[2023-03-23 05:44:48] [INFO ] Flatten gal took : 506 ms
[2023-03-23 05:44:49] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17272/17272 places, 21129/21129 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 17234 transition count 21129
Applied a total of 38 rules in 82 ms. Remains 17234 /17272 variables (removed 38) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 17234/17272 places, 21129/21129 transitions.
[2023-03-23 05:44:50] [INFO ] Flatten gal took : 453 ms
[2023-03-23 05:44:50] [INFO ] Flatten gal took : 504 ms
[2023-03-23 05:44:51] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17272/17272 places, 21129/21129 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 17233 transition count 21129
Applied a total of 39 rules in 80 ms. Remains 17233 /17272 variables (removed 39) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 17233/17272 places, 21129/21129 transitions.
[2023-03-23 05:44:52] [INFO ] Flatten gal took : 449 ms
[2023-03-23 05:44:52] [INFO ] Flatten gal took : 515 ms
[2023-03-23 05:44:53] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17272/17272 places, 21129/21129 transitions.
Graph (complete) has 42554 edges and 17272 vertex of which 17231 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.21 ms
Discarding 41 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8318 transitions
Trivial Post-agglo rules discarded 8318 transitions
Performed 8318 trivial Post agglomeration. Transition count delta: 8318
Iterating post reduction 0 with 8318 rules applied. Total rules applied 8319 place count 17231 transition count 12809
Reduce places removed 8318 places and 0 transitions.
Iterating post reduction 1 with 8318 rules applied. Total rules applied 16637 place count 8913 transition count 12809
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 16637 place count 8913 transition count 12679
Deduced a syphon composed of 130 places in 4 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 16897 place count 8783 transition count 12679
Discarding 4028 places :
Symmetric choice reduction at 2 with 4028 rule applications. Total rules 20925 place count 4755 transition count 8651
Iterating global reduction 2 with 4028 rules applied. Total rules applied 24953 place count 4755 transition count 8651
Applied a total of 24953 rules in 2033 ms. Remains 4755 /17272 variables (removed 12517) and now considering 8651/21129 (removed 12478) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2033 ms. Remains : 4755/17272 places, 8651/21129 transitions.
[2023-03-23 05:44:56] [INFO ] Flatten gal took : 206 ms
[2023-03-23 05:44:56] [INFO ] Flatten gal took : 226 ms
[2023-03-23 05:44:56] [INFO ] Input system was already deterministic with 8651 transitions.
Incomplete random walk after 10000 steps, including 472 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19407 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19407 steps, saw 10651 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 8651 rows 4755 cols
[2023-03-23 05:45:00] [INFO ] Computed 198 place invariants in 98 ms
[2023-03-23 05:45:00] [INFO ] After 478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 05:45:01] [INFO ] [Nat]Absence check using 0 positive and 198 generalized place invariants in 103 ms returned sat
[2023-03-23 05:45:04] [INFO ] After 3564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 05:45:05] [INFO ] After 3904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-23 05:45:05] [INFO ] After 4747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
FORMULA LeafsetExtension-PT-S64C4-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
Starting structural reductions in LTL mode, iteration 0 : 17272/17272 places, 21129/21129 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 17234 transition count 21129
Applied a total of 38 rules in 81 ms. Remains 17234 /17272 variables (removed 38) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 17234/17272 places, 21129/21129 transitions.
[2023-03-23 05:45:05] [INFO ] Flatten gal took : 453 ms
[2023-03-23 05:45:06] [INFO ] Flatten gal took : 505 ms
[2023-03-23 05:45:07] [INFO ] Input system was already deterministic with 21129 transitions.
[2023-03-23 05:45:07] [INFO ] Flatten gal took : 484 ms
[2023-03-23 05:45:08] [INFO ] Flatten gal took : 520 ms
[2023-03-23 05:45:08] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-23 05:45:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 17272 places, 21129 transitions and 63548 arcs took 83 ms.
Total runtime 123426 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/547/ctl_0_ --ctl=/tmp/547/ctl_1_ --ctl=/tmp/547/ctl_2_ --ctl=/tmp/547/ctl_3_ --ctl=/tmp/547/ctl_4_ --ctl=/tmp/547/ctl_5_ --ctl=/tmp/547/ctl_6_ --ctl=/tmp/547/ctl_7_ --mu-par --mu-opt
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLCardinality-03
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLCardinality-04
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLCardinality-06
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLCardinality-07
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLCardinality-08
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLCardinality-12
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLCardinality-13
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLCardinality-15

BK_STOP 1679553129761

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name LeafsetExtension-PT-S64C4-CTLCardinality-03
ctl formula formula --ctl=/tmp/547/ctl_0_
ctl formula name LeafsetExtension-PT-S64C4-CTLCardinality-04
ctl formula formula --ctl=/tmp/547/ctl_1_
ctl formula name LeafsetExtension-PT-S64C4-CTLCardinality-06
ctl formula formula --ctl=/tmp/547/ctl_2_
ctl formula name LeafsetExtension-PT-S64C4-CTLCardinality-07
ctl formula formula --ctl=/tmp/547/ctl_3_
ctl formula name LeafsetExtension-PT-S64C4-CTLCardinality-08
ctl formula formula --ctl=/tmp/547/ctl_4_
ctl formula name LeafsetExtension-PT-S64C4-CTLCardinality-12
ctl formula formula --ctl=/tmp/547/ctl_5_
ctl formula name LeafsetExtension-PT-S64C4-CTLCardinality-13
ctl formula formula --ctl=/tmp/547/ctl_6_
ctl formula name LeafsetExtension-PT-S64C4-CTLCardinality-15
ctl formula formula --ctl=/tmp/547/ctl_7_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 17272 places, 21129 transitions and 63548 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.400 real 0.210 user 0.200 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 21129->21127 groups
pnml2lts-sym: Regrouping took 457.290 real 456.100 user 1.130 sys
pnml2lts-sym: state vector length is 17272; there are 21127 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
MDD Unique table full, 268435456 of 268435456 buckets filled!

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S64C4"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is LeafsetExtension-PT-S64C4, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856419000537"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C4.tgz
mv LeafsetExtension-PT-S64C4 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;