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-167873952100681.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-COL-S10J30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952100681
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.9K Feb 26 00:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 00:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:29 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 3.8K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 01:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K 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-COL-S10J30-CTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S10J30-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679632383996

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-COL-S10J30
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 04:33:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 04:33:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 04:33:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 04:33:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 04:33:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 732 ms
[2023-03-24 04:33:06] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
[2023-03-24 04:33:06] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-24 04:33:06] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 565 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 85) seen :18
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1006 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 67) seen :5
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1002 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1003 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 62) seen :0
Running SMT prover for 62 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-24 04:33:07] [INFO ] Computed 13 place invariants in 11 ms
[2023-03-24 04:33:07] [INFO ] After 428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:62
[2023-03-24 04:33:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-24 04:33:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-24 04:33:08] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :61 sat :1
[2023-03-24 04:33:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:33:08] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :61 sat :1
[2023-03-24 04:33:08] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :61 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-24 04:33:08] [INFO ] After 524ms SMT Verify possible using all constraints in natural domain returned unsat :61 sat :1
Fused 62 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 9 place count 43 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 41 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 39 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 39 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 17 place count 39 transition count 29
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 19 place count 38 transition count 29
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 23 place count 36 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 25 place count 35 transition count 29
Applied a total of 25 rules in 20 ms. Remains 35 /48 variables (removed 13) and now considering 29/38 (removed 9) transitions.
// Phase 1: matrix 29 rows 35 cols
[2023-03-24 04:33:08] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-24 04:33:08] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 35/48 places, 29/38 transitions.
Incomplete random walk after 10000 steps, including 739 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 299 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Probably explored full state space saw : 595 states, properties seen :0
Probabilistic random walk after 1641 steps, saw 595 distinct states, run finished after 19 ms. (steps per millisecond=86 ) properties seen :0
Explored full state space saw : 595 states, properties seen :0
Exhaustive walk after 1641 steps, saw 595 distinct states, run finished after 4 ms. (steps per millisecond=410 ) properties seen :0
Successfully simplified 62 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 04:33:08] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2023-03-24 04:33:08] [INFO ] Flatten gal took : 20 ms
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 04:33:08] [INFO ] Flatten gal took : 7 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-24 04:33:08] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 201 ms.
[2023-03-24 04:33:08] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Deduced a syphon composed of 30 places in 23 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 517 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 37 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2023-03-24 04:33:08] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-24 04:33:09] [INFO ] Computed 92 place invariants in 133 ms
[2023-03-24 04:33:09] [INFO ] Dead Transitions using invariants and state equation in 1098 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 04:33:09] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 664 cols
[2023-03-24 04:33:10] [INFO ] Computed 92 place invariants in 33 ms
[2023-03-24 04:33:10] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-24 04:33:10] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-24 04:33:10] [INFO ] Invariant cache hit.
[2023-03-24 04:33:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:33:10] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/664 places, 1325/1940 transitions.
Applied a total of 0 rules in 25 ms. Remains 664 /664 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2056 ms. Remains : 664/664 places, 1325/1940 transitions.
Support contains 517 out of 664 places after structural reductions.
[2023-03-24 04:33:11] [INFO ] Flatten gal took : 154 ms
[2023-03-24 04:33:11] [INFO ] Flatten gal took : 105 ms
[2023-03-24 04:33:11] [INFO ] Input system was already deterministic with 1325 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 739 ms. (steps per millisecond=13 ) properties (out of 23) seen :3
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2023-03-24 04:33:12] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-24 04:33:12] [INFO ] Invariant cache hit.
[2023-03-24 04:33:12] [INFO ] [Real]Absence check using 85 positive place invariants in 23 ms returned sat
[2023-03-24 04:33:12] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-24 04:33:12] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:11
[2023-03-24 04:33:13] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2023-03-24 04:33:13] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-24 04:33:23] [INFO ] After 10581ms SMT Verify possible using state equation in natural domain returned unsat :15 sat :2
[2023-03-24 04:33:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:33:38] [INFO ] After 14156ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :15 sat :0
[2023-03-24 04:33:38] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :0
Fused 18 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 323 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 82 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 82 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 150 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 583 transition count 1254
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 583 transition count 1254
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 156 place count 581 transition count 1252
Applied a total of 156 rules in 130 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-24 04:33:38] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 04:33:38] [INFO ] Computed 82 place invariants in 19 ms
[2023-03-24 04:33:38] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 772 ms. Remains : 581/664 places, 1252/1325 transitions.
Incomplete random walk after 10000 steps, including 725 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 04:33:39] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 04:33:39] [INFO ] Invariant cache hit.
[2023-03-24 04:33:39] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 04:33:39] [INFO ] [Nat]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-24 04:33:39] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-24 04:33:49] [INFO ] After 10448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 04:33:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:33:51] [INFO ] After 1520ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 04:33:52] [INFO ] Deduced a trap composed of 232 places in 292 ms of which 1 ms to minimize.
[2023-03-24 04:33:55] [INFO ] Deduced a trap composed of 232 places in 300 ms of which 1 ms to minimize.
[2023-03-24 04:33:56] [INFO ] Deduced a trap composed of 234 places in 327 ms of which 2 ms to minimize.
[2023-03-24 04:33:56] [INFO ] Deduced a trap composed of 241 places in 285 ms of which 1 ms to minimize.
[2023-03-24 04:33:56] [INFO ] Deduced a trap composed of 243 places in 263 ms of which 1 ms to minimize.
[2023-03-24 04:33:57] [INFO ] Deduced a trap composed of 237 places in 253 ms of which 1 ms to minimize.
[2023-03-24 04:33:57] [INFO ] Deduced a trap composed of 233 places in 248 ms of which 2 ms to minimize.
[2023-03-24 04:33:58] [INFO ] Deduced a trap composed of 231 places in 260 ms of which 1 ms to minimize.
[2023-03-24 04:33:58] [INFO ] Deduced a trap composed of 234 places in 276 ms of which 1 ms to minimize.
[2023-03-24 04:33:58] [INFO ] Deduced a trap composed of 253 places in 281 ms of which 1 ms to minimize.
[2023-03-24 04:33:59] [INFO ] Deduced a trap composed of 245 places in 251 ms of which 1 ms to minimize.
[2023-03-24 04:33:59] [INFO ] Deduced a trap composed of 243 places in 265 ms of which 1 ms to minimize.
[2023-03-24 04:34:00] [INFO ] Deduced a trap composed of 233 places in 248 ms of which 1 ms to minimize.
[2023-03-24 04:34:00] [INFO ] Deduced a trap composed of 231 places in 253 ms of which 1 ms to minimize.
[2023-03-24 04:34:01] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 0 ms to minimize.
[2023-03-24 04:34:02] [INFO ] Deduced a trap composed of 241 places in 255 ms of which 0 ms to minimize.
[2023-03-24 04:34:04] [INFO ] Deduced a trap composed of 241 places in 255 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 04:34:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 04:34:04] [INFO ] After 25063ms 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 312 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 33 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 581/581 places, 1252/1252 transitions.
Incomplete random walk after 10000 steps, including 709 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 317966 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 317966 steps, saw 51729 distinct states, run finished after 3002 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 04:34:07] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 04:34:07] [INFO ] Invariant cache hit.
[2023-03-24 04:34:08] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 04:34:08] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-24 04:34:08] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-24 04:34:18] [INFO ] After 10557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 04:34:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:34:20] [INFO ] After 2071ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 04:34:21] [INFO ] Deduced a trap composed of 248 places in 267 ms of which 0 ms to minimize.
[2023-03-24 04:34:22] [INFO ] Deduced a trap composed of 269 places in 260 ms of which 1 ms to minimize.
[2023-03-24 04:34:22] [INFO ] Deduced a trap composed of 252 places in 263 ms of which 1 ms to minimize.
[2023-03-24 04:34:23] [INFO ] Deduced a trap composed of 248 places in 290 ms of which 1 ms to minimize.
[2023-03-24 04:34:23] [INFO ] Deduced a trap composed of 253 places in 263 ms of which 1 ms to minimize.
[2023-03-24 04:34:24] [INFO ] Deduced a trap composed of 273 places in 259 ms of which 0 ms to minimize.
[2023-03-24 04:34:24] [INFO ] Deduced a trap composed of 257 places in 299 ms of which 1 ms to minimize.
[2023-03-24 04:34:25] [INFO ] Deduced a trap composed of 269 places in 293 ms of which 1 ms to minimize.
[2023-03-24 04:34:25] [INFO ] Deduced a trap composed of 244 places in 271 ms of which 0 ms to minimize.
[2023-03-24 04:34:26] [INFO ] Deduced a trap composed of 256 places in 324 ms of which 1 ms to minimize.
[2023-03-24 04:34:27] [INFO ] Deduced a trap composed of 261 places in 296 ms of which 1 ms to minimize.
[2023-03-24 04:34:28] [INFO ] Deduced a trap composed of 244 places in 312 ms of which 1 ms to minimize.
[2023-03-24 04:34:28] [INFO ] Deduced a trap composed of 260 places in 298 ms of which 1 ms to minimize.
[2023-03-24 04:34:29] [INFO ] Deduced a trap composed of 256 places in 294 ms of which 1 ms to minimize.
[2023-03-24 04:34:29] [INFO ] Deduced a trap composed of 256 places in 286 ms of which 1 ms to minimize.
[2023-03-24 04:34:30] [INFO ] Deduced a trap composed of 257 places in 289 ms of which 1 ms to minimize.
[2023-03-24 04:34:33] [INFO ] Trap strengthening (SAT) tested/added 16/16 trap constraints in 11630 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
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 04:34:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 04:34:33] [INFO ] After 25019ms 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 312 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 29 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 27 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-24 04:34:33] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 04:34:33] [INFO ] Invariant cache hit.
[2023-03-24 04:34:33] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-24 04:34:33] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 04:34:33] [INFO ] Invariant cache hit.
[2023-03-24 04:34:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:34:35] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 2533 ms to find 0 implicit places.
[2023-03-24 04:34:35] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-24 04:34:35] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 04:34:35] [INFO ] Invariant cache hit.
[2023-03-24 04:34:36] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3204 ms. Remains : 581/581 places, 1252/1252 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 581 transition count 1243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 581 transition count 1242
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 580 transition count 1242
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 580 transition count 1241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 579 transition count 1241
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 579 transition count 1231
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 569 transition count 1231
Applied a total of 33 rules in 96 ms. Remains 569 /581 variables (removed 12) and now considering 1231/1252 (removed 21) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1231 rows 569 cols
[2023-03-24 04:34:36] [INFO ] Computed 82 place invariants in 17 ms
[2023-03-24 04:34:36] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 04:34:36] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-24 04:34:36] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-24 04:34:55] [INFO ] After 18776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 15 atomic propositions for a total of 6 simplifications.
[2023-03-24 04:34:55] [INFO ] Flatten gal took : 80 ms
[2023-03-24 04:34:55] [INFO ] Flatten gal took : 73 ms
[2023-03-24 04:34:55] [INFO ] Input system was already deterministic with 1325 transitions.
Support contains 356 out of 664 places (down from 368) after GAL structural reductions.
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1253
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1253
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 146 place count 581 transition count 1252
Applied a total of 146 rules in 111 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-24 04:34:55] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 04:34:55] [INFO ] Computed 82 place invariants in 30 ms
[2023-03-24 04:34:56] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 633 ms. Remains : 581/664 places, 1252/1325 transitions.
[2023-03-24 04:34:56] [INFO ] Flatten gal took : 60 ms
[2023-03-24 04:34:56] [INFO ] Flatten gal took : 65 ms
[2023-03-24 04:34:56] [INFO ] Input system was already deterministic with 1252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 23 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 04:34:56] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-24 04:34:56] [INFO ] Computed 82 place invariants in 33 ms
[2023-03-24 04:34:57] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 736 ms. Remains : 653/664 places, 1324/1325 transitions.
[2023-03-24 04:34:57] [INFO ] Flatten gal took : 54 ms
[2023-03-24 04:34:57] [INFO ] Flatten gal took : 56 ms
[2023-03-24 04:34:57] [INFO ] Input system was already deterministic with 1324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 17 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 04:34:57] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 04:34:57] [INFO ] Invariant cache hit.
[2023-03-24 04:34:58] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 703 ms. Remains : 653/664 places, 1324/1325 transitions.
[2023-03-24 04:34:58] [INFO ] Flatten gal took : 50 ms
[2023-03-24 04:34:58] [INFO ] Flatten gal took : 58 ms
[2023-03-24 04:34:58] [INFO ] Input system was already deterministic with 1324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 21 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 04:34:58] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 04:34:58] [INFO ] Invariant cache hit.
[2023-03-24 04:34:59] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 692 ms. Remains : 653/664 places, 1324/1325 transitions.
[2023-03-24 04:34:59] [INFO ] Flatten gal took : 51 ms
[2023-03-24 04:34:59] [INFO ] Flatten gal took : 50 ms
[2023-03-24 04:34:59] [INFO ] Input system was already deterministic with 1324 transitions.
[2023-03-24 04:34:59] [INFO ] Flatten gal took : 52 ms
[2023-03-24 04:34:59] [INFO ] Flatten gal took : 51 ms
[2023-03-24 04:34:59] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-24 04:34:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 664 places, 1325 transitions and 8384 arcs took 10 ms.
Total runtime 114089 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: 664 NrTr: 1325 NrArc: 8384)

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

net check time: 0m 0.002sec

init dd package: 0m 2.721sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6548608 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095744 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.008sec

871371 1627954 2333539

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-COL-S10J30"
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-COL-S10J30, 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-167873952100681"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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