About the Execution of ITS-Tools for Parking-PT-208
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1368.968 | 48721.00 | 155064.00 | 277.10 | TTFFFFTFFFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998700307.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r150-smll-165276998700307
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 5.2K Apr 30 05:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 30 05:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 05:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 30 05:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 49K May 10 09:34 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 1653051339948
Running Version 202205111006
[2022-05-20 12:55:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 12:55:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:55:42] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2022-05-20 12:55:42] [INFO ] Transformed 137 places.
[2022-05-20 12:55:42] [INFO ] Transformed 201 transitions.
[2022-05-20 12:55:42] [INFO ] Found NUPN structural information;
[2022-05-20 12:55:42] [INFO ] Parsed PT model containing 137 places and 201 transitions in 288 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
FORMULA Parking-PT-208-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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 34 ms. Remains 135 /137 variables (removed 2) and now considering 115/117 (removed 2) transitions.
// Phase 1: matrix 115 rows 135 cols
[2022-05-20 12:55:42] [INFO ] Computed 34 place invariants in 16 ms
[2022-05-20 12:55:42] [INFO ] Implicit Places using invariants in 337 ms returned [28, 36, 52, 64, 66, 101, 109, 117, 129]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 386 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/137 places, 115/117 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 110
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 110
Applied a total of 10 rules in 16 ms. Remains 121 /126 variables (removed 5) and now considering 110/115 (removed 5) transitions.
// Phase 1: matrix 110 rows 121 cols
[2022-05-20 12:55:42] [INFO ] Computed 25 place invariants in 7 ms
[2022-05-20 12:55:43] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 110 rows 121 cols
[2022-05-20 12:55:43] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-20 12:55:43] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:55:43] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/137 places, 110/117 transitions.
Finished structural reductions, in 2 iterations. Remains : 121/137 places, 110/117 transitions.
Support contains 21 out of 121 places after structural reductions.
[2022-05-20 12:55:43] [INFO ] Flatten gal took : 52 ms
[2022-05-20 12:55:43] [INFO ] Flatten gal took : 23 ms
[2022-05-20 12:55:43] [INFO ] Input system was already deterministic with 110 transitions.
Incomplete random walk after 10000 steps, including 291 resets, run finished after 784 ms. (steps per millisecond=12 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 110 rows 121 cols
[2022-05-20 12:55:44] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-20 12:55:44] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 12:55:44] [INFO ] [Nat]Absence check using 25 positive place invariants in 13 ms returned sat
[2022-05-20 12:55:45] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2022-05-20 12:55:45] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:55:45] [INFO ] After 35ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2022-05-20 12:55:45] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-20 12:55:45] [INFO ] After 335ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 4 ms.
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 121/121 places, 110/110 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 121 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 106
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 117 transition count 102
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 113 transition count 102
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 105 transition count 94
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 56 place count 105 transition count 70
Reduce places removed 24 places and 0 transitions.
Graph (complete) has 162 edges and 81 vertex of which 46 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.4 ms
Discarding 35 places :
Also discarding 29 output transitions
Drop transitions removed 29 transitions
Iterating post reduction 2 with 25 rules applied. Total rules applied 81 place count 46 transition count 41
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 46 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 45 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 4 with 29 rules applied. Total rules applied 113 place count 34 transition count 20
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 24 rules applied. Total rules applied 137 place count 16 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 141 place count 12 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 141 place count 12 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 147 place count 9 transition count 11
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 149 place count 7 transition count 9
Iterating global reduction 7 with 2 rules applied. Total rules applied 151 place count 7 transition count 9
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 153 place count 7 transition count 7
Applied a total of 153 rules in 72 ms. Remains 7 /121 variables (removed 114) and now considering 7/110 (removed 103) transitions.
Finished structural reductions, in 1 iterations. Remains : 7/121 places, 7/110 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
FORMULA Parking-PT-208-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 7 simplifications.
FORMULA Parking-PT-208-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(F(G(!(p0 U F(p0)))))))))'
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 116 transition count 105
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 116 transition count 101
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 112 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 111 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 111 transition count 100
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 104 transition count 93
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 104 transition count 93
Applied a total of 33 rules in 34 ms. Remains 104 /121 variables (removed 17) and now considering 93/110 (removed 17) transitions.
// Phase 1: matrix 93 rows 104 cols
[2022-05-20 12:55:45] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-20 12:55:45] [INFO ] Implicit Places using invariants in 113 ms returned [35, 75, 101]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 114 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/121 places, 93/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 99 transition count 91
Applied a total of 4 rules in 12 ms. Remains 99 /101 variables (removed 2) and now considering 91/93 (removed 2) transitions.
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:55:45] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:55:45] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:55:45] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-20 12:55:45] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/121 places, 91/110 transitions.
Finished structural reductions, in 2 iterations. Remains : 99/121 places, 91/110 transitions.
Stuttering acceptance computed with spot in 209 ms :[p0]
Running random walk in product with property : Parking-PT-208-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 62 steps with 1 reset in 4 ms.
FORMULA Parking-PT-208-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-04 finished in 691 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 110/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 120 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 120 transition count 109
Applied a total of 2 rules in 6 ms. Remains 120 /121 variables (removed 1) and now considering 109/110 (removed 1) transitions.
// Phase 1: matrix 109 rows 120 cols
[2022-05-20 12:55:46] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-20 12:55:46] [INFO ] Implicit Places using invariants in 116 ms returned [41, 116]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 118 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/121 places, 109/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 108
Applied a total of 2 rules in 7 ms. Remains 117 /118 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:55:46] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:55:46] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:55:46] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:55:46] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:55:46] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/121 places, 108/110 transitions.
Finished structural reductions, in 2 iterations. Remains : 117/121 places, 108/110 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-208-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s0 0) (EQ s83 1)), p1:(OR (EQ s64 0) (EQ s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 883 ms.
Product exploration explored 100000 steps with 50000 reset in 488 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 (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 124 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Parking-PT-208-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-208-LTLCardinality-06 finished in 2114 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(G(p0))||p1))))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 116 transition count 105
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 116 transition count 101
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 112 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 111 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 111 transition count 100
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 104 transition count 93
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 104 transition count 93
Applied a total of 33 rules in 20 ms. Remains 104 /121 variables (removed 17) and now considering 93/110 (removed 17) transitions.
// Phase 1: matrix 93 rows 104 cols
[2022-05-20 12:55:48] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-20 12:55:48] [INFO ] Implicit Places using invariants in 103 ms returned [34, 75, 101]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 106 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/121 places, 93/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 99 transition count 91
Applied a total of 4 rules in 9 ms. Remains 99 /101 variables (removed 2) and now considering 91/93 (removed 2) transitions.
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:55:48] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:55:48] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:55:48] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:55:48] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/121 places, 91/110 transitions.
Finished structural reductions, in 2 iterations. Remains : 99/121 places, 91/110 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-208-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s76 1), p1:(AND (EQ s76 0) (OR (EQ s67 0) (EQ s67 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3165 reset in 245 ms.
Product exploration explored 100000 steps with 3166 reset in 288 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 306 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:55:49] [INFO ] Computed 22 place invariants in 8 ms
[2022-05-20 12:55:49] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:55:49] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2022-05-20 12:55:49] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 260 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:55:50] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 12:55:50] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:55:50] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-20 12:55:50] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2022-05-20 12:55:50] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:55:50] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:55:50] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 91/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3165 reset in 350 ms.
Product exploration explored 100000 steps with 3161 reset in 297 ms.
Built C files in :
/tmp/ltsmin6877954221413655134
[2022-05-20 12:55:51] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2022-05-20 12:55:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:55:51] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2022-05-20 12:55:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:55:51] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2022-05-20 12:55:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:55:51] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6877954221413655134
Running compilation step : cd /tmp/ltsmin6877954221413655134;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 620 ms.
Running link step : cd /tmp/ltsmin6877954221413655134;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6877954221413655134;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4070551102855889451.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:56:06] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:56:07] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:56:07] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:56:07] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2022-05-20 12:56:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:56:07] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:56:07] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 91/91 transitions.
Built C files in :
/tmp/ltsmin11223115868989953037
[2022-05-20 12:56:07] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2022-05-20 12:56:07] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:56:07] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2022-05-20 12:56:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:56:07] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2022-05-20 12:56:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:56:07] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11223115868989953037
Running compilation step : cd /tmp/ltsmin11223115868989953037;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 297 ms.
Running link step : cd /tmp/ltsmin11223115868989953037;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11223115868989953037;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2829001058317144581.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 12:56:22] [INFO ] Flatten gal took : 11 ms
[2022-05-20 12:56:22] [INFO ] Flatten gal took : 11 ms
[2022-05-20 12:56:22] [INFO ] Time to serialize gal into /tmp/LTL3606638113337226438.gal : 7 ms
[2022-05-20 12:56:22] [INFO ] Time to serialize properties into /tmp/LTL14217816745276622762.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3606638113337226438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14217816745276622762.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3606638...267
Read 1 LTL properties
Checking formula 0 : !((G(F((F(G("(p100!=1)")))||("((p100==0)&&((p88==0)||(p88==1)))")))))
Formula 0 simplified : !GF("((p100==0)&&((p88==0)||(p88==1)))" | FG"(p100!=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 289 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
17 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.224635,21232,1,0,9,23197,34,5,2366,8550,26
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Parking-PT-208-LTLCardinality-09 finished in 34512 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U p1)))'
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 110/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 121 /121 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 121 cols
[2022-05-20 12:56:22] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-20 12:56:22] [INFO ] Implicit Places using invariants in 115 ms returned [41, 85, 117]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 118 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/121 places, 110/110 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 108
Applied a total of 4 rules in 3 ms. Remains 116 /118 variables (removed 2) and now considering 108/110 (removed 2) transitions.
// Phase 1: matrix 108 rows 116 cols
[2022-05-20 12:56:22] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 12:56:23] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 108 rows 116 cols
[2022-05-20 12:56:23] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 12:56:23] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:56:23] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 116/121 places, 108/110 transitions.
Finished structural reductions, in 2 iterations. Remains : 116/121 places, 108/110 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s101 1), p0:(OR (EQ s65 0) (EQ s54 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 62 steps with 1 reset in 0 ms.
FORMULA Parking-PT-208-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLCardinality-12 finished in 610 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(!(X((X(F(p1))||p0)) U !p2)))))'
Support contains 2 out of 121 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 110/110 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 121 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 106
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 117 transition count 102
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 113 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 112 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 112 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 105 transition count 94
Applied a total of 32 rules in 16 ms. Remains 105 /121 variables (removed 16) and now considering 94/110 (removed 16) transitions.
// Phase 1: matrix 94 rows 105 cols
[2022-05-20 12:56:23] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-20 12:56:23] [INFO ] Implicit Places using invariants in 135 ms returned [76, 102]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 136 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/121 places, 94/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 92
Applied a total of 4 rules in 11 ms. Remains 101 /103 variables (removed 2) and now considering 92/94 (removed 2) transitions.
// Phase 1: matrix 92 rows 101 cols
[2022-05-20 12:56:23] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:56:23] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 92 rows 101 cols
[2022-05-20 12:56:23] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-20 12:56:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-20 12:56:23] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/121 places, 92/110 transitions.
Finished structural reductions, in 2 iterations. Remains : 101/121 places, 92/110 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
Running random walk in product with property : Parking-PT-208-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(OR (EQ s83 0) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2983 reset in 328 ms.
Product exploration explored 100000 steps with 2977 reset in 288 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 : [p2, (X p2)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Finished random walk after 263 steps, including 8 resets, run visited all 1 properties in 1 ms. (steps per millisecond=263 )
Knowledge obtained : [p2, (X p2)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Support contains 2 out of 101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 101 cols
[2022-05-20 12:56:24] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:56:25] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 92 rows 101 cols
[2022-05-20 12:56:25] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:56:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-20 12:56:25] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2022-05-20 12:56:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 92 rows 101 cols
[2022-05-20 12:56:25] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:56:25] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 92/92 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 : [p2, (X p2)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p2, (X p2)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Product exploration explored 100000 steps with 2972 reset in 192 ms.
Product exploration explored 100000 steps with 2981 reset in 211 ms.
Built C files in :
/tmp/ltsmin11365899801469959300
[2022-05-20 12:56:26] [INFO ] Computing symmetric may disable matrix : 92 transitions.
[2022-05-20 12:56:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:56:26] [INFO ] Computing symmetric may enable matrix : 92 transitions.
[2022-05-20 12:56:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:56:26] [INFO ] Computing Do-Not-Accords matrix : 92 transitions.
[2022-05-20 12:56:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:56:26] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11365899801469959300
Running compilation step : cd /tmp/ltsmin11365899801469959300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 282 ms.
Running link step : cd /tmp/ltsmin11365899801469959300;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11365899801469959300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9554731288882089134.hoa' '--buchi-type=spotba'
LTSmin run took 2027 ms.
FORMULA Parking-PT-208-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-208-LTLCardinality-13 finished in 5145 ms.
All properties solved by simple procedures.
Total runtime 46564 ms.
BK_STOP 1653051388669
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="itstools"
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-4028"
echo " Executing tool itstools"
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 r150-smll-165276998700307"
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 '
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 ;