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-165276998700299.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-104, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998700299
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 6.5K Apr 30 05:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 05:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 05:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 05:47 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.6K 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 17K 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 23K 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-104-LTLCardinality-00
FORMULA_NAME Parking-PT-104-LTLCardinality-01
FORMULA_NAME Parking-PT-104-LTLCardinality-02
FORMULA_NAME Parking-PT-104-LTLCardinality-03
FORMULA_NAME Parking-PT-104-LTLCardinality-04
FORMULA_NAME Parking-PT-104-LTLCardinality-05
FORMULA_NAME Parking-PT-104-LTLCardinality-06
FORMULA_NAME Parking-PT-104-LTLCardinality-07
FORMULA_NAME Parking-PT-104-LTLCardinality-08
FORMULA_NAME Parking-PT-104-LTLCardinality-09
FORMULA_NAME Parking-PT-104-LTLCardinality-10
FORMULA_NAME Parking-PT-104-LTLCardinality-11
FORMULA_NAME Parking-PT-104-LTLCardinality-12
FORMULA_NAME Parking-PT-104-LTLCardinality-13
FORMULA_NAME Parking-PT-104-LTLCardinality-14
FORMULA_NAME Parking-PT-104-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653051117823

Running Version 202205111006
[2022-05-20 12:51:59] [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:51:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:52:00] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2022-05-20 12:52:00] [INFO ] Transformed 65 places.
[2022-05-20 12:52:00] [INFO ] Transformed 97 transitions.
[2022-05-20 12:52:00] [INFO ] Found NUPN structural information;
[2022-05-20 12:52:00] [INFO ] Parsed PT model containing 65 places and 97 transitions in 298 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Parking-PT-104-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 32 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 65 cols
[2022-05-20 12:52:00] [INFO ] Computed 16 place invariants in 15 ms
[2022-05-20 12:52:00] [INFO ] Implicit Places using invariants in 351 ms returned [32, 40, 58, 60]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 419 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/65 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/65 places, 56/56 transitions.
Support contains 18 out of 61 places after structural reductions.
[2022-05-20 12:52:01] [INFO ] Flatten gal took : 39 ms
[2022-05-20 12:52:01] [INFO ] Flatten gal took : 25 ms
[2022-05-20 12:52:01] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 16 out of 61 places (down from 18) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 600 resets, run finished after 704 ms. (steps per millisecond=14 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 56 rows 61 cols
[2022-05-20 12:52:02] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-20 12:52:02] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-05-20 12:52:02] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-20 12:52:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-05-20 12:52:02] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-20 12:52:02] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 12:52:02] [INFO ] After 14ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-05-20 12:52:02] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-20 12:52:02] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 56/56 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 59 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 59 transition count 52
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 57 transition count 52
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 55 transition count 50
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 55 transition count 50
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 50 transition count 45
Free-agglomeration rule applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 34 place count 50 transition count 33
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 46 place count 38 transition count 33
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 38 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 37 transition count 32
Applied a total of 48 rules in 53 ms. Remains 37 /61 variables (removed 24) and now considering 32/56 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/61 places, 32/56 transitions.
Finished random walk after 244 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=122 )
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
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' '!(X(X(p0)))'
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 58 transition count 53
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 58 transition count 53
Applied a total of 6 rules in 8 ms. Remains 58 /61 variables (removed 3) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 58 cols
[2022-05-20 12:52:02] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-20 12:52:03] [INFO ] Implicit Places using invariants in 102 ms returned [24, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 103 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/61 places, 53/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 54 transition count 51
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 51
Applied a total of 4 rules in 10 ms. Remains 54 /56 variables (removed 2) and now considering 51/53 (removed 2) transitions.
// Phase 1: matrix 51 rows 54 cols
[2022-05-20 12:52:03] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-20 12:52:03] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 51 rows 54 cols
[2022-05-20 12:52:03] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-20 12:52:03] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 12:52:03] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/61 places, 51/56 transitions.
Finished structural reductions, in 2 iterations. Remains : 54/61 places, 51/56 transitions.
Stuttering acceptance computed with spot in 409 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Parking-PT-104-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLCardinality-02 finished in 893 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 59 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 59 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 57 transition count 52
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 54 transition count 49
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 54 transition count 49
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 49 transition count 44
Applied a total of 24 rules in 30 ms. Remains 49 /61 variables (removed 12) and now considering 44/56 (removed 12) transitions.
// Phase 1: matrix 44 rows 49 cols
[2022-05-20 12:52:03] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 12:52:03] [INFO ] Implicit Places using invariants in 92 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/61 places, 44/56 transitions.
Applied a total of 0 rules in 7 ms. Remains 48 /48 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 48/61 places, 44/56 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s36 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 6099 reset in 751 ms.
Product exploration explored 100000 steps with 6089 reset in 253 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 153 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 49 ms :[(NOT p0)]
Finished random walk after 26 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 168 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 44/44 transitions.
Applied a total of 0 rules in 6 ms. Remains 48 /48 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 48 cols
[2022-05-20 12:52:05] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 12:52:05] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 44 rows 48 cols
[2022-05-20 12:52:05] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 12:52:05] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-20 12:52:05] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2022-05-20 12:52:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 48 cols
[2022-05-20 12:52:05] [INFO ] Computed 11 place invariants in 8 ms
[2022-05-20 12:52:05] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 44/44 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 154 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 46 ms :[(NOT p0)]
Finished random walk after 103 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 241 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 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6078 reset in 144 ms.
Product exploration explored 100000 steps with 6088 reset in 389 ms.
Built C files in :
/tmp/ltsmin7825684803081479441
[2022-05-20 12:52:07] [INFO ] Computing symmetric may disable matrix : 44 transitions.
[2022-05-20 12:52:07] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:52:07] [INFO ] Computing symmetric may enable matrix : 44 transitions.
[2022-05-20 12:52:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:52:07] [INFO ] Computing Do-Not-Accords matrix : 44 transitions.
[2022-05-20 12:52:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:52:07] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7825684803081479441
Running compilation step : cd /tmp/ltsmin7825684803081479441;'/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 329 ms.
Running link step : cd /tmp/ltsmin7825684803081479441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin7825684803081479441;'/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/stateBased14653129790922026809.hoa' '--buchi-type=spotba'
LTSmin run took 318 ms.
FORMULA Parking-PT-104-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-104-LTLCardinality-06 finished in 3962 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 58 transition count 53
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 58 transition count 53
Applied a total of 6 rules in 4 ms. Remains 58 /61 variables (removed 3) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 58 cols
[2022-05-20 12:52:07] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-20 12:52:07] [INFO ] Implicit Places using invariants in 82 ms returned [24, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/61 places, 53/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 54 transition count 51
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 51
Applied a total of 4 rules in 3 ms. Remains 54 /56 variables (removed 2) and now considering 51/53 (removed 2) transitions.
// Phase 1: matrix 51 rows 54 cols
[2022-05-20 12:52:07] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 12:52:07] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 51 rows 54 cols
[2022-05-20 12:52:07] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 12:52:07] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 12:52:07] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/61 places, 51/56 transitions.
Finished structural reductions, in 2 iterations. Remains : 54/61 places, 51/56 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s1 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]]
Stuttering criterion allowed to conclude after 62 steps with 10 reset in 1 ms.
FORMULA Parking-PT-104-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLCardinality-09 finished in 383 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 58 transition count 53
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 58 transition count 53
Applied a total of 6 rules in 4 ms. Remains 58 /61 variables (removed 3) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 58 cols
[2022-05-20 12:52:08] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 12:52:08] [INFO ] Implicit Places using invariants in 54 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/61 places, 53/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 52
Applied a total of 2 rules in 4 ms. Remains 56 /57 variables (removed 1) and now considering 52/53 (removed 1) transitions.
// Phase 1: matrix 52 rows 56 cols
[2022-05-20 12:52:08] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 12:52:08] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 52 rows 56 cols
[2022-05-20 12:52:08] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-20 12:52:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 12:52:08] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 56/61 places, 52/56 transitions.
Finished structural reductions, in 2 iterations. Remains : 56/61 places, 52/56 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s24 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA Parking-PT-104-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLCardinality-10 finished in 352 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 58 transition count 53
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 58 transition count 53
Applied a total of 6 rules in 4 ms. Remains 58 /61 variables (removed 3) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 58 cols
[2022-05-20 12:52:08] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 12:52:08] [INFO ] Implicit Places using invariants in 77 ms returned [24, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/61 places, 53/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 54 transition count 51
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 51
Applied a total of 4 rules in 3 ms. Remains 54 /56 variables (removed 2) and now considering 51/53 (removed 2) transitions.
// Phase 1: matrix 51 rows 54 cols
[2022-05-20 12:52:08] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 12:52:08] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 51 rows 54 cols
[2022-05-20 12:52:08] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 12:52:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 12:52:08] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/61 places, 51/56 transitions.
Finished structural reductions, in 2 iterations. Remains : 54/61 places, 51/56 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s21 0) (NEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Parking-PT-104-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLCardinality-12 finished in 437 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!G(!X(!F(G(p0)))) U F(p0))))'
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 54
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 59 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 58 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 58 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 57 transition count 52
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 9 place count 54 transition count 49
Iterating global reduction 3 with 3 rules applied. Total rules applied 12 place count 54 transition count 49
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 24 place count 48 transition count 43
Applied a total of 24 rules in 9 ms. Remains 48 /61 variables (removed 13) and now considering 43/56 (removed 13) transitions.
// Phase 1: matrix 43 rows 48 cols
[2022-05-20 12:52:08] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 12:52:09] [INFO ] Implicit Places using invariants in 73 ms returned [21, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 75 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/61 places, 43/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 46/61 places, 43/56 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s29 0) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6757 reset in 299 ms.
Product exploration explored 100000 steps with 6728 reset in 304 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 224 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 145 ms :[(NOT p0), (NOT p0)]
Finished random walk after 52 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 138 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 46 cols
[2022-05-20 12:52:10] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-20 12:52:10] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 43 rows 46 cols
[2022-05-20 12:52:10] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-20 12:52:10] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2022-05-20 12:52:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 43 rows 46 cols
[2022-05-20 12:52:10] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 12:52:10] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 43/43 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 152 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 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 156 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 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6725 reset in 189 ms.
Product exploration explored 100000 steps with 6725 reset in 275 ms.
Built C files in :
/tmp/ltsmin18097233189577040756
[2022-05-20 12:52:11] [INFO ] Computing symmetric may disable matrix : 43 transitions.
[2022-05-20 12:52:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:52:11] [INFO ] Computing symmetric may enable matrix : 43 transitions.
[2022-05-20 12:52:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:52:11] [INFO ] Computing Do-Not-Accords matrix : 43 transitions.
[2022-05-20 12:52:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:52:11] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18097233189577040756
Running compilation step : cd /tmp/ltsmin18097233189577040756;'/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 262 ms.
Running link step : cd /tmp/ltsmin18097233189577040756;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin18097233189577040756;'/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/stateBased8167346175174185868.hoa' '--buchi-type=spotba'
LTSmin run took 353 ms.
FORMULA Parking-PT-104-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-104-LTLCardinality-13 finished in 3587 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!((F(X(p0)) U p0) U X(p1))&&F(p2)))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 59 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 54
Applied a total of 4 rules in 3 ms. Remains 59 /61 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 59 cols
[2022-05-20 12:52:12] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 12:52:12] [INFO ] Implicit Places using invariants in 86 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 88 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/61 places, 54/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 55 transition count 52
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 55 transition count 52
Applied a total of 4 rules in 3 ms. Remains 55 /57 variables (removed 2) and now considering 52/54 (removed 2) transitions.
// Phase 1: matrix 52 rows 55 cols
[2022-05-20 12:52:12] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 12:52:12] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 52 rows 55 cols
[2022-05-20 12:52:12] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-20 12:52:12] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 12:52:12] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 55/61 places, 52/56 transitions.
Finished structural reductions, in 2 iterations. Remains : 55/61 places, 52/56 transitions.
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p2) p1), p1, (NOT p2), p1, (AND p0 p1), true, (AND p0 p1), (AND p0 (NOT p1))]
Running random walk in product with property : Parking-PT-104-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s24 1), p0:(OR (EQ s22 0) (EQ s39 1)), p1:(OR (EQ s10 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 39 steps with 7 reset in 1 ms.
FORMULA Parking-PT-104-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLCardinality-14 finished in 667 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||G((X(p1)||(F(p2)&&p3))))))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 59 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 54
Applied a total of 4 rules in 2 ms. Remains 59 /61 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 59 cols
[2022-05-20 12:52:13] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 12:52:13] [INFO ] Implicit Places using invariants in 46 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/61 places, 54/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 53
Applied a total of 2 rules in 3 ms. Remains 57 /58 variables (removed 1) and now considering 53/54 (removed 1) transitions.
// Phase 1: matrix 53 rows 57 cols
[2022-05-20 12:52:13] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 12:52:13] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 53 rows 57 cols
[2022-05-20 12:52:13] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 12:52:13] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 12:52:13] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 57/61 places, 53/56 transitions.
Finished structural reductions, in 2 iterations. Remains : 57/61 places, 53/56 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2) (NOT p1)), false]
Running random walk in product with property : Parking-PT-104-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s47 0) (EQ s54 1)), p3:(OR (EQ s54 0) (EQ s24 1)), p2:(EQ s15 0), p1:(EQ s44 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9836 reset in 479 ms.
Product exploration explored 100000 steps with 9827 reset in 454 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) p3 p2 p1), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
Knowledge based reduction with 14 factoid took 753 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 599 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 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 104 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 53 rows 57 cols
[2022-05-20 12:52:16] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 12:52:16] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 12:52:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-20 12:52:16] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2022-05-20 12:52:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 12:52:16] [INFO ] After 18ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2022-05-20 12:52:16] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-20 12:52:16] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 53/53 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 55 transition count 51
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 55 transition count 49
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 53 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 49 transition count 45
Free-agglomeration rule applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 49 transition count 33
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 40 place count 37 transition count 33
Applied a total of 40 rules in 8 ms. Remains 37 /57 variables (removed 20) and now considering 33/53 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/57 places, 33/53 transitions.
Finished random walk after 220 steps, including 8 resets, run visited all 3 properties in 2 ms. (steps per millisecond=110 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p3 p2 p1), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p3 (NOT p2))), (F p0), (F (AND (NOT p0) p3 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 16 factoid took 1068 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false]
Support contains 4 out of 57 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 : 57/57 places, 53/53 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 55 transition count 51
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 55 transition count 49
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 53 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 49 transition count 45
Applied a total of 16 rules in 12 ms. Remains 49 /57 variables (removed 8) and now considering 45/53 (removed 8) transitions.
// Phase 1: matrix 45 rows 49 cols
[2022-05-20 12:52:17] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 12:52:17] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 45 rows 49 cols
[2022-05-20 12:52:17] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 12:52:17] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-20 12:52:17] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2022-05-20 12:52:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 49 cols
[2022-05-20 12:52:17] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 12:52:17] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/57 places, 45/53 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/57 places, 45/53 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 (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 6 factoid took 316 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false]
Incomplete random walk after 10000 steps, including 604 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 49 cols
[2022-05-20 12:52:18] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 12:52:18] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:52:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-20 12:52:18] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:52:18] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-20 12:52:18] [INFO ] After 7ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 12:52:18] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-20 12:52:18] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 49/49 places, 45/45 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 44
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 48 transition count 32
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 26 place count 36 transition count 32
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 36 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 35 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 34 transition count 30
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 38 place count 27 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 40 place count 25 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 40 place count 25 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 24 transition count 27
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 44 place count 22 transition count 25
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 22 transition count 25
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 47 place count 21 transition count 24
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 21 transition count 24
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 49 place count 20 transition count 23
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 20 transition count 23
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 58 place count 16 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 60 place count 16 transition count 17
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 62 place count 16 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 64 place count 14 transition count 15
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 65 place count 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 66 place count 13 transition count 14
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 67 place count 13 transition count 14
Applied a total of 67 rules in 21 ms. Remains 13 /49 variables (removed 36) and now considering 14/45 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/49 places, 14/45 transitions.
Finished random walk after 56 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (AND (NOT p2) p1 (NOT p0))), (F p0), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 6 factoid took 420 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false]
Product exploration explored 100000 steps with 9837 reset in 150 ms.
Product exploration explored 100000 steps with 9800 reset in 170 ms.
Built C files in :
/tmp/ltsmin1991668304965001075
[2022-05-20 12:52:19] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2022-05-20 12:52:19] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:52:19] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2022-05-20 12:52:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:52:19] [INFO ] Computing Do-Not-Accords matrix : 45 transitions.
[2022-05-20 12:52:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:52:19] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1991668304965001075
Running compilation step : cd /tmp/ltsmin1991668304965001075;'/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 183 ms.
Running link step : cd /tmp/ltsmin1991668304965001075;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1991668304965001075;'/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/stateBased16128496701997690034.hoa' '--buchi-type=spotba'
LTSmin run took 154 ms.
FORMULA Parking-PT-104-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-104-LTLCardinality-15 finished in 6839 ms.
All properties solved by simple procedures.
Total runtime 20199 ms.

BK_STOP 1653051140229

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

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