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.r394-oct2-167903717700313.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPt-PT-040B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717700313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 686K Mar 5 18:23 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 ShieldIIPt-PT-040B-CTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-040B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679503602504

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:46:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 16:46:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:46:46] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2023-03-22 16:46:46] [INFO ] Transformed 2803 places.
[2023-03-22 16:46:46] [INFO ] Transformed 2603 transitions.
[2023-03-22 16:46:46] [INFO ] Found NUPN structural information;
[2023-03-22 16:46:46] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 409 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
FORMULA ShieldIIPt-PT-040B-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 95 out of 2803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Discarding 414 places :
Symmetric choice reduction at 0 with 414 rule applications. Total rules 414 place count 2389 transition count 2189
Iterating global reduction 0 with 414 rules applied. Total rules applied 828 place count 2389 transition count 2189
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 829 place count 2388 transition count 2188
Iterating global reduction 0 with 1 rules applied. Total rules applied 830 place count 2388 transition count 2188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 831 place count 2387 transition count 2187
Iterating global reduction 0 with 1 rules applied. Total rules applied 832 place count 2387 transition count 2187
Applied a total of 832 rules in 1076 ms. Remains 2387 /2803 variables (removed 416) and now considering 2187/2603 (removed 416) transitions.
// Phase 1: matrix 2187 rows 2387 cols
[2023-03-22 16:46:47] [INFO ] Computed 361 place invariants in 35 ms
[2023-03-22 16:46:49] [INFO ] Implicit Places using invariants in 2034 ms returned []
[2023-03-22 16:46:49] [INFO ] Invariant cache hit.
[2023-03-22 16:46:53] [INFO ] Implicit Places using invariants and state equation in 3800 ms returned []
Implicit Place search using SMT with State Equation took 5889 ms to find 0 implicit places.
[2023-03-22 16:46:53] [INFO ] Invariant cache hit.
[2023-03-22 16:46:55] [INFO ] Dead Transitions using invariants and state equation in 2488 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2387/2803 places, 2187/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9482 ms. Remains : 2387/2803 places, 2187/2603 transitions.
Support contains 95 out of 2387 places after structural reductions.
[2023-03-22 16:46:56] [INFO ] Flatten gal took : 180 ms
[2023-03-22 16:46:56] [INFO ] Flatten gal took : 87 ms
[2023-03-22 16:46:56] [INFO ] Input system was already deterministic with 2187 transitions.
Support contains 76 out of 2387 places (down from 95) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 661 ms. (steps per millisecond=15 ) properties (out of 51) seen :29
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :0
Running SMT prover for 22 properties.
[2023-03-22 16:46:57] [INFO ] Invariant cache hit.
[2023-03-22 16:46:59] [INFO ] [Real]Absence check using 361 positive place invariants in 248 ms returned sat
[2023-03-22 16:46:59] [INFO ] After 2061ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-22 16:47:01] [INFO ] [Nat]Absence check using 361 positive place invariants in 182 ms returned sat
[2023-03-22 16:47:06] [INFO ] After 3603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-22 16:47:07] [INFO ] Deduced a trap composed of 26 places in 677 ms of which 16 ms to minimize.
[2023-03-22 16:47:08] [INFO ] Deduced a trap composed of 27 places in 822 ms of which 10 ms to minimize.
[2023-03-22 16:47:09] [INFO ] Deduced a trap composed of 21 places in 803 ms of which 5 ms to minimize.
[2023-03-22 16:47:10] [INFO ] Deduced a trap composed of 23 places in 928 ms of which 3 ms to minimize.
[2023-03-22 16:47:11] [INFO ] Deduced a trap composed of 17 places in 801 ms of which 3 ms to minimize.
[2023-03-22 16:47:11] [INFO ] Deduced a trap composed of 12 places in 555 ms of which 2 ms to minimize.
[2023-03-22 16:47:12] [INFO ] Deduced a trap composed of 27 places in 680 ms of which 14 ms to minimize.
[2023-03-22 16:47:13] [INFO ] Deduced a trap composed of 23 places in 705 ms of which 1 ms to minimize.
[2023-03-22 16:47:14] [INFO ] Deduced a trap composed of 21 places in 814 ms of which 2 ms to minimize.
[2023-03-22 16:47:15] [INFO ] Deduced a trap composed of 27 places in 748 ms of which 1 ms to minimize.
[2023-03-22 16:47:15] [INFO ] Deduced a trap composed of 40 places in 486 ms of which 1 ms to minimize.
[2023-03-22 16:47:16] [INFO ] Deduced a trap composed of 27 places in 589 ms of which 1 ms to minimize.
[2023-03-22 16:47:17] [INFO ] Deduced a trap composed of 28 places in 608 ms of which 1 ms to minimize.
[2023-03-22 16:47:17] [INFO ] Deduced a trap composed of 20 places in 617 ms of which 1 ms to minimize.
[2023-03-22 16:47:18] [INFO ] Deduced a trap composed of 24 places in 786 ms of which 1 ms to minimize.
[2023-03-22 16:47:19] [INFO ] Deduced a trap composed of 17 places in 942 ms of which 2 ms to minimize.
[2023-03-22 16:47:20] [INFO ] Deduced a trap composed of 23 places in 664 ms of which 1 ms to minimize.
[2023-03-22 16:47:21] [INFO ] Deduced a trap composed of 20 places in 511 ms of which 1 ms to minimize.
[2023-03-22 16:47:21] [INFO ] Deduced a trap composed of 30 places in 644 ms of which 1 ms to minimize.
[2023-03-22 16:47:22] [INFO ] Deduced a trap composed of 24 places in 735 ms of which 2 ms to minimize.
[2023-03-22 16:47:23] [INFO ] Deduced a trap composed of 23 places in 486 ms of which 1 ms to minimize.
[2023-03-22 16:47:23] [INFO ] Deduced a trap composed of 45 places in 470 ms of which 1 ms to minimize.
[2023-03-22 16:47:24] [INFO ] Deduced a trap composed of 37 places in 510 ms of which 1 ms to minimize.
[2023-03-22 16:47:24] [INFO ] Deduced a trap composed of 29 places in 536 ms of which 1 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-22 16:47:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 16:47:24] [INFO ] After 25346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:22
Parikh walk visited 2 properties in 3786 ms.
Support contains 28 out of 2387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2387/2387 places, 2187/2187 transitions.
Drop transitions removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 462 rules applied. Total rules applied 462 place count 2387 transition count 1725
Reduce places removed 462 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 464 rules applied. Total rules applied 926 place count 1925 transition count 1723
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 928 place count 1923 transition count 1723
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 307 Pre rules applied. Total rules applied 928 place count 1923 transition count 1416
Deduced a syphon composed of 307 places in 5 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 3 with 614 rules applied. Total rules applied 1542 place count 1616 transition count 1416
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1555 place count 1603 transition count 1403
Iterating global reduction 3 with 13 rules applied. Total rules applied 1568 place count 1603 transition count 1403
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 1568 place count 1603 transition count 1391
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 1592 place count 1591 transition count 1391
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 3 with 1362 rules applied. Total rules applied 2954 place count 910 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2955 place count 910 transition count 709
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2957 place count 909 transition count 708
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -62
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3159 place count 808 transition count 770
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 3191 place count 792 transition count 781
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3192 place count 792 transition count 780
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3193 place count 792 transition count 779
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3194 place count 791 transition count 779
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 3233 place count 791 transition count 779
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3234 place count 790 transition count 778
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3236 place count 788 transition count 778
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3236 place count 788 transition count 777
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3238 place count 787 transition count 777
Applied a total of 3238 rules in 658 ms. Remains 787 /2387 variables (removed 1600) and now considering 777/2187 (removed 1410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 658 ms. Remains : 787/2387 places, 777/2187 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 82158 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82158 steps, saw 54092 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 777 rows 787 cols
[2023-03-22 16:47:32] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-22 16:47:33] [INFO ] [Real]Absence check using 359 positive place invariants in 96 ms returned sat
[2023-03-22 16:47:33] [INFO ] After 506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-22 16:47:34] [INFO ] [Nat]Absence check using 359 positive place invariants in 161 ms returned sat
[2023-03-22 16:47:35] [INFO ] After 1329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-22 16:47:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 16:47:37] [INFO ] After 1040ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-22 16:47:38] [INFO ] After 2883ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 1106 ms.
[2023-03-22 16:47:39] [INFO ] After 6513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 11 different solutions.
Parikh walk visited 5 properties in 313 ms.
Support contains 18 out of 787 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 787/787 places, 777/777 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 787 transition count 774
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 784 transition count 774
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 784 transition count 771
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 781 transition count 771
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 2 with 4 rules applied. Total rules applied 16 place count 779 transition count 769
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 777 transition count 770
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 777 transition count 769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 776 transition count 769
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 774 transition count 767
Applied a total of 24 rules in 125 ms. Remains 774 /787 variables (removed 13) and now considering 767/777 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 774/787 places, 767/777 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 80703 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80703 steps, saw 53482 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 767 rows 774 cols
[2023-03-22 16:47:44] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-22 16:47:45] [INFO ] [Real]Absence check using 359 positive place invariants in 121 ms returned sat
[2023-03-22 16:47:45] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 16:47:45] [INFO ] [Nat]Absence check using 359 positive place invariants in 87 ms returned sat
[2023-03-22 16:47:47] [INFO ] After 945ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-22 16:47:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 16:47:47] [INFO ] After 651ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-22 16:47:49] [INFO ] After 1722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 796 ms.
[2023-03-22 16:47:49] [INFO ] After 4420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 395 ms.
Support contains 18 out of 774 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 774/774 places, 767/767 transitions.
Applied a total of 0 rules in 18 ms. Remains 774 /774 variables (removed 0) and now considering 767/767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 774/774 places, 767/767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 774/774 places, 767/767 transitions.
Applied a total of 0 rules in 18 ms. Remains 774 /774 variables (removed 0) and now considering 767/767 (removed 0) transitions.
[2023-03-22 16:47:50] [INFO ] Invariant cache hit.
[2023-03-22 16:47:50] [INFO ] Implicit Places using invariants in 448 ms returned [762]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 451 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 773/774 places, 767/767 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 772 transition count 766
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 772 transition count 766
Applied a total of 2 rules in 37 ms. Remains 772 /773 variables (removed 1) and now considering 766/767 (removed 1) transitions.
// Phase 1: matrix 766 rows 772 cols
[2023-03-22 16:47:50] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-22 16:47:51] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-22 16:47:51] [INFO ] Invariant cache hit.
[2023-03-22 16:47:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 16:47:52] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 772/774 places, 766/767 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2165 ms. Remains : 772/774 places, 766/767 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 83213 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83213 steps, saw 54975 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-22 16:47:57] [INFO ] Invariant cache hit.
[2023-03-22 16:47:57] [INFO ] [Real]Absence check using 358 positive place invariants in 106 ms returned sat
[2023-03-22 16:47:57] [INFO ] After 652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 16:47:58] [INFO ] [Nat]Absence check using 358 positive place invariants in 115 ms returned sat
[2023-03-22 16:47:59] [INFO ] After 1352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-22 16:47:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 16:48:00] [INFO ] After 803ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-22 16:48:01] [INFO ] After 2090ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 730 ms.
[2023-03-22 16:48:02] [INFO ] After 4967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 401 ms.
Support contains 18 out of 772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 766/766 transitions.
Applied a total of 0 rules in 16 ms. Remains 772 /772 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 772/772 places, 766/766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 766/766 transitions.
Applied a total of 0 rules in 28 ms. Remains 772 /772 variables (removed 0) and now considering 766/766 (removed 0) transitions.
[2023-03-22 16:48:03] [INFO ] Invariant cache hit.
[2023-03-22 16:48:03] [INFO ] Implicit Places using invariants in 521 ms returned []
[2023-03-22 16:48:03] [INFO ] Invariant cache hit.
[2023-03-22 16:48:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 16:48:05] [INFO ] Implicit Places using invariants and state equation in 1566 ms returned []
Implicit Place search using SMT with State Equation took 2105 ms to find 0 implicit places.
[2023-03-22 16:48:05] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-22 16:48:05] [INFO ] Invariant cache hit.
[2023-03-22 16:48:06] [INFO ] Dead Transitions using invariants and state equation in 947 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3156 ms. Remains : 772/772 places, 766/766 transitions.
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 772 transition count 766
Applied a total of 75 rules in 44 ms. Remains 772 /772 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 766 rows 772 cols
[2023-03-22 16:48:06] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-22 16:48:06] [INFO ] [Real]Absence check using 358 positive place invariants in 87 ms returned sat
[2023-03-22 16:48:06] [INFO ] After 558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 16:48:07] [INFO ] [Nat]Absence check using 358 positive place invariants in 84 ms returned sat
[2023-03-22 16:48:08] [INFO ] After 928ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-22 16:48:08] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-22 16:48:09] [INFO ] After 767ms SMT Verify possible using 70 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-22 16:48:10] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2023-03-22 16:48:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 433 ms
[2023-03-22 16:48:10] [INFO ] After 2311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1022 ms.
[2023-03-22 16:48:11] [INFO ] After 4900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
[2023-03-22 16:48:11] [INFO ] Flatten gal took : 69 ms
[2023-03-22 16:48:12] [INFO ] Flatten gal took : 64 ms
[2023-03-22 16:48:12] [INFO ] Input system was already deterministic with 2187 transitions.
Computed a total of 643 stabilizing places and 643 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2387/2387 places, 2187/2187 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 2363 transition count 2163
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 2363 transition count 2163
Applied a total of 48 rules in 333 ms. Remains 2363 /2387 variables (removed 24) and now considering 2163/2187 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 333 ms. Remains : 2363/2387 places, 2163/2187 transitions.
[2023-03-22 16:48:12] [INFO ] Flatten gal took : 83 ms
[2023-03-22 16:48:12] [INFO ] Flatten gal took : 109 ms
[2023-03-22 16:48:12] [INFO ] Input system was already deterministic with 2163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2387/2387 places, 2187/2187 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 2362 transition count 2162
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 2362 transition count 2162
Applied a total of 50 rules in 408 ms. Remains 2362 /2387 variables (removed 25) and now considering 2162/2187 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 2362/2387 places, 2162/2187 transitions.
[2023-03-22 16:48:13] [INFO ] Flatten gal took : 46 ms
[2023-03-22 16:48:13] [INFO ] Flatten gal took : 47 ms
[2023-03-22 16:48:13] [INFO ] Input system was already deterministic with 2162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2387/2387 places, 2187/2187 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2366 transition count 2166
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2366 transition count 2166
Applied a total of 42 rules in 405 ms. Remains 2366 /2387 variables (removed 21) and now considering 2166/2187 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 2366/2387 places, 2166/2187 transitions.
[2023-03-22 16:48:14] [INFO ] Flatten gal took : 117 ms
[2023-03-22 16:48:14] [INFO ] Flatten gal took : 126 ms
[2023-03-22 16:48:14] [INFO ] Input system was already deterministic with 2166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2387/2387 places, 2187/2187 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2364 transition count 2164
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2364 transition count 2164
Applied a total of 46 rules in 396 ms. Remains 2364 /2387 variables (removed 23) and now considering 2164/2187 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 2364/2387 places, 2164/2187 transitions.
[2023-03-22 16:48:14] [INFO ] Flatten gal took : 47 ms
[2023-03-22 16:48:14] [INFO ] Flatten gal took : 49 ms
[2023-03-22 16:48:15] [INFO ] Input system was already deterministic with 2164 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2387/2387 places, 2187/2187 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2364 transition count 2164
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2364 transition count 2164
Applied a total of 46 rules in 371 ms. Remains 2364 /2387 variables (removed 23) and now considering 2164/2187 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 383 ms. Remains : 2364/2387 places, 2164/2187 transitions.
[2023-03-22 16:48:15] [INFO ] Flatten gal took : 45 ms
[2023-03-22 16:48:15] [INFO ] Flatten gal took : 46 ms
[2023-03-22 16:48:15] [INFO ] Input system was already deterministic with 2164 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2387/2387 places, 2187/2187 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 2362 transition count 2162
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 2362 transition count 2162
Applied a total of 50 rules in 384 ms. Remains 2362 /2387 variables (removed 25) and now considering 2162/2187 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 2362/2387 places, 2162/2187 transitions.
[2023-03-22 16:48:16] [INFO ] Flatten gal took : 44 ms
[2023-03-22 16:48:16] [INFO ] Flatten gal took : 48 ms
[2023-03-22 16:48:16] [INFO ] Input system was already deterministic with 2162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2387/2387 places, 2187/2187 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2364 transition count 2164
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2364 transition count 2164
Applied a total of 46 rules in 335 ms. Remains 2364 /2387 variables (removed 23) and now considering 2164/2187 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 2364/2387 places, 2164/2187 transitions.
[2023-03-22 16:48:16] [INFO ] Flatten gal took : 44 ms
[2023-03-22 16:48:16] [INFO ] Flatten gal took : 48 ms
[2023-03-22 16:48:17] [INFO ] Input system was already deterministic with 2164 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2387/2387 places, 2187/2187 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2361 transition count 2161
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2361 transition count 2161
Applied a total of 52 rules in 301 ms. Remains 2361 /2387 variables (removed 26) and now considering 2161/2187 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 2361/2387 places, 2161/2187 transitions.
[2023-03-22 16:48:17] [INFO ] Flatten gal took : 44 ms
[2023-03-22 16:48:17] [INFO ] Flatten gal took : 47 ms
[2023-03-22 16:48:17] [INFO ] Input system was already deterministic with 2161 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2387/2387 places, 2187/2187 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 476 rules applied. Total rules applied 476 place count 2386 transition count 1710
Reduce places removed 476 places and 0 transitions.
Iterating post reduction 1 with 476 rules applied. Total rules applied 952 place count 1910 transition count 1710
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 952 place count 1910 transition count 1401
Deduced a syphon composed of 309 places in 2 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 1570 place count 1601 transition count 1401
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1592 place count 1579 transition count 1379
Iterating global reduction 2 with 22 rules applied. Total rules applied 1614 place count 1579 transition count 1379
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 1614 place count 1579 transition count 1360
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 1652 place count 1560 transition count 1360
Performed 635 Post agglomeration using F-continuation condition.Transition count delta: 635
Deduced a syphon composed of 635 places in 1 ms
Reduce places removed 635 places and 0 transitions.
Iterating global reduction 2 with 1270 rules applied. Total rules applied 2922 place count 925 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2923 place count 925 transition count 724
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2925 place count 924 transition count 723
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2927 place count 922 transition count 721
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2929 place count 920 transition count 721
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2929 place count 920 transition count 720
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2931 place count 919 transition count 720
Applied a total of 2931 rules in 542 ms. Remains 919 /2387 variables (removed 1468) and now considering 720/2187 (removed 1467) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 542 ms. Remains : 919/2387 places, 720/2187 transitions.
[2023-03-22 16:48:18] [INFO ] Flatten gal took : 19 ms
[2023-03-22 16:48:18] [INFO ] Flatten gal took : 20 ms
[2023-03-22 16:48:18] [INFO ] Input system was already deterministic with 720 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2387/2387 places, 2187/2187 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 2362 transition count 2162
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 2362 transition count 2162
Applied a total of 50 rules in 369 ms. Remains 2362 /2387 variables (removed 25) and now considering 2162/2187 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 2362/2387 places, 2162/2187 transitions.
[2023-03-22 16:48:18] [INFO ] Flatten gal took : 58 ms
[2023-03-22 16:48:18] [INFO ] Flatten gal took : 45 ms
[2023-03-22 16:48:18] [INFO ] Input system was already deterministic with 2162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2387/2387 places, 2187/2187 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2361 transition count 2161
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2361 transition count 2161
Applied a total of 52 rules in 335 ms. Remains 2361 /2387 variables (removed 26) and now considering 2161/2187 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 2361/2387 places, 2161/2187 transitions.
[2023-03-22 16:48:19] [INFO ] Flatten gal took : 44 ms
[2023-03-22 16:48:19] [INFO ] Flatten gal took : 46 ms
[2023-03-22 16:48:19] [INFO ] Input system was already deterministic with 2161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2387/2387 places, 2187/2187 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2361 transition count 2161
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2361 transition count 2161
Applied a total of 52 rules in 329 ms. Remains 2361 /2387 variables (removed 26) and now considering 2161/2187 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 330 ms. Remains : 2361/2387 places, 2161/2187 transitions.
[2023-03-22 16:48:19] [INFO ] Flatten gal took : 43 ms
[2023-03-22 16:48:19] [INFO ] Flatten gal took : 46 ms
[2023-03-22 16:48:19] [INFO ] Input system was already deterministic with 2161 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2387/2387 places, 2187/2187 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 475 place count 2386 transition count 1711
Reduce places removed 475 places and 0 transitions.
Iterating post reduction 1 with 475 rules applied. Total rules applied 950 place count 1911 transition count 1711
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 311 Pre rules applied. Total rules applied 950 place count 1911 transition count 1400
Deduced a syphon composed of 311 places in 2 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 2 with 622 rules applied. Total rules applied 1572 place count 1600 transition count 1400
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1594 place count 1578 transition count 1378
Iterating global reduction 2 with 22 rules applied. Total rules applied 1616 place count 1578 transition count 1378
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 1616 place count 1578 transition count 1359
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 1654 place count 1559 transition count 1359
Performed 636 Post agglomeration using F-continuation condition.Transition count delta: 636
Deduced a syphon composed of 636 places in 1 ms
Reduce places removed 636 places and 0 transitions.
Iterating global reduction 2 with 1272 rules applied. Total rules applied 2926 place count 923 transition count 723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2927 place count 923 transition count 722
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2929 place count 922 transition count 721
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2931 place count 920 transition count 719
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2933 place count 918 transition count 719
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2933 place count 918 transition count 718
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2935 place count 917 transition count 718
Applied a total of 2935 rules in 431 ms. Remains 917 /2387 variables (removed 1470) and now considering 718/2187 (removed 1469) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 431 ms. Remains : 917/2387 places, 718/2187 transitions.
[2023-03-22 16:48:20] [INFO ] Flatten gal took : 17 ms
[2023-03-22 16:48:20] [INFO ] Flatten gal took : 18 ms
[2023-03-22 16:48:20] [INFO ] Input system was already deterministic with 718 transitions.
[2023-03-22 16:48:20] [INFO ] Flatten gal took : 41 ms
[2023-03-22 16:48:20] [INFO ] Flatten gal took : 41 ms
[2023-03-22 16:48:20] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-22 16:48:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2387 places, 2187 transitions and 5654 arcs took 9 ms.
Total runtime 94821 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 2387 NrTr: 2187 NrArc: 5654)

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

net check time: 0m 0.014sec

init dd package: 0m 3.062sec


before gc: list nodes free: 229931

after gc: idd nodes used:51387022, unused:12612978; list nodes free:54486684

RS generation: 31m11.114sec


-> last computed set: #nodes 51384637 (5.1e+07) #states 9,302,730,365,041,921,123,068,742 (24)


CANNOT_COMPUTE


BK_STOP 1679505606554

--------------------
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//
++ perl -pe 's/.*\.//g'
++ 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 CTLCardinality -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.014sec

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="ShieldIIPt-PT-040B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldIIPt-PT-040B, 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 r394-oct2-167903717700313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040B.tgz
mv ShieldIIPt-PT-040B 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 ;