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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 159K Mar 5 18:22 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 AutonomousCar-PT-05b-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678637673203

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=AutonomousCar-PT-05b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:14:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:14:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:14:35] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2023-03-12 16:14:35] [INFO ] Transformed 255 places.
[2023-03-12 16:14:35] [INFO ] Transformed 490 transitions.
[2023-03-12 16:14:35] [INFO ] Found NUPN structural information;
[2023-03-12 16:14:35] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 84 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 490/490 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 233 transition count 468
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 233 transition count 468
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 144 place count 233 transition count 368
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 147 place count 230 transition count 365
Iterating global reduction 1 with 3 rules applied. Total rules applied 150 place count 230 transition count 365
Applied a total of 150 rules in 40 ms. Remains 230 /255 variables (removed 25) and now considering 365/490 (removed 125) transitions.
// Phase 1: matrix 365 rows 230 cols
[2023-03-12 16:14:35] [INFO ] Computed 10 place invariants in 11 ms
[2023-03-12 16:14:36] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-12 16:14:36] [INFO ] Invariant cache hit.
[2023-03-12 16:14:36] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2023-03-12 16:14:36] [INFO ] Invariant cache hit.
[2023-03-12 16:14:36] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/255 places, 365/490 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 882 ms. Remains : 230/255 places, 365/490 transitions.
Support contains 84 out of 230 places after structural reductions.
[2023-03-12 16:14:36] [INFO ] Flatten gal took : 61 ms
[2023-03-12 16:14:36] [INFO ] Flatten gal took : 29 ms
[2023-03-12 16:14:37] [INFO ] Input system was already deterministic with 365 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 83) seen :37
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 46) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 44) seen :5
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 39) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 37) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2023-03-12 16:14:37] [INFO ] Invariant cache hit.
[2023-03-12 16:14:38] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 16:14:38] [INFO ] After 303ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:31
[2023-03-12 16:14:38] [INFO ] After 351ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-12 16:14:38] [INFO ] After 601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-12 16:14:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 16:14:39] [INFO ] After 1053ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :28
[2023-03-12 16:14:40] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 20 ms to minimize.
[2023-03-12 16:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 254 ms
[2023-03-12 16:14:40] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 1 ms to minimize.
[2023-03-12 16:14:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-12 16:14:41] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2023-03-12 16:14:41] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 14 ms to minimize.
[2023-03-12 16:14:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 339 ms
[2023-03-12 16:14:41] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 7 ms to minimize.
[2023-03-12 16:14:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-03-12 16:14:42] [INFO ] After 3311ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :27
Attempting to minimize the solution found.
Minimization took 909 ms.
[2023-03-12 16:14:43] [INFO ] After 4583ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :27
Fused 32 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 166 ms.
Support contains 41 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 365/365 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 230 transition count 292
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 97 rules applied. Total rules applied 170 place count 157 transition count 268
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 186 place count 143 transition count 266
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 188 place count 141 transition count 266
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 188 place count 141 transition count 254
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 212 place count 129 transition count 254
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 220 place count 121 transition count 246
Iterating global reduction 4 with 8 rules applied. Total rules applied 228 place count 121 transition count 246
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 230 place count 119 transition count 240
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 119 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 119 transition count 239
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 289 place count 91 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 291 place count 91 transition count 209
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 292 place count 90 transition count 204
Iterating global reduction 6 with 1 rules applied. Total rules applied 293 place count 90 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 294 place count 90 transition count 203
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 7 with 2 rules applied. Total rules applied 296 place count 89 transition count 202
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 297 place count 89 transition count 201
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 308 place count 89 transition count 190
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 319 place count 78 transition count 190
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 321 place count 78 transition count 188
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 323 place count 78 transition count 188
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 324 place count 77 transition count 182
Iterating global reduction 8 with 1 rules applied. Total rules applied 325 place count 77 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 326 place count 76 transition count 181
Applied a total of 326 rules in 77 ms. Remains 76 /230 variables (removed 154) and now considering 181/365 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 76/230 places, 181/365 transitions.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 27) seen :6
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 11) seen :1
Running SMT prover for 10 properties.
// Phase 1: matrix 181 rows 76 cols
[2023-03-12 16:14:43] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:14:43] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-12 16:14:43] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 16:14:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 16:14:44] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 16:14:44] [INFO ] After 504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-03-12 16:14:44] [INFO ] After 743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 68 ms.
Support contains 24 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 181/181 transitions.
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 4 rules applied. Total rules applied 4 place count 76 transition count 177
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 72 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 71 transition count 176
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 71 transition count 174
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 69 transition count 174
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 3 with 4 rules applied. Total rules applied 18 place count 67 transition count 172
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 24 place count 64 transition count 169
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 29 place count 64 transition count 164
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 39 place count 59 transition count 159
Applied a total of 39 rules in 15 ms. Remains 59 /76 variables (removed 17) and now considering 159/181 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 59/76 places, 159/181 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 159 rows 59 cols
[2023-03-12 16:14:45] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 16:14:45] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:14:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-12 16:14:46] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 16:14:46] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 10 ms to minimize.
[2023-03-12 16:14:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-12 16:14:46] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-12 16:14:46] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 21 ms.
Support contains 13 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 159/159 transitions.
Graph (trivial) has 25 edges and 59 vertex of which 2 / 59 are part of one of the 1 SCC in 8 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 392 edges and 58 vertex of which 55 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 55 transition count 154
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 154
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 51 transition count 151
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 0 with 4 rules applied. Total rules applied 14 place count 49 transition count 149
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 49 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 47 transition count 147
Applied a total of 18 rules in 31 ms. Remains 47 /59 variables (removed 12) and now considering 147/159 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 47/59 places, 147/159 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Finished probabilistic random walk after 852090 steps, run visited all 5 properties in 1592 ms. (steps per millisecond=535 )
Probabilistic random walk after 852090 steps, saw 135948 distinct states, run finished after 1592 ms. (steps per millisecond=535 ) properties seen :5
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2023-03-12 16:14:48] [INFO ] Flatten gal took : 58 ms
[2023-03-12 16:14:48] [INFO ] Flatten gal took : 23 ms
[2023-03-12 16:14:48] [INFO ] Input system was already deterministic with 365 transitions.
Support contains 75 out of 230 places (down from 79) after GAL structural reductions.
Computed a total of 42 stabilizing places and 43 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 213 transition count 348
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 213 transition count 348
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 209 transition count 344
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 209 transition count 344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 208 transition count 343
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 208 transition count 343
Applied a total of 44 rules in 14 ms. Remains 208 /230 variables (removed 22) and now considering 343/365 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 208/230 places, 343/365 transitions.
[2023-03-12 16:14:48] [INFO ] Flatten gal took : 15 ms
[2023-03-12 16:14:48] [INFO ] Flatten gal took : 16 ms
[2023-03-12 16:14:48] [INFO ] Input system was already deterministic with 343 transitions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 212 transition count 347
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 212 transition count 347
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 208 transition count 343
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 208 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 207 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 207 transition count 342
Applied a total of 46 rules in 12 ms. Remains 207 /230 variables (removed 23) and now considering 342/365 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 207/230 places, 342/365 transitions.
[2023-03-12 16:14:48] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:14:48] [INFO ] Flatten gal took : 15 ms
[2023-03-12 16:14:48] [INFO ] Input system was already deterministic with 342 transitions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 213 transition count 348
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 213 transition count 348
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 209 transition count 344
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 209 transition count 344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 208 transition count 343
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 208 transition count 343
Applied a total of 44 rules in 23 ms. Remains 208 /230 variables (removed 22) and now considering 343/365 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 208/230 places, 343/365 transitions.
[2023-03-12 16:14:48] [INFO ] Flatten gal took : 18 ms
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 17 ms
[2023-03-12 16:14:49] [INFO ] Input system was already deterministic with 343 transitions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 217 transition count 352
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 217 transition count 352
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 213 transition count 348
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 213 transition count 348
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 212 transition count 347
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 212 transition count 347
Applied a total of 36 rules in 12 ms. Remains 212 /230 variables (removed 18) and now considering 347/365 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 212/230 places, 347/365 transitions.
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 13 ms
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 15 ms
[2023-03-12 16:14:49] [INFO ] Input system was already deterministic with 347 transitions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 212 transition count 347
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 212 transition count 347
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 208 transition count 343
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 208 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 207 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 207 transition count 342
Applied a total of 46 rules in 22 ms. Remains 207 /230 variables (removed 23) and now considering 342/365 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 207/230 places, 342/365 transitions.
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 17 ms
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:14:49] [INFO ] Input system was already deterministic with 342 transitions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 213 transition count 348
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 213 transition count 348
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 210 transition count 345
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 210 transition count 345
Applied a total of 40 rules in 8 ms. Remains 210 /230 variables (removed 20) and now considering 345/365 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 210/230 places, 345/365 transitions.
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 11 ms
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 12 ms
[2023-03-12 16:14:49] [INFO ] Input system was already deterministic with 345 transitions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 213 transition count 348
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 213 transition count 348
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 209 transition count 344
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 209 transition count 344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 208 transition count 343
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 208 transition count 343
Applied a total of 44 rules in 11 ms. Remains 208 /230 variables (removed 22) and now considering 343/365 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 208/230 places, 343/365 transitions.
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 12 ms
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 12 ms
[2023-03-12 16:14:49] [INFO ] Input system was already deterministic with 343 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Graph (trivial) has 208 edges and 230 vertex of which 4 / 230 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 227 transition count 273
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 118 rules applied. Total rules applied 208 place count 138 transition count 244
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 18 rules applied. Total rules applied 226 place count 121 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 120 transition count 243
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 227 place count 120 transition count 233
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 247 place count 110 transition count 233
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 254 place count 103 transition count 226
Iterating global reduction 4 with 7 rules applied. Total rules applied 261 place count 103 transition count 226
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 263 place count 101 transition count 220
Iterating global reduction 4 with 2 rules applied. Total rules applied 265 place count 101 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 267 place count 101 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 268 place count 100 transition count 218
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 330 place count 69 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 331 place count 69 transition count 186
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 337 place count 63 transition count 153
Iterating global reduction 7 with 6 rules applied. Total rules applied 343 place count 63 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 4 rules applied. Total rules applied 347 place count 63 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 349 place count 61 transition count 149
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 9 with 2 rules applied. Total rules applied 351 place count 60 transition count 148
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 353 place count 60 transition count 146
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 354 place count 60 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 355 place count 59 transition count 145
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 356 place count 59 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 357 place count 58 transition count 144
Applied a total of 357 rules in 44 ms. Remains 58 /230 variables (removed 172) and now considering 144/365 (removed 221) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 58/230 places, 144/365 transitions.
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:14:49] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 214 transition count 349
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 214 transition count 349
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 211 transition count 346
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 211 transition count 346
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 210 transition count 345
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 210 transition count 345
Applied a total of 40 rules in 10 ms. Remains 210 /230 variables (removed 20) and now considering 345/365 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 210/230 places, 345/365 transitions.
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 11 ms
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 35 ms
[2023-03-12 16:14:49] [INFO ] Input system was already deterministic with 345 transitions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 217 transition count 352
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 217 transition count 352
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 215 transition count 350
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 215 transition count 350
Applied a total of 30 rules in 9 ms. Remains 215 /230 variables (removed 15) and now considering 350/365 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 215/230 places, 350/365 transitions.
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 13 ms
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 12 ms
[2023-03-12 16:14:49] [INFO ] Input system was already deterministic with 350 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Graph (trivial) has 213 edges and 230 vertex of which 4 / 230 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 227 transition count 270
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 122 rules applied. Total rules applied 215 place count 135 transition count 240
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 20 rules applied. Total rules applied 235 place count 117 transition count 238
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 237 place count 115 transition count 238
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 237 place count 115 transition count 232
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 249 place count 109 transition count 232
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 258 place count 100 transition count 223
Iterating global reduction 4 with 9 rules applied. Total rules applied 267 place count 100 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 268 place count 100 transition count 222
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 268 place count 100 transition count 221
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 270 place count 99 transition count 221
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 273 place count 96 transition count 210
Iterating global reduction 5 with 3 rules applied. Total rules applied 276 place count 96 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 278 place count 96 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 279 place count 95 transition count 208
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 347 place count 61 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 348 place count 61 transition count 173
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 356 place count 53 transition count 128
Iterating global reduction 8 with 8 rules applied. Total rules applied 364 place count 53 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 6 rules applied. Total rules applied 370 place count 53 transition count 122
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 373 place count 50 transition count 122
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 10 with 2 rules applied. Total rules applied 375 place count 49 transition count 121
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 376 place count 49 transition count 120
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 378 place count 47 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 379 place count 46 transition count 118
Applied a total of 379 rules in 32 ms. Remains 46 /230 variables (removed 184) and now considering 118/365 (removed 247) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 46/230 places, 118/365 transitions.
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:14:49] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Graph (trivial) has 205 edges and 230 vertex of which 4 / 230 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 227 transition count 268
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 126 rules applied. Total rules applied 221 place count 133 transition count 236
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 240 place count 114 transition count 236
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 240 place count 114 transition count 229
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 254 place count 107 transition count 229
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 263 place count 98 transition count 220
Iterating global reduction 3 with 9 rules applied. Total rules applied 272 place count 98 transition count 220
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 272 place count 98 transition count 219
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 274 place count 97 transition count 219
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 277 place count 94 transition count 208
Iterating global reduction 3 with 3 rules applied. Total rules applied 280 place count 94 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 284 place count 94 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 286 place count 92 transition count 204
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 342 place count 64 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 343 place count 64 transition count 175
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 348 place count 59 transition count 148
Iterating global reduction 6 with 5 rules applied. Total rules applied 353 place count 59 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 6 rules applied. Total rules applied 359 place count 59 transition count 142
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 362 place count 56 transition count 142
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 8 with 2 rules applied. Total rules applied 364 place count 55 transition count 141
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 365 place count 55 transition count 140
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 367 place count 53 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 368 place count 52 transition count 138
Applied a total of 368 rules in 49 ms. Remains 52 /230 variables (removed 178) and now considering 138/365 (removed 227) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 52/230 places, 138/365 transitions.
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:14:49] [INFO ] Input system was already deterministic with 138 transitions.
Finished random walk after 43 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
FORMULA AutonomousCar-PT-05b-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 213 transition count 348
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 213 transition count 348
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 209 transition count 344
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 209 transition count 344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 208 transition count 343
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 208 transition count 343
Applied a total of 44 rules in 9 ms. Remains 208 /230 variables (removed 22) and now considering 343/365 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 208/230 places, 343/365 transitions.
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 11 ms
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 11 ms
[2023-03-12 16:14:49] [INFO ] Input system was already deterministic with 343 transitions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 213 transition count 348
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 213 transition count 348
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 210 transition count 345
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 210 transition count 345
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 209 transition count 344
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 209 transition count 344
Applied a total of 42 rules in 9 ms. Remains 209 /230 variables (removed 21) and now considering 344/365 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 209/230 places, 344/365 transitions.
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 11 ms
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 12 ms
[2023-03-12 16:14:49] [INFO ] Input system was already deterministic with 344 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Graph (trivial) has 210 edges and 230 vertex of which 4 / 230 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 227 transition count 271
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 121 rules applied. Total rules applied 213 place count 136 transition count 241
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 232 place count 118 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 233 place count 117 transition count 240
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 233 place count 117 transition count 232
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 249 place count 109 transition count 232
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 257 place count 101 transition count 224
Iterating global reduction 4 with 8 rules applied. Total rules applied 265 place count 101 transition count 224
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 268 place count 98 transition count 213
Iterating global reduction 4 with 3 rules applied. Total rules applied 271 place count 98 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 3 rules applied. Total rules applied 274 place count 98 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 275 place count 97 transition count 210
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 343 place count 63 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 344 place count 63 transition count 175
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 351 place count 56 transition count 136
Iterating global reduction 7 with 7 rules applied. Total rules applied 358 place count 56 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 5 rules applied. Total rules applied 363 place count 56 transition count 131
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 366 place count 54 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 367 place count 53 transition count 130
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 10 with 2 rules applied. Total rules applied 369 place count 52 transition count 129
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 370 place count 52 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 372 place count 50 transition count 126
Applied a total of 372 rules in 63 ms. Remains 50 /230 variables (removed 180) and now considering 126/365 (removed 239) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 50/230 places, 126/365 transitions.
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 11 ms
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 11 ms
[2023-03-12 16:14:49] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 365/365 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 212 transition count 347
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 212 transition count 347
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 208 transition count 343
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 208 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 207 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 207 transition count 342
Applied a total of 46 rules in 11 ms. Remains 207 /230 variables (removed 23) and now considering 342/365 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 207/230 places, 342/365 transitions.
[2023-03-12 16:14:49] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:14:50] [INFO ] Flatten gal took : 13 ms
[2023-03-12 16:14:50] [INFO ] Input system was already deterministic with 342 transitions.
[2023-03-12 16:14:50] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:14:50] [INFO ] Flatten gal took : 15 ms
[2023-03-12 16:14:50] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-03-12 16:14:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 230 places, 365 transitions and 1677 arcs took 3 ms.
Total runtime 14605 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/525/ctl_0_ --ctl=/tmp/525/ctl_1_ --ctl=/tmp/525/ctl_2_ --ctl=/tmp/525/ctl_3_ --ctl=/tmp/525/ctl_4_ --ctl=/tmp/525/ctl_5_ --ctl=/tmp/525/ctl_6_ --ctl=/tmp/525/ctl_7_ --ctl=/tmp/525/ctl_8_ --ctl=/tmp/525/ctl_9_ --ctl=/tmp/525/ctl_10_ --ctl=/tmp/525/ctl_11_ --ctl=/tmp/525/ctl_12_ --ctl=/tmp/525/ctl_13_ --ctl=/tmp/525/ctl_14_ --mu-par --mu-opt
FORMULA AutonomousCar-PT-05b-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05b-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678638780878

