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.r010-oct2-167813599300634.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 marciexred
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 r010-oct2-167813599300634
=====================================================================

--------------------
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 1678700354691

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:39:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 09:39:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:39:17] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-03-13 09:39:17] [INFO ] Transformed 323 places.
[2023-03-13 09:39:17] [INFO ] Transformed 846 transitions.
[2023-03-13 09:39:17] [INFO ] Found NUPN structural information;
[2023-03-13 09:39:17] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 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 123 ms. Remains 273 /323 variables (removed 50) and now considering 600/846 (removed 246) transitions.
// Phase 1: matrix 600 rows 273 cols
[2023-03-13 09:39:18] [INFO ] Computed 12 place invariants in 15 ms
[2023-03-13 09:39:18] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-13 09:39:18] [INFO ] Invariant cache hit.
[2023-03-13 09:39:19] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
[2023-03-13 09:39:19] [INFO ] Invariant cache hit.
[2023-03-13 09:39:20] [INFO ] Dead Transitions using invariants and state equation in 1245 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 2375 ms. Remains : 273/323 places, 600/846 transitions.
Support contains 74 out of 273 places after structural reductions.
[2023-03-13 09:39:20] [INFO ] Flatten gal took : 117 ms
[2023-03-13 09:39:20] [INFO ] Flatten gal took : 53 ms
[2023-03-13 09:39:20] [INFO ] Input system was already deterministic with 600 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 575 ms. (steps per millisecond=17 ) properties (out of 65) seen :27
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) 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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) 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 11 ms. (steps per millisecond=91 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 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 11 ms. (steps per millisecond=91 ) properties (out of 37) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Running SMT prover for 35 properties.
[2023-03-13 09:39:22] [INFO ] Invariant cache hit.
[2023-03-13 09:39:22] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-13 09:39:23] [INFO ] After 1469ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:34
[2023-03-13 09:39:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-13 09:39:26] [INFO ] After 1974ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :28
[2023-03-13 09:39:27] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 35 ms to minimize.
[2023-03-13 09:39:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 335 ms
[2023-03-13 09:39:29] [INFO ] Deduced a trap composed of 44 places in 576 ms of which 2 ms to minimize.
[2023-03-13 09:39:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 629 ms
[2023-03-13 09:39:30] [INFO ] Deduced a trap composed of 33 places in 503 ms of which 0 ms to minimize.
[2023-03-13 09:39:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 544 ms
[2023-03-13 09:39:30] [INFO ] After 6021ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :28
Attempting to minimize the solution found.
Minimization took 1736 ms.
[2023-03-13 09:39:32] [INFO ] After 8745ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :28
Fused 35 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 305 ms.
Support contains 40 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 600/600 transitions.
Graph (trivial) has 203 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.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 269 transition count 506
Reduce places removed 88 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 120 rules applied. Total rules applied 212 place count 181 transition count 474
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 230 place count 163 transition count 474
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 230 place count 163 transition count 463
Deduced a syphon composed of 11 places in 13 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 252 place count 152 transition count 463
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 255 place count 149 transition count 460
Iterating global reduction 3 with 3 rules applied. Total rules applied 258 place count 149 transition count 460
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 259 place count 149 transition count 459
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 260 place count 148 transition count 458
Iterating global reduction 4 with 1 rules applied. Total rules applied 261 place count 148 transition count 458
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 347 place count 105 transition count 415
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 350 place count 102 transition count 400
Iterating global reduction 4 with 3 rules applied. Total rules applied 353 place count 102 transition count 400
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 355 place count 102 transition count 398
Free-agglomeration rule applied 19 times.
Iterating global reduction 5 with 19 rules applied. Total rules applied 374 place count 102 transition count 379
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 393 place count 83 transition count 379
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 397 place count 83 transition count 375
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 402 place count 83 transition count 375
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 403 place count 82 transition count 374
Applied a total of 403 rules in 165 ms. Remains 82 /273 variables (removed 191) and now considering 374/600 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 82/273 places, 374/600 transitions.
Incomplete random walk after 10000 steps, including 349 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 28) seen :4
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 :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) 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 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 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 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) 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 21) 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 21) 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 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 374 rows 82 cols
[2023-03-13 09:39:33] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-13 09:39:33] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-13 09:39:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-13 09:39:35] [INFO ] After 1072ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-13 09:39:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:39:36] [INFO ] After 1069ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-13 09:39:36] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 2 ms to minimize.
[2023-03-13 09:39:37] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 0 ms to minimize.
[2023-03-13 09:39:37] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-13 09:39:37] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 40 ms to minimize.
[2023-03-13 09:39:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 936 ms
[2023-03-13 09:39:38] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 1 ms to minimize.
[2023-03-13 09:39:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-13 09:39:38] [INFO ] After 3616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 1018 ms.
[2023-03-13 09:39:39] [INFO ] After 5967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 328 ms.
Support contains 39 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 374/374 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 81 transition count 367
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 367
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 81 transition count 366
Applied a total of 3 rules in 24 ms. Remains 81 /82 variables (removed 1) and now considering 366/374 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 81/82 places, 366/374 transitions.
Incomplete random walk after 10000 steps, including 341 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) 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 17) 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 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 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 3 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 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 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 3 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 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 366 rows 81 cols
[2023-03-13 09:39:40] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-13 09:39:40] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-13 09:39:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-13 09:39:42] [INFO ] After 955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-13 09:39:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:39:43] [INFO ] After 752ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-13 09:39:44] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 1 ms to minimize.
[2023-03-13 09:39:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-13 09:39:44] [INFO ] After 2052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 920 ms.
[2023-03-13 09:39:45] [INFO ] After 4458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 76 ms.
Support contains 35 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 366/366 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 79 transition count 364
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 78 transition count 363
Applied a total of 6 rules in 53 ms. Remains 78 /81 variables (removed 3) and now considering 363/366 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 78/81 places, 363/366 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 363 rows 78 cols
[2023-03-13 09:39:46] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-13 09:39:46] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 09:39:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 09:39:46] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 09:39:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:39:47] [INFO ] After 333ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 09:39:47] [INFO ] Deduced a trap composed of 10 places in 499 ms of which 26 ms to minimize.
[2023-03-13 09:39:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 553 ms
[2023-03-13 09:39:48] [INFO ] After 1323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 578 ms.
[2023-03-13 09:39:48] [INFO ] After 2437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 15 ms.
Support contains 27 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 363/363 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 75 transition count 360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 74 transition count 352
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 74 transition count 352
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 73 transition count 351
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 73 transition count 348
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 16 place count 70 transition count 348
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 70 transition count 348
Applied a total of 17 rules in 49 ms. Remains 70 /78 variables (removed 8) and now considering 348/363 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 70/78 places, 348/363 transitions.
Incomplete random walk after 10000 steps, including 369 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 705723 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 705723 steps, saw 107768 distinct states, run finished after 3004 ms. (steps per millisecond=234 ) properties seen :3
Running SMT prover for 3 properties.
// Phase 1: matrix 348 rows 70 cols
[2023-03-13 09:39:52] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-13 09:39:52] [INFO ] [Real]Absence check using 12 positive place invariants in 73 ms returned sat
[2023-03-13 09:39:52] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 09:39:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-13 09:39:52] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 09:39:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:39:53] [INFO ] After 214ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 09:39:53] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2023-03-13 09:39:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-13 09:39:53] [INFO ] After 606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-13 09:39:53] [INFO ] After 1240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 22 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 348/348 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 70 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 69 transition count 347
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 68 transition count 339
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 68 transition count 339
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 68 transition count 338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 67 transition count 338
Applied a total of 6 rules in 33 ms. Remains 67 /70 variables (removed 3) and now considering 338/348 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 67/70 places, 338/348 transitions.
Incomplete random walk after 10000 steps, including 358 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 700410 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{0=1}
Probabilistic random walk after 700410 steps, saw 109294 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 338 rows 67 cols
[2023-03-13 09:39:57] [INFO ] Computed 12 place invariants in 15 ms
[2023-03-13 09:39:57] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 09:39:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 09:39:57] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 09:39:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:39:57] [INFO ] After 179ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 09:39:57] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 1 ms to minimize.
[2023-03-13 09:39:58] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-13 09:39:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 494 ms
[2023-03-13 09:39:58] [INFO ] After 825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-13 09:39:58] [INFO ] After 1226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 16 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 338/338 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 67 transition count 336
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 65 transition count 336
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 65 transition count 333
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 17 place count 62 transition count 326
Applied a total of 17 rules in 35 ms. Remains 62 /67 variables (removed 5) and now considering 326/338 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 62/67 places, 326/338 transitions.
Incomplete random walk after 10000 steps, including 231 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 326 rows 62 cols
[2023-03-13 09:39:58] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-13 09:39:58] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:39:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 79 ms returned sat
[2023-03-13 09:39:58] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:39:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:39:59] [INFO ] After 107ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:39:59] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2023-03-13 09:39:59] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-13 09:39:59] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 14 ms to minimize.
[2023-03-13 09:39:59] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 40 ms to minimize.
[2023-03-13 09:39:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 850 ms
[2023-03-13 09:39:59] [INFO ] After 1054ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-13 09:40:00] [INFO ] After 1484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 15 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 326/326 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 325
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 61 transition count 318
Applied a total of 9 rules in 25 ms. Remains 61 /62 variables (removed 1) and now considering 318/326 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 61/62 places, 318/326 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2000971 steps, run timeout after 3001 ms. (steps per millisecond=666 ) properties seen :{}
Probabilistic random walk after 2000971 steps, saw 293645 distinct states, run finished after 3015 ms. (steps per millisecond=663 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 318 rows 61 cols
[2023-03-13 09:40:03] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-13 09:40:03] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:40:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 55 ms returned sat
[2023-03-13 09:40:03] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:40:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:40:03] [INFO ] After 73ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:40:03] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2023-03-13 09:40:04] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 1 ms to minimize.
[2023-03-13 09:40:04] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 0 ms to minimize.
[2023-03-13 09:40:04] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2023-03-13 09:40:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 950 ms
[2023-03-13 09:40:04] [INFO ] After 1070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-13 09:40:04] [INFO ] After 1534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 15 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 318/318 transitions.
Applied a total of 0 rules in 8 ms. Remains 61 /61 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 61/61 places, 318/318 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 318/318 transitions.
Applied a total of 0 rules in 21 ms. Remains 61 /61 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2023-03-13 09:40:04] [INFO ] Invariant cache hit.
[2023-03-13 09:40:04] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-13 09:40:04] [INFO ] Invariant cache hit.
[2023-03-13 09:40:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:40:05] [INFO ] Implicit Places using invariants and state equation in 211 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 375 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/61 places, 317/318 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 316
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 58 transition count 315
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 315
Applied a total of 4 rules in 17 ms. Remains 57 /59 variables (removed 2) and now considering 315/317 (removed 2) transitions.
// Phase 1: matrix 315 rows 57 cols
[2023-03-13 09:40:05] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-13 09:40:05] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-13 09:40:05] [INFO ] Invariant cache hit.
[2023-03-13 09:40:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 09:40:05] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 57/61 places, 315/318 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 806 ms. Remains : 57/61 places, 315/318 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2243637 steps, run timeout after 3001 ms. (steps per millisecond=747 ) properties seen :{}
Probabilistic random walk after 2243637 steps, saw 339696 distinct states, run finished after 3001 ms. (steps per millisecond=747 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 09:40:08] [INFO ] Invariant cache hit.
[2023-03-13 09:40:08] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:40:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 09:40:08] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:40:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 09:40:09] [INFO ] After 77ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:40:09] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 1 ms to minimize.
[2023-03-13 09:40:09] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2023-03-13 09:40:09] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 21 ms to minimize.
[2023-03-13 09:40:09] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2023-03-13 09:40:10] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 1 ms to minimize.
[2023-03-13 09:40:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1068 ms
[2023-03-13 09:40:10] [INFO ] After 1194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-13 09:40:10] [INFO ] After 1464ms 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 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 315/315 transitions.
Applied a total of 0 rules in 15 ms. Remains 57 /57 variables (removed 0) and now considering 315/315 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 57/57 places, 315/315 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 315/315 transitions.
Applied a total of 0 rules in 22 ms. Remains 57 /57 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2023-03-13 09:40:10] [INFO ] Invariant cache hit.
[2023-03-13 09:40:10] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-13 09:40:10] [INFO ] Invariant cache hit.
[2023-03-13 09:40:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 09:40:10] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2023-03-13 09:40:10] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-13 09:40:10] [INFO ] Invariant cache hit.
[2023-03-13 09:40:11] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 731 ms. Remains : 57/57 places, 315/315 transitions.
Graph (complete) has 589 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 314
Applied a total of 2 rules in 7 ms. Remains 56 /57 variables (removed 1) and now considering 314/315 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 314 rows 56 cols
[2023-03-13 09:40:11] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-13 09:40:11] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:40:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-13 09:40:11] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:40:11] [INFO ] Deduced a trap composed of 8 places in 332 ms of which 0 ms to minimize.
[2023-03-13 09:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2023-03-13 09:40:11] [INFO ] After 647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-13 09:40:11] [INFO ] After 796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :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-13 09:40:11] [INFO ] Flatten gal took : 74 ms
[2023-03-13 09:40:12] [INFO ] Flatten gal took : 38 ms
[2023-03-13 09:40:12] [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 10 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 11 ms. Remains : 263/273 places, 590/600 transitions.
[2023-03-13 09:40:12] [INFO ] Flatten gal took : 42 ms
[2023-03-13 09:40:12] [INFO ] Flatten gal took : 49 ms
[2023-03-13 09:40:12] [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 22 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 23 ms. Remains : 263/273 places, 590/600 transitions.
[2023-03-13 09:40:12] [INFO ] Flatten gal took : 27 ms
[2023-03-13 09:40:12] [INFO ] Flatten gal took : 30 ms
[2023-03-13 09:40:12] [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 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 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 81 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 81 ms. Remains : 67/273 places, 306/600 transitions.
[2023-03-13 09:40:12] [INFO ] Flatten gal took : 31 ms
[2023-03-13 09:40:12] [INFO ] Flatten gal took : 24 ms
[2023-03-13 09:40:12] [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 13 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 13 ms. Remains : 263/273 places, 590/600 transitions.
[2023-03-13 09:40:12] [INFO ] Flatten gal took : 32 ms
[2023-03-13 09:40:12] [INFO ] Flatten gal took : 27 ms
[2023-03-13 09:40:12] [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 10 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 10 ms. Remains : 266/273 places, 593/600 transitions.
[2023-03-13 09:40:12] [INFO ] Flatten gal took : 25 ms
[2023-03-13 09:40:12] [INFO ] Flatten gal took : 27 ms
[2023-03-13 09:40:12] [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 21 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 21 ms. Remains : 264/273 places, 591/600 transitions.
[2023-03-13 09:40:13] [INFO ] Flatten gal took : 37 ms
[2023-03-13 09:40:13] [INFO ] Flatten gal took : 25 ms
[2023-03-13 09:40:13] [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 10 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 10 ms. Remains : 263/273 places, 590/600 transitions.
[2023-03-13 09:40:13] [INFO ] Flatten gal took : 24 ms
[2023-03-13 09:40:13] [INFO ] Flatten gal took : 25 ms
[2023-03-13 09:40:13] [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 97 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 97 ms. Remains : 74/273 places, 326/600 transitions.
[2023-03-13 09:40:13] [INFO ] Flatten gal took : 23 ms
[2023-03-13 09:40:13] [INFO ] Flatten gal took : 23 ms
[2023-03-13 09:40:13] [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-13 09:40:13] [INFO ] Flatten gal took : 22 ms
[2023-03-13 09:40:13] [INFO ] Flatten gal took : 22 ms
[2023-03-13 09:40:13] [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 10 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 10 ms. Remains : 266/273 places, 593/600 transitions.
[2023-03-13 09:40:13] [INFO ] Flatten gal took : 26 ms
[2023-03-13 09:40:13] [INFO ] Flatten gal took : 26 ms
[2023-03-13 09:40:13] [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 22 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 23 ms. Remains : 264/273 places, 591/600 transitions.
[2023-03-13 09:40:13] [INFO ] Flatten gal took : 24 ms
[2023-03-13 09:40:13] [INFO ] Flatten gal took : 25 ms
[2023-03-13 09:40:14] [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 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 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 0 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 1 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 108 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 108 ms. Remains : 60/273 places, 277/600 transitions.
[2023-03-13 09:40:14] [INFO ] Flatten gal took : 22 ms
[2023-03-13 09:40:14] [INFO ] Flatten gal took : 23 ms
[2023-03-13 09:40:14] [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 1 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 79 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 79 ms. Remains : 59/273 places, 276/600 transitions.
[2023-03-13 09:40:14] [INFO ] Flatten gal took : 35 ms
[2023-03-13 09:40:14] [INFO ] Flatten gal took : 24 ms
[2023-03-13 09:40:14] [INFO ] Input system was already deterministic with 276 transitions.
Incomplete random walk after 10000 steps, including 572 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 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 751 ms. (steps per millisecond=734 )
Probabilistic random walk after 551329 steps, saw 84504 distinct states, run finished after 751 ms. (steps per millisecond=734 ) 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-13 09:40:15] [INFO ] Flatten gal took : 23 ms
[2023-03-13 09:40:15] [INFO ] Flatten gal took : 24 ms
[2023-03-13 09:40:15] [INFO ] Input system was already deterministic with 591 transitions.
[2023-03-13 09:40:15] [INFO ] Flatten gal took : 30 ms
[2023-03-13 09:40:15] [INFO ] Flatten gal took : 25 ms
[2023-03-13 09:40:15] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 09:40:15] [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 58165 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 273 NrTr: 600 NrArc: 4197)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.025sec

net check time: 0m 0.000sec

init dd package: 0m 2.936sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6289932 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096144 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

274802 281203 281858 290736 294531 290061 288731 292468 302619 298660 307809 310944 300821 306998 306334 298840 307904 332609 315644 322459 331334 341125 348281 332019 325925 339222 338437 340306 322115 313468 324716 333002 337619 331097 343004 351207 361586 367654 348889 353944 368114 377961 385806 375516 388581 404891 394369 404319 415922 383583 364259 382060 377582 383991 371230 371500 381534 397226 393141 406762 364376 330089 358600 371350 386304 369994 372514 394819 426089 430853 452707 406470 409747 406260 404582 404492 409294 404700 418415 457850 457655 478681 491297 459346 484370 514569 529176 523845 532202 475102 486246 466903 474061 468056 475988 481291 459572 441697 455121 466503 477836 447069 452186 483040 502243 504790 503407 492972 441096 441229 429503 426448 425742 431711 418113 414543 399967 408651 426380 428205 421859 440385 489426

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="marciexred"
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 marciexred"
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 r010-oct2-167813599300634"
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 ;