Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 04:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 04:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 27K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SmartHome-PT-02-LTLCardinality-00
FORMULA_NAME SmartHome-PT-02-LTLCardinality-01
FORMULA_NAME SmartHome-PT-02-LTLCardinality-02
FORMULA_NAME SmartHome-PT-02-LTLCardinality-03
FORMULA_NAME SmartHome-PT-02-LTLCardinality-04
FORMULA_NAME SmartHome-PT-02-LTLCardinality-05
FORMULA_NAME SmartHome-PT-02-LTLCardinality-06
FORMULA_NAME SmartHome-PT-02-LTLCardinality-07
FORMULA_NAME SmartHome-PT-02-LTLCardinality-08
FORMULA_NAME SmartHome-PT-02-LTLCardinality-09
FORMULA_NAME SmartHome-PT-02-LTLCardinality-10
FORMULA_NAME SmartHome-PT-02-LTLCardinality-11
FORMULA_NAME SmartHome-PT-02-LTLCardinality-12
FORMULA_NAME SmartHome-PT-02-LTLCardinality-13
FORMULA_NAME SmartHome-PT-02-LTLCardinality-14
FORMULA_NAME SmartHome-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717029176261

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 00:32:58] [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]
[2024-05-30 00:32:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 00:32:59] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-30 00:32:59] [INFO ] Transformed 41 places.
[2024-05-30 00:32:59] [INFO ] Transformed 127 transitions.
[2024-05-30 00:32:59] [INFO ] Found NUPN structural information;
[2024-05-30 00:32:59] [INFO ] Parsed PT model containing 41 places and 127 transitions and 359 arcs in 366 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 66 transitions
Reduce redundant transitions removed 66 transitions.
FORMULA SmartHome-PT-02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-02-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-02-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-02-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-02-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 61/61 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 41 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 40 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 40 transition count 48
Applied a total of 14 rules in 45 ms. Remains 40 /41 variables (removed 1) and now considering 48/61 (removed 13) transitions.
[2024-05-30 00:32:59] [INFO ] Flow matrix only has 36 transitions (discarded 12 similar events)
// Phase 1: matrix 36 rows 40 cols
[2024-05-30 00:32:59] [INFO ] Computed 16 invariants in 15 ms
[2024-05-30 00:32:59] [INFO ] Implicit Places using invariants in 317 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 392 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 39/41 places, 48/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 479 ms. Remains : 39/41 places, 48/61 transitions.
Support contains 22 out of 39 places after structural reductions.
[2024-05-30 00:33:00] [INFO ] Flatten gal took : 57 ms
[2024-05-30 00:33:00] [INFO ] Flatten gal took : 19 ms
[2024-05-30 00:33:00] [INFO ] Input system was already deterministic with 48 transitions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (8 resets) in 1913 ms. (20 steps per ms) remains 1/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 1/1 properties
[2024-05-30 00:33:01] [INFO ] Flow matrix only has 36 transitions (discarded 12 similar events)
// Phase 1: matrix 36 rows 39 cols
[2024-05-30 00:33:01] [INFO ] Computed 15 invariants in 4 ms
[2024-05-30 00:33:01] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/26 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/49 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/51 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/53 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/55 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/55 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/63 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/63 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/63 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/65 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/65 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/70 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/70 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/70 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/74 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/74 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/74 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/75 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/75 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/75 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Int declared 3/75 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 2/14 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/39 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-02-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 13 stable transitions
Graph (complete) has 88 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U (G(p1)||(p1&&G(!p2))))||p0)))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 33 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 33 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 33 transition count 41
Applied a total of 13 rules in 12 ms. Remains 33 /39 variables (removed 6) and now considering 41/48 (removed 7) transitions.
[2024-05-30 00:33:01] [INFO ] Flow matrix only has 31 transitions (discarded 10 similar events)
// Phase 1: matrix 31 rows 33 cols
[2024-05-30 00:33:01] [INFO ] Computed 12 invariants in 1 ms
[2024-05-30 00:33:01] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 00:33:01] [INFO ] Flow matrix only has 31 transitions (discarded 10 similar events)
[2024-05-30 00:33:01] [INFO ] Invariant cache hit.
[2024-05-30 00:33:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-30 00:33:01] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 00:33:01] [INFO ] Flow matrix only has 31 transitions (discarded 10 similar events)
[2024-05-30 00:33:01] [INFO ] Invariant cache hit.
[2024-05-30 00:33:01] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 30/63 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 1/64 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 57 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1276 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 30/63 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 40/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 1/64 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 97 constraints, problems are : Problem set: 0 solved, 40 unsolved in 941 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 2245ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2247ms
Starting structural reductions in LTL mode, iteration 1 : 33/39 places, 41/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2425 ms. Remains : 33/39 places, 41/48 transitions.
Stuttering acceptance computed with spot in 584 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2), p2]
Running random walk in product with property : SmartHome-PT-02-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 4 ms.
FORMULA SmartHome-PT-02-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-02-LTLCardinality-01 finished in 3099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 34 transition count 44
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 34 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 34 transition count 42
Applied a total of 11 rules in 5 ms. Remains 34 /39 variables (removed 5) and now considering 42/48 (removed 6) transitions.
[2024-05-30 00:33:04] [INFO ] Flow matrix only has 31 transitions (discarded 11 similar events)
// Phase 1: matrix 31 rows 34 cols
[2024-05-30 00:33:04] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 00:33:04] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-30 00:33:04] [INFO ] Flow matrix only has 31 transitions (discarded 11 similar events)
[2024-05-30 00:33:04] [INFO ] Invariant cache hit.
[2024-05-30 00:33:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-30 00:33:05] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2024-05-30 00:33:05] [INFO ] Flow matrix only has 31 transitions (discarded 11 similar events)
[2024-05-30 00:33:05] [INFO ] Invariant cache hit.
[2024-05-30 00:33:05] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 30/64 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 1/65 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 59 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 30/64 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 41/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/65 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 100 constraints, problems are : Problem set: 0 solved, 41 unsolved in 713 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 1760ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1762ms
Starting structural reductions in LTL mode, iteration 1 : 34/39 places, 42/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2002 ms. Remains : 34/39 places, 42/48 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-02-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 549 ms.
Product exploration explored 100000 steps with 33333 reset in 234 ms.
Computed a total of 16 stabilizing places and 12 stable transitions
Computed a total of 16 stabilizing places and 12 stable transitions
Detected a total of 16/34 stabilizing places and 12/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 33 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-02-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-02-LTLCardinality-03 finished in 2981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U !p1)))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 48/48 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 34 transition count 43
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 34 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 34 transition count 41
Applied a total of 12 rules in 3 ms. Remains 34 /39 variables (removed 5) and now considering 41/48 (removed 7) transitions.
[2024-05-30 00:33:07] [INFO ] Flow matrix only has 31 transitions (discarded 10 similar events)
// Phase 1: matrix 31 rows 34 cols
[2024-05-30 00:33:07] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 00:33:07] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 00:33:07] [INFO ] Flow matrix only has 31 transitions (discarded 10 similar events)
[2024-05-30 00:33:07] [INFO ] Invariant cache hit.
[2024-05-30 00:33:07] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-30 00:33:07] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 00:33:07] [INFO ] Flow matrix only has 31 transitions (discarded 10 similar events)
[2024-05-30 00:33:07] [INFO ] Invariant cache hit.
[2024-05-30 00:33:07] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 30/64 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 1/65 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 59 constraints, problems are : Problem set: 0 solved, 40 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 30/64 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 40/98 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 1/65 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (OVERLAPS) 0/65 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 99 constraints, problems are : Problem set: 0 solved, 40 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1733ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1734ms
Starting structural reductions in LTL mode, iteration 1 : 34/39 places, 41/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1847 ms. Remains : 34/39 places, 41/48 transitions.
Stuttering acceptance computed with spot in 165 ms :[p1, p1, true]
Running random walk in product with property : SmartHome-PT-02-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Computed a total of 16 stabilizing places and 12 stable transitions
Graph (complete) has 79 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 16 stabilizing places and 12 stable transitions
Detected a total of 16/34 stabilizing places and 12/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 27 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-02-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-02-LTLCardinality-04 finished in 2356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 48/48 transitions.
Graph (trivial) has 29 edges and 39 vertex of which 15 / 39 are part of one of the 7 SCC in 3 ms
Free SCC test removed 8 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 72 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 37 edges and 19 vertex of which 15 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 15 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 22 place count 15 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 13 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 13 transition count 13
Applied a total of 29 rules in 20 ms. Remains 13 /39 variables (removed 26) and now considering 13/48 (removed 35) transitions.
// Phase 1: matrix 13 rows 13 cols
[2024-05-30 00:33:10] [INFO ] Computed 4 invariants in 5 ms
[2024-05-30 00:33:10] [INFO ] Implicit Places using invariants in 35 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/39 places, 13/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57 ms. Remains : 12/39 places, 13/48 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-02-LTLCardinality-05
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-02-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-02-LTLCardinality-05 finished in 123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 33 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 33 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 33 transition count 41
Applied a total of 13 rules in 3 ms. Remains 33 /39 variables (removed 6) and now considering 41/48 (removed 7) transitions.
[2024-05-30 00:33:10] [INFO ] Flow matrix only has 31 transitions (discarded 10 similar events)
// Phase 1: matrix 31 rows 33 cols
[2024-05-30 00:33:10] [INFO ] Computed 12 invariants in 1 ms
[2024-05-30 00:33:10] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-30 00:33:10] [INFO ] Flow matrix only has 31 transitions (discarded 10 similar events)
[2024-05-30 00:33:10] [INFO ] Invariant cache hit.
[2024-05-30 00:33:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-30 00:33:10] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 00:33:10] [INFO ] Flow matrix only has 31 transitions (discarded 10 similar events)
[2024-05-30 00:33:10] [INFO ] Invariant cache hit.
[2024-05-30 00:33:10] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 30/63 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 1/64 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 57 constraints, problems are : Problem set: 0 solved, 40 unsolved in 821 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 30/63 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 40/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 1/64 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 97 constraints, problems are : Problem set: 0 solved, 40 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1441ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1443ms
Starting structural reductions in LTL mode, iteration 1 : 33/39 places, 41/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1550 ms. Remains : 33/39 places, 41/48 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-02-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-02-LTLCardinality-06 finished in 1727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 48/48 transitions.
Graph (trivial) has 28 edges and 39 vertex of which 15 / 39 are part of one of the 7 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 72 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 24 transition count 26
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 24 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 24 transition count 25
Applied a total of 15 rules in 4 ms. Remains 24 /39 variables (removed 15) and now considering 25/48 (removed 23) transitions.
[2024-05-30 00:33:12] [INFO ] Flow matrix only has 17 transitions (discarded 8 similar events)
// Phase 1: matrix 17 rows 24 cols
[2024-05-30 00:33:12] [INFO ] Computed 10 invariants in 0 ms
[2024-05-30 00:33:12] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-30 00:33:12] [INFO ] Flow matrix only has 17 transitions (discarded 8 similar events)
[2024-05-30 00:33:12] [INFO ] Invariant cache hit.
[2024-05-30 00:33:12] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-30 00:33:12] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-30 00:33:12] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-30 00:33:12] [INFO ] Flow matrix only has 17 transitions (discarded 8 similar events)
[2024-05-30 00:33:12] [INFO ] Invariant cache hit.
[2024-05-30 00:33:12] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 16/40 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/41 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/41 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 46 constraints, problems are : Problem set: 0 solved, 24 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 16/40 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 24/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/41 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/41 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 70 constraints, problems are : Problem set: 0 solved, 24 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 736ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 737ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/39 places, 25/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 826 ms. Remains : 24/39 places, 25/48 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-02-LTLCardinality-08
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-02-LTLCardinality-08 finished in 887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((G(X(p1)) U p1))||p0)))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 48
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 35 transition count 45
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 35 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 35 transition count 44
Applied a total of 8 rules in 2 ms. Remains 35 /39 variables (removed 4) and now considering 44/48 (removed 4) transitions.
[2024-05-30 00:33:12] [INFO ] Flow matrix only has 34 transitions (discarded 10 similar events)
// Phase 1: matrix 34 rows 35 cols
[2024-05-30 00:33:12] [INFO ] Computed 12 invariants in 2 ms
[2024-05-30 00:33:12] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-30 00:33:12] [INFO ] Flow matrix only has 34 transitions (discarded 10 similar events)
[2024-05-30 00:33:12] [INFO ] Invariant cache hit.
[2024-05-30 00:33:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-30 00:33:12] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-30 00:33:12] [INFO ] Flow matrix only has 34 transitions (discarded 10 similar events)
[2024-05-30 00:33:12] [INFO ] Invariant cache hit.
[2024-05-30 00:33:12] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 33/68 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 1/69 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 60 constraints, problems are : Problem set: 0 solved, 43 unsolved in 867 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 33/68 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 43/102 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/69 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/69 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 103 constraints, problems are : Problem set: 0 solved, 43 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1589ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1590ms
Starting structural reductions in LTL mode, iteration 1 : 35/39 places, 44/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1696 ms. Remains : 35/39 places, 44/48 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-02-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 264 ms.
Product exploration explored 100000 steps with 0 reset in 294 ms.
Computed a total of 16 stabilizing places and 13 stable transitions
Computed a total of 16 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 123 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 23490 steps (6 resets) in 198 ms. (118 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p0))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 219 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2024-05-30 00:33:16] [INFO ] Flow matrix only has 34 transitions (discarded 10 similar events)
[2024-05-30 00:33:16] [INFO ] Invariant cache hit.
[2024-05-30 00:33:16] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 00:33:16] [INFO ] Flow matrix only has 34 transitions (discarded 10 similar events)
[2024-05-30 00:33:16] [INFO ] Invariant cache hit.
[2024-05-30 00:33:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-30 00:33:16] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-30 00:33:16] [INFO ] Flow matrix only has 34 transitions (discarded 10 similar events)
[2024-05-30 00:33:16] [INFO ] Invariant cache hit.
[2024-05-30 00:33:16] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 33/68 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 1/69 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 60 constraints, problems are : Problem set: 0 solved, 43 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 33/68 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 43/102 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/69 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/69 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 103 constraints, problems are : Problem set: 0 solved, 43 unsolved in 783 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1662ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1663ms
Finished structural reductions in LTL mode , in 1 iterations and 1785 ms. Remains : 35/35 places, 44/44 transitions.
Computed a total of 16 stabilizing places and 13 stable transitions
Computed a total of 16 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 132 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 16897 steps (4 resets) in 86 ms. (194 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p0))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 238 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 155 ms.
Product exploration explored 100000 steps with 0 reset in 400 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 44/44 transitions.
Graph (trivial) has 26 edges and 35 vertex of which 16 / 35 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 24 transition count 25
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 24 transition count 25
Applied a total of 7 rules in 7 ms. Remains 24 /35 variables (removed 11) and now considering 25/44 (removed 19) transitions.
[2024-05-30 00:33:20] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-30 00:33:20] [INFO ] Flow matrix only has 18 transitions (discarded 7 similar events)
// Phase 1: matrix 18 rows 24 cols
[2024-05-30 00:33:20] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 00:33:20] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 17/41 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 46 constraints, problems are : Problem set: 0 solved, 24 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 17/41 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 24/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/42 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/42 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 70 constraints, problems are : Problem set: 0 solved, 24 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 1361ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1362ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/35 places, 25/44 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1399 ms. Remains : 24/35 places, 25/44 transitions.
Built C files in :
/tmp/ltsmin4280355259327984736
[2024-05-30 00:33:21] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4280355259327984736
Running compilation step : cd /tmp/ltsmin4280355259327984736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 581 ms.
Running link step : cd /tmp/ltsmin4280355259327984736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin4280355259327984736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10090348955789164373.hoa' '--buchi-type=spotba'
LTSmin run took 1414 ms.
FORMULA SmartHome-PT-02-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-02-LTLCardinality-09 finished in 10720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 34 transition count 44
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 34 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 34 transition count 42
Applied a total of 11 rules in 2 ms. Remains 34 /39 variables (removed 5) and now considering 42/48 (removed 6) transitions.
[2024-05-30 00:33:23] [INFO ] Flow matrix only has 32 transitions (discarded 10 similar events)
// Phase 1: matrix 32 rows 34 cols
[2024-05-30 00:33:23] [INFO ] Computed 12 invariants in 1 ms
[2024-05-30 00:33:23] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 00:33:23] [INFO ] Flow matrix only has 32 transitions (discarded 10 similar events)
[2024-05-30 00:33:23] [INFO ] Invariant cache hit.
[2024-05-30 00:33:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-30 00:33:23] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2024-05-30 00:33:23] [INFO ] Flow matrix only has 32 transitions (discarded 10 similar events)
[2024-05-30 00:33:23] [INFO ] Invariant cache hit.
[2024-05-30 00:33:23] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 31/65 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/66 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 59 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1165 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 31/65 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 41/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/66 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 100 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 2263ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 2264ms
Starting structural reductions in LTL mode, iteration 1 : 34/39 places, 42/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2376 ms. Remains : 34/39 places, 42/48 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-02-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 467 ms.
Product exploration explored 100000 steps with 33333 reset in 258 ms.
Computed a total of 16 stabilizing places and 13 stable transitions
Computed a total of 16 stabilizing places and 13 stable transitions
Detected a total of 16/34 stabilizing places and 13/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-02-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-02-LTLCardinality-10 finished in 3287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(p1||F(G(p0))))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 48/48 transitions.
Graph (trivial) has 33 edges and 39 vertex of which 18 / 39 are part of one of the 8 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 68 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 16 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 11 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 28 place count 11 transition count 10
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 32 place count 9 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 9 transition count 9
Applied a total of 33 rules in 6 ms. Remains 9 /39 variables (removed 30) and now considering 9/48 (removed 39) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-30 00:33:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 00:33:26] [INFO ] Implicit Places using invariants in 37 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/39 places, 9/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52 ms. Remains : 8/39 places, 9/48 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-02-LTLCardinality-11
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-02-LTLCardinality-11 finished in 276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(X(p2))||p1))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 34 transition count 44
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 34 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 34 transition count 42
Applied a total of 11 rules in 4 ms. Remains 34 /39 variables (removed 5) and now considering 42/48 (removed 6) transitions.
[2024-05-30 00:33:27] [INFO ] Flow matrix only has 31 transitions (discarded 11 similar events)
// Phase 1: matrix 31 rows 34 cols
[2024-05-30 00:33:27] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 00:33:27] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 00:33:27] [INFO ] Flow matrix only has 31 transitions (discarded 11 similar events)
[2024-05-30 00:33:27] [INFO ] Invariant cache hit.
[2024-05-30 00:33:27] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-30 00:33:27] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2024-05-30 00:33:27] [INFO ] Flow matrix only has 31 transitions (discarded 11 similar events)
[2024-05-30 00:33:27] [INFO ] Invariant cache hit.
[2024-05-30 00:33:27] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 30/64 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 1/65 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 59 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 30/64 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 41/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/65 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 100 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 2051ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 2051ms
Starting structural reductions in LTL mode, iteration 1 : 34/39 places, 42/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2187 ms. Remains : 34/39 places, 42/48 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Running random walk in product with property : SmartHome-PT-02-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Computed a total of 16 stabilizing places and 12 stable transitions
Computed a total of 16 stabilizing places and 12 stable transitions
Detected a total of 16/34 stabilizing places and 12/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-02-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-02-LTLCardinality-14 finished in 2878 ms.
All properties solved by simple procedures.
Total runtime 31394 ms.

BK_STOP 1717029210125

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="SmartHome-PT-02"
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-5568"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-02, 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 r378-smll-171683811300347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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