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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K 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 111K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K 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 334K 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-07b-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678638742680

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-07b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:32:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:32:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:32:25] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-12 16:32:25] [INFO ] Transformed 323 places.
[2023-03-12 16:32:25] [INFO ] Transformed 846 transitions.
[2023-03-12 16:32:25] [INFO ] Found NUPN structural information;
[2023-03-12 16:32:25] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 74 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 282 transition count 805
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 282 transition count 805
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 278 place count 282 transition count 609
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 286 place count 274 transition count 601
Iterating global reduction 1 with 8 rules applied. Total rules applied 294 place count 274 transition count 601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 295 place count 273 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 296 place count 273 transition count 600
Applied a total of 296 rules in 69 ms. Remains 273 /323 variables (removed 50) and now considering 600/846 (removed 246) transitions.
// Phase 1: matrix 600 rows 273 cols
[2023-03-12 16:32:25] [INFO ] Computed 12 place invariants in 14 ms
[2023-03-12 16:32:25] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-12 16:32:25] [INFO ] Invariant cache hit.
[2023-03-12 16:32:26] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
[2023-03-12 16:32:26] [INFO ] Invariant cache hit.
[2023-03-12 16:32:26] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 273/323 places, 600/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1363 ms. Remains : 273/323 places, 600/846 transitions.
Support contains 74 out of 273 places after structural reductions.
[2023-03-12 16:32:26] [INFO ] Flatten gal took : 100 ms
[2023-03-12 16:32:27] [INFO ] Flatten gal took : 55 ms
[2023-03-12 16:32:27] [INFO ] Input system was already deterministic with 600 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 65) seen :27
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 38) 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 38) 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 38) 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 38) 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 38) 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 38) 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 38) 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 38) 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 38) 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 38) 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 38) 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 38) 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 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) 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 37) 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 37) 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 37) 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 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 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) 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 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 37) 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 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 37) 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 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) 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 37) 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 37) 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 37) 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 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 37) 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 37) 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 37) 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 37) seen :0
Running SMT prover for 37 properties.
[2023-03-12 16:32:27] [INFO ] Invariant cache hit.
[2023-03-12 16:32:28] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 16:32:29] [INFO ] After 759ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:36
[2023-03-12 16:32:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-12 16:32:31] [INFO ] After 1964ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :30
[2023-03-12 16:32:32] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 13 ms to minimize.
[2023-03-12 16:32:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 355 ms
[2023-03-12 16:32:34] [INFO ] Deduced a trap composed of 33 places in 324 ms of which 2 ms to minimize.
[2023-03-12 16:32:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2023-03-12 16:32:34] [INFO ] Deduced a trap composed of 31 places in 382 ms of which 2 ms to minimize.
[2023-03-12 16:32:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 423 ms
[2023-03-12 16:32:35] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 3 ms to minimize.
[2023-03-12 16:32:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 377 ms
[2023-03-12 16:32:36] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 2 ms to minimize.
[2023-03-12 16:32:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2023-03-12 16:32:36] [INFO ] After 6466ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :30
Attempting to minimize the solution found.
Minimization took 1696 ms.
[2023-03-12 16:32:38] [INFO ] After 8922ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :30
Fused 37 Parikh solutions to 30 different solutions.
Parikh walk visited 0 properties in 219 ms.
Support contains 42 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 600/600 transitions.
Graph (trivial) has 200 edges and 273 vertex of which 4 / 273 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 1092 edges and 271 vertex of which 269 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 87 rules applied. Total rules applied 89 place count 269 transition count 509
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 117 rules applied. Total rules applied 206 place count 184 transition count 477
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 224 place count 166 transition count 477
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 224 place count 166 transition count 465
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 248 place count 154 transition count 465
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 251 place count 151 transition count 462
Iterating global reduction 3 with 3 rules applied. Total rules applied 254 place count 151 transition count 462
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 255 place count 151 transition count 461
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 256 place count 150 transition count 460
Iterating global reduction 4 with 1 rules applied. Total rules applied 257 place count 150 transition count 460
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 339 place count 109 transition count 419
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 342 place count 106 transition count 404
Iterating global reduction 4 with 3 rules applied. Total rules applied 345 place count 106 transition count 404
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 347 place count 106 transition count 402
Free-agglomeration rule applied 19 times.
Iterating global reduction 5 with 19 rules applied. Total rules applied 366 place count 106 transition count 383
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 385 place count 87 transition count 383
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 389 place count 87 transition count 379
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 394 place count 87 transition count 379
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 395 place count 86 transition count 378
Applied a total of 395 rules in 201 ms. Remains 86 /273 variables (removed 187) and now considering 378/600 (removed 222) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 86/273 places, 378/600 transitions.
Incomplete random walk after 10000 steps, including 314 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 30) seen :5
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) 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 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) 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 22) 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 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 378 rows 86 cols
[2023-03-12 16:32:39] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:32:39] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-12 16:32:39] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-12 16:32:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-12 16:32:40] [INFO ] After 1128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-12 16:32:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:32:41] [INFO ] After 1038ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-12 16:32:42] [INFO ] After 2140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 1044 ms.
[2023-03-12 16:32:43] [INFO ] After 4596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 0 properties in 47 ms.
Support contains 38 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 378/378 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 85 transition count 377
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 83 transition count 375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 82 transition count 374
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 81 transition count 373
Applied a total of 9 rules in 34 ms. Remains 81 /86 variables (removed 5) and now considering 373/378 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 81/86 places, 373/378 transitions.
Incomplete random walk after 10000 steps, including 358 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 21) seen :4
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 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 4 ms. (steps per millisecond=250 ) properties (out of 16) 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 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 :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 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 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 373 rows 81 cols
[2023-03-12 16:32:44] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:32:44] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 16:32:44] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-12 16:32:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:32:45] [INFO ] After 737ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-12 16:32:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:32:46] [INFO ] After 581ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-12 16:32:47] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 13 ms to minimize.
[2023-03-12 16:32:47] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2023-03-12 16:32:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 393 ms
[2023-03-12 16:32:47] [INFO ] After 1948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 851 ms.
[2023-03-12 16:32:48] [INFO ] After 3694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 217 ms.
Support contains 33 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 373/373 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 0 with 2 rules applied. Total rules applied 2 place count 81 transition count 371
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 79 transition count 371
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 78 transition count 364
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 78 transition count 364
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 78 transition count 363
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 78 transition count 360
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 13 place count 75 transition count 360
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 75 transition count 360
Applied a total of 14 rules in 41 ms. Remains 75 /81 variables (removed 6) and now considering 360/373 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 75/81 places, 360/373 transitions.
Incomplete random walk after 10000 steps, including 354 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 360 rows 75 cols
[2023-03-12 16:32:49] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:32:49] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:32:49] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:32:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:32:50] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 16:32:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:32:50] [INFO ] After 382ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 16:32:50] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 0 ms to minimize.
[2023-03-12 16:32:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-12 16:32:51] [INFO ] After 880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 311 ms.
[2023-03-12 16:32:51] [INFO ] After 1526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 12 ms.
Support contains 20 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 360/360 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 74 transition count 353
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 74 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 74 transition count 352
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 1 with 10 rules applied. Total rules applied 13 place count 69 transition count 347
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 1 with 2 rules applied. Total rules applied 15 place count 68 transition count 346
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 68 transition count 342
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 64 transition count 342
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 64 transition count 342
Applied a total of 24 rules in 31 ms. Remains 64 /75 variables (removed 11) and now considering 342/360 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 64/75 places, 342/360 transitions.
Incomplete random walk after 10000 steps, including 276 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 342 rows 64 cols
[2023-03-12 16:32:51] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:32:51] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:32:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-12 16:32:52] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 16:32:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:32:52] [INFO ] After 139ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 16:32:52] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 206 ms.
[2023-03-12 16:32:52] [INFO ] After 809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 26 ms.
Support contains 19 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 342/342 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 341
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 63 transition count 334
Applied a total of 9 rules in 18 ms. Remains 63 /64 variables (removed 1) and now considering 334/342 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 63/64 places, 334/342 transitions.
Incomplete random walk after 10000 steps, including 216 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 775598 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{0=1, 1=1, 2=1}
Probabilistic random walk after 775598 steps, saw 122542 distinct states, run finished after 3004 ms. (steps per millisecond=258 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 334 rows 63 cols
[2023-03-12 16:32:55] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:32:56] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:32:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 26 ms returned sat
[2023-03-12 16:32:56] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:32:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:32:56] [INFO ] After 97ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:32:56] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 1 ms to minimize.
[2023-03-12 16:32:56] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2023-03-12 16:32:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 527 ms
[2023-03-12 16:32:57] [INFO ] After 694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-12 16:32:57] [INFO ] After 1041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 15 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 334/334 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 333
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 61 transition count 325
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 61 transition count 325
Applied a total of 4 rules in 38 ms. Remains 61 /63 variables (removed 2) and now considering 325/334 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 61/63 places, 325/334 transitions.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2109727 steps, run timeout after 3001 ms. (steps per millisecond=703 ) properties seen :{}
Probabilistic random walk after 2109727 steps, saw 303727 distinct states, run finished after 3007 ms. (steps per millisecond=701 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 325 rows 61 cols
[2023-03-12 16:33:00] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-12 16:33:00] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:33:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:33:00] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:33:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:33:00] [INFO ] After 89ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:33:00] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2023-03-12 16:33:00] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 13 ms to minimize.
[2023-03-12 16:33:01] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 1 ms to minimize.
[2023-03-12 16:33:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 561 ms
[2023-03-12 16:33:01] [INFO ] After 695ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-12 16:33:01] [INFO ] After 932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 325/325 transitions.
Applied a total of 0 rules in 29 ms. Remains 61 /61 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 61/61 places, 325/325 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 325/325 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2023-03-12 16:33:01] [INFO ] Invariant cache hit.
[2023-03-12 16:33:01] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-12 16:33:01] [INFO ] Invariant cache hit.
[2023-03-12 16:33:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:33:01] [INFO ] Implicit Places using invariants and state equation in 224 ms returned [56, 60]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 341 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/61 places, 324/325 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 323
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 58 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 57 transition count 322
Applied a total of 4 rules in 23 ms. Remains 57 /59 variables (removed 2) and now considering 322/324 (removed 2) transitions.
// Phase 1: matrix 322 rows 57 cols
[2023-03-12 16:33:01] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:33:01] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-12 16:33:01] [INFO ] Invariant cache hit.
[2023-03-12 16:33:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:33:01] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 57/61 places, 322/325 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 636 ms. Remains : 57/61 places, 322/325 transitions.
Incomplete random walk after 10000 steps, including 121 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2043274 steps, run visited all 1 properties in 2928 ms. (steps per millisecond=697 )
Probabilistic random walk after 2043274 steps, saw 306927 distinct states, run finished after 2928 ms. (steps per millisecond=697 ) properties seen :1
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-07b-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:33:04] [INFO ] Flatten gal took : 34 ms
[2023-03-12 16:33:04] [INFO ] Flatten gal took : 36 ms
[2023-03-12 16:33:05] [INFO ] Input system was already deterministic with 600 transitions.
Computed a total of 45 stabilizing places and 46 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 265 transition count 592
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 265 transition count 592
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 263 transition count 590
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 263 transition count 590
Applied a total of 20 rules in 8 ms. Remains 263 /273 variables (removed 10) and now considering 590/600 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 263/273 places, 590/600 transitions.
[2023-03-12 16:33:05] [INFO ] Flatten gal took : 31 ms
[2023-03-12 16:33:05] [INFO ] Flatten gal took : 44 ms
[2023-03-12 16:33:05] [INFO ] Input system was already deterministic with 590 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 265 transition count 592
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 265 transition count 592
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 263 transition count 590
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 263 transition count 590
Applied a total of 20 rules in 21 ms. Remains 263 /273 variables (removed 10) and now considering 590/600 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 263/273 places, 590/600 transitions.
[2023-03-12 16:33:05] [INFO ] Flatten gal took : 40 ms
[2023-03-12 16:33:05] [INFO ] Flatten gal took : 39 ms
[2023-03-12 16:33:05] [INFO ] Input system was already deterministic with 590 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Graph (trivial) has 244 edges and 273 vertex of which 4 / 273 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 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 270 transition count 493
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 146 rules applied. Total rules applied 251 place count 166 transition count 451
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 276 place count 141 transition count 451
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 276 place count 141 transition count 445
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 288 place count 135 transition count 445
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 293 place count 130 transition count 440
Iterating global reduction 3 with 5 rules applied. Total rules applied 298 place count 130 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 299 place count 130 transition count 439
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 301 place count 128 transition count 431
Iterating global reduction 4 with 2 rules applied. Total rules applied 303 place count 128 transition count 431
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 305 place count 128 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 306 place count 127 transition count 429
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 6 with 82 rules applied. Total rules applied 388 place count 86 transition count 388
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 398 place count 76 transition count 321
Iterating global reduction 6 with 10 rules applied. Total rules applied 408 place count 76 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 6 with 12 rules applied. Total rules applied 420 place count 76 transition count 309
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 426 place count 70 transition count 309
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 427 place count 70 transition count 308
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 429 place count 68 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 430 place count 67 transition count 306
Applied a total of 430 rules in 99 ms. Remains 67 /273 variables (removed 206) and now considering 306/600 (removed 294) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 99 ms. Remains : 67/273 places, 306/600 transitions.
[2023-03-12 16:33:05] [INFO ] Flatten gal took : 37 ms
[2023-03-12 16:33:05] [INFO ] Flatten gal took : 43 ms
[2023-03-12 16:33:05] [INFO ] Input system was already deterministic with 306 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 265 transition count 592
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 265 transition count 592
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 263 transition count 590
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 263 transition count 590
Applied a total of 20 rules in 9 ms. Remains 263 /273 variables (removed 10) and now considering 590/600 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 263/273 places, 590/600 transitions.
[2023-03-12 16:33:05] [INFO ] Flatten gal took : 29 ms
[2023-03-12 16:33:05] [INFO ] Flatten gal took : 28 ms
[2023-03-12 16:33:05] [INFO ] Input system was already deterministic with 590 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 267 transition count 594
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 267 transition count 594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 266 transition count 593
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 266 transition count 593
Applied a total of 14 rules in 8 ms. Remains 266 /273 variables (removed 7) and now considering 593/600 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 266/273 places, 593/600 transitions.
[2023-03-12 16:33:05] [INFO ] Flatten gal took : 25 ms
[2023-03-12 16:33:05] [INFO ] Flatten gal took : 38 ms
[2023-03-12 16:33:05] [INFO ] Input system was already deterministic with 593 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 266 transition count 593
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 266 transition count 593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 264 transition count 591
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 264 transition count 591
Applied a total of 18 rules in 8 ms. Remains 264 /273 variables (removed 9) and now considering 591/600 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 264/273 places, 591/600 transitions.
[2023-03-12 16:33:06] [INFO ] Flatten gal took : 25 ms
[2023-03-12 16:33:06] [INFO ] Flatten gal took : 26 ms
[2023-03-12 16:33:06] [INFO ] Input system was already deterministic with 591 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 265 transition count 592
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 265 transition count 592
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 263 transition count 590
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 263 transition count 590
Applied a total of 20 rules in 9 ms. Remains 263 /273 variables (removed 10) and now considering 590/600 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 263/273 places, 590/600 transitions.
[2023-03-12 16:33:06] [INFO ] Flatten gal took : 24 ms
[2023-03-12 16:33:06] [INFO ] Flatten gal took : 28 ms
[2023-03-12 16:33:06] [INFO ] Input system was already deterministic with 590 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Graph (trivial) has 237 edges and 273 vertex of which 4 / 273 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 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 270 transition count 498
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 141 rules applied. Total rules applied 241 place count 171 transition count 456
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 267 place count 146 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 268 place count 145 transition count 455
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 268 place count 145 transition count 447
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 284 place count 137 transition count 447
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 289 place count 132 transition count 442
Iterating global reduction 4 with 5 rules applied. Total rules applied 294 place count 132 transition count 442
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 295 place count 132 transition count 441
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 297 place count 130 transition count 433
Iterating global reduction 5 with 2 rules applied. Total rules applied 299 place count 130 transition count 433
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 301 place count 130 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 302 place count 129 transition count 431
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 382 place count 89 transition count 391
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 390 place count 81 transition count 339
Iterating global reduction 7 with 8 rules applied. Total rules applied 398 place count 81 transition count 339
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 10 rules applied. Total rules applied 408 place count 81 transition count 329
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 413 place count 76 transition count 329
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 414 place count 76 transition count 328
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 415 place count 76 transition count 328
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 417 place count 74 transition count 326
Applied a total of 417 rules in 74 ms. Remains 74 /273 variables (removed 199) and now considering 326/600 (removed 274) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 74/273 places, 326/600 transitions.
[2023-03-12 16:33:06] [INFO ] Flatten gal took : 23 ms
[2023-03-12 16:33:06] [INFO ] Flatten gal took : 24 ms
[2023-03-12 16:33:06] [INFO ] Input system was already deterministic with 326 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 265 transition count 592
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 265 transition count 592
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 263 transition count 590
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 263 transition count 590
Applied a total of 20 rules in 9 ms. Remains 263 /273 variables (removed 10) and now considering 590/600 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 263/273 places, 590/600 transitions.
[2023-03-12 16:33:06] [INFO ] Flatten gal took : 25 ms
[2023-03-12 16:33:06] [INFO ] Flatten gal took : 27 ms
[2023-03-12 16:33:06] [INFO ] Input system was already deterministic with 590 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 267 transition count 594
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 267 transition count 594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 266 transition count 593
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 266 transition count 593
Applied a total of 14 rules in 8 ms. Remains 266 /273 variables (removed 7) and now considering 593/600 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 266/273 places, 593/600 transitions.
[2023-03-12 16:33:06] [INFO ] Flatten gal took : 24 ms
[2023-03-12 16:33:06] [INFO ] Flatten gal took : 26 ms
[2023-03-12 16:33:06] [INFO ] Input system was already deterministic with 593 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 265 transition count 592
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 265 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 264 transition count 591
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 264 transition count 591
Applied a total of 18 rules in 8 ms. Remains 264 /273 variables (removed 9) and now considering 591/600 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 264/273 places, 591/600 transitions.
[2023-03-12 16:33:06] [INFO ] Flatten gal took : 56 ms
[2023-03-12 16:33:06] [INFO ] Flatten gal took : 24 ms
[2023-03-12 16:33:06] [INFO ] Input system was already deterministic with 591 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Graph (trivial) has 256 edges and 273 vertex of which 4 / 273 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 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 270 transition count 493
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 146 rules applied. Total rules applied 251 place count 166 transition count 451
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 276 place count 141 transition count 451
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 276 place count 141 transition count 446
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 286 place count 136 transition count 446
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 290 place count 132 transition count 442
Iterating global reduction 3 with 4 rules applied. Total rules applied 294 place count 132 transition count 442
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 392 place count 83 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 393 place count 83 transition count 392
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 407 place count 69 transition count 293
Iterating global reduction 4 with 14 rules applied. Total rules applied 421 place count 69 transition count 293
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 12 rules applied. Total rules applied 433 place count 69 transition count 281
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 439 place count 63 transition count 281
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 441 place count 62 transition count 280
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 442 place count 62 transition count 279
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 443 place count 62 transition count 279
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 445 place count 60 transition count 277
Applied a total of 445 rules in 48 ms. Remains 60 /273 variables (removed 213) and now considering 277/600 (removed 323) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 60/273 places, 277/600 transitions.
[2023-03-12 16:33:06] [INFO ] Flatten gal took : 19 ms
[2023-03-12 16:33:06] [INFO ] Flatten gal took : 20 ms
[2023-03-12 16:33:07] [INFO ] Input system was already deterministic with 277 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Graph (trivial) has 258 edges and 273 vertex of which 4 / 273 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 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 270 transition count 492
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 147 rules applied. Total rules applied 253 place count 165 transition count 450
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 278 place count 140 transition count 450
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 278 place count 140 transition count 445
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 288 place count 135 transition count 445
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 292 place count 131 transition count 441
Iterating global reduction 3 with 4 rules applied. Total rules applied 296 place count 131 transition count 441
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 297 place count 130 transition count 434
Iterating global reduction 3 with 1 rules applied. Total rules applied 298 place count 130 transition count 434
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 3 with 2 rules applied. Total rules applied 300 place count 130 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 301 place count 129 transition count 432
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 399 place count 80 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 400 place count 80 transition count 382
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 413 place count 67 transition count 290
Iterating global reduction 6 with 13 rules applied. Total rules applied 426 place count 67 transition count 290
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 436 place count 67 transition count 280
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 441 place count 62 transition count 280
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 443 place count 61 transition count 279
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 444 place count 61 transition count 278
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 445 place count 61 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 447 place count 59 transition count 276
Applied a total of 447 rules in 52 ms. Remains 59 /273 variables (removed 214) and now considering 276/600 (removed 324) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 59/273 places, 276/600 transitions.
[2023-03-12 16:33:07] [INFO ] Flatten gal took : 19 ms
[2023-03-12 16:33:07] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:33:07] [INFO ] Input system was already deterministic with 276 transitions.
Incomplete random walk after 10000 steps, including 548 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 551329 steps, run visited all 1 properties in 678 ms. (steps per millisecond=813 )
Probabilistic random walk after 551329 steps, saw 84504 distinct states, run finished after 679 ms. (steps per millisecond=811 ) properties seen :1
FORMULA AutonomousCar-PT-07b-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 266 transition count 593
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 266 transition count 593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 264 transition count 591
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 264 transition count 591
Applied a total of 18 rules in 8 ms. Remains 264 /273 variables (removed 9) and now considering 591/600 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 264/273 places, 591/600 transitions.
[2023-03-12 16:33:07] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:33:07] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:33:08] [INFO ] Input system was already deterministic with 591 transitions.
[2023-03-12 16:33:08] [INFO ] Flatten gal took : 23 ms
[2023-03-12 16:33:08] [INFO ] Flatten gal took : 23 ms
[2023-03-12 16:33:08] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-12 16:33:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 600 transitions and 4197 arcs took 3 ms.
Total runtime 43163 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/588/ctl_0_ --ctl=/tmp/588/ctl_1_ --ctl=/tmp/588/ctl_2_ --ctl=/tmp/588/ctl_3_ --ctl=/tmp/588/ctl_4_ --ctl=/tmp/588/ctl_5_ --ctl=/tmp/588/ctl_6_ --ctl=/tmp/588/ctl_7_ --ctl=/tmp/588/ctl_8_ --ctl=/tmp/588/ctl_9_ --ctl=/tmp/588/ctl_10_ --ctl=/tmp/588/ctl_11_ --ctl=/tmp/588/ctl_12_ --mu-par --mu-opt
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-00
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-01
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-02
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-03
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-04
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-05
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-06
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-07
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-09
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-10
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-12
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-13
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-15

