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-167813598200618.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-06b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200618
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 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:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:52 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 228K 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-06b-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678637930461

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-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:18:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:18:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:18:53] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-12 16:18:53] [INFO ] Transformed 289 places.
[2023-03-12 16:18:53] [INFO ] Transformed 644 transitions.
[2023-03-12 16:18:53] [INFO ] Found NUPN structural information;
[2023-03-12 16:18:53] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 90 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 257 transition count 612
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 257 transition count 612
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 208 place count 257 transition count 468
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 212 place count 253 transition count 464
Iterating global reduction 1 with 4 rules applied. Total rules applied 216 place count 253 transition count 464
Applied a total of 216 rules in 57 ms. Remains 253 /289 variables (removed 36) and now considering 464/644 (removed 180) transitions.
// Phase 1: matrix 464 rows 253 cols
[2023-03-12 16:18:53] [INFO ] Computed 11 place invariants in 11 ms
[2023-03-12 16:18:54] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 16:18:54] [INFO ] Invariant cache hit.
[2023-03-12 16:18:54] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
[2023-03-12 16:18:54] [INFO ] Invariant cache hit.
[2023-03-12 16:18:55] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/289 places, 464/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1430 ms. Remains : 253/289 places, 464/644 transitions.
Support contains 90 out of 253 places after structural reductions.
[2023-03-12 16:18:55] [INFO ] Flatten gal took : 135 ms
[2023-03-12 16:18:55] [INFO ] Flatten gal took : 35 ms
[2023-03-12 16:18:55] [INFO ] Input system was already deterministic with 464 transitions.
Support contains 88 out of 253 places (down from 90) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 75) seen :39
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 36) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 35) 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 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) 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 35) 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 35) 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 35) 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 35) 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 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) 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 35) 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 35) 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 35) 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 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) 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 35) seen :1
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 1001 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
Running SMT prover for 34 properties.
[2023-03-12 16:18:56] [INFO ] Invariant cache hit.
[2023-03-12 16:18:56] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:18:56] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:33
[2023-03-12 16:18:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-12 16:18:58] [INFO ] After 1415ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :24
[2023-03-12 16:18:58] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 6 ms to minimize.
[2023-03-12 16:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2023-03-12 16:18:59] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 3 ms to minimize.
[2023-03-12 16:18:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-12 16:19:00] [INFO ] After 3226ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :24
Attempting to minimize the solution found.
Minimization took 1017 ms.
[2023-03-12 16:19:01] [INFO ] After 4720ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :24
Fused 34 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 301 ms.
Support contains 44 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 464/464 transitions.
Graph (trivial) has 175 edges and 253 vertex of which 4 / 253 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 888 edges and 251 vertex of which 244 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 244 transition count 377
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 104 rules applied. Total rules applied 184 place count 168 transition count 349
Reduce places removed 16 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 20 rules applied. Total rules applied 204 place count 152 transition count 345
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 210 place count 148 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 211 place count 147 transition count 343
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 211 place count 147 transition count 335
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 227 place count 139 transition count 335
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 232 place count 134 transition count 330
Iterating global reduction 5 with 5 rules applied. Total rules applied 237 place count 134 transition count 330
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 238 place count 133 transition count 329
Iterating global reduction 5 with 1 rules applied. Total rules applied 239 place count 133 transition count 329
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 299 place count 103 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 300 place count 103 transition count 298
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 6 with 2 rules applied. Total rules applied 302 place count 102 transition count 297
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 305 place count 102 transition count 294
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 320 place count 102 transition count 279
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 335 place count 87 transition count 279
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 339 place count 87 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 340 place count 86 transition count 278
Applied a total of 340 rules in 123 ms. Remains 86 /253 variables (removed 167) and now considering 278/464 (removed 186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 86/253 places, 278/464 transitions.
Incomplete random walk after 10000 steps, including 337 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 24) seen :8
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :2
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 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 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 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 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 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 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 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
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 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 278 rows 86 cols
[2023-03-12 16:19:02] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:19:02] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:19:02] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-12 16:19:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-12 16:19:03] [INFO ] After 578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-12 16:19:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:03] [INFO ] After 496ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-12 16:19:04] [INFO ] After 1212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 503 ms.
[2023-03-12 16:19:05] [INFO ] After 2531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 81 ms.
Support contains 38 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 278/278 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 86 transition count 274
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 82 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 81 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 81 transition count 272
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 80 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 79 transition count 271
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 79 transition count 269
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 18 place count 77 transition count 269
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 20 place count 77 transition count 269
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 21 place count 76 transition count 262
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 76 transition count 262
Applied a total of 22 rules in 33 ms. Remains 76 /86 variables (removed 10) and now considering 262/278 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 76/86 places, 262/278 transitions.
Incomplete random walk after 10000 steps, including 345 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :2
Running SMT prover for 4 properties.
// Phase 1: matrix 262 rows 76 cols
[2023-03-12 16:19:05] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:19:05] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:19:06] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:19:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:19:06] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 16:19:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:06] [INFO ] After 124ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 16:19:06] [INFO ] After 333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 226 ms.
[2023-03-12 16:19:06] [INFO ] After 823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 11 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 262/262 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 258
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 72 transition count 258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 72 transition count 257
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 10 place count 71 transition count 257
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 68 transition count 244
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 68 transition count 244
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 2 with 3 rules applied. Total rules applied 19 place count 68 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 67 transition count 241
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 34 place count 60 transition count 234
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 35 place count 59 transition count 227
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 59 transition count 227
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 46 place count 54 transition count 222
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 51 place count 54 transition count 217
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 62 place count 49 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 63 place count 48 transition count 210
Applied a total of 63 rules in 66 ms. Remains 48 /76 variables (removed 28) and now considering 210/262 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 48/76 places, 210/262 transitions.
Incomplete random walk after 10000 steps, including 262 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 210 rows 48 cols
[2023-03-12 16:19:07] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 16:19:07] [INFO ] [Real]Absence check using 11 positive place invariants in 26 ms returned sat
[2023-03-12 16:19:07] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:19:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:19:07] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:19:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:07] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:19:07] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-12 16:19:07] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 210/210 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 46 transition count 197
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 46 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 46 transition count 196
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 46 transition count 193
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 23 place count 43 transition count 181
Applied a total of 23 rules in 11 ms. Remains 43 /48 variables (removed 5) and now considering 181/210 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 43/48 places, 181/210 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 119500 steps, run visited all 1 properties in 174 ms. (steps per millisecond=686 )
Probabilistic random walk after 119500 steps, saw 20088 distinct states, run finished after 175 ms. (steps per millisecond=682 ) properties seen :1
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
[2023-03-12 16:19:07] [INFO ] Flatten gal took : 26 ms
[2023-03-12 16:19:07] [INFO ] Flatten gal took : 53 ms
[2023-03-12 16:19:08] [INFO ] Input system was already deterministic with 464 transitions.
Computed a total of 44 stabilizing places and 45 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 242 transition count 453
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 242 transition count 453
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 237 transition count 448
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 236 transition count 447
Applied a total of 34 rules in 11 ms. Remains 236 /253 variables (removed 17) and now considering 447/464 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 236/253 places, 447/464 transitions.
[2023-03-12 16:19:08] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:19:08] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:19:08] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 242 transition count 453
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 242 transition count 453
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 238 transition count 449
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 238 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 237 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 237 transition count 448
Applied a total of 32 rules in 10 ms. Remains 237 /253 variables (removed 16) and now considering 448/464 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 237/253 places, 448/464 transitions.
[2023-03-12 16:19:08] [INFO ] Flatten gal took : 20 ms
[2023-03-12 16:19:08] [INFO ] Flatten gal took : 20 ms
[2023-03-12 16:19:08] [INFO ] Input system was already deterministic with 448 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Graph (trivial) has 236 edges and 253 vertex of which 4 / 253 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 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 250 transition count 360
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 136 rules applied. Total rules applied 238 place count 149 transition count 325
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 258 place count 129 transition count 325
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 258 place count 129 transition count 319
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 270 place count 123 transition count 319
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 277 place count 116 transition count 312
Iterating global reduction 3 with 7 rules applied. Total rules applied 284 place count 116 transition count 312
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 287 place count 113 transition count 299
Iterating global reduction 3 with 3 rules applied. Total rules applied 290 place count 113 transition count 299
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 294 place count 113 transition count 295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 296 place count 111 transition count 295
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 378 place count 70 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 379 place count 70 transition count 253
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 386 place count 63 transition count 206
Iterating global reduction 6 with 7 rules applied. Total rules applied 393 place count 63 transition count 206
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 6 with 4 rules applied. Total rules applied 397 place count 63 transition count 202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 399 place count 61 transition count 202
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 401 place count 60 transition count 201
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 402 place count 60 transition count 200
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 403 place count 60 transition count 200
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 405 place count 58 transition count 198
Applied a total of 405 rules in 76 ms. Remains 58 /253 variables (removed 195) and now considering 198/464 (removed 266) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 58/253 places, 198/464 transitions.
[2023-03-12 16:19:08] [INFO ] Flatten gal took : 17 ms
[2023-03-12 16:19:08] [INFO ] Flatten gal took : 16 ms
[2023-03-12 16:19:08] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Graph (trivial) has 238 edges and 253 vertex of which 4 / 253 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 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 250 transition count 360
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 137 rules applied. Total rules applied 239 place count 149 transition count 324
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 260 place count 128 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 260 place count 128 transition count 318
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 272 place count 122 transition count 318
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 279 place count 115 transition count 311
Iterating global reduction 3 with 7 rules applied. Total rules applied 286 place count 115 transition count 311
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 289 place count 112 transition count 298
Iterating global reduction 3 with 3 rules applied. Total rules applied 292 place count 112 transition count 298
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 296 place count 112 transition count 294
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 298 place count 110 transition count 294
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 380 place count 69 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 381 place count 69 transition count 252
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 390 place count 60 transition count 193
Iterating global reduction 6 with 9 rules applied. Total rules applied 399 place count 60 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 6 with 8 rules applied. Total rules applied 407 place count 60 transition count 185
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 411 place count 56 transition count 185
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 413 place count 55 transition count 184
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 414 place count 55 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 416 place count 53 transition count 181
Applied a total of 416 rules in 60 ms. Remains 53 /253 variables (removed 200) and now considering 181/464 (removed 283) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 53/253 places, 181/464 transitions.
[2023-03-12 16:19:08] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:19:08] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:19:08] [INFO ] Input system was already deterministic with 181 transitions.
Incomplete random walk after 10000 steps, including 564 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 155995 steps, run visited all 1 properties in 178 ms. (steps per millisecond=876 )
Probabilistic random walk after 155995 steps, saw 27866 distinct states, run finished after 178 ms. (steps per millisecond=876 ) properties seen :1
FORMULA AutonomousCar-PT-06b-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 241 transition count 452
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 241 transition count 452
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 236 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 235 transition count 446
Applied a total of 36 rules in 52 ms. Remains 235 /253 variables (removed 18) and now considering 446/464 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 235/253 places, 446/464 transitions.
[2023-03-12 16:19:08] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:19:08] [INFO ] Flatten gal took : 20 ms
[2023-03-12 16:19:08] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 241 transition count 452
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 241 transition count 452
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 236 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 235 transition count 446
Applied a total of 36 rules in 24 ms. Remains 235 /253 variables (removed 18) and now considering 446/464 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 235/253 places, 446/464 transitions.
[2023-03-12 16:19:08] [INFO ] Flatten gal took : 30 ms
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 31 ms
[2023-03-12 16:19:09] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 242 transition count 453
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 242 transition count 453
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 238 transition count 449
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 238 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 237 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 237 transition count 448
Applied a total of 32 rules in 29 ms. Remains 237 /253 variables (removed 16) and now considering 448/464 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 237/253 places, 448/464 transitions.
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 30 ms
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 30 ms
[2023-03-12 16:19:09] [INFO ] Input system was already deterministic with 448 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 241 transition count 452
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 241 transition count 452
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 236 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 235 transition count 446
Applied a total of 36 rules in 22 ms. Remains 235 /253 variables (removed 18) and now considering 446/464 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 235/253 places, 446/464 transitions.
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 16 ms
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 17 ms
[2023-03-12 16:19:09] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 241 transition count 452
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 241 transition count 452
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 236 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 235 transition count 446
Applied a total of 36 rules in 11 ms. Remains 235 /253 variables (removed 18) and now considering 446/464 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 235/253 places, 446/464 transitions.
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 16 ms
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 18 ms
[2023-03-12 16:19:09] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 242 transition count 453
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 242 transition count 453
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 237 transition count 448
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 236 transition count 447
Applied a total of 34 rules in 11 ms. Remains 236 /253 variables (removed 17) and now considering 447/464 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 236/253 places, 447/464 transitions.
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 16 ms
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 17 ms
[2023-03-12 16:19:09] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 241 transition count 452
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 241 transition count 452
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 236 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 235 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 235 transition count 446
Applied a total of 36 rules in 11 ms. Remains 235 /253 variables (removed 18) and now considering 446/464 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 235/253 places, 446/464 transitions.
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 17 ms
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 23 ms
[2023-03-12 16:19:09] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Graph (trivial) has 233 edges and 253 vertex of which 4 / 253 are part of one of the 2 SCC in 4 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 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 250 transition count 361
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 136 rules applied. Total rules applied 237 place count 150 transition count 325
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 259 place count 129 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 260 place count 128 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 260 place count 128 transition count 318
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 272 place count 122 transition count 318
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 279 place count 115 transition count 311
Iterating global reduction 4 with 7 rules applied. Total rules applied 286 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 287 place count 114 transition count 310
Iterating global reduction 4 with 1 rules applied. Total rules applied 288 place count 114 transition count 310
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 370 place count 73 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 371 place count 73 transition count 268
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 379 place count 65 transition count 214
Iterating global reduction 5 with 8 rules applied. Total rules applied 387 place count 65 transition count 214
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 5 with 4 rules applied. Total rules applied 391 place count 65 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 393 place count 63 transition count 210
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 395 place count 62 transition count 209
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 396 place count 62 transition count 208
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 399 place count 62 transition count 208
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 401 place count 60 transition count 206
Applied a total of 401 rules in 43 ms. Remains 60 /253 variables (removed 193) and now considering 206/464 (removed 258) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 60/253 places, 206/464 transitions.
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:19:09] [INFO ] Input system was already deterministic with 206 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 242 transition count 453
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 242 transition count 453
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 237 transition count 448
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 236 transition count 447
Applied a total of 34 rules in 24 ms. Remains 236 /253 variables (removed 17) and now considering 447/464 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 236/253 places, 447/464 transitions.
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 18 ms
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 19 ms
[2023-03-12 16:19:09] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Graph (trivial) has 239 edges and 253 vertex of which 4 / 253 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 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 250 transition count 359
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 138 rules applied. Total rules applied 241 place count 148 transition count 323
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 262 place count 127 transition count 323
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 262 place count 127 transition count 317
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 274 place count 121 transition count 317
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 281 place count 114 transition count 310
Iterating global reduction 3 with 7 rules applied. Total rules applied 288 place count 114 transition count 310
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 291 place count 111 transition count 297
Iterating global reduction 3 with 3 rules applied. Total rules applied 294 place count 111 transition count 297
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 298 place count 111 transition count 293
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 300 place count 109 transition count 293
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 382 place count 68 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 383 place count 68 transition count 251
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 392 place count 59 transition count 191
Iterating global reduction 6 with 9 rules applied. Total rules applied 401 place count 59 transition count 191
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 407 place count 59 transition count 185
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 410 place count 56 transition count 185
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 412 place count 55 transition count 184
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 413 place count 55 transition count 183
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 414 place count 55 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 416 place count 53 transition count 181
Applied a total of 416 rules in 39 ms. Remains 53 /253 variables (removed 200) and now considering 181/464 (removed 283) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 53/253 places, 181/464 transitions.
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:19:09] [INFO ] Flatten gal took : 13 ms
[2023-03-12 16:19:10] [INFO ] Input system was already deterministic with 181 transitions.
Finished random walk after 61 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
FORMULA AutonomousCar-PT-06b-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 242 transition count 453
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 242 transition count 453
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 237 transition count 448
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 236 transition count 447
Applied a total of 34 rules in 10 ms. Remains 236 /253 variables (removed 17) and now considering 447/464 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 236/253 places, 447/464 transitions.
[2023-03-12 16:19:10] [INFO ] Flatten gal took : 16 ms
[2023-03-12 16:19:10] [INFO ] Flatten gal took : 16 ms
[2023-03-12 16:19:10] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 464/464 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 242 transition count 453
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 242 transition count 453
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 237 transition count 448
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 236 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 236 transition count 447
Applied a total of 34 rules in 8 ms. Remains 236 /253 variables (removed 17) and now considering 447/464 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 236/253 places, 447/464 transitions.
[2023-03-12 16:19:10] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:19:10] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:19:10] [INFO ] Input system was already deterministic with 447 transitions.
[2023-03-12 16:19:10] [INFO ] Flatten gal took : 34 ms
[2023-03-12 16:19:10] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:19:10] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-12 16:19:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 253 places, 464 transitions and 2588 arcs took 2 ms.
Total runtime 16932 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/521/ctl_0_ --ctl=/tmp/521/ctl_1_ --ctl=/tmp/521/ctl_2_ --ctl=/tmp/521/ctl_3_ --ctl=/tmp/521/ctl_4_ --ctl=/tmp/521/ctl_5_ --ctl=/tmp/521/ctl_6_ --ctl=/tmp/521/ctl_7_ --ctl=/tmp/521/ctl_8_ --ctl=/tmp/521/ctl_9_ --ctl=/tmp/521/ctl_10_ --ctl=/tmp/521/ctl_11_ --ctl=/tmp/521/ctl_12_ --ctl=/tmp/521/ctl_13_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393236 kB
MemFree: 203296 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16098328 kB
FORMULA AutonomousCar-PT-06b-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06b-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06b-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06b-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-05
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-06
FORMULA AutonomousCar-PT-06b-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06b-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-09
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-10
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-11
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-12
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-14
FORMULA AutonomousCar-PT-06b-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678641522069

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name AutonomousCar-PT-06b-CTLFireability-00
ctl formula formula --ctl=/tmp/521/ctl_0_
ctl formula name AutonomousCar-PT-06b-CTLFireability-01
ctl formula formula --ctl=/tmp/521/ctl_1_
ctl formula name AutonomousCar-PT-06b-CTLFireability-02
ctl formula formula --ctl=/tmp/521/ctl_2_
ctl formula name AutonomousCar-PT-06b-CTLFireability-04
ctl formula formula --ctl=/tmp/521/ctl_3_
ctl formula name AutonomousCar-PT-06b-CTLFireability-05
ctl formula formula --ctl=/tmp/521/ctl_4_
ctl formula name AutonomousCar-PT-06b-CTLFireability-06
ctl formula formula --ctl=/tmp/521/ctl_5_
ctl formula name AutonomousCar-PT-06b-CTLFireability-07
ctl formula formula --ctl=/tmp/521/ctl_6_
ctl formula name AutonomousCar-PT-06b-CTLFireability-08
ctl formula formula --ctl=/tmp/521/ctl_7_
ctl formula name AutonomousCar-PT-06b-CTLFireability-09
ctl formula formula --ctl=/tmp/521/ctl_8_
ctl formula name AutonomousCar-PT-06b-CTLFireability-10
ctl formula formula --ctl=/tmp/521/ctl_9_
ctl formula name AutonomousCar-PT-06b-CTLFireability-11
ctl formula formula --ctl=/tmp/521/ctl_10_
ctl formula name AutonomousCar-PT-06b-CTLFireability-12
ctl formula formula --ctl=/tmp/521/ctl_11_
ctl formula name AutonomousCar-PT-06b-CTLFireability-14
ctl formula formula --ctl=/tmp/521/ctl_12_
ctl formula name AutonomousCar-PT-06b-CTLFireability-15
ctl formula formula --ctl=/tmp/521/ctl_13_
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 253 places, 464 transitions and 2588 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 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: 464->448 groups
pnml2lts-sym: Regrouping took 0.110 real 0.100 user 0.000 sys
pnml2lts-sym: state vector length is 253; there are 448 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 18579056 group checks and 0 next state calls
pnml2lts-sym: reachability took 405.430 real 1620.290 user 0.270 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.050 real 0.190 user 0.000 sys
pnml2lts-sym: state space has 1605440653476 states, 130695 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/521/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/521/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/521/ctl_3_ does not hold 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: 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/521/ctl_0_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/521/ctl_6_ 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/521/ctl_7_ holds for the initial state
pnml2lts-sym: Formula /tmp/521/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: 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: 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
Killing (15) : 527
Killing (9) : 527

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-06b"
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-06b, 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-167813598200618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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