Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536300411.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r261-smll-167863536300411
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.7K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 14:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 14:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 14:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 23K Mar 5 18:23 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 1678920536311

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-104
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-15 22:48:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 22:48:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:48:59] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-15 22:48:59] [INFO ] Transformed 65 places.
[2023-03-15 22:48:59] [INFO ] Transformed 97 transitions.
[2023-03-15 22:48:59] [INFO ] Found NUPN structural information;
[2023-03-15 22:48:59] [INFO ] Parsed PT model containing 65 places and 97 transitions and 284 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 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-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-LTLCardinality-14 FALSE 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.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 34 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 64 cols
[2023-03-15 22:49:00] [INFO ] Computed 16 place invariants in 7 ms
[2023-03-15 22:49:00] [INFO ] Implicit Places using invariants in 305 ms returned [24, 32, 58, 60]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 364 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/65 places, 55/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 54
Applied a total of 2 rules in 8 ms. Remains 59 /60 variables (removed 1) and now considering 54/55 (removed 1) transitions.
// Phase 1: matrix 54 rows 59 cols
[2023-03-15 22:49:00] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-15 22:49:00] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-15 22:49:00] [INFO ] Invariant cache hit.
[2023-03-15 22:49:00] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 22:49:00] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 59/65 places, 54/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 691 ms. Remains : 59/65 places, 54/56 transitions.
Support contains 18 out of 59 places after structural reductions.
[2023-03-15 22:49:01] [INFO ] Flatten gal took : 50 ms
[2023-03-15 22:49:01] [INFO ] Flatten gal took : 22 ms
[2023-03-15 22:49:01] [INFO ] Input system was already deterministic with 54 transitions.
Incomplete random walk after 10000 steps, including 598 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 22:49:01] [INFO ] Invariant cache hit.
[2023-03-15 22:49:02] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 22:49:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-15 22:49:02] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA Parking-PT-104-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 54/54 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 53
Applied a total of 2 rules in 9 ms. Remains 58 /59 variables (removed 1) and now considering 53/54 (removed 1) transitions.
// Phase 1: matrix 53 rows 58 cols
[2023-03-15 22:49:02] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-15 22:49:02] [INFO ] Implicit Places using invariants in 124 ms returned [37, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 126 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/59 places, 53/54 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 9 ms. Remains 54 /56 variables (removed 2) and now considering 51/53 (removed 2) transitions.
// Phase 1: matrix 51 rows 54 cols
[2023-03-15 22:49:02] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-15 22:49:02] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-15 22:49:02] [INFO ] Invariant cache hit.
[2023-03-15 22:49:02] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 22:49:02] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/59 places, 51/54 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 394 ms. Remains : 54/59 places, 51/54 transitions.
Stuttering acceptance computed with spot in 343 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLCardinality-04 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: 2}]], initial=3, aps=[p0:(EQ s10 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 3 ms.
FORMULA Parking-PT-104-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLCardinality-04 finished in 835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 54/54 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 53
Applied a total of 2 rules in 10 ms. Remains 58 /59 variables (removed 1) and now considering 53/54 (removed 1) transitions.
// Phase 1: matrix 53 rows 58 cols
[2023-03-15 22:49:03] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-15 22:49:03] [INFO ] Implicit Places using invariants in 134 ms returned [37, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 136 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/59 places, 53/54 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 6 ms. Remains 54 /56 variables (removed 2) and now considering 51/53 (removed 2) transitions.
// Phase 1: matrix 51 rows 54 cols
[2023-03-15 22:49:03] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-15 22:49:03] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-15 22:49:03] [INFO ] Invariant cache hit.
[2023-03-15 22:49:03] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 22:49:03] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/59 places, 51/54 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 404 ms. Remains : 54/59 places, 51/54 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s38 0) (NEQ s11 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][false, false]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA Parking-PT-104-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLCardinality-06 finished in 525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 54/54 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 53
Applied a total of 2 rules in 4 ms. Remains 58 /59 variables (removed 1) and now considering 53/54 (removed 1) transitions.
// Phase 1: matrix 53 rows 58 cols
[2023-03-15 22:49:03] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-15 22:49:03] [INFO ] Implicit Places using invariants in 60 ms returned [37, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/59 places, 53/54 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 5 ms. Remains 54 /56 variables (removed 2) and now considering 51/53 (removed 2) transitions.
// Phase 1: matrix 51 rows 54 cols
[2023-03-15 22:49:03] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-15 22:49:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-15 22:49:03] [INFO ] Invariant cache hit.
[2023-03-15 22:49:03] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 22:49:03] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/59 places, 51/54 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 231 ms. Remains : 54/59 places, 51/54 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s48 0) (EQ s22 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 645 ms.
Product exploration explored 100000 steps with 50000 reset in 275 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), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-104-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-104-LTLCardinality-07 finished in 1343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(p1))))'
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 54/54 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 53
Applied a total of 2 rules in 4 ms. Remains 58 /59 variables (removed 1) and now considering 53/54 (removed 1) transitions.
// Phase 1: matrix 53 rows 58 cols
[2023-03-15 22:49:05] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-15 22:49:05] [INFO ] Implicit Places using invariants in 52 ms returned [37, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/59 places, 53/54 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 4 ms. Remains 54 /56 variables (removed 2) and now considering 51/53 (removed 2) transitions.
// Phase 1: matrix 51 rows 54 cols
[2023-03-15 22:49:05] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 22:49:05] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-15 22:49:05] [INFO ] Invariant cache hit.
[2023-03-15 22:49:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 22:49:05] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/59 places, 51/54 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 258 ms. Remains : 54/59 places, 51/54 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s52 1)), p1:(OR (EQ s27 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7984 reset in 491 ms.
Product exploration explored 100000 steps with 7952 reset in 339 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 79 steps, including 4 resets, run visited all 2 properties in 2 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-15 22:49:07] [INFO ] Invariant cache hit.
[2023-03-15 22:49:07] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-15 22:49:07] [INFO ] Invariant cache hit.
[2023-03-15 22:49:07] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 22:49:07] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-15 22:49:07] [INFO ] Invariant cache hit.
[2023-03-15 22:49:07] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 54/54 places, 51/51 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 32 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 271 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 7995 reset in 141 ms.
Product exploration explored 100000 steps with 7963 reset in 248 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 51/51 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 51
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 54 transition count 51
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 54 transition count 51
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 52 transition count 49
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 52 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 52 transition count 51
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 12 rules in 35 ms. Remains 52 /54 variables (removed 2) and now considering 51/51 (removed 0) transitions.
[2023-03-15 22:49:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 52 cols
[2023-03-15 22:49:09] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-15 22:49:09] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/54 places, 51/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 52/54 places, 51/51 transitions.
Built C files in :
/tmp/ltsmin15575195786477597221
[2023-03-15 22:49:09] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15575195786477597221
Running compilation step : cd /tmp/ltsmin15575195786477597221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 490 ms.
Running link step : cd /tmp/ltsmin15575195786477597221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin15575195786477597221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12981434668601297716.hoa' '--buchi-type=spotba'
LTSmin run took 385 ms.
FORMULA Parking-PT-104-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-104-LTLCardinality-09 finished in 5460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 54/54 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 58 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 57 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 57 transition count 51
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 56 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 55 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 55 transition count 50
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 2 with 12 rules applied. Total rules applied 18 place count 49 transition count 44
Applied a total of 18 rules in 21 ms. Remains 49 /59 variables (removed 10) and now considering 44/54 (removed 10) transitions.
// Phase 1: matrix 44 rows 49 cols
[2023-03-15 22:49:10] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-15 22:49:10] [INFO ] Implicit Places using invariants in 74 ms returned [30, 37]
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 : 47/59 places, 44/54 transitions.
Applied a total of 0 rules in 5 ms. Remains 47 /47 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 47/59 places, 44/54 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLCardinality-10 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 s41 0) (EQ s32 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 6468 reset in 476 ms.
Product exploration explored 100000 steps with 6472 reset in 370 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Finished random walk after 165 steps, including 11 resets, run visited all 1 properties in 2 ms. (steps per millisecond=82 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 44/44 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 47 cols
[2023-03-15 22:49:12] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-15 22:49:12] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-15 22:49:12] [INFO ] Invariant cache hit.
[2023-03-15 22:49:12] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-15 22:49:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 22:49:12] [INFO ] Invariant cache hit.
[2023-03-15 22:49:12] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 275 ms. Remains : 47/47 places, 44/44 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Finished random walk after 25 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6467 reset in 178 ms.
Product exploration explored 100000 steps with 6471 reset in 206 ms.
Built C files in :
/tmp/ltsmin2782947882729700438
[2023-03-15 22:49:13] [INFO ] Computing symmetric may disable matrix : 44 transitions.
[2023-03-15 22:49:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:49:13] [INFO ] Computing symmetric may enable matrix : 44 transitions.
[2023-03-15 22:49:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:49:13] [INFO ] Computing Do-Not-Accords matrix : 44 transitions.
[2023-03-15 22:49:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:49:13] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2782947882729700438
Running compilation step : cd /tmp/ltsmin2782947882729700438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 172 ms.
Running link step : cd /tmp/ltsmin2782947882729700438;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin2782947882729700438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9074560214377306241.hoa' '--buchi-type=spotba'
LTSmin run took 133 ms.
FORMULA Parking-PT-104-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-104-LTLCardinality-10 finished in 3198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 54/54 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 59 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 57 transition count 52
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 57 transition count 50
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 55 transition count 50
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 54 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 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 2 with 12 rules applied. Total rules applied 22 place count 48 transition count 43
Applied a total of 22 rules in 13 ms. Remains 48 /59 variables (removed 11) and now considering 43/54 (removed 11) transitions.
// Phase 1: matrix 43 rows 48 cols
[2023-03-15 22:49:13] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-15 22:49:13] [INFO ] Implicit Places using invariants in 88 ms returned [31, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/59 places, 43/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 62
Applied a total of 2 rules in 7 ms. Remains 45 /46 variables (removed 1) and now considering 62/43 (removed -19) transitions.
// Phase 1: matrix 62 rows 45 cols
[2023-03-15 22:49:13] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 22:49:13] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-15 22:49:13] [INFO ] Invariant cache hit.
[2023-03-15 22:49:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 22:49:14] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/59 places, 62/54 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 351 ms. Remains : 45/59 places, 62/54 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-104-LTLCardinality-11 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 s0 0) (EQ s24 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 11591 reset in 185 ms.
Product exploration explored 100000 steps with 11493 reset in 521 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
[2023-03-15 22:49:15] [INFO ] Invariant cache hit.
[2023-03-15 22:49:15] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-15 22:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:49:15] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 22:49:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 22:49:15] [INFO ] [Real]Added 38 Read/Feed constraints in 10 ms returned sat
[2023-03-15 22:49:15] [INFO ] Computed and/alt/rep : 57/384/57 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 22:49:15] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-15 22:49:15] [INFO ] Invariant cache hit.
[2023-03-15 22:49:15] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-15 22:49:15] [INFO ] Invariant cache hit.
[2023-03-15 22:49:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 22:49:15] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-15 22:49:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 22:49:15] [INFO ] Invariant cache hit.
[2023-03-15 22:49:15] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 393 ms. Remains : 45/45 places, 62/62 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
[2023-03-15 22:49:16] [INFO ] Invariant cache hit.
[2023-03-15 22:49:16] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-15 22:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:49:16] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-15 22:49:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 22:49:16] [INFO ] [Real]Added 38 Read/Feed constraints in 8 ms returned sat
[2023-03-15 22:49:16] [INFO ] Computed and/alt/rep : 57/384/57 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-15 22:49:16] [INFO ] Added : 0 causal constraints over 0 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11480 reset in 213 ms.
Product exploration explored 100000 steps with 11409 reset in 240 ms.
Built C files in :
/tmp/ltsmin17321980243810078876
[2023-03-15 22:49:17] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2023-03-15 22:49:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:49:17] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2023-03-15 22:49:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:49:17] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2023-03-15 22:49:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:49:17] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17321980243810078876
Running compilation step : cd /tmp/ltsmin17321980243810078876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 291 ms.
Running link step : cd /tmp/ltsmin17321980243810078876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17321980243810078876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15932297092448774288.hoa' '--buchi-type=spotba'
LTSmin run took 378 ms.
FORMULA Parking-PT-104-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-104-LTLCardinality-11 finished in 4462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(p1)))||X((X(F(p0)) U G(p2)))))'
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 54/54 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 53
Applied a total of 2 rules in 4 ms. Remains 58 /59 variables (removed 1) and now considering 53/54 (removed 1) transitions.
// Phase 1: matrix 53 rows 58 cols
[2023-03-15 22:49:18] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-15 22:49:18] [INFO ] Implicit Places using invariants in 63 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/59 places, 53/54 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 3 ms. Remains 56 /57 variables (removed 1) and now considering 52/53 (removed 1) transitions.
// Phase 1: matrix 52 rows 56 cols
[2023-03-15 22:49:18] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 22:49:18] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-15 22:49:18] [INFO ] Invariant cache hit.
[2023-03-15 22:49:18] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 22:49:18] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 56/59 places, 52/54 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 263 ms. Remains : 56/59 places, 52/54 transitions.
Stuttering acceptance computed with spot in 436 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : Parking-PT-104-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 5}]], initial=0, aps=[p0:(OR (EQ s43 0) (EQ s4 1)), p1:(OR (EQ s46 0) (EQ s12 1)), p2:(OR (EQ s43 0) (EQ s2 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 52762 steps with 4888 reset in 205 ms.
FORMULA Parking-PT-104-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-104-LTLCardinality-12 finished in 932 ms.
All properties solved by simple procedures.
Total runtime 19581 ms.

BK_STOP 1678920560400

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-5348"
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 r261-smll-167863536300411"
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 ;