fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r297-tall-167873950700634
Last Updated
May 14, 2023

About the Execution of LTSMin+red for PolyORBNT-COL-S05J20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3601.584 3600000.00 14183343.00 642.80 ?T?????T???????? normal

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.r297-tall-167873950700634.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 ltsminxred
Input is PolyORBNT-COL-S05J20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950700634
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 23:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 23:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:40 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.7K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 23:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 23:46 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 92K 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-S05J20-CTLFireability-00
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-01
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-02
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-03
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-04
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-05
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-06
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-07
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-08
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-09
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-10
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-11
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-12
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-13
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-14
FORMULA_NAME PolyORBNT-COL-S05J20-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679595619248

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 18:20:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 18:20:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 18:20:21] [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-23 18:20:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 18:20:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 584 ms
[2023-03-23 18:20:21] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
[2023-03-23 18:20:21] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-23 18:20:21] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 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 798 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 35) seen :20
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 18:20:22] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-23 18:20:22] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-23 18:20:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-23 18:20:22] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:1
[2023-03-23 18:20:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:20:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 18:20:22] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2023-03-23 18:20:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:20:22] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :5 sat :1
[2023-03-23 18:20:22] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 5 ms to minimize.
[2023-03-23 18:20:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-23 18:20:22] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-23 18:20:22] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 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 0 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 1 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 17 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2023-03-23 18:20:22] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-23 18:20:22] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10000 steps, including 1171 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 332 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Probably explored full state space saw : 335 states, properties seen :0
Probabilistic random walk after 889 steps, saw 335 distinct states, run finished after 19 ms. (steps per millisecond=46 ) properties seen :0
Explored full state space saw : 335 states, properties seen :0
Exhaustive walk after 889 steps, saw 335 distinct states, run finished after 3 ms. (steps per millisecond=296 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBNT-COL-S05J20-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 18:20:22] [INFO ] Flatten gal took : 24 ms
[2023-03-23 18:20:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-COL-S05J20-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 18:20:22] [INFO ] Flatten gal took : 9 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-23 18:20:23] [INFO ] Unfolded HLPN to a Petri net with 369 places and 1230 transitions 8864 arcs in 35 ms.
[2023-03-23 18:20:23] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2023-03-23 18:20:23] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-23 18:20:23] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-23 18:20:23] [INFO ] Reduced 10 identical enabling conditions.
[2023-03-23 18:20:23] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-23 18:20:23] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-23 18:20:23] [INFO ] Reduced 10 identical enabling conditions.
[2023-03-23 18:20:23] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-23 18:20:23] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 347 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 349 /349 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-23 18:20:23] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2023-03-23 18:20:23] [INFO ] Computed 62 place invariants in 35 ms
[2023-03-23 18:20:23] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-23 18:20:23] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 349 cols
[2023-03-23 18:20:23] [INFO ] Computed 62 place invariants in 13 ms
[2023-03-23 18:20:23] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-23 18:20:23] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
[2023-03-23 18:20:23] [INFO ] Invariant cache hit.
[2023-03-23 18:20:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:20:23] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 349/349 places, 460/555 transitions.
Applied a total of 0 rules in 5 ms. Remains 349 /349 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 748 ms. Remains : 349/349 places, 460/555 transitions.
Support contains 347 out of 349 places after structural reductions.
[2023-03-23 18:20:23] [INFO ] Flatten gal took : 58 ms
[2023-03-23 18:20:24] [INFO ] Flatten gal took : 65 ms
[2023-03-23 18:20:24] [INFO ] Input system was already deterministic with 460 transitions.
Incomplete random walk after 10000 steps, including 689 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 52) seen :42
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 250 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 69 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 169 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 155 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-23 18:20:25] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
[2023-03-23 18:20:25] [INFO ] Invariant cache hit.
[2023-03-23 18:20:25] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2023-03-23 18:20:25] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 18:20:25] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:3
[2023-03-23 18:20:25] [INFO ] [Nat]Absence check using 55 positive place invariants in 14 ms returned sat
[2023-03-23 18:20:25] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 33 ms returned sat
[2023-03-23 18:20:25] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2023-03-23 18:20:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:20:25] [INFO ] After 26ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :6 sat :1
[2023-03-23 18:20:25] [INFO ] Deduced a trap composed of 133 places in 117 ms of which 1 ms to minimize.
[2023-03-23 18:20:26] [INFO ] Deduced a trap composed of 136 places in 113 ms of which 1 ms to minimize.
[2023-03-23 18:20:26] [INFO ] Deduced a trap composed of 145 places in 127 ms of which 0 ms to minimize.
[2023-03-23 18:20:26] [INFO ] Deduced a trap composed of 145 places in 129 ms of which 0 ms to minimize.
[2023-03-23 18:20:26] [INFO ] Deduced a trap composed of 145 places in 133 ms of which 1 ms to minimize.
[2023-03-23 18:20:26] [INFO ] Deduced a trap composed of 139 places in 116 ms of which 1 ms to minimize.
[2023-03-23 18:20:26] [INFO ] Deduced a trap composed of 139 places in 117 ms of which 1 ms to minimize.
[2023-03-23 18:20:27] [INFO ] Deduced a trap composed of 142 places in 124 ms of which 1 ms to minimize.
[2023-03-23 18:20:27] [INFO ] Deduced a trap composed of 133 places in 136 ms of which 1 ms to minimize.
[2023-03-23 18:20:27] [INFO ] Deduced a trap composed of 145 places in 117 ms of which 1 ms to minimize.
[2023-03-23 18:20:27] [INFO ] Deduced a trap composed of 148 places in 114 ms of which 1 ms to minimize.
[2023-03-23 18:20:27] [INFO ] Deduced a trap composed of 151 places in 120 ms of which 0 ms to minimize.
[2023-03-23 18:20:27] [INFO ] Deduced a trap composed of 154 places in 122 ms of which 0 ms to minimize.
[2023-03-23 18:20:28] [INFO ] Deduced a trap composed of 151 places in 126 ms of which 0 ms to minimize.
[2023-03-23 18:20:28] [INFO ] Deduced a trap composed of 145 places in 127 ms of which 0 ms to minimize.
[2023-03-23 18:20:28] [INFO ] Deduced a trap composed of 151 places in 116 ms of which 0 ms to minimize.
[2023-03-23 18:20:28] [INFO ] Deduced a trap composed of 148 places in 115 ms of which 0 ms to minimize.
[2023-03-23 18:20:28] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 1 ms to minimize.
[2023-03-23 18:20:28] [INFO ] Deduced a trap composed of 145 places in 120 ms of which 0 ms to minimize.
[2023-03-23 18:20:28] [INFO ] Deduced a trap composed of 133 places in 119 ms of which 1 ms to minimize.
[2023-03-23 18:20:29] [INFO ] Deduced a trap composed of 148 places in 116 ms of which 1 ms to minimize.
[2023-03-23 18:20:29] [INFO ] Deduced a trap composed of 142 places in 122 ms of which 1 ms to minimize.
[2023-03-23 18:20:29] [INFO ] Deduced a trap composed of 145 places in 114 ms of which 1 ms to minimize.
[2023-03-23 18:20:29] [INFO ] Deduced a trap composed of 136 places in 117 ms of which 1 ms to minimize.
[2023-03-23 18:20:29] [INFO ] Deduced a trap composed of 151 places in 119 ms of which 0 ms to minimize.
[2023-03-23 18:20:30] [INFO ] Deduced a trap composed of 148 places in 119 ms of which 0 ms to minimize.
[2023-03-23 18:20:30] [INFO ] Deduced a trap composed of 139 places in 118 ms of which 1 ms to minimize.
[2023-03-23 18:20:30] [INFO ] Deduced a trap composed of 142 places in 121 ms of which 0 ms to minimize.
[2023-03-23 18:20:30] [INFO ] Deduced a trap composed of 154 places in 122 ms of which 1 ms to minimize.
[2023-03-23 18:20:30] [INFO ] Deduced a trap composed of 151 places in 118 ms of which 0 ms to minimize.
[2023-03-23 18:20:31] [INFO ] Deduced a trap composed of 142 places in 115 ms of which 0 ms to minimize.
[2023-03-23 18:20:31] [INFO ] Deduced a trap composed of 142 places in 120 ms of which 1 ms to minimize.
[2023-03-23 18:20:31] [INFO ] Deduced a trap composed of 148 places in 124 ms of which 1 ms to minimize.
[2023-03-23 18:20:31] [INFO ] Deduced a trap composed of 139 places in 118 ms of which 0 ms to minimize.
[2023-03-23 18:20:31] [INFO ] Deduced a trap composed of 139 places in 118 ms of which 0 ms to minimize.
[2023-03-23 18:20:33] [INFO ] Deduced a trap composed of 145 places in 117 ms of which 0 ms to minimize.
[2023-03-23 18:20:33] [INFO ] Deduced a trap composed of 148 places in 119 ms of which 1 ms to minimize.
[2023-03-23 18:20:36] [INFO ] Deduced a trap composed of 145 places in 124 ms of which 1 ms to minimize.
[2023-03-23 18:20:36] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 1 ms to minimize.
[2023-03-23 18:20:36] [INFO ] Deduced a trap composed of 130 places in 119 ms of which 0 ms to minimize.
[2023-03-23 18:20:37] [INFO ] Deduced a trap composed of 142 places in 114 ms of which 0 ms to minimize.
[2023-03-23 18:20:37] [INFO ] Deduced a trap composed of 145 places in 128 ms of which 1 ms to minimize.
[2023-03-23 18:20:37] [INFO ] Deduced a trap composed of 139 places in 115 ms of which 0 ms to minimize.
[2023-03-23 18:20:37] [INFO ] Deduced a trap composed of 145 places in 113 ms of which 1 ms to minimize.
[2023-03-23 18:20:37] [INFO ] Deduced a trap composed of 145 places in 121 ms of which 1 ms to minimize.
[2023-03-23 18:20:37] [INFO ] Deduced a trap composed of 145 places in 119 ms of which 1 ms to minimize.
[2023-03-23 18:20:38] [INFO ] Deduced a trap composed of 157 places in 137 ms of which 0 ms to minimize.
[2023-03-23 18:20:38] [INFO ] Deduced a trap composed of 145 places in 120 ms of which 1 ms to minimize.
[2023-03-23 18:20:38] [INFO ] Deduced a trap composed of 142 places in 116 ms of which 1 ms to minimize.
[2023-03-23 18:20:39] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 0 ms to minimize.
[2023-03-23 18:20:40] [INFO ] Deduced a trap composed of 142 places in 124 ms of which 0 ms to minimize.
[2023-03-23 18:20:44] [INFO ] Deduced a trap composed of 145 places in 122 ms of which 0 ms to minimize.
[2023-03-23 18:20:45] [INFO ] Deduced a trap composed of 139 places in 118 ms of which 0 ms to minimize.
[2023-03-23 18:20:45] [INFO ] Deduced a trap composed of 142 places in 119 ms of which 0 ms to minimize.
[2023-03-23 18:20:47] [INFO ] Deduced a trap composed of 148 places in 128 ms of which 0 ms to minimize.
[2023-03-23 18:20:47] [INFO ] Deduced a trap composed of 148 places in 121 ms of which 1 ms to minimize.
[2023-03-23 18:20:47] [INFO ] Deduced a trap composed of 142 places in 118 ms of which 0 ms to minimize.
[2023-03-23 18:20:48] [INFO ] Deduced a trap composed of 142 places in 116 ms of which 0 ms to minimize.
[2023-03-23 18:20:50] [INFO ] Trap strengthening (SAT) tested/added 58/58 trap constraints in 24668 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-23 18:20:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 18:20:50] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0 real:3
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 344 transition count 434
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 318 transition count 434
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 57 place count 318 transition count 409
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 107 place count 293 transition count 409
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 292 transition count 408
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 292 transition count 408
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 113 place count 290 transition count 406
Applied a total of 113 rules in 72 ms. Remains 290 /349 variables (removed 59) and now considering 406/460 (removed 54) transitions.
[2023-03-23 18:20:50] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-23 18:20:50] [INFO ] Computed 57 place invariants in 16 ms
[2023-03-23 18:20:50] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 290/349 places, 406/460 transitions.
Incomplete random walk after 10000 steps, including 531 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 675853 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 675853 steps, saw 210688 distinct states, run finished after 3003 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 18:20:53] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-23 18:20:53] [INFO ] Invariant cache hit.
[2023-03-23 18:20:53] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-23 18:20:53] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 18:20:53] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 18:20:54] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-23 18:20:54] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-23 18:20:54] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 18:20:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:20:54] [INFO ] After 65ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 18:20:54] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 1 ms to minimize.
[2023-03-23 18:20:54] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 0 ms to minimize.
[2023-03-23 18:20:54] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 1 ms to minimize.
[2023-03-23 18:20:54] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 0 ms to minimize.
[2023-03-23 18:20:54] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 0 ms to minimize.
[2023-03-23 18:20:54] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2023-03-23 18:20:55] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 0 ms to minimize.
[2023-03-23 18:20:55] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 1 ms to minimize.
[2023-03-23 18:20:55] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 1 ms to minimize.
[2023-03-23 18:20:55] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 1 ms to minimize.
[2023-03-23 18:20:55] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 1 ms to minimize.
[2023-03-23 18:20:55] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 1 ms to minimize.
[2023-03-23 18:20:55] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 1 ms to minimize.
[2023-03-23 18:20:55] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 0 ms to minimize.
[2023-03-23 18:20:56] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 0 ms to minimize.
[2023-03-23 18:20:56] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 0 ms to minimize.
[2023-03-23 18:20:56] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 0 ms to minimize.
[2023-03-23 18:20:56] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2023-03-23 18:20:56] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 1 ms to minimize.
[2023-03-23 18:20:56] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 0 ms to minimize.
[2023-03-23 18:20:57] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 0 ms to minimize.
[2023-03-23 18:20:57] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 1 ms to minimize.
[2023-03-23 18:20:57] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 1 ms to minimize.
[2023-03-23 18:20:57] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 0 ms to minimize.
[2023-03-23 18:20:57] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 0 ms to minimize.
[2023-03-23 18:20:57] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 1 ms to minimize.
[2023-03-23 18:20:57] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 0 ms to minimize.
[2023-03-23 18:20:58] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 0 ms to minimize.
[2023-03-23 18:20:58] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 0 ms to minimize.
[2023-03-23 18:20:58] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 0 ms to minimize.
[2023-03-23 18:20:58] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 1 ms to minimize.
[2023-03-23 18:20:59] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 1 ms to minimize.
[2023-03-23 18:20:59] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 1 ms to minimize.
[2023-03-23 18:20:59] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 1 ms to minimize.
[2023-03-23 18:20:59] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 0 ms to minimize.
[2023-03-23 18:21:00] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 0 ms to minimize.
[2023-03-23 18:21:00] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 0 ms to minimize.
[2023-03-23 18:21:09] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 14929 ms
[2023-03-23 18:21:09] [INFO ] After 15044ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-23 18:21:09] [INFO ] After 15250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 29 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 16 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-23 18:21:09] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-23 18:21:09] [INFO ] Invariant cache hit.
[2023-03-23 18:21:09] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-23 18:21:09] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-23 18:21:09] [INFO ] Invariant cache hit.
[2023-03-23 18:21:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:21:10] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
[2023-03-23 18:21:10] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-23 18:21:10] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-23 18:21:10] [INFO ] Invariant cache hit.
[2023-03-23 18:21:10] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1499 ms. Remains : 290/290 places, 406/406 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 43 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 395 rows 283 cols
[2023-03-23 18:21:10] [INFO ] Computed 57 place invariants in 12 ms
[2023-03-23 18:21:10] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-23 18:21:10] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-23 18:21:10] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 18:21:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-23 18:21:10] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 18:21:11] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 18:21:11] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 0 ms to minimize.
[2023-03-23 18:21:11] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 0 ms to minimize.
[2023-03-23 18:21:11] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 0 ms to minimize.
[2023-03-23 18:21:11] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 1 ms to minimize.
[2023-03-23 18:21:11] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 1 ms to minimize.
[2023-03-23 18:21:11] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 0 ms to minimize.
[2023-03-23 18:21:11] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 0 ms to minimize.
[2023-03-23 18:21:12] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 1 ms to minimize.
[2023-03-23 18:21:12] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 1 ms to minimize.
[2023-03-23 18:21:12] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 0 ms to minimize.
[2023-03-23 18:21:12] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 1 ms to minimize.
[2023-03-23 18:21:12] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 0 ms to minimize.
[2023-03-23 18:21:12] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 0 ms to minimize.
[2023-03-23 18:21:12] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 0 ms to minimize.
[2023-03-23 18:21:12] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 0 ms to minimize.
[2023-03-23 18:21:13] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 0 ms to minimize.
[2023-03-23 18:21:13] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 0 ms to minimize.
[2023-03-23 18:21:13] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 0 ms to minimize.
[2023-03-23 18:21:13] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 1 ms to minimize.
[2023-03-23 18:21:13] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 1 ms to minimize.
[2023-03-23 18:21:13] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 1 ms to minimize.
[2023-03-23 18:21:13] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 0 ms to minimize.
[2023-03-23 18:21:14] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 0 ms to minimize.
[2023-03-23 18:21:14] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 1 ms to minimize.
[2023-03-23 18:21:14] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 1 ms to minimize.
[2023-03-23 18:21:14] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 1 ms to minimize.
[2023-03-23 18:21:14] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 1 ms to minimize.
[2023-03-23 18:21:14] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 0 ms to minimize.
[2023-03-23 18:21:14] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 1 ms to minimize.
[2023-03-23 18:21:14] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 0 ms to minimize.
[2023-03-23 18:21:15] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 0 ms to minimize.
[2023-03-23 18:21:15] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 1 ms to minimize.
[2023-03-23 18:21:15] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 0 ms to minimize.
[2023-03-23 18:21:15] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 1 ms to minimize.
[2023-03-23 18:21:15] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 1 ms to minimize.
[2023-03-23 18:21:15] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 0 ms to minimize.
[2023-03-23 18:21:16] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 1 ms to minimize.
[2023-03-23 18:21:16] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 1 ms to minimize.
[2023-03-23 18:21:16] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 0 ms to minimize.
[2023-03-23 18:21:16] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 0 ms to minimize.
[2023-03-23 18:21:16] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 0 ms to minimize.
[2023-03-23 18:21:16] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 0 ms to minimize.
[2023-03-23 18:21:17] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 1 ms to minimize.
[2023-03-23 18:21:17] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 0 ms to minimize.
[2023-03-23 18:21:17] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 1 ms to minimize.
[2023-03-23 18:21:17] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2023-03-23 18:21:17] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 0 ms to minimize.
[2023-03-23 18:21:18] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 0 ms to minimize.
[2023-03-23 18:21:19] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 0 ms to minimize.
[2023-03-23 18:21:19] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 0 ms to minimize.
[2023-03-23 18:21:20] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 0 ms to minimize.
[2023-03-23 18:21:21] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 0 ms to minimize.
[2023-03-23 18:21:21] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 0 ms to minimize.
[2023-03-23 18:21:21] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 1 ms to minimize.
[2023-03-23 18:21:21] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 1 ms to minimize.
[2023-03-23 18:21:22] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 1 ms to minimize.
[2023-03-23 18:21:22] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 0 ms to minimize.
[2023-03-23 18:21:31] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 20398 ms
[2023-03-23 18:21:31] [INFO ] After 20711ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-23 18:21:31] [INFO ] After 20781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
[2023-03-23 18:21:31] [INFO ] Flatten gal took : 44 ms
[2023-03-23 18:21:31] [INFO ] Flatten gal took : 43 ms
[2023-03-23 18:21:31] [INFO ] Input system was already deterministic with 460 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 344 transition count 460
Applied a total of 5 rules in 5 ms. Remains 344 /349 variables (removed 5) and now considering 460/460 (removed 0) transitions.
[2023-03-23 18:21:32] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 344 cols
[2023-03-23 18:21:32] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-23 18:21:32] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 333 ms. Remains : 344/349 places, 460/460 transitions.
[2023-03-23 18:21:32] [INFO ] Flatten gal took : 27 ms
[2023-03-23 18:21:32] [INFO ] Flatten gal took : 23 ms
[2023-03-23 18:21:32] [INFO ] Input system was already deterministic with 460 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 344 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 343 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 343 transition count 459
Applied a total of 7 rules in 8 ms. Remains 343 /349 variables (removed 6) and now considering 459/460 (removed 1) transitions.
[2023-03-23 18:21:32] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2023-03-23 18:21:32] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-23 18:21:32] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 343/349 places, 459/460 transitions.
[2023-03-23 18:21:32] [INFO ] Flatten gal took : 21 ms
[2023-03-23 18:21:32] [INFO ] Flatten gal took : 21 ms
[2023-03-23 18:21:32] [INFO ] Input system was already deterministic with 459 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 344 transition count 460
Applied a total of 5 rules in 6 ms. Remains 344 /349 variables (removed 5) and now considering 460/460 (removed 0) transitions.
[2023-03-23 18:21:32] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 344 cols
[2023-03-23 18:21:32] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-23 18:21:33] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 344/349 places, 460/460 transitions.
[2023-03-23 18:21:33] [INFO ] Flatten gal took : 19 ms
[2023-03-23 18:21:33] [INFO ] Flatten gal took : 21 ms
[2023-03-23 18:21:33] [INFO ] Input system was already deterministic with 460 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 344 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 343 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 343 transition count 459
Applied a total of 7 rules in 19 ms. Remains 343 /349 variables (removed 6) and now considering 459/460 (removed 1) transitions.
[2023-03-23 18:21:33] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2023-03-23 18:21:33] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-23 18:21:33] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 343/349 places, 459/460 transitions.
[2023-03-23 18:21:33] [INFO ] Flatten gal took : 20 ms
[2023-03-23 18:21:33] [INFO ] Flatten gal took : 19 ms
[2023-03-23 18:21:33] [INFO ] Input system was already deterministic with 459 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Applied a total of 0 rules in 2 ms. Remains 349 /349 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2023-03-23 18:21:33] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 349 cols
[2023-03-23 18:21:33] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-23 18:21:33] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 349/349 places, 460/460 transitions.
[2023-03-23 18:21:33] [INFO ] Flatten gal took : 20 ms
[2023-03-23 18:21:33] [INFO ] Flatten gal took : 20 ms
[2023-03-23 18:21:34] [INFO ] Input system was already deterministic with 460 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 344 transition count 457
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 341 transition count 457
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 6 place count 341 transition count 433
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 54 place count 317 transition count 433
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 316 transition count 432
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 316 transition count 432
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 58 place count 315 transition count 431
Applied a total of 58 rules in 35 ms. Remains 315 /349 variables (removed 34) and now considering 431/460 (removed 29) transitions.
[2023-03-23 18:21:34] [INFO ] Flow matrix only has 427 transitions (discarded 4 similar events)
// Phase 1: matrix 427 rows 315 cols
[2023-03-23 18:21:34] [INFO ] Computed 57 place invariants in 14 ms
[2023-03-23 18:21:34] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 307 ms. Remains : 315/349 places, 431/460 transitions.
[2023-03-23 18:21:34] [INFO ] Flatten gal took : 17 ms
[2023-03-23 18:21:34] [INFO ] Flatten gal took : 27 ms
[2023-03-23 18:21:34] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 348 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 348 transition count 459
Applied a total of 2 rules in 13 ms. Remains 348 /349 variables (removed 1) and now considering 459/460 (removed 1) transitions.
[2023-03-23 18:21:34] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 348 cols
[2023-03-23 18:21:34] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-23 18:21:34] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 333 ms. Remains : 348/349 places, 459/460 transitions.
[2023-03-23 18:21:34] [INFO ] Flatten gal took : 17 ms
[2023-03-23 18:21:34] [INFO ] Flatten gal took : 17 ms
[2023-03-23 18:21:34] [INFO ] Input system was already deterministic with 459 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 344 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 343 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 343 transition count 459
Applied a total of 7 rules in 11 ms. Remains 343 /349 variables (removed 6) and now considering 459/460 (removed 1) transitions.
[2023-03-23 18:21:34] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2023-03-23 18:21:34] [INFO ] Computed 57 place invariants in 9 ms
[2023-03-23 18:21:35] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 343/349 places, 459/460 transitions.
[2023-03-23 18:21:35] [INFO ] Flatten gal took : 14 ms
[2023-03-23 18:21:35] [INFO ] Flatten gal took : 15 ms
[2023-03-23 18:21:35] [INFO ] Input system was already deterministic with 459 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 344 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 343 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 343 transition count 459
Applied a total of 7 rules in 8 ms. Remains 343 /349 variables (removed 6) and now considering 459/460 (removed 1) transitions.
[2023-03-23 18:21:35] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
[2023-03-23 18:21:35] [INFO ] Invariant cache hit.
[2023-03-23 18:21:35] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 343/349 places, 459/460 transitions.
[2023-03-23 18:21:35] [INFO ] Flatten gal took : 15 ms
[2023-03-23 18:21:35] [INFO ] Flatten gal took : 16 ms
[2023-03-23 18:21:35] [INFO ] Input system was already deterministic with 459 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 349 transition count 459
Reduce places removed 1 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 22 rules applied. Total rules applied 23 place count 348 transition count 438
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 44 place count 327 transition count 438
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 44 place count 327 transition count 435
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 324 transition count 435
Applied a total of 50 rules in 38 ms. Remains 324 /349 variables (removed 25) and now considering 435/460 (removed 25) transitions.
[2023-03-23 18:21:35] [INFO ] Flow matrix only has 431 transitions (discarded 4 similar events)
// Phase 1: matrix 431 rows 324 cols
[2023-03-23 18:21:35] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-23 18:21:35] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 323 ms. Remains : 324/349 places, 435/460 transitions.
[2023-03-23 18:21:35] [INFO ] Flatten gal took : 16 ms
[2023-03-23 18:21:35] [INFO ] Flatten gal took : 16 ms
[2023-03-23 18:21:35] [INFO ] Input system was already deterministic with 435 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 344 transition count 434
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 318 transition count 434
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 52 place count 318 transition count 410
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 100 place count 294 transition count 410
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 293 transition count 409
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 293 transition count 409
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 106 place count 291 transition count 407
Applied a total of 106 rules in 28 ms. Remains 291 /349 variables (removed 58) and now considering 407/460 (removed 53) transitions.
[2023-03-23 18:21:35] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2023-03-23 18:21:36] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-23 18:21:36] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 253 ms. Remains : 291/349 places, 407/460 transitions.
[2023-03-23 18:21:36] [INFO ] Flatten gal took : 13 ms
[2023-03-23 18:21:36] [INFO ] Flatten gal took : 14 ms
[2023-03-23 18:21:36] [INFO ] Input system was already deterministic with 407 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 344 transition count 435
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 319 transition count 435
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 319 transition count 411
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 295 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 294 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 294 transition count 410
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 104 place count 292 transition count 408
Applied a total of 104 rules in 26 ms. Remains 292 /349 variables (removed 57) and now considering 408/460 (removed 52) transitions.
[2023-03-23 18:21:36] [INFO ] Flow matrix only has 404 transitions (discarded 4 similar events)
// Phase 1: matrix 404 rows 292 cols
[2023-03-23 18:21:36] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-23 18:21:36] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 254 ms. Remains : 292/349 places, 408/460 transitions.
[2023-03-23 18:21:36] [INFO ] Flatten gal took : 14 ms
[2023-03-23 18:21:36] [INFO ] Flatten gal took : 21 ms
[2023-03-23 18:21:36] [INFO ] Input system was already deterministic with 408 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 344 transition count 435
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 319 transition count 435
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 319 transition count 410
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 294 transition count 410
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 293 transition count 409
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 293 transition count 409
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 106 place count 291 transition count 407
Applied a total of 106 rules in 25 ms. Remains 291 /349 variables (removed 58) and now considering 407/460 (removed 53) transitions.
[2023-03-23 18:21:36] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2023-03-23 18:21:36] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-23 18:21:36] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 257 ms. Remains : 291/349 places, 407/460 transitions.
[2023-03-23 18:21:36] [INFO ] Flatten gal took : 14 ms
[2023-03-23 18:21:36] [INFO ] Flatten gal took : 14 ms
[2023-03-23 18:21:36] [INFO ] Input system was already deterministic with 407 transitions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 460/460 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 344 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 343 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 343 transition count 459
Applied a total of 7 rules in 7 ms. Remains 343 /349 variables (removed 6) and now considering 459/460 (removed 1) transitions.
[2023-03-23 18:21:36] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2023-03-23 18:21:36] [INFO ] Computed 57 place invariants in 9 ms
[2023-03-23 18:21:37] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 343/349 places, 459/460 transitions.
[2023-03-23 18:21:37] [INFO ] Flatten gal took : 15 ms
[2023-03-23 18:21:37] [INFO ] Flatten gal took : 16 ms
[2023-03-23 18:21:37] [INFO ] Input system was already deterministic with 459 transitions.
[2023-03-23 18:21:37] [INFO ] Flatten gal took : 28 ms
[2023-03-23 18:21:37] [INFO ] Flatten gal took : 27 ms
[2023-03-23 18:21:37] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 18 ms.
[2023-03-23 18:21:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 349 places, 460 transitions and 2324 arcs took 3 ms.
Total runtime 76458 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/1039/ctl_0_ --ctl=/tmp/1039/ctl_1_ --ctl=/tmp/1039/ctl_2_ --ctl=/tmp/1039/ctl_3_ --ctl=/tmp/1039/ctl_4_ --ctl=/tmp/1039/ctl_5_ --ctl=/tmp/1039/ctl_6_ --ctl=/tmp/1039/ctl_7_ --ctl=/tmp/1039/ctl_8_ --ctl=/tmp/1039/ctl_9_ --ctl=/tmp/1039/ctl_10_ --ctl=/tmp/1039/ctl_11_ --ctl=/tmp/1039/ctl_12_ --ctl=/tmp/1039/ctl_13_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12540444 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093920 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//
++ 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
mcc2023

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-S05J20"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBNT-COL-S05J20, 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 r297-tall-167873950700634"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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