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.r295-tall-167873948300706.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 lolaxred
Input is PolyORBNT-COL-S10J80, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948300706
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 9.1K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 00:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:55 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 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 03:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 02:41 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 95K 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-S10J80-CTLFireability-00
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-01
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-02
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-03
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-04
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-05
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-06
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-07
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-08
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-09
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-10
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-11
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-12
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-13
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-14
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678891800666

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=lolaxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J80
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 14:50:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 14:50:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:50:02] [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-15 14:50:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 14:50:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 467 ms
[2023-03-15 14:50:03] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
[2023-03-15 14:50:03] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-15 14:50:03] [INFO ] Skeletonized 16 HLPN properties in 5 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 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 564 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 41) seen :22
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :11
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 14:50:03] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-15 14:50:03] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 14:50:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 14:50:03] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :4 sat :1 real:3
[2023-03-15 14:50:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:50:03] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :4 sat :1 real:3
[2023-03-15 14:50:03] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 8 ms to minimize.
[2023-03-15 14:50:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-15 14:50:03] [INFO ] After 123ms SMT Verify possible using trap constraints in real domain returned unsat :4 sat :0 real:4
[2023-03-15 14:50:03] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:4
[2023-03-15 14:50:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 14:50:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 14:50:04] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2023-03-15 14:50:04] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :6 sat :2
[2023-03-15 14:50:04] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2023-03-15 14:50:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-15 14:50:04] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-15 14:50:04] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 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 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
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 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 25 place count 35 transition count 26
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 27 place count 34 transition count 28
Applied a total of 27 rules in 16 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2023-03-15 14:50:04] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-15 14:50:04] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10000 steps, including 738 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 244 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 296 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:50:04] [INFO ] Invariant cache hit.
[2023-03-15 14:50:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 14:50:04] [INFO ] [Real]Absence check using 5 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 14:50:04] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:50:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:50:04] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:50:04] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2023-03-15 14:50:04] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2023-03-15 14:50:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2023-03-15 14:50:04] [INFO ] After 83ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:50:04] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:50:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-15 14:50:04] [INFO ] [Nat]Absence check using 5 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-15 14:50:04] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:50:04] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:50:04] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2023-03-15 14:50:05] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 1 ms to minimize.
[2023-03-15 14:50:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2023-03-15 14:50:05] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-15 14:50:05] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 28/28 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 34/34 places, 28/28 transitions.
Incomplete random walk after 10007 steps, including 741 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 305 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Probably explored full state space saw : 521 states, properties seen :0
Probabilistic random walk after 1393 steps, saw 521 distinct states, run finished after 21 ms. (steps per millisecond=66 ) properties seen :0
Explored full state space saw : 521 states, properties seen :0
Exhaustive walk after 1393 steps, saw 521 distinct states, run finished after 3 ms. (steps per millisecond=464 ) properties seen :0
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBNT-COL-S10J80-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 14:50:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-15 14:50:05] [INFO ] Flatten gal took : 34 ms
FORMULA PolyORBNT-COL-S10J80-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 14:50:05] [INFO ] Flatten gal took : 19 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-15 14:50:05] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 473 ms.
[2023-03-15 14:50:05] [INFO ] Unfolded 13 HLPN properties in 12 ms.
[2023-03-15 14:50:05] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 14:50:05] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 14:50:05] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-15 14:50:05] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-15 14:50:05] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 14:50:05] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-15 14:50:05] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-15 14:50:05] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 14:50:05] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-15 14:50:05] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 14:50:05] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 14:50:05] [INFO ] Reduced 9285 identical enabling conditions.
Deduced a syphon composed of 80 places in 42 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 1611 out of 1614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Applied a total of 0 rules in 72 ms. Remains 1614 /1614 variables (removed 0) and now considering 3390/3390 (removed 0) transitions.
[2023-03-15 14:50:06] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2023-03-15 14:50:06] [INFO ] Computed 192 place invariants in 267 ms
[2023-03-15 14:50:09] [INFO ] Dead Transitions using invariants and state equation in 3643 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-15 14:50:09] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1614 cols
[2023-03-15 14:50:09] [INFO ] Computed 192 place invariants in 85 ms
[2023-03-15 14:50:10] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-15 14:50:10] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-15 14:50:10] [INFO ] Invariant cache hit.
[2023-03-15 14:50:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:50:11] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1614/1614 places, 2775/3390 transitions.
Applied a total of 0 rules in 14 ms. Remains 1614 /1614 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5120 ms. Remains : 1614/1614 places, 2775/3390 transitions.
Support contains 1611 out of 1614 places after structural reductions.
[2023-03-15 14:50:11] [INFO ] Flatten gal took : 296 ms
[2023-03-15 14:50:12] [INFO ] Flatten gal took : 235 ms
[2023-03-15 14:50:13] [INFO ] Input system was already deterministic with 2775 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 1312 ms. (steps per millisecond=7 ) properties (out of 50) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 39) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) seen :15
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=9 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 114 ms. (steps per millisecond=8 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 16) 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 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2023-03-15 14:50:15] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-15 14:50:15] [INFO ] Invariant cache hit.
[2023-03-15 14:50:21] [INFO ] [Real]Absence check using 185 positive place invariants in 1222 ms returned sat
[2023-03-15 14:50:21] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 49 ms returned sat
[2023-03-15 14:50:21] [INFO ] After 2889ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:13
[2023-03-15 14:50:22] [INFO ] [Nat]Absence check using 185 positive place invariants in 60 ms returned sat
[2023-03-15 14:50:22] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 53 ms returned sat
[2023-03-15 14:50:30] [INFO ] After 7770ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :9
[2023-03-15 14:50:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:50:46] [INFO ] After 16112ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :7 sat :8
[2023-03-15 14:50:46] [INFO ] After 16113ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :8
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 14:50:46] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :8
Fused 16 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 418 out of 1614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1614/1614 places, 2775/2775 transitions.
Ensure Unique test removed 10 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 14 rules applied. Total rules applied 14 place count 1604 transition count 2771
Reduce places removed 4 places and 0 transitions.
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Iterating post reduction 1 with 86 rules applied. Total rules applied 100 place count 1600 transition count 2689
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 2 with 82 rules applied. Total rules applied 182 place count 1518 transition count 2689
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 182 place count 1518 transition count 2686
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 188 place count 1515 transition count 2686
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 189 place count 1514 transition count 2685
Iterating global reduction 3 with 1 rules applied. Total rules applied 190 place count 1514 transition count 2685
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 3 with 4 rules applied. Total rules applied 194 place count 1512 transition count 2683
Applied a total of 194 rules in 587 ms. Remains 1512 /1614 variables (removed 102) and now considering 2683/2775 (removed 92) transitions.
[2023-03-15 14:50:47] [INFO ] Flow matrix only has 2674 transitions (discarded 9 similar events)
// Phase 1: matrix 2674 rows 1512 cols
[2023-03-15 14:50:47] [INFO ] Computed 182 place invariants in 104 ms
[2023-03-15 14:50:49] [INFO ] Dead Transitions using invariants and state equation in 2258 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2855 ms. Remains : 1512/1614 places, 2683/2775 transitions.
Incomplete random walk after 10000 steps, including 707 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:50:49] [INFO ] Flow matrix only has 2674 transitions (discarded 9 similar events)
[2023-03-15 14:50:49] [INFO ] Invariant cache hit.
[2023-03-15 14:50:50] [INFO ] [Real]Absence check using 176 positive place invariants in 49 ms returned sat
[2023-03-15 14:50:50] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 36 ms returned sat
[2023-03-15 14:50:50] [INFO ] After 803ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:50:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:50:51] [INFO ] After 233ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:50:51] [INFO ] After 1307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:50:51] [INFO ] [Nat]Absence check using 176 positive place invariants in 49 ms returned sat
[2023-03-15 14:50:51] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 36 ms returned sat
[2023-03-15 14:50:52] [INFO ] After 798ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:50:52] [INFO ] After 556ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:50:53] [INFO ] Deduced a trap composed of 676 places in 754 ms of which 2 ms to minimize.
[2023-03-15 14:50:54] [INFO ] Deduced a trap composed of 668 places in 701 ms of which 1 ms to minimize.
[2023-03-15 14:50:55] [INFO ] Deduced a trap composed of 678 places in 805 ms of which 2 ms to minimize.
[2023-03-15 14:50:56] [INFO ] Deduced a trap composed of 676 places in 860 ms of which 1 ms to minimize.
[2023-03-15 14:50:57] [INFO ] Deduced a trap composed of 654 places in 699 ms of which 2 ms to minimize.
[2023-03-15 14:50:57] [INFO ] Deduced a trap composed of 674 places in 701 ms of which 1 ms to minimize.
[2023-03-15 14:50:58] [INFO ] Deduced a trap composed of 658 places in 745 ms of which 2 ms to minimize.
[2023-03-15 14:50:59] [INFO ] Deduced a trap composed of 662 places in 708 ms of which 1 ms to minimize.
[2023-03-15 14:51:00] [INFO ] Deduced a trap composed of 676 places in 762 ms of which 1 ms to minimize.
[2023-03-15 14:51:01] [INFO ] Deduced a trap composed of 654 places in 724 ms of which 1 ms to minimize.
[2023-03-15 14:51:02] [INFO ] Deduced a trap composed of 672 places in 714 ms of which 2 ms to minimize.
[2023-03-15 14:51:03] [INFO ] Deduced a trap composed of 672 places in 699 ms of which 1 ms to minimize.
[2023-03-15 14:51:03] [INFO ] Deduced a trap composed of 666 places in 727 ms of which 2 ms to minimize.
[2023-03-15 14:51:04] [INFO ] Deduced a trap composed of 656 places in 758 ms of which 2 ms to minimize.
[2023-03-15 14:51:05] [INFO ] Deduced a trap composed of 668 places in 718 ms of which 1 ms to minimize.
[2023-03-15 14:51:06] [INFO ] Deduced a trap composed of 668 places in 727 ms of which 1 ms to minimize.
[2023-03-15 14:51:07] [INFO ] Deduced a trap composed of 646 places in 730 ms of which 1 ms to minimize.
[2023-03-15 14:51:08] [INFO ] Deduced a trap composed of 660 places in 734 ms of which 1 ms to minimize.
[2023-03-15 14:51:09] [INFO ] Deduced a trap composed of 658 places in 735 ms of which 1 ms to minimize.
[2023-03-15 14:51:10] [INFO ] Deduced a trap composed of 664 places in 721 ms of which 1 ms to minimize.
[2023-03-15 14:51:11] [INFO ] Deduced a trap composed of 672 places in 730 ms of which 1 ms to minimize.
[2023-03-15 14:51:11] [INFO ] Deduced a trap composed of 678 places in 743 ms of which 1 ms to minimize.
[2023-03-15 14:51:12] [INFO ] Deduced a trap composed of 691 places in 724 ms of which 2 ms to minimize.
[2023-03-15 14:51:13] [INFO ] Deduced a trap composed of 675 places in 709 ms of which 1 ms to minimize.
[2023-03-15 14:51:14] [INFO ] Deduced a trap composed of 669 places in 690 ms of which 1 ms to minimize.
[2023-03-15 14:51:15] [INFO ] Deduced a trap composed of 678 places in 740 ms of which 3 ms to minimize.
[2023-03-15 14:51:16] [INFO ] Deduced a trap composed of 680 places in 720 ms of which 5 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-15 14:51:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:51:16] [INFO ] After 25336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1512/1512 places, 2683/2683 transitions.
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 82 Pre rules applied. Total rules applied 0 place count 1512 transition count 2601
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 0 with 164 rules applied. Total rules applied 164 place count 1430 transition count 2601
Applied a total of 164 rules in 108 ms. Remains 1430 /1512 variables (removed 82) and now considering 2601/2683 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 1430/1512 places, 2601/2683 transitions.
Incomplete random walk after 10000 steps, including 727 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 219776 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219776 steps, saw 36842 distinct states, run finished after 3003 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:51:19] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 14:51:19] [INFO ] Computed 182 place invariants in 98 ms
[2023-03-15 14:51:20] [INFO ] [Real]Absence check using 175 positive place invariants in 47 ms returned sat
[2023-03-15 14:51:20] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 14:51:20] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:51:20] [INFO ] [Nat]Absence check using 175 positive place invariants in 45 ms returned sat
[2023-03-15 14:51:20] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 33 ms returned sat
[2023-03-15 14:51:21] [INFO ] After 1046ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:51:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:51:21] [INFO ] After 340ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:51:22] [INFO ] Deduced a trap composed of 575 places in 734 ms of which 1 ms to minimize.
[2023-03-15 14:51:23] [INFO ] Deduced a trap composed of 574 places in 779 ms of which 1 ms to minimize.
[2023-03-15 14:51:24] [INFO ] Deduced a trap composed of 575 places in 695 ms of which 1 ms to minimize.
[2023-03-15 14:51:25] [INFO ] Deduced a trap composed of 584 places in 687 ms of which 1 ms to minimize.
[2023-03-15 14:51:25] [INFO ] Deduced a trap composed of 585 places in 698 ms of which 17 ms to minimize.
[2023-03-15 14:51:26] [INFO ] Deduced a trap composed of 584 places in 672 ms of which 1 ms to minimize.
[2023-03-15 14:51:27] [INFO ] Deduced a trap composed of 580 places in 678 ms of which 1 ms to minimize.
[2023-03-15 14:51:28] [INFO ] Deduced a trap composed of 591 places in 698 ms of which 1 ms to minimize.
[2023-03-15 14:51:28] [INFO ] Deduced a trap composed of 587 places in 696 ms of which 4 ms to minimize.
[2023-03-15 14:51:29] [INFO ] Deduced a trap composed of 576 places in 689 ms of which 1 ms to minimize.
[2023-03-15 14:51:30] [INFO ] Deduced a trap composed of 588 places in 684 ms of which 1 ms to minimize.
[2023-03-15 14:51:31] [INFO ] Deduced a trap composed of 584 places in 678 ms of which 2 ms to minimize.
[2023-03-15 14:51:32] [INFO ] Deduced a trap composed of 572 places in 684 ms of which 1 ms to minimize.
[2023-03-15 14:51:32] [INFO ] Deduced a trap composed of 584 places in 659 ms of which 1 ms to minimize.
[2023-03-15 14:51:33] [INFO ] Deduced a trap composed of 593 places in 694 ms of which 1 ms to minimize.
[2023-03-15 14:51:34] [INFO ] Deduced a trap composed of 591 places in 677 ms of which 13 ms to minimize.
[2023-03-15 14:51:35] [INFO ] Deduced a trap composed of 579 places in 704 ms of which 1 ms to minimize.
[2023-03-15 14:51:36] [INFO ] Deduced a trap composed of 578 places in 692 ms of which 1 ms to minimize.
[2023-03-15 14:51:36] [INFO ] Deduced a trap composed of 591 places in 683 ms of which 1 ms to minimize.
[2023-03-15 14:51:37] [INFO ] Deduced a trap composed of 572 places in 672 ms of which 2 ms to minimize.
[2023-03-15 14:51:38] [INFO ] Deduced a trap composed of 578 places in 656 ms of which 5 ms to minimize.
[2023-03-15 14:51:39] [INFO ] Deduced a trap composed of 576 places in 692 ms of which 1 ms to minimize.
[2023-03-15 14:51:45] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 23331 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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-15 14:51:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:51:45] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 66 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 65 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-15 14:51:45] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:51:45] [INFO ] Invariant cache hit.
[2023-03-15 14:51:46] [INFO ] Implicit Places using invariants in 1401 ms returned []
[2023-03-15 14:51:46] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:51:46] [INFO ] Invariant cache hit.
[2023-03-15 14:51:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:51:57] [INFO ] Implicit Places using invariants and state equation in 10691 ms returned []
Implicit Place search using SMT with State Equation took 12104 ms to find 0 implicit places.
[2023-03-15 14:51:57] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-15 14:51:57] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:51:57] [INFO ] Invariant cache hit.
[2023-03-15 14:51:59] [INFO ] Dead Transitions using invariants and state equation in 1452 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13772 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
[2023-03-15 14:51:59] [INFO ] Flatten gal took : 169 ms
[2023-03-15 14:51:59] [INFO ] Flatten gal took : 181 ms
[2023-03-15 14:52:00] [INFO ] Input system was already deterministic with 2775 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 2775/2775 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1604 transition count 2775
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1603 transition count 2774
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1603 transition count 2774
Applied a total of 12 rules in 87 ms. Remains 1603 /1614 variables (removed 11) and now considering 2774/2775 (removed 1) transitions.
[2023-03-15 14:52:00] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-15 14:52:00] [INFO ] Computed 182 place invariants in 53 ms
[2023-03-15 14:52:03] [INFO ] Dead Transitions using invariants and state equation in 2364 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2455 ms. Remains : 1603/1614 places, 2774/2775 transitions.
[2023-03-15 14:52:03] [INFO ] Flatten gal took : 92 ms
[2023-03-15 14:52:03] [INFO ] Flatten gal took : 99 ms
[2023-03-15 14:52:03] [INFO ] Input system was already deterministic with 2774 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1613 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1613 transition count 2774
Applied a total of 2 rules in 88 ms. Remains 1613 /1614 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-15 14:52:03] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1613 cols
[2023-03-15 14:52:03] [INFO ] Computed 192 place invariants in 55 ms
[2023-03-15 14:52:06] [INFO ] Dead Transitions using invariants and state equation in 2519 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2625 ms. Remains : 1613/1614 places, 2774/2775 transitions.
[2023-03-15 14:52:06] [INFO ] Flatten gal took : 93 ms
[2023-03-15 14:52:06] [INFO ] Flatten gal took : 102 ms
[2023-03-15 14:52:06] [INFO ] Input system was already deterministic with 2774 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1614/1614 places, 2775/2775 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1604 transition count 2690
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1519 transition count 2690
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 82 Pre rules applied. Total rules applied 170 place count 1519 transition count 2608
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 334 place count 1437 transition count 2608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 335 place count 1436 transition count 2607
Iterating global reduction 2 with 1 rules applied. Total rules applied 336 place count 1436 transition count 2607
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 340 place count 1434 transition count 2605
Applied a total of 340 rules in 208 ms. Remains 1434 /1614 variables (removed 180) and now considering 2605/2775 (removed 170) transitions.
[2023-03-15 14:52:06] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
// Phase 1: matrix 2596 rows 1434 cols
[2023-03-15 14:52:06] [INFO ] Computed 182 place invariants in 84 ms
[2023-03-15 14:52:08] [INFO ] Dead Transitions using invariants and state equation in 1802 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2012 ms. Remains : 1434/1614 places, 2605/2775 transitions.
[2023-03-15 14:52:08] [INFO ] Flatten gal took : 117 ms
[2023-03-15 14:52:08] [INFO ] Flatten gal took : 90 ms
[2023-03-15 14:52:09] [INFO ] Input system was already deterministic with 2605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1613 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1613 transition count 2774
Applied a total of 2 rules in 66 ms. Remains 1613 /1614 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-15 14:52:09] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1613 cols
[2023-03-15 14:52:09] [INFO ] Computed 192 place invariants in 54 ms
[2023-03-15 14:52:11] [INFO ] Dead Transitions using invariants and state equation in 2636 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2716 ms. Remains : 1613/1614 places, 2774/2775 transitions.
[2023-03-15 14:52:11] [INFO ] Flatten gal took : 103 ms
[2023-03-15 14:52:11] [INFO ] Flatten gal took : 119 ms
[2023-03-15 14:52:12] [INFO ] Input system was already deterministic with 2774 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 2775/2775 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1604 transition count 2775
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1603 transition count 2774
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1603 transition count 2774
Applied a total of 12 rules in 77 ms. Remains 1603 /1614 variables (removed 11) and now considering 2774/2775 (removed 1) transitions.
[2023-03-15 14:52:12] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-15 14:52:12] [INFO ] Computed 182 place invariants in 67 ms
[2023-03-15 14:52:14] [INFO ] Dead Transitions using invariants and state equation in 2442 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2540 ms. Remains : 1603/1614 places, 2774/2775 transitions.
[2023-03-15 14:52:14] [INFO ] Flatten gal took : 96 ms
[2023-03-15 14:52:15] [INFO ] Flatten gal took : 110 ms
[2023-03-15 14:52:15] [INFO ] Input system was already deterministic with 2774 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 2775/2775 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1604 transition count 2775
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1603 transition count 2774
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1603 transition count 2774
Applied a total of 12 rules in 64 ms. Remains 1603 /1614 variables (removed 11) and now considering 2774/2775 (removed 1) transitions.
[2023-03-15 14:52:15] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-15 14:52:15] [INFO ] Invariant cache hit.
[2023-03-15 14:52:17] [INFO ] Dead Transitions using invariants and state equation in 2441 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2517 ms. Remains : 1603/1614 places, 2774/2775 transitions.
[2023-03-15 14:52:17] [INFO ] Flatten gal took : 91 ms
[2023-03-15 14:52:18] [INFO ] Flatten gal took : 98 ms
[2023-03-15 14:52:18] [INFO ] Input system was already deterministic with 2774 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 2775/2775 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1604 transition count 2775
Applied a total of 10 rules in 45 ms. Remains 1604 /1614 variables (removed 10) and now considering 2775/2775 (removed 0) transitions.
[2023-03-15 14:52:18] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2023-03-15 14:52:18] [INFO ] Computed 182 place invariants in 51 ms
[2023-03-15 14:52:20] [INFO ] Dead Transitions using invariants and state equation in 2478 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2526 ms. Remains : 1604/1614 places, 2775/2775 transitions.
[2023-03-15 14:52:20] [INFO ] Flatten gal took : 86 ms
[2023-03-15 14:52:20] [INFO ] Flatten gal took : 93 ms
[2023-03-15 14:52:21] [INFO ] Input system was already deterministic with 2775 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1614/1614 places, 2775/2775 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 1604 transition count 2689
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 1518 transition count 2689
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 172 place count 1518 transition count 2605
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 340 place count 1434 transition count 2605
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 341 place count 1433 transition count 2604
Iterating global reduction 2 with 1 rules applied. Total rules applied 342 place count 1433 transition count 2604
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 346 place count 1431 transition count 2602
Applied a total of 346 rules in 248 ms. Remains 1431 /1614 variables (removed 183) and now considering 2602/2775 (removed 173) transitions.
[2023-03-15 14:52:21] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-15 14:52:21] [INFO ] Computed 182 place invariants in 52 ms
[2023-03-15 14:52:22] [INFO ] Dead Transitions using invariants and state equation in 1592 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1857 ms. Remains : 1431/1614 places, 2602/2775 transitions.
[2023-03-15 14:52:23] [INFO ] Flatten gal took : 79 ms
[2023-03-15 14:52:23] [INFO ] Flatten gal took : 87 ms
[2023-03-15 14:52:23] [INFO ] Input system was already deterministic with 2602 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1614/1614 places, 2775/2775 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 1604 transition count 2692
Reduce places removed 83 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 167 place count 1521 transition count 2691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 1520 transition count 2691
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 168 place count 1520 transition count 2606
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 338 place count 1435 transition count 2606
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 3 with 2 rules applied. Total rules applied 340 place count 1434 transition count 2605
Applied a total of 340 rules in 157 ms. Remains 1434 /1614 variables (removed 180) and now considering 2605/2775 (removed 170) transitions.
[2023-03-15 14:52:23] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
// Phase 1: matrix 2596 rows 1434 cols
[2023-03-15 14:52:23] [INFO ] Computed 182 place invariants in 57 ms
[2023-03-15 14:52:24] [INFO ] Dead Transitions using invariants and state equation in 1476 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1648 ms. Remains : 1434/1614 places, 2605/2775 transitions.
[2023-03-15 14:52:25] [INFO ] Flatten gal took : 81 ms
[2023-03-15 14:52:25] [INFO ] Flatten gal took : 89 ms
[2023-03-15 14:52:25] [INFO ] Input system was already deterministic with 2605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 2775/2775 transitions.
Applied a total of 0 rules in 12 ms. Remains 1614 /1614 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
[2023-03-15 14:52:25] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1614 cols
[2023-03-15 14:52:25] [INFO ] Computed 192 place invariants in 57 ms
[2023-03-15 14:52:27] [INFO ] Dead Transitions using invariants and state equation in 2410 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2427 ms. Remains : 1614/1614 places, 2775/2775 transitions.
[2023-03-15 14:52:27] [INFO ] Flatten gal took : 116 ms
[2023-03-15 14:52:27] [INFO ] Flatten gal took : 98 ms
[2023-03-15 14:52:28] [INFO ] Input system was already deterministic with 2775 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1614/1614 places, 2775/2775 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 1604 transition count 2692
Reduce places removed 83 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 167 place count 1521 transition count 2691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 1520 transition count 2691
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 168 place count 1520 transition count 2608
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 334 place count 1437 transition count 2608
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 335 place count 1436 transition count 2607
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 1436 transition count 2607
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 338 place count 1435 transition count 2606
Applied a total of 338 rules in 396 ms. Remains 1435 /1614 variables (removed 179) and now considering 2606/2775 (removed 169) transitions.
[2023-03-15 14:52:28] [INFO ] Flow matrix only has 2597 transitions (discarded 9 similar events)
// Phase 1: matrix 2597 rows 1435 cols
[2023-03-15 14:52:28] [INFO ] Computed 182 place invariants in 82 ms
[2023-03-15 14:52:30] [INFO ] Dead Transitions using invariants and state equation in 1662 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2066 ms. Remains : 1435/1614 places, 2606/2775 transitions.
[2023-03-15 14:52:30] [INFO ] Flatten gal took : 82 ms
[2023-03-15 14:52:30] [INFO ] Flatten gal took : 88 ms
[2023-03-15 14:52:30] [INFO ] Input system was already deterministic with 2606 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1614/1614 places, 2775/2775 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1604 transition count 2770
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1599 transition count 2770
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 1599 transition count 2767
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 1596 transition count 2767
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 1595 transition count 2766
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 1595 transition count 2766
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 22 place count 1593 transition count 2764
Applied a total of 22 rules in 208 ms. Remains 1593 /1614 variables (removed 21) and now considering 2764/2775 (removed 11) transitions.
[2023-03-15 14:52:30] [INFO ] Flow matrix only has 2755 transitions (discarded 9 similar events)
// Phase 1: matrix 2755 rows 1593 cols
[2023-03-15 14:52:30] [INFO ] Computed 182 place invariants in 55 ms
[2023-03-15 14:52:32] [INFO ] Dead Transitions using invariants and state equation in 2137 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2359 ms. Remains : 1593/1614 places, 2764/2775 transitions.
[2023-03-15 14:52:33] [INFO ] Flatten gal took : 86 ms
[2023-03-15 14:52:33] [INFO ] Flatten gal took : 93 ms
[2023-03-15 14:52:33] [INFO ] Input system was already deterministic with 2764 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 2775/2775 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1604 transition count 2775
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1603 transition count 2774
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1603 transition count 2774
Applied a total of 12 rules in 104 ms. Remains 1603 /1614 variables (removed 11) and now considering 2774/2775 (removed 1) transitions.
[2023-03-15 14:52:33] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-15 14:52:33] [INFO ] Computed 182 place invariants in 60 ms
[2023-03-15 14:52:35] [INFO ] Dead Transitions using invariants and state equation in 2528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2643 ms. Remains : 1603/1614 places, 2774/2775 transitions.
[2023-03-15 14:52:36] [INFO ] Flatten gal took : 89 ms
[2023-03-15 14:52:36] [INFO ] Flatten gal took : 92 ms
[2023-03-15 14:52:36] [INFO ] Input system was already deterministic with 2774 transitions.
[2023-03-15 14:52:36] [INFO ] Flatten gal took : 192 ms
[2023-03-15 14:52:37] [INFO ] Flatten gal took : 144 ms
[2023-03-15 14:52:37] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 38 ms.
[2023-03-15 14:52:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1614 places, 2775 transitions and 15584 arcs took 14 ms.
Total runtime 154982 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBNT-COL-S10J80
BK_EXAMINATION: CTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
CTLFireability

BK_STOP 1678892277151

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/CTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:553
lola: rewrite Frontend/Parser/formula_rewrite.k:553
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:397
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:397
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:397
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 765 Killed lola --conf=$BIN_DIR/configfiles/ctlfireabilityconf --formula=$DIR/CTLFireability.xml --verdictfile=$DIR/GenericPropertiesVerdict.xml $DIR/model.pnml

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-S10J80"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is PolyORBNT-COL-S10J80, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873948300706"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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