--------------------
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
ctl formula name AutonomousCar-PT-05b-CTLFireability-00
ctl formula formula --ctl=/tmp/525/ctl_0_
ctl formula name AutonomousCar-PT-05b-CTLFireability-01
ctl formula formula --ctl=/tmp/525/ctl_1_
ctl formula name AutonomousCar-PT-05b-CTLFireability-02
ctl formula formula --ctl=/tmp/525/ctl_2_
ctl formula name AutonomousCar-PT-05b-CTLFireability-03
ctl formula formula --ctl=/tmp/525/ctl_3_
ctl formula name AutonomousCar-PT-05b-CTLFireability-04
ctl formula formula --ctl=/tmp/525/ctl_4_
ctl formula name AutonomousCar-PT-05b-CTLFireability-05
ctl formula formula --ctl=/tmp/525/ctl_5_
ctl formula name AutonomousCar-PT-05b-CTLFireability-06
ctl formula formula --ctl=/tmp/525/ctl_6_
ctl formula name AutonomousCar-PT-05b-CTLFireability-07
ctl formula formula --ctl=/tmp/525/ctl_7_
ctl formula name AutonomousCar-PT-05b-CTLFireability-08
ctl formula formula --ctl=/tmp/525/ctl_8_
ctl formula name AutonomousCar-PT-05b-CTLFireability-09
ctl formula formula --ctl=/tmp/525/ctl_9_
ctl formula name AutonomousCar-PT-05b-CTLFireability-10
ctl formula formula --ctl=/tmp/525/ctl_10_
ctl formula name AutonomousCar-PT-05b-CTLFireability-12
ctl formula formula --ctl=/tmp/525/ctl_11_
ctl formula name AutonomousCar-PT-05b-CTLFireability-13
ctl formula formula --ctl=/tmp/525/ctl_12_
ctl formula name AutonomousCar-PT-05b-CTLFireability-14
ctl formula formula --ctl=/tmp/525/ctl_13_
ctl formula name AutonomousCar-PT-05b-CTLFireability-15
ctl formula formula --ctl=/tmp/525/ctl_14_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 230 places, 365 transitions and 1677 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 365->351 groups
pnml2lts-sym: Regrouping took 0.060 real 0.070 user 0.000 sys
pnml2lts-sym: state vector length is 230; there are 351 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 2146323 group checks and 0 next state calls
pnml2lts-sym: reachability took 31.320 real 125.080 user 0.040 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.020 real 0.080 user 0.000 sys
pnml2lts-sym: state space has 76360205956 states, 59657 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/525/ctl_14_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_0_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/525/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_4_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/525/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_5_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_13_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/525/ctl_7_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/525/ctl_12_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_6_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/525/ctl_11_ holds for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_10_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/525/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_8_ does not hold for the initial state
pnml2lts-sym: group_next: 4138 nodes total
pnml2lts-sym: group_explored: 6105 nodes, 29254 short vectors total
pnml2lts-sym: max token count: 1

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="AutonomousCar-PT-05b"
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 AutonomousCar-PT-05b, 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 r009-oct2-167813598100602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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