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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 30K Feb 26 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 26 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 786K Feb 26 01:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.0M Feb 26 01:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 34K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 181K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K Feb 26 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 197K Feb 26 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Feb 26 02:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Feb 26 02:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J80-CTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679672641109

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=PolyORBNT-PT-S10J80
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 15:44:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 15:44:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 15:44:03] [INFO ] Load time of PNML (sax parser for PT used): 617 ms
[2023-03-24 15:44:03] [INFO ] Transformed 1614 places.
[2023-03-24 15:44:03] [INFO ] Transformed 13500 transitions.
[2023-03-24 15:44:03] [INFO ] Parsed PT model containing 1614 places and 13500 transitions and 119759 arcs in 978 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 835 out of 1614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1604 transition count 3390
Applied a total of 10 rules in 169 ms. Remains 1604 /1614 variables (removed 10) and now considering 3390/3390 (removed 0) transitions.
[2023-03-24 15:44:03] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1604 cols
[2023-03-24 15:44:04] [INFO ] Computed 182 place invariants in 229 ms
[2023-03-24 15:44:10] [INFO ] Dead Transitions using invariants and state equation in 6270 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-24 15:44:10] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2023-03-24 15:44:10] [INFO ] Computed 182 place invariants in 144 ms
[2023-03-24 15:44:11] [INFO ] Implicit Places using invariants in 1090 ms returned []
[2023-03-24 15:44:11] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-24 15:44:11] [INFO ] Invariant cache hit.
[2023-03-24 15:44:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 15:44:42] [INFO ] Performed 624/1604 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-24 15:45:12] [INFO ] Performed 1289/1604 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-24 15:45:21] [INFO ] Implicit Places using invariants and state equation in 70301 ms returned []
Implicit Place search using SMT with State Equation took 71400 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1604/1614 places, 2775/3390 transitions.
Applied a total of 0 rules in 52 ms. Remains 1604 /1604 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77919 ms. Remains : 1604/1614 places, 2775/3390 transitions.
Support contains 835 out of 1604 places after structural reductions.
[2023-03-24 15:45:22] [INFO ] Flatten gal took : 274 ms
[2023-03-24 15:45:22] [INFO ] Flatten gal took : 184 ms
[2023-03-24 15:45:22] [INFO ] Input system was already deterministic with 2775 transitions.
Support contains 833 out of 1604 places (down from 835) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 839 ms. (steps per millisecond=11 ) properties (out of 104) seen :7
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 97) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 97) seen :0
Interrupted probabilistic random walk after 38466 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{4=1, 6=1, 8=1, 10=1, 13=1, 24=1, 32=1, 48=1, 68=1, 69=1, 80=1, 81=1, 82=1, 86=1, 89=1, 94=1}
Probabilistic random walk after 38466 steps, saw 12526 distinct states, run finished after 3002 ms. (steps per millisecond=12 ) properties seen :16
Running SMT prover for 81 properties.
[2023-03-24 15:45:27] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-24 15:45:27] [INFO ] Invariant cache hit.
[2023-03-24 15:45:30] [INFO ] [Real]Absence check using 160 positive place invariants in 37 ms returned sat
[2023-03-24 15:45:30] [INFO ] [Real]Absence check using 160 positive and 22 generalized place invariants in 63 ms returned sat
[2023-03-24 15:45:30] [INFO ] After 2535ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:80
[2023-03-24 15:45:32] [INFO ] [Nat]Absence check using 160 positive place invariants in 48 ms returned sat
[2023-03-24 15:45:32] [INFO ] [Nat]Absence check using 160 positive and 22 generalized place invariants in 57 ms returned sat
[2023-03-24 15:45:55] [INFO ] After 21938ms SMT Verify possible using state equation in natural domain returned unsat :59 sat :21
[2023-03-24 15:45:55] [INFO ] State equation strengthened by 1 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-24 15:45:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 15:45:55] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:80
Fused 81 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 291 out of 1604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 1604 transition count 2697
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 1526 transition count 2697
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 156 place count 1526 transition count 2616
Deduced a syphon composed of 81 places in 2 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 318 place count 1445 transition count 2616
Applied a total of 318 rules in 507 ms. Remains 1445 /1604 variables (removed 159) and now considering 2616/2775 (removed 159) transitions.
[2023-03-24 15:45:56] [INFO ] Flow matrix only has 2607 transitions (discarded 9 similar events)
// Phase 1: matrix 2607 rows 1445 cols
[2023-03-24 15:45:56] [INFO ] Computed 182 place invariants in 63 ms
[2023-03-24 15:45:58] [INFO ] Dead Transitions using invariants and state equation in 2946 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3459 ms. Remains : 1445/1604 places, 2616/2775 transitions.
Incomplete random walk after 10000 steps, including 627 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 22) seen :3
Incomplete Best-First random walk after 1001 steps, including 10 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 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 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 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 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 10 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 10 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 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 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 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 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 10 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 10 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 10 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-24 15:45:59] [INFO ] Flow matrix only has 2607 transitions (discarded 9 similar events)
[2023-03-24 15:45:59] [INFO ] Invariant cache hit.
[2023-03-24 15:46:00] [INFO ] After 599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-24 15:46:01] [INFO ] [Nat]Absence check using 160 positive place invariants in 36 ms returned sat
[2023-03-24 15:46:01] [INFO ] [Nat]Absence check using 160 positive and 22 generalized place invariants in 46 ms returned sat
[2023-03-24 15:46:25] [INFO ] After 23850ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-24 15:46:25] [INFO ] State equation strengthened by 1 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-24 15:46:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 15:46:25] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Fused 19 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 274 out of 1445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1445/1445 places, 2616/2616 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 1445 transition count 2615
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 4 rules applied. Total rules applied 5 place count 1444 transition count 2612
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 1441 transition count 2612
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 1440 transition count 2611
Applied a total of 10 rules in 226 ms. Remains 1440 /1445 variables (removed 5) and now considering 2611/2616 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 1440/1445 places, 2611/2616 transitions.
Incomplete random walk after 10000 steps, including 731 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 19) seen :8
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-24 15:46:26] [INFO ] Flow matrix only has 2602 transitions (discarded 9 similar events)
// Phase 1: matrix 2602 rows 1440 cols
[2023-03-24 15:46:26] [INFO ] Computed 182 place invariants in 85 ms
[2023-03-24 15:46:27] [INFO ] [Real]Absence check using 160 positive place invariants in 38 ms returned sat
[2023-03-24 15:46:27] [INFO ] [Real]Absence check using 160 positive and 22 generalized place invariants in 48 ms returned sat
[2023-03-24 15:46:27] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-24 15:46:27] [INFO ] [Nat]Absence check using 160 positive place invariants in 37 ms returned sat
[2023-03-24 15:46:27] [INFO ] [Nat]Absence check using 160 positive and 22 generalized place invariants in 58 ms returned sat
[2023-03-24 15:46:52] [INFO ] After 24367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-24 15:46:52] [INFO ] State equation strengthened by 1 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-24 15:46:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 15:46:52] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 1440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1440/1440 places, 2611/2611 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1440 transition count 2609
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1438 transition count 2609
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 1438 transition count 2606
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 1435 transition count 2606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 1434 transition count 2605
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 1434 transition count 2605
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 1433 transition count 2604
Applied a total of 14 rules in 569 ms. Remains 1433 /1440 variables (removed 7) and now considering 2604/2611 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 569 ms. Remains : 1433/1440 places, 2604/2611 transitions.
Incomplete random walk after 10000 steps, including 693 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-24 15:46:53] [INFO ] Flow matrix only has 2595 transitions (discarded 9 similar events)
// Phase 1: matrix 2595 rows 1433 cols
[2023-03-24 15:46:53] [INFO ] Computed 182 place invariants in 72 ms
[2023-03-24 15:46:53] [INFO ] [Real]Absence check using 160 positive place invariants in 36 ms returned sat
[2023-03-24 15:46:53] [INFO ] [Real]Absence check using 160 positive and 22 generalized place invariants in 42 ms returned sat
[2023-03-24 15:46:53] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 15:46:54] [INFO ] [Nat]Absence check using 160 positive place invariants in 36 ms returned sat
[2023-03-24 15:46:54] [INFO ] [Nat]Absence check using 160 positive and 22 generalized place invariants in 42 ms returned sat
[2023-03-24 15:47:08] [INFO ] After 14482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 15:47:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 15:47:11] [INFO ] After 2711ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 15:47:12] [INFO ] Deduced a trap composed of 588 places in 725 ms of which 6 ms to minimize.
[2023-03-24 15:47:13] [INFO ] Deduced a trap composed of 580 places in 865 ms of which 2 ms to minimize.
[2023-03-24 15:47:14] [INFO ] Deduced a trap composed of 588 places in 758 ms of which 2 ms to minimize.
[2023-03-24 15:47:14] [INFO ] Deduced a trap composed of 595 places in 765 ms of which 3 ms to minimize.
[2023-03-24 15:47:15] [INFO ] Deduced a trap composed of 595 places in 766 ms of which 2 ms to minimize.
[2023-03-24 15:47:16] [INFO ] Deduced a trap composed of 591 places in 801 ms of which 1 ms to minimize.
[2023-03-24 15:47:17] [INFO ] Deduced a trap composed of 580 places in 719 ms of which 1 ms to minimize.
[2023-03-24 15:47:18] [INFO ] Deduced a trap composed of 601 places in 709 ms of which 2 ms to minimize.
[2023-03-24 15:47:19] [INFO ] Deduced a trap composed of 578 places in 719 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-24 15:47:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 15:47:19] [INFO ] After 25266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 1433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1433/1433 places, 2604/2604 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 1433 transition count 2603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1432 transition count 2603
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1432 transition count 2602
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1431 transition count 2602
Applied a total of 4 rules in 123 ms. Remains 1431 /1433 variables (removed 2) and now considering 2602/2604 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 1431/1433 places, 2602/2604 transitions.
Successfully simplified 59 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 15:47:19] [INFO ] Flatten gal took : 130 ms
[2023-03-24 15:47:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-24 15:47:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 15:47:19] [INFO ] Flatten gal took : 133 ms
[2023-03-24 15:47:19] [INFO ] Input system was already deterministic with 2775 transitions.
Support contains 115 out of 1604 places (down from 224) after GAL structural reductions.
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Applied a total of 0 rules in 55 ms. Remains 1604 /1604 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
[2023-03-24 15:47:19] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2023-03-24 15:47:19] [INFO ] Computed 182 place invariants in 62 ms
[2023-03-24 15:47:25] [INFO ] Dead Transitions using invariants and state equation in 5291 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5350 ms. Remains : 1604/1604 places, 2775/2775 transitions.
[2023-03-24 15:47:25] [INFO ] Flatten gal took : 119 ms
[2023-03-24 15:47:25] [INFO ] Flatten gal took : 126 ms
[2023-03-24 15:47:25] [INFO ] Input system was already deterministic with 2775 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Applied a total of 0 rules in 57 ms. Remains 1604 /1604 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
[2023-03-24 15:47:25] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-24 15:47:25] [INFO ] Invariant cache hit.
[2023-03-24 15:47:30] [INFO ] Dead Transitions using invariants and state equation in 5000 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5062 ms. Remains : 1604/1604 places, 2775/2775 transitions.
[2023-03-24 15:47:30] [INFO ] Flatten gal took : 103 ms
[2023-03-24 15:47:30] [INFO ] Flatten gal took : 120 ms
[2023-03-24 15:47:31] [INFO ] Input system was already deterministic with 2775 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 216 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-24 15:47:31] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-24 15:47:31] [INFO ] Computed 182 place invariants in 63 ms
[2023-03-24 15:47:36] [INFO ] Dead Transitions using invariants and state equation in 5044 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5262 ms. Remains : 1603/1604 places, 2774/2775 transitions.
[2023-03-24 15:47:36] [INFO ] Flatten gal took : 116 ms
[2023-03-24 15:47:36] [INFO ] Flatten gal took : 113 ms
[2023-03-24 15:47:36] [INFO ] Input system was already deterministic with 2774 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 112 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-24 15:47:37] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 15:47:37] [INFO ] Invariant cache hit.
[2023-03-24 15:47:42] [INFO ] Dead Transitions using invariants and state equation in 4894 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5007 ms. Remains : 1603/1604 places, 2774/2775 transitions.
[2023-03-24 15:47:42] [INFO ] Flatten gal took : 95 ms
[2023-03-24 15:47:42] [INFO ] Flatten gal took : 108 ms
[2023-03-24 15:47:42] [INFO ] Input system was already deterministic with 2774 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 137 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-24 15:47:42] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 15:47:42] [INFO ] Invariant cache hit.
[2023-03-24 15:47:47] [INFO ] Dead Transitions using invariants and state equation in 4910 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5062 ms. Remains : 1603/1604 places, 2774/2775 transitions.
[2023-03-24 15:47:47] [INFO ] Flatten gal took : 96 ms
[2023-03-24 15:47:47] [INFO ] Flatten gal took : 100 ms
[2023-03-24 15:47:47] [INFO ] Input system was already deterministic with 2774 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 133 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-24 15:47:48] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 15:47:48] [INFO ] Invariant cache hit.
[2023-03-24 15:47:52] [INFO ] Dead Transitions using invariants and state equation in 4795 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4932 ms. Remains : 1603/1604 places, 2774/2775 transitions.
[2023-03-24 15:47:53] [INFO ] Flatten gal took : 96 ms
[2023-03-24 15:47:53] [INFO ] Flatten gal took : 104 ms
[2023-03-24 15:47:53] [INFO ] Input system was already deterministic with 2774 transitions.
[2023-03-24 15:47:53] [INFO ] Flatten gal took : 97 ms
[2023-03-24 15:47:53] [INFO ] Flatten gal took : 99 ms
[2023-03-24 15:47:53] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-24 15:47:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1604 places, 2775 transitions and 14764 arcs took 18 ms.
Total runtime 231067 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: 1604 NrTr: 2775 NrArc: 14764)

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

net check time: 0m 0.002sec

init dd package: 0m 2.688sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10490524 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16070696 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.071sec

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="PolyORBNT-PT-S10J80"
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 PolyORBNT-PT-S10J80, 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 r298-tall-167873952200785"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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