BK_STOP 1678639776883

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name AutonomousCar-PT-07b-CTLFireability-00
ctl formula formula --ctl=/tmp/588/ctl_0_
ctl formula name AutonomousCar-PT-07b-CTLFireability-01
ctl formula formula --ctl=/tmp/588/ctl_1_
ctl formula name AutonomousCar-PT-07b-CTLFireability-02
ctl formula formula --ctl=/tmp/588/ctl_2_
ctl formula name AutonomousCar-PT-07b-CTLFireability-03
ctl formula formula --ctl=/tmp/588/ctl_3_
ctl formula name AutonomousCar-PT-07b-CTLFireability-04
ctl formula formula --ctl=/tmp/588/ctl_4_
ctl formula name AutonomousCar-PT-07b-CTLFireability-05
ctl formula formula --ctl=/tmp/588/ctl_5_
ctl formula name AutonomousCar-PT-07b-CTLFireability-06
ctl formula formula --ctl=/tmp/588/ctl_6_
ctl formula name AutonomousCar-PT-07b-CTLFireability-07
ctl formula formula --ctl=/tmp/588/ctl_7_
ctl formula name AutonomousCar-PT-07b-CTLFireability-09
ctl formula formula --ctl=/tmp/588/ctl_8_
ctl formula name AutonomousCar-PT-07b-CTLFireability-10
ctl formula formula --ctl=/tmp/588/ctl_9_
ctl formula name AutonomousCar-PT-07b-CTLFireability-12
ctl formula formula --ctl=/tmp/588/ctl_10_
ctl formula name AutonomousCar-PT-07b-CTLFireability-13
ctl formula formula --ctl=/tmp/588/ctl_11_
ctl formula name AutonomousCar-PT-07b-CTLFireability-15
ctl formula formula --ctl=/tmp/588/ctl_12_
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 273 places, 600 transitions and 4197 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.010 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: 600->582 groups
pnml2lts-sym: Regrouping took 0.190 real 0.190 user 0.000 sys
pnml2lts-sym: state vector length is 273; there are 582 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: 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: Exploration took 46550298 group checks and 0 next state calls
pnml2lts-sym: reachability took 953.890 real 3812.220 user 0.660 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.070 real 0.300 user 0.000 sys
pnml2lts-sym: state space has 37083748295916 states, 266315 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
double free or corruption (top)

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

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