Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696000650.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CANConstruction-PT-050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000650
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 7.6K Feb 25 21:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 21:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 21:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 21:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.8M 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 CANConstruction-PT-050-CTLFireability-00
FORMULA_NAME CANConstruction-PT-050-CTLFireability-01
FORMULA_NAME CANConstruction-PT-050-CTLFireability-02
FORMULA_NAME CANConstruction-PT-050-CTLFireability-03
FORMULA_NAME CANConstruction-PT-050-CTLFireability-04
FORMULA_NAME CANConstruction-PT-050-CTLFireability-05
FORMULA_NAME CANConstruction-PT-050-CTLFireability-06
FORMULA_NAME CANConstruction-PT-050-CTLFireability-07
FORMULA_NAME CANConstruction-PT-050-CTLFireability-08
FORMULA_NAME CANConstruction-PT-050-CTLFireability-09
FORMULA_NAME CANConstruction-PT-050-CTLFireability-10
FORMULA_NAME CANConstruction-PT-050-CTLFireability-11
FORMULA_NAME CANConstruction-PT-050-CTLFireability-12
FORMULA_NAME CANConstruction-PT-050-CTLFireability-13
FORMULA_NAME CANConstruction-PT-050-CTLFireability-14
FORMULA_NAME CANConstruction-PT-050-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678738459008

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 20:14:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 20:14:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:14:21] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2023-03-13 20:14:21] [INFO ] Transformed 5602 places.
[2023-03-13 20:14:21] [INFO ] Transformed 10400 transitions.
[2023-03-13 20:14:21] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 447 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 94 out of 5602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Discarding 2370 places :
Symmetric choice reduction at 0 with 2370 rule applications. Total rules 2370 place count 3232 transition count 5660
Iterating global reduction 0 with 2370 rules applied. Total rules applied 4740 place count 3232 transition count 5660
Applied a total of 4740 rules in 1069 ms. Remains 3232 /5602 variables (removed 2370) and now considering 5660/10400 (removed 4740) transitions.
// Phase 1: matrix 5660 rows 3232 cols
[2023-03-13 20:14:23] [INFO ] Computed 101 place invariants in 82 ms
[2023-03-13 20:14:25] [INFO ] Implicit Places using invariants in 2835 ms returned []
[2023-03-13 20:14:25] [INFO ] Invariant cache hit.
[2023-03-13 20:14:27] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-13 20:14:53] [INFO ] Implicit Places using invariants and state equation in 27356 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698]
Discarding 50 places :
Implicit Place search using SMT with State Equation took 30287 ms to find 50 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3182/5602 places, 5660/10400 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 3133 transition count 5611
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 3133 transition count 5611
Applied a total of 98 rules in 763 ms. Remains 3133 /3182 variables (removed 49) and now considering 5611/5660 (removed 49) transitions.
// Phase 1: matrix 5611 rows 3133 cols
[2023-03-13 20:14:54] [INFO ] Computed 51 place invariants in 83 ms
[2023-03-13 20:14:56] [INFO ] Implicit Places using invariants in 2292 ms returned []
[2023-03-13 20:14:56] [INFO ] Invariant cache hit.
[2023-03-13 20:14:57] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-13 20:15:11] [INFO ] Implicit Places using invariants and state equation in 14709 ms returned []
Implicit Place search using SMT with State Equation took 17013 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3133/5602 places, 5611/10400 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49133 ms. Remains : 3133/5602 places, 5611/10400 transitions.
Support contains 94 out of 3133 places after structural reductions.
[2023-03-13 20:15:11] [INFO ] Flatten gal took : 418 ms
[2023-03-13 20:15:12] [INFO ] Flatten gal took : 230 ms
[2023-03-13 20:15:12] [INFO ] Input system was already deterministic with 5611 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 686 ms. (steps per millisecond=14 ) properties (out of 56) seen :20
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) 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 36) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) 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 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Running SMT prover for 34 properties.
[2023-03-13 20:15:13] [INFO ] Invariant cache hit.
[2023-03-13 20:15:16] [INFO ] [Real]Absence check using 51 positive place invariants in 87 ms returned sat
[2023-03-13 20:15:20] [INFO ] After 2737ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:31
[2023-03-13 20:15:20] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-13 20:15:21] [INFO ] After 1266ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-13 20:15:21] [INFO ] After 7723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-13 20:15:23] [INFO ] [Nat]Absence check using 51 positive place invariants in 101 ms returned sat
[2023-03-13 20:15:33] [INFO ] After 8033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :34
[2023-03-13 20:15:44] [INFO ] After 11022ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :34
[2023-03-13 20:15:49] [INFO ] Deduced a trap composed of 5 places in 3308 ms of which 9 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-13 20:15:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 20:15:49] [INFO ] After 28383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:34
Parikh walk visited 4 properties in 983 ms.
Support contains 57 out of 3133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Drop transitions removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 3133 transition count 5283
Reduce places removed 328 places and 0 transitions.
Iterating post reduction 1 with 328 rules applied. Total rules applied 656 place count 2805 transition count 5283
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 656 place count 2805 transition count 5233
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 756 place count 2755 transition count 5233
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 764 place count 2747 transition count 5217
Iterating global reduction 2 with 8 rules applied. Total rules applied 772 place count 2747 transition count 5217
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 6 rules applied. Total rules applied 778 place count 2747 transition count 5211
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 784 place count 2741 transition count 5211
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 884 place count 2691 transition count 5161
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 892 place count 2691 transition count 5153
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 900 place count 2683 transition count 5153
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 916 place count 2683 transition count 5153
Applied a total of 916 rules in 2322 ms. Remains 2683 /3133 variables (removed 450) and now considering 5153/5611 (removed 458) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2323 ms. Remains : 2683/3133 places, 5153/5611 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 30) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) 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 17) 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 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 5153 rows 2683 cols
[2023-03-13 20:15:53] [INFO ] Computed 51 place invariants in 50 ms
[2023-03-13 20:15:54] [INFO ] [Real]Absence check using 51 positive place invariants in 39 ms returned sat
[2023-03-13 20:15:59] [INFO ] After 4085ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:10
[2023-03-13 20:15:59] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-13 20:16:01] [INFO ] After 1785ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-13 20:16:01] [INFO ] After 7362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-13 20:16:02] [INFO ] [Nat]Absence check using 51 positive place invariants in 48 ms returned sat
[2023-03-13 20:16:06] [INFO ] After 3893ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-13 20:16:10] [INFO ] After 4510ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-13 20:16:16] [INFO ] After 9934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 3469 ms.
[2023-03-13 20:16:19] [INFO ] After 18662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 2 properties in 151 ms.
Support contains 32 out of 2683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2683/2683 places, 5153/5153 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2683 transition count 5152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2682 transition count 5152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 2678 transition count 5144
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 2678 transition count 5144
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 2674 transition count 5140
Applied a total of 18 rules in 951 ms. Remains 2674 /2683 variables (removed 9) and now considering 5140/5153 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 952 ms. Remains : 2674/2683 places, 5140/5153 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 5140 rows 2674 cols
[2023-03-13 20:16:21] [INFO ] Computed 51 place invariants in 63 ms
[2023-03-13 20:16:21] [INFO ] [Real]Absence check using 51 positive place invariants in 38 ms returned sat
[2023-03-13 20:16:25] [INFO ] After 3103ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:5
[2023-03-13 20:16:25] [INFO ] State equation strengthened by 4953 read => feed constraints.
[2023-03-13 20:16:26] [INFO ] After 1472ms SMT Verify possible using 4953 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 20:16:26] [INFO ] After 5451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 20:16:27] [INFO ] [Nat]Absence check using 51 positive place invariants in 45 ms returned sat
[2023-03-13 20:16:30] [INFO ] After 2797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 20:16:33] [INFO ] After 3317ms SMT Verify possible using 4953 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-13 20:16:37] [INFO ] After 6479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1993 ms.
[2023-03-13 20:16:39] [INFO ] After 12196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 54 ms.
Support contains 25 out of 2674 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2674/2674 places, 5140/5140 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2673 transition count 5138
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2673 transition count 5138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 2671 transition count 5136
Applied a total of 6 rules in 852 ms. Remains 2671 /2674 variables (removed 3) and now considering 5136/5140 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 852 ms. Remains : 2671/2674 places, 5136/5140 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 580 ms. (steps per millisecond=17 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 5136 rows 2671 cols
[2023-03-13 20:16:40] [INFO ] Computed 51 place invariants in 94 ms
[2023-03-13 20:16:41] [INFO ] [Real]Absence check using 51 positive place invariants in 100 ms returned sat
[2023-03-13 20:16:45] [INFO ] After 3209ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-13 20:16:45] [INFO ] State equation strengthened by 4953 read => feed constraints.
[2023-03-13 20:16:45] [INFO ] After 716ms SMT Verify possible using 4953 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 20:16:45] [INFO ] After 5112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 20:16:46] [INFO ] [Nat]Absence check using 51 positive place invariants in 58 ms returned sat
[2023-03-13 20:16:49] [INFO ] After 2787ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 20:16:52] [INFO ] After 3168ms SMT Verify possible using 4953 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-13 20:16:56] [INFO ] After 6311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1964 ms.
[2023-03-13 20:16:58] [INFO ] After 12110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 4 properties in 111 ms.
Support contains 9 out of 2671 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2671/2671 places, 5136/5136 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2671 transition count 5135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2670 transition count 5135
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 2664 transition count 5123
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 2664 transition count 5123
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 2659 transition count 5118
Applied a total of 24 rules in 1025 ms. Remains 2659 /2671 variables (removed 12) and now considering 5118/5136 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1025 ms. Remains : 2659/2671 places, 5118/5136 transitions.
[2023-03-13 20:16:59] [INFO ] Flatten gal took : 107 ms
[2023-03-13 20:16:59] [INFO ] Flatten gal took : 115 ms
[2023-03-13 20:16:59] [INFO ] Input system was already deterministic with 5611 transitions.
Computed a total of 152 stabilizing places and 201 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 330 place count 3133 transition count 5281
Reduce places removed 330 places and 0 transitions.
Iterating post reduction 1 with 330 rules applied. Total rules applied 660 place count 2803 transition count 5281
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 660 place count 2803 transition count 5231
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 760 place count 2753 transition count 5231
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 789 place count 2724 transition count 5173
Iterating global reduction 2 with 29 rules applied. Total rules applied 818 place count 2724 transition count 5173
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 2 with 21 rules applied. Total rules applied 839 place count 2724 transition count 5152
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 860 place count 2703 transition count 5152
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 960 place count 2653 transition count 5102
Applied a total of 960 rules in 935 ms. Remains 2653 /3133 variables (removed 480) and now considering 5102/5611 (removed 509) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 936 ms. Remains : 2653/3133 places, 5102/5611 transitions.
[2023-03-13 20:17:00] [INFO ] Flatten gal took : 93 ms
[2023-03-13 20:17:00] [INFO ] Flatten gal took : 99 ms
[2023-03-13 20:17:01] [INFO ] Input system was already deterministic with 5102 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95483 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95483 steps, saw 37940 distinct states, run finished after 3015 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5102 rows 2653 cols
[2023-03-13 20:17:04] [INFO ] Computed 51 place invariants in 85 ms
[2023-03-13 20:17:04] [INFO ] [Real]Absence check using 51 positive place invariants in 45 ms returned sat
[2023-03-13 20:17:06] [INFO ] After 1571ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 20:17:06] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-13 20:17:07] [INFO ] After 633ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:17:07] [INFO ] After 2742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:17:07] [INFO ] [Nat]Absence check using 51 positive place invariants in 48 ms returned sat
[2023-03-13 20:17:09] [INFO ] After 1547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:17:09] [INFO ] After 483ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:17:09] [INFO ] After 750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 257 ms.
[2023-03-13 20:17:10] [INFO ] After 3070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA CANConstruction-PT-050-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
Starting structural reductions in LTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3105 transition count 5556
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3105 transition count 5556
Applied a total of 56 rules in 796 ms. Remains 3105 /3133 variables (removed 28) and now considering 5556/5611 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 797 ms. Remains : 3105/3133 places, 5556/5611 transitions.
[2023-03-13 20:17:11] [INFO ] Flatten gal took : 119 ms
[2023-03-13 20:17:11] [INFO ] Flatten gal took : 220 ms
[2023-03-13 20:17:11] [INFO ] Input system was already deterministic with 5556 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 3102 transition count 5550
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 3102 transition count 5550
Applied a total of 62 rules in 795 ms. Remains 3102 /3133 variables (removed 31) and now considering 5550/5611 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 795 ms. Remains : 3102/3133 places, 5550/5611 transitions.
[2023-03-13 20:17:12] [INFO ] Flatten gal took : 118 ms
[2023-03-13 20:17:12] [INFO ] Flatten gal took : 138 ms
[2023-03-13 20:17:12] [INFO ] Input system was already deterministic with 5550 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 3102 transition count 5550
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 3102 transition count 5550
Applied a total of 62 rules in 580 ms. Remains 3102 /3133 variables (removed 31) and now considering 5550/5611 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 582 ms. Remains : 3102/3133 places, 5550/5611 transitions.
[2023-03-13 20:17:13] [INFO ] Flatten gal took : 105 ms
[2023-03-13 20:17:13] [INFO ] Flatten gal took : 147 ms
[2023-03-13 20:17:14] [INFO ] Input system was already deterministic with 5550 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Drop transitions removed 329 transitions
Trivial Post-agglo rules discarded 329 transitions
Performed 329 trivial Post agglomeration. Transition count delta: 329
Iterating post reduction 0 with 329 rules applied. Total rules applied 329 place count 3133 transition count 5282
Reduce places removed 329 places and 0 transitions.
Iterating post reduction 1 with 329 rules applied. Total rules applied 658 place count 2804 transition count 5282
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 658 place count 2804 transition count 5232
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 758 place count 2754 transition count 5232
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 787 place count 2725 transition count 5174
Iterating global reduction 2 with 29 rules applied. Total rules applied 816 place count 2725 transition count 5174
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 2 with 21 rules applied. Total rules applied 837 place count 2725 transition count 5153
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 858 place count 2704 transition count 5153
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 952 place count 2657 transition count 5106
Applied a total of 952 rules in 1102 ms. Remains 2657 /3133 variables (removed 476) and now considering 5106/5611 (removed 505) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1103 ms. Remains : 2657/3133 places, 5106/5611 transitions.
[2023-03-13 20:17:15] [INFO ] Flatten gal took : 90 ms
[2023-03-13 20:17:15] [INFO ] Flatten gal took : 102 ms
[2023-03-13 20:17:15] [INFO ] Input system was already deterministic with 5106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3103 transition count 5551
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3103 transition count 5551
Applied a total of 60 rules in 598 ms. Remains 3103 /3133 variables (removed 30) and now considering 5551/5611 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 3103/3133 places, 5551/5611 transitions.
[2023-03-13 20:17:16] [INFO ] Flatten gal took : 103 ms
[2023-03-13 20:17:16] [INFO ] Flatten gal took : 144 ms
[2023-03-13 20:17:16] [INFO ] Input system was already deterministic with 5551 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Drop transitions removed 329 transitions
Trivial Post-agglo rules discarded 329 transitions
Performed 329 trivial Post agglomeration. Transition count delta: 329
Iterating post reduction 0 with 329 rules applied. Total rules applied 329 place count 3133 transition count 5282
Reduce places removed 329 places and 0 transitions.
Iterating post reduction 1 with 329 rules applied. Total rules applied 658 place count 2804 transition count 5282
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 658 place count 2804 transition count 5232
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 758 place count 2754 transition count 5232
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 784 place count 2728 transition count 5180
Iterating global reduction 2 with 26 rules applied. Total rules applied 810 place count 2728 transition count 5180
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 2 with 18 rules applied. Total rules applied 828 place count 2728 transition count 5162
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 846 place count 2710 transition count 5162
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 948 place count 2659 transition count 5111
Applied a total of 948 rules in 1079 ms. Remains 2659 /3133 variables (removed 474) and now considering 5111/5611 (removed 500) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1080 ms. Remains : 2659/3133 places, 5111/5611 transitions.
[2023-03-13 20:17:18] [INFO ] Flatten gal took : 98 ms
[2023-03-13 20:17:18] [INFO ] Flatten gal took : 115 ms
[2023-03-13 20:17:18] [INFO ] Input system was already deterministic with 5111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 330 place count 3133 transition count 5281
Reduce places removed 330 places and 0 transitions.
Iterating post reduction 1 with 330 rules applied. Total rules applied 660 place count 2803 transition count 5281
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 660 place count 2803 transition count 5231
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 760 place count 2753 transition count 5231
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 788 place count 2725 transition count 5175
Iterating global reduction 2 with 28 rules applied. Total rules applied 816 place count 2725 transition count 5175
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 2 with 20 rules applied. Total rules applied 836 place count 2725 transition count 5155
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 856 place count 2705 transition count 5155
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 956 place count 2655 transition count 5105
Applied a total of 956 rules in 1110 ms. Remains 2655 /3133 variables (removed 478) and now considering 5105/5611 (removed 506) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1112 ms. Remains : 2655/3133 places, 5105/5611 transitions.
[2023-03-13 20:17:19] [INFO ] Flatten gal took : 124 ms
[2023-03-13 20:17:19] [INFO ] Flatten gal took : 146 ms
[2023-03-13 20:17:20] [INFO ] Input system was already deterministic with 5105 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Finished Best-First random walk after 6559 steps, including 1 resets, run visited all 1 properties in 10 ms. (steps per millisecond=655 )
FORMULA CANConstruction-PT-050-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3103 transition count 5552
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3103 transition count 5552
Applied a total of 60 rules in 688 ms. Remains 3103 /3133 variables (removed 30) and now considering 5552/5611 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 688 ms. Remains : 3103/3133 places, 5552/5611 transitions.
[2023-03-13 20:17:21] [INFO ] Flatten gal took : 99 ms
[2023-03-13 20:17:21] [INFO ] Flatten gal took : 113 ms
[2023-03-13 20:17:21] [INFO ] Input system was already deterministic with 5552 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3105 transition count 5556
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3105 transition count 5556
Applied a total of 56 rules in 519 ms. Remains 3105 /3133 variables (removed 28) and now considering 5556/5611 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 520 ms. Remains : 3105/3133 places, 5556/5611 transitions.
[2023-03-13 20:17:22] [INFO ] Flatten gal took : 95 ms
[2023-03-13 20:17:22] [INFO ] Flatten gal took : 110 ms
[2023-03-13 20:17:22] [INFO ] Input system was already deterministic with 5556 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3105 transition count 5556
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3105 transition count 5556
Applied a total of 56 rules in 514 ms. Remains 3105 /3133 variables (removed 28) and now considering 5556/5611 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 515 ms. Remains : 3105/3133 places, 5556/5611 transitions.
[2023-03-13 20:17:23] [INFO ] Flatten gal took : 80 ms
[2023-03-13 20:17:23] [INFO ] Flatten gal took : 92 ms
[2023-03-13 20:17:23] [INFO ] Input system was already deterministic with 5556 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 330 place count 3133 transition count 5281
Reduce places removed 330 places and 0 transitions.
Iterating post reduction 1 with 330 rules applied. Total rules applied 660 place count 2803 transition count 5281
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 660 place count 2803 transition count 5231
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 760 place count 2753 transition count 5231
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 789 place count 2724 transition count 5173
Iterating global reduction 2 with 29 rules applied. Total rules applied 818 place count 2724 transition count 5173
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 2 with 21 rules applied. Total rules applied 839 place count 2724 transition count 5152
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 860 place count 2703 transition count 5152
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 958 place count 2654 transition count 5103
Applied a total of 958 rules in 745 ms. Remains 2654 /3133 variables (removed 479) and now considering 5103/5611 (removed 508) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 745 ms. Remains : 2654/3133 places, 5103/5611 transitions.
[2023-03-13 20:17:24] [INFO ] Flatten gal took : 73 ms
[2023-03-13 20:17:24] [INFO ] Flatten gal took : 84 ms
[2023-03-13 20:17:24] [INFO ] Input system was already deterministic with 5103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3103 transition count 5552
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3103 transition count 5552
Applied a total of 60 rules in 661 ms. Remains 3103 /3133 variables (removed 30) and now considering 5552/5611 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 661 ms. Remains : 3103/3133 places, 5552/5611 transitions.
[2023-03-13 20:17:25] [INFO ] Flatten gal took : 85 ms
[2023-03-13 20:17:25] [INFO ] Flatten gal took : 98 ms
[2023-03-13 20:17:25] [INFO ] Input system was already deterministic with 5552 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3103 transition count 5552
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3103 transition count 5552
Applied a total of 60 rules in 510 ms. Remains 3103 /3133 variables (removed 30) and now considering 5552/5611 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 511 ms. Remains : 3103/3133 places, 5552/5611 transitions.
[2023-03-13 20:17:26] [INFO ] Flatten gal took : 168 ms
[2023-03-13 20:17:26] [INFO ] Flatten gal took : 87 ms
[2023-03-13 20:17:26] [INFO ] Input system was already deterministic with 5552 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 3106 transition count 5558
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 3106 transition count 5558
Applied a total of 54 rules in 521 ms. Remains 3106 /3133 variables (removed 27) and now considering 5558/5611 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 3106/3133 places, 5558/5611 transitions.
[2023-03-13 20:17:27] [INFO ] Flatten gal took : 80 ms
[2023-03-13 20:17:27] [INFO ] Flatten gal took : 90 ms
[2023-03-13 20:17:28] [INFO ] Input system was already deterministic with 5558 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3133/3133 places, 5611/5611 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 3107 transition count 5560
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 3107 transition count 5560
Applied a total of 52 rules in 842 ms. Remains 3107 /3133 variables (removed 26) and now considering 5560/5611 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 843 ms. Remains : 3107/3133 places, 5560/5611 transitions.
[2023-03-13 20:17:29] [INFO ] Flatten gal took : 108 ms
[2023-03-13 20:17:29] [INFO ] Flatten gal took : 134 ms
[2023-03-13 20:17:29] [INFO ] Input system was already deterministic with 5560 transitions.
[2023-03-13 20:17:29] [INFO ] Flatten gal took : 132 ms
[2023-03-13 20:17:29] [INFO ] Flatten gal took : 201 ms
[2023-03-13 20:17:29] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-13 20:17:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3133 places, 5611 transitions and 21223 arcs took 33 ms.
Total runtime 188605 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 3133 NrTr: 5611 NrArc: 21223)

parse formulas
formulas created successfully
place and transition orderings generation:0m 1.942sec

net check time: 0m 0.005sec

init dd package: 0m 3.115sec


before gc: list nodes free: 1466239

after gc: idd nodes used:33176723, unused:30823277; list nodes free:132563877

RS generation: 35m22.012sec


-> last computed set: #nodes 33173618 (3.3e+07) #states 6,553,751 (6)


CANNOT_COMPUTE


BK_STOP 1678740802770

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.062sec

idd.cc:820: DD Exception: No free nodes

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="CANConstruction-PT-050"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is CANConstruction-PT-050, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813696000650"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-050.tgz
mv CANConstruction-PT-050 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;