Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r512-smll-171654406800067.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Parking-PT-208, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654406800067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 16:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 11 16:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 49K May 18 16:43 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 Parking-PT-208-LTLCardinality-00
FORMULA_NAME Parking-PT-208-LTLCardinality-01
FORMULA_NAME Parking-PT-208-LTLCardinality-02
FORMULA_NAME Parking-PT-208-LTLCardinality-03
FORMULA_NAME Parking-PT-208-LTLCardinality-04
FORMULA_NAME Parking-PT-208-LTLCardinality-05
FORMULA_NAME Parking-PT-208-LTLCardinality-06
FORMULA_NAME Parking-PT-208-LTLCardinality-07
FORMULA_NAME Parking-PT-208-LTLCardinality-08
FORMULA_NAME Parking-PT-208-LTLCardinality-09
FORMULA_NAME Parking-PT-208-LTLCardinality-10
FORMULA_NAME Parking-PT-208-LTLCardinality-11
FORMULA_NAME Parking-PT-208-LTLCardinality-12
FORMULA_NAME Parking-PT-208-LTLCardinality-13
FORMULA_NAME Parking-PT-208-LTLCardinality-14
FORMULA_NAME Parking-PT-208-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717244864899

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-208
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:27:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:27:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:27:47] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-06-01 12:27:47] [INFO ] Transformed 137 places.
[2024-06-01 12:27:47] [INFO ] Transformed 201 transitions.
[2024-06-01 12:27:47] [INFO ] Found NUPN structural information;
[2024-06-01 12:27:47] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 401 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA Parking-PT-208-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 135 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 135 transition count 115
Applied a total of 4 rules in 58 ms. Remains 135 /137 variables (removed 2) and now considering 115/117 (removed 2) transitions.
// Phase 1: matrix 115 rows 135 cols
[2024-06-01 12:27:48] [INFO ] Computed 34 invariants in 32 ms
[2024-06-01 12:27:48] [INFO ] Implicit Places using invariants in 541 ms returned [36, 44, 52, 64, 66, 93, 109, 129, 131]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 611 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/137 places, 115/117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 113
Applied a total of 4 rules in 18 ms. Remains 124 /126 variables (removed 2) and now considering 113/115 (removed 2) transitions.
// Phase 1: matrix 113 rows 124 cols
[2024-06-01 12:27:48] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 12:27:49] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 12:27:49] [INFO ] Invariant cache hit.
[2024-06-01 12:27:49] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 12:27:49] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/137 places, 113/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1312 ms. Remains : 124/137 places, 113/117 transitions.
Support contains 38 out of 124 places after structural reductions.
[2024-06-01 12:27:49] [INFO ] Flatten gal took : 84 ms
[2024-06-01 12:27:50] [INFO ] Flatten gal took : 30 ms
[2024-06-01 12:27:50] [INFO ] Input system was already deterministic with 113 transitions.
Support contains 37 out of 124 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (1171 resets) in 2671 ms. (14 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40004 steps (103 resets) in 250 ms. (159 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (103 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (99 resets) in 220 ms. (181 steps per ms) remains 3/3 properties
[2024-06-01 12:27:51] [INFO ] Invariant cache hit.
[2024-06-01 12:27:51] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/84 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/124 variables, 20/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 113/237 variables, 124/149 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 26/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/237 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 175 constraints, problems are : Problem set: 1 solved, 2 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 124/124 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 76/79 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 45/124 variables, 23/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 113/237 variables, 124/149 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 26/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/177 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 177 constraints, problems are : Problem set: 1 solved, 2 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 124/124 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 607ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 29 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=9 )
Parikh walk visited 2 properties in 13 ms.
FORMULA Parking-PT-208-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Parking-PT-208-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA Parking-PT-208-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Applied a total of 6 rules in 24 ms. Remains 121 /124 variables (removed 3) and now considering 110/113 (removed 3) transitions.
// Phase 1: matrix 110 rows 121 cols
[2024-06-01 12:27:52] [INFO ] Computed 25 invariants in 3 ms
[2024-06-01 12:27:52] [INFO ] Implicit Places using invariants in 221 ms returned [28, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 223 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/124 places, 110/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 108
Applied a total of 4 rules in 22 ms. Remains 117 /119 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 117 cols
[2024-06-01 12:27:52] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 12:27:52] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 12:27:52] [INFO ] Invariant cache hit.
[2024-06-01 12:27:52] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 12:27:52] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/124 places, 108/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 695 ms. Remains : 117/124 places, 108/113 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Parking-PT-208-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Parking-PT-208-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-00 finished in 1153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((X(X(F(p2)))||p1)))))'
Support contains 6 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Applied a total of 6 rules in 10 ms. Remains 121 /124 variables (removed 3) and now considering 110/113 (removed 3) transitions.
// Phase 1: matrix 110 rows 121 cols
[2024-06-01 12:27:53] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 12:27:53] [INFO ] Implicit Places using invariants in 136 ms returned [28, 92, 106]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 142 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 110/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 115 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 115 transition count 107
Applied a total of 6 rules in 7 ms. Remains 115 /118 variables (removed 3) and now considering 107/110 (removed 3) transitions.
// Phase 1: matrix 107 rows 115 cols
[2024-06-01 12:27:53] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 12:27:53] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 12:27:53] [INFO ] Invariant cache hit.
[2024-06-01 12:27:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 12:27:53] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 582 ms. Remains : 115/124 places, 107/113 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-01 finished in 880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Applied a total of 6 rules in 8 ms. Remains 121 /124 variables (removed 3) and now considering 110/113 (removed 3) transitions.
// Phase 1: matrix 110 rows 121 cols
[2024-06-01 12:27:54] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 12:27:54] [INFO ] Implicit Places using invariants in 119 ms returned [28, 92, 106]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 124 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 110/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 115 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 115 transition count 107
Applied a total of 6 rules in 7 ms. Remains 115 /118 variables (removed 3) and now considering 107/110 (removed 3) transitions.
// Phase 1: matrix 107 rows 115 cols
[2024-06-01 12:27:54] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 12:27:54] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 12:27:54] [INFO ] Invariant cache hit.
[2024-06-01 12:27:54] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 12:27:54] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/124 places, 107/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 529 ms. Remains : 115/124 places, 107/113 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 507 steps with 14 reset in 19 ms.
FORMULA Parking-PT-208-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-02 finished in 792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p1 U X(p2)))||p0))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Applied a total of 6 rules in 8 ms. Remains 121 /124 variables (removed 3) and now considering 110/113 (removed 3) transitions.
// Phase 1: matrix 110 rows 121 cols
[2024-06-01 12:27:55] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 12:27:55] [INFO ] Implicit Places using invariants in 212 ms returned [28, 92]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 219 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/124 places, 110/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 108
Applied a total of 4 rules in 7 ms. Remains 117 /119 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 117 cols
[2024-06-01 12:27:55] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 12:27:55] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 12:27:55] [INFO ] Invariant cache hit.
[2024-06-01 12:27:55] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 12:27:55] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/124 places, 108/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 693 ms. Remains : 117/124 places, 108/113 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Parking-PT-208-LTLCardinality-03
Product exploration explored 100000 steps with 25208 reset in 662 ms.
Product exploration explored 100000 steps with 25215 reset in 587 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 277 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 869 steps (22 resets) in 19 ms. (43 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 2 factoid took 303 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 117 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-06-01 12:27:58] [INFO ] Invariant cache hit.
[2024-06-01 12:27:58] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 12:27:58] [INFO ] Invariant cache hit.
[2024-06-01 12:27:58] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 12:27:58] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-06-01 12:27:58] [INFO ] Invariant cache hit.
[2024-06-01 12:27:58] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 18 ms to minimize.
[2024-06-01 12:28:00] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/225 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 168 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5318 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/225 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 107/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 275 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5451 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
After SMT, in 10836ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 10843ms
Finished structural reductions in LTL mode , in 1 iterations and 11288 ms. Remains : 117/117 places, 108/108 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 413 steps (10 resets) in 7 ms. (51 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 255 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25216 reset in 524 ms.
Product exploration explored 100000 steps with 25199 reset in 596 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 117 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 117 transition count 108
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 117 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 114 transition count 105
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 114 transition count 105
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 114 transition count 109
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 20 rules in 56 ms. Remains 114 /117 variables (removed 3) and now considering 109/108 (removed -1) transitions.
[2024-06-01 12:28:12] [INFO ] Redundant transitions in 4 ms returned []
Running 108 sub problems to find dead transitions.
// Phase 1: matrix 109 rows 114 cols
[2024-06-01 12:28:12] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 12:28:12] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 12:28:14] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 12:28:14] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-01 12:28:14] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 12:28:14] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD103 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 4/27 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/27 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 109/223 variables, 114/141 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 41/182 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/182 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/182 constraints. Problems are: Problem set: 15 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 182 constraints, problems are : Problem set: 15 solved, 93 unsolved in 5336 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 114/114 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 15 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 12/114 variables, 23/23 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 4/27 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/27 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 109/223 variables, 114/141 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 41/182 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 93/275 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/275 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 0/223 variables, 0/275 constraints. Problems are: Problem set: 15 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 275 constraints, problems are : Problem set: 15 solved, 93 unsolved in 3499 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 114/114 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 93/108 constraints, Known Traps: 4/4 constraints]
After SMT, in 8888ms problems are : Problem set: 15 solved, 93 unsolved
Search for dead transitions found 15 dead transitions in 8892ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 114/117 places, 94/108 transitions.
Graph (complete) has 274 edges and 114 vertex of which 103 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 118
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 2 rules in 17 ms. Remains 103 /114 variables (removed 11) and now considering 118/94 (removed -24) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/117 places, 118/108 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8984 ms. Remains : 103/117 places, 118/108 transitions.
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 117 cols
[2024-06-01 12:28:21] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 12:28:21] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 12:28:21] [INFO ] Invariant cache hit.
[2024-06-01 12:28:21] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 12:28:22] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-06-01 12:28:22] [INFO ] Invariant cache hit.
[2024-06-01 12:28:22] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 12:28:22] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:28:23] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/225 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 168 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3871 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/225 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 107/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 275 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3661 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 2/2 constraints]
After SMT, in 7560ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 7564ms
Finished structural reductions in LTL mode , in 1 iterations and 7898 ms. Remains : 117/117 places, 108/108 transitions.
Treatment of property Parking-PT-208-LTLCardinality-03 finished in 34744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 123 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 119 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 119 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 115 transition count 104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 112 transition count 101
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 112 transition count 101
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 102 transition count 91
Applied a total of 42 rules in 24 ms. Remains 102 /124 variables (removed 22) and now considering 91/113 (removed 22) transitions.
// Phase 1: matrix 91 rows 102 cols
[2024-06-01 12:28:29] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 12:28:29] [INFO ] Implicit Places using invariants in 114 ms returned [26, 79, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 115 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/124 places, 91/113 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 146 ms. Remains : 99/124 places, 91/113 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-07
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-07 finished in 202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 122 transition count 111
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 122 transition count 111
Applied a total of 4 rules in 5 ms. Remains 122 /124 variables (removed 2) and now considering 111/113 (removed 2) transitions.
// Phase 1: matrix 111 rows 122 cols
[2024-06-01 12:28:29] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 12:28:30] [INFO ] Implicit Places using invariants in 100 ms returned [28, 93, 107]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 126 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/124 places, 111/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 116 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 116 transition count 108
Applied a total of 6 rules in 5 ms. Remains 116 /119 variables (removed 3) and now considering 108/111 (removed 3) transitions.
// Phase 1: matrix 108 rows 116 cols
[2024-06-01 12:28:30] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 12:28:30] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 12:28:30] [INFO ] Invariant cache hit.
[2024-06-01 12:28:30] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 12:28:30] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 116/124 places, 108/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 442 ms. Remains : 116/124 places, 108/113 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : Parking-PT-208-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 538 steps with 14 reset in 2 ms.
FORMULA Parking-PT-208-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-10 finished in 617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p1&&(G(!p2)||(!p2&&F(p3))))||p0)))'
Support contains 7 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 121 transition count 107
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 118 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 115 transition count 104
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 115 transition count 104
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 105 transition count 94
Applied a total of 38 rules in 21 ms. Remains 105 /124 variables (removed 19) and now considering 94/113 (removed 19) transitions.
// Phase 1: matrix 94 rows 105 cols
[2024-06-01 12:28:30] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 12:28:30] [INFO ] Implicit Places using invariants in 94 ms returned [82, 91]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 108 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/124 places, 94/113 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 103/124 places, 94/113 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), true, (AND (NOT p3) p2), (NOT p3)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 7165 steps with 214 reset in 57 ms.
FORMULA Parking-PT-208-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-12 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 109
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 120 transition count 105
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 116 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 113 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 113 transition count 102
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 102 transition count 91
Applied a total of 44 rules in 20 ms. Remains 102 /124 variables (removed 22) and now considering 91/113 (removed 22) transitions.
// Phase 1: matrix 91 rows 102 cols
[2024-06-01 12:28:30] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 12:28:31] [INFO ] Implicit Places using invariants in 91 ms returned [26, 79, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 95 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/124 places, 91/113 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 2 place count 98 transition count 110
Applied a total of 2 rules in 16 ms. Remains 98 /99 variables (removed 1) and now considering 110/91 (removed -19) transitions.
// Phase 1: matrix 110 rows 98 cols
[2024-06-01 12:28:31] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 12:28:31] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 12:28:31] [INFO ] Invariant cache hit.
[2024-06-01 12:28:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 12:28:31] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/124 places, 110/113 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 398 ms. Remains : 98/124 places, 110/113 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-13
Product exploration explored 100000 steps with 3058 reset in 380 ms.
Product exploration explored 100000 steps with 3062 reset in 391 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 540 steps (15 resets) in 5 ms. (90 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-06-01 12:28:32] [INFO ] Invariant cache hit.
[2024-06-01 12:28:32] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 12:28:32] [INFO ] Invariant cache hit.
[2024-06-01 12:28:32] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 12:28:32] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-06-01 12:28:32] [INFO ] Redundant transitions in 3 ms returned []
Running 105 sub problems to find dead transitions.
[2024-06-01 12:28:32] [INFO ] Invariant cache hit.
[2024-06-01 12:28:32] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 110/208 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 58/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 178 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3107 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 110/208 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 58/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 105/283 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 283 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3506 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 6665ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 6668ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6944 ms. Remains : 98/98 places, 110/110 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 1055 steps (31 resets) in 8 ms. (117 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3058 reset in 201 ms.
Product exploration explored 100000 steps with 3068 reset in 477 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-06-01 12:28:40] [INFO ] Invariant cache hit.
[2024-06-01 12:28:40] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 12:28:40] [INFO ] Invariant cache hit.
[2024-06-01 12:28:40] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 12:28:40] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-06-01 12:28:40] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2024-06-01 12:28:40] [INFO ] Invariant cache hit.
[2024-06-01 12:28:40] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 110/208 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 58/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 178 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3484 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 110/208 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 58/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 105/283 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 283 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3589 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 7108ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 7110ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7412 ms. Remains : 98/98 places, 110/110 transitions.
Treatment of property Parking-PT-208-LTLCardinality-13 finished in 16950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p1 U X(p2)))||p0))))'
Found a Shortening insensitive property : Parking-PT-208-LTLCardinality-03
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 121 transition count 107
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 118 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 115 transition count 104
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 115 transition count 104
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 105 transition count 94
Applied a total of 38 rules in 21 ms. Remains 105 /124 variables (removed 19) and now considering 94/113 (removed 19) transitions.
// Phase 1: matrix 94 rows 105 cols
[2024-06-01 12:28:48] [INFO ] Computed 25 invariants in 0 ms
[2024-06-01 12:28:48] [INFO ] Implicit Places using invariants in 90 ms returned [26, 79]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 91 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 103/124 places, 94/113 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 102 transition count 113
Applied a total of 2 rules in 5 ms. Remains 102 /103 variables (removed 1) and now considering 113/94 (removed -19) transitions.
// Phase 1: matrix 113 rows 102 cols
[2024-06-01 12:28:48] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 12:28:48] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 12:28:48] [INFO ] Invariant cache hit.
[2024-06-01 12:28:48] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 12:28:48] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 102/124 places, 113/113 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 398 ms. Remains : 102/124 places, 113/113 transitions.
Running random walk in product with property : Parking-PT-208-LTLCardinality-03
Product exploration explored 100000 steps with 25220 reset in 357 ms.
Product exploration explored 100000 steps with 25180 reset in 370 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 940 steps (27 resets) in 9 ms. (94 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 102 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 113/113 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-06-01 12:28:50] [INFO ] Invariant cache hit.
[2024-06-01 12:28:50] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 12:28:50] [INFO ] Invariant cache hit.
[2024-06-01 12:28:50] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 12:28:50] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 12:28:50] [INFO ] Invariant cache hit.
[2024-06-01 12:28:50] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 113/215 variables, 102/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 58/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/215 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 183 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3476 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 102/102 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 113/215 variables, 102/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 58/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 108/291 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/215 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 291 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4373 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 102/102 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 7894ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 7896ms
Finished structural reductions in LTL mode , in 1 iterations and 8191 ms. Remains : 102/102 places, 113/113 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p2)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 552 steps (15 resets) in 6 ms. (78 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25247 reset in 359 ms.
Product exploration explored 100000 steps with 25217 reset in 376 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 113/113 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-06-01 12:29:00] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 12:29:00] [INFO ] Invariant cache hit.
[2024-06-01 12:29:00] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 113/215 variables, 102/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 58/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/215 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 183 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3506 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 102/102 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 113/215 variables, 102/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 58/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 108/291 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/215 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 291 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4412 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 102/102 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 7952ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 7954ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7968 ms. Remains : 102/102 places, 113/113 transitions.
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 113/113 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-06-01 12:29:08] [INFO ] Invariant cache hit.
[2024-06-01 12:29:08] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 12:29:08] [INFO ] Invariant cache hit.
[2024-06-01 12:29:08] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 12:29:08] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 12:29:08] [INFO ] Invariant cache hit.
[2024-06-01 12:29:08] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 113/215 variables, 102/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 58/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/215 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 183 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3484 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 102/102 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 113/215 variables, 102/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 58/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 108/291 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/215 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 291 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4365 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 102/102 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 7881ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 7883ms
Finished structural reductions in LTL mode , in 1 iterations and 8213 ms. Remains : 102/102 places, 113/113 transitions.
Treatment of property Parking-PT-208-LTLCardinality-03 finished in 28530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 12:29:16] [INFO ] Flatten gal took : 13 ms
[2024-06-01 12:29:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 12:29:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 113 transitions and 368 arcs took 4 ms.
Total runtime 89086 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Parking-PT-208-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-208-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717245015061

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Parking-PT-208-LTLCardinality-03
ltl formula formula --ltl=/tmp/1351/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 124 places, 113 transitions and 368 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1351/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1351/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1351/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1351/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 126 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 125, there are 138 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 447
pnml2lts-mc( 0/ 4): unique states count: 447
pnml2lts-mc( 0/ 4): unique transitions count: 836
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 429
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 463
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 463 states 1123 transitions, fanout: 2.425
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.002 sec on average)
pnml2lts-mc( 0/ 4): States per second: 46300, Transitions per second: 112300
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.9 B/state, compr.: 3.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 113 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Parking-PT-208-LTLCardinality-13
ltl formula formula --ltl=/tmp/1351/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 124 places, 113 transitions and 368 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1351/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1351/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1351/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1351/ltl_1_
pnml2lts-mc( 0/ 4): There are 125 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 125, there are 125 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~33 levels ~10000 states ~49932 transitions
pnml2lts-mc( 2/ 4): ~33 levels ~20000 states ~108508 transitions
pnml2lts-mc( 1/ 4): ~96 levels ~40000 states ~183564 transitions
pnml2lts-mc( 2/ 4): ~33 levels ~80000 states ~510000 transitions
pnml2lts-mc( 2/ 4): ~44 levels ~160000 states ~1098036 transitions
pnml2lts-mc( 3/ 4): ~128 levels ~320000 states ~1868688 transitions
pnml2lts-mc( 3/ 4): ~164 levels ~640000 states ~3825736 transitions
pnml2lts-mc( 3/ 4): ~164 levels ~1280000 states ~8337268 transitions
pnml2lts-mc( 3/ 4): ~273 levels ~2560000 states ~17423088 transitions
pnml2lts-mc( 3/ 4): ~273 levels ~5120000 states ~37783480 transitions
pnml2lts-mc( 0/ 4): ~191 levels ~10240000 states ~84048628 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~104!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11914259
pnml2lts-mc( 0/ 4): unique states count: 14591044
pnml2lts-mc( 0/ 4): unique transitions count: 135243118
pnml2lts-mc( 0/ 4): - self-loop count: 143
pnml2lts-mc( 0/ 4): - claim dead count: 114797824
pnml2lts-mc( 0/ 4): - claim found count: 5851941
pnml2lts-mc( 0/ 4): - claim success count: 14591100
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1041
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14591104 states 135243661 transitions, fanout: 9.269
pnml2lts-mc( 0/ 4): Total exploration time 57.620 sec (57.620 sec minimum, 57.620 sec on average)
pnml2lts-mc( 0/ 4): States per second: 253230, Transitions per second: 2347165
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 112.3MB, 8.1 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 43.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 113 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 112.3MB (~256.0MB paged-in)

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="Parking-PT-208"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Parking-PT-208, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654406800067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-208.tgz
mv Parking-PT-208 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;