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.r285-smll-171654421800032.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 gold2023
Input is ParamProductionCell-PT-5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654421800032
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 20:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-5-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716841064450

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-5
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 20:17:47] [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-27 20:17:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:17:47] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-27 20:17:47] [INFO ] Transformed 231 places.
[2024-05-27 20:17:47] [INFO ] Transformed 202 transitions.
[2024-05-27 20:17:47] [INFO ] Found NUPN structural information;
[2024-05-27 20:17:47] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ParamProductionCell-PT-5-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 228 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 228 transition count 199
Applied a total of 6 rules in 69 ms. Remains 228 /231 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 228 cols
[2024-05-27 20:17:47] [INFO ] Computed 59 invariants in 30 ms
[2024-05-27 20:17:48] [INFO ] Implicit Places using invariants in 754 ms returned [15, 16, 19, 24, 31, 35, 36, 41, 42, 46, 47, 59, 64, 65, 73, 78, 79, 98, 99, 101, 113, 114, 116, 119, 161, 162, 164, 166, 167, 193, 194, 197, 198, 203, 204]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 800 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/231 places, 199/202 transitions.
Applied a total of 0 rules in 13 ms. Remains 193 /193 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 882 ms. Remains : 193/231 places, 199/202 transitions.
Support contains 27 out of 193 places after structural reductions.
[2024-05-27 20:17:48] [INFO ] Flatten gal took : 70 ms
[2024-05-27 20:17:48] [INFO ] Flatten gal took : 29 ms
[2024-05-27 20:17:48] [INFO ] Input system was already deterministic with 199 transitions.
Support contains 23 out of 193 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 199 rows 193 cols
[2024-05-27 20:17:49] [INFO ] Computed 24 invariants in 5 ms
[2024-05-27 20:17:49] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-27 20:17:49] [INFO ] [Real]Absence check using 19 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-27 20:17:49] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:17:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-27 20:17:49] [INFO ] [Nat]Absence check using 19 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-27 20:17:49] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:17:49] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:17:49] [INFO ] After 86ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:17:50] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 30 ms to minimize.
[2024-05-27 20:17:50] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 1 ms to minimize.
[2024-05-27 20:17:50] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 1 ms to minimize.
[2024-05-27 20:17:50] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 2 ms to minimize.
[2024-05-27 20:17:50] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2024-05-27 20:17:50] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:17:50] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-27 20:17:51] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2024-05-27 20:17:51] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 0 ms to minimize.
[2024-05-27 20:17:51] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2024-05-27 20:17:51] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 0 ms to minimize.
[2024-05-27 20:17:51] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2024-05-27 20:17:51] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2024-05-27 20:17:51] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2024-05-27 20:17:51] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-27 20:17:51] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2120 ms
[2024-05-27 20:17:51] [INFO ] After 2223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-27 20:17:51] [INFO ] After 2537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 199/199 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 193 transition count 168
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 162 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 161 transition count 167
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 64 place count 161 transition count 149
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 100 place count 143 transition count 149
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 139 transition count 145
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 139 transition count 145
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 184 place count 101 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 100 transition count 106
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 190 place count 100 transition count 102
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 194 place count 96 transition count 102
Applied a total of 194 rules in 70 ms. Remains 96 /193 variables (removed 97) and now considering 102/199 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 96/193 places, 102/199 transitions.
Finished random walk after 7553 steps, including 2 resets, run visited all 1 properties in 26 ms. (steps per millisecond=290 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 188 transition count 194
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 188 transition count 194
Applied a total of 10 rules in 7 ms. Remains 188 /193 variables (removed 5) and now considering 194/199 (removed 5) transitions.
// Phase 1: matrix 194 rows 188 cols
[2024-05-27 20:17:52] [INFO ] Computed 24 invariants in 3 ms
[2024-05-27 20:17:52] [INFO ] Implicit Places using invariants in 138 ms returned [16, 94, 168, 179]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 141 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/193 places, 194/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 184/193 places, 194/199 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s15 1) (EQ s169 1)), p1:(EQ s169 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3344 reset in 449 ms.
Product exploration explored 100000 steps with 3331 reset in 314 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Finished random walk after 145 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=36 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
// Phase 1: matrix 194 rows 184 cols
[2024-05-27 20:17:54] [INFO ] Computed 20 invariants in 2 ms
[2024-05-27 20:17:54] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-27 20:17:54] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-27 20:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:17:54] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2024-05-27 20:17:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:17:55] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-27 20:17:55] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-27 20:17:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:17:55] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2024-05-27 20:17:55] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:17:55] [INFO ] [Nat]Added 68 Read/Feed constraints in 55 ms returned sat
[2024-05-27 20:17:55] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2024-05-27 20:17:55] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:17:55] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2024-05-27 20:17:55] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:17:55] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:17:55] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:17:56] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2024-05-27 20:17:56] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2024-05-27 20:17:56] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2024-05-27 20:17:56] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2024-05-27 20:17:56] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:17:56] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:17:56] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
[2024-05-27 20:17:56] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-27 20:17:56] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:17:56] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2024-05-27 20:17:56] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2024-05-27 20:17:56] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-27 20:17:56] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1594 ms
[2024-05-27 20:17:56] [INFO ] Computed and/alt/rep : 189/309/189 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-27 20:17:57] [INFO ] Added : 163 causal constraints over 33 iterations in 705 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 184 transition count 153
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 143 transition count 153
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 82 place count 143 transition count 141
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 106 place count 131 transition count 141
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 190 place count 89 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 194 place count 87 transition count 97
Applied a total of 194 rules in 27 ms. Remains 87 /184 variables (removed 97) and now considering 97/194 (removed 97) transitions.
// Phase 1: matrix 97 rows 87 cols
[2024-05-27 20:17:57] [INFO ] Computed 20 invariants in 1 ms
[2024-05-27 20:17:57] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-27 20:17:57] [INFO ] Invariant cache hit.
[2024-05-27 20:17:57] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:17:58] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-05-27 20:17:58] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:17:58] [INFO ] Invariant cache hit.
[2024-05-27 20:17:58] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/184 places, 97/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 496 ms. Remains : 87/184 places, 97/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Finished random walk after 85 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=85 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 244 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
[2024-05-27 20:17:59] [INFO ] Invariant cache hit.
[2024-05-27 20:17:59] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-27 20:17:59] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 20:17:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:17:59] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-27 20:17:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:17:59] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-27 20:17:59] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 20:17:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:17:59] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-27 20:17:59] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:17:59] [INFO ] [Nat]Added 66 Read/Feed constraints in 17 ms returned sat
[2024-05-27 20:17:59] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 6 ms to minimize.
[2024-05-27 20:17:59] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-27 20:17:59] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-27 20:17:59] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2024-05-27 20:17:59] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-27 20:17:59] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 20:18:01] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:18:01] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-27 20:18:01] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:18:01] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:18:01] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-27 20:18:01] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
[2024-05-27 20:18:01] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-27 20:18:01] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
[2024-05-27 20:18:01] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 1754 ms
[2024-05-27 20:18:01] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 20:18:01] [INFO ] Added : 75 causal constraints over 15 iterations in 181 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Product exploration explored 100000 steps with 6258 reset in 151 ms.
Product exploration explored 100000 steps with 6276 reset in 163 ms.
Built C files in :
/tmp/ltsmin15674929161432236941
[2024-05-27 20:18:02] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2024-05-27 20:18:02] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:18:02] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2024-05-27 20:18:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:18:02] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2024-05-27 20:18:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:18:02] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15674929161432236941
Running compilation step : cd /tmp/ltsmin15674929161432236941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 485 ms.
Running link step : cd /tmp/ltsmin15674929161432236941;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15674929161432236941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6757801318431724772.hoa' '--buchi-type=spotba'
LTSmin run took 617 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLCardinality-00 finished in 10926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 193 transition count 167
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 161 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 160 transition count 166
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 66 place count 160 transition count 148
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 102 place count 142 transition count 148
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 107 place count 137 transition count 143
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 137 transition count 143
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 190 place count 98 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 192 place count 97 transition count 103
Applied a total of 192 rules in 25 ms. Remains 97 /193 variables (removed 96) and now considering 103/199 (removed 96) transitions.
// Phase 1: matrix 103 rows 97 cols
[2024-05-27 20:18:03] [INFO ] Computed 24 invariants in 2 ms
[2024-05-27 20:18:03] [INFO ] Implicit Places using invariants in 127 ms returned [8, 51, 85, 91]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 129 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/193 places, 103/199 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 87 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 86 transition count 96
Applied a total of 14 rules in 11 ms. Remains 86 /93 variables (removed 7) and now considering 96/103 (removed 7) transitions.
// Phase 1: matrix 96 rows 86 cols
[2024-05-27 20:18:03] [INFO ] Computed 20 invariants in 1 ms
[2024-05-27 20:18:03] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-27 20:18:03] [INFO ] Invariant cache hit.
[2024-05-27 20:18:03] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:18:03] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/193 places, 96/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 516 ms. Remains : 86/193 places, 96/199 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s17 0) (NEQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 143 ms.
Stack based approach found an accepted trace after 165 steps with 0 reset with depth 166 and stack size 166 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-04 finished in 712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 193 transition count 170
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 164 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 162 transition count 168
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 62 place count 162 transition count 149
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 100 place count 143 transition count 149
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 105 place count 138 transition count 144
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 138 transition count 144
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 190 place count 98 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 192 place count 97 transition count 103
Applied a total of 192 rules in 22 ms. Remains 97 /193 variables (removed 96) and now considering 103/199 (removed 96) transitions.
// Phase 1: matrix 103 rows 97 cols
[2024-05-27 20:18:03] [INFO ] Computed 24 invariants in 1 ms
[2024-05-27 20:18:04] [INFO ] Implicit Places using invariants in 136 ms returned [9, 51, 91]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 137 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/193 places, 103/199 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 90 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 89 transition count 98
Applied a total of 10 rules in 9 ms. Remains 89 /94 variables (removed 5) and now considering 98/103 (removed 5) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-05-27 20:18:04] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:18:04] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-27 20:18:04] [INFO ] Invariant cache hit.
[2024-05-27 20:18:04] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:18:04] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/193 places, 98/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 550 ms. Remains : 89/193 places, 98/199 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s6 1) (OR (EQ s79 0) (EQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2653 reset in 128 ms.
Stack based approach found an accepted trace after 3579 steps with 117 reset with depth 82 and stack size 82 in 9 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-06 finished in 798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p1)))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 189 transition count 195
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 189 transition count 195
Applied a total of 8 rules in 5 ms. Remains 189 /193 variables (removed 4) and now considering 195/199 (removed 4) transitions.
// Phase 1: matrix 195 rows 189 cols
[2024-05-27 20:18:04] [INFO ] Computed 24 invariants in 1 ms
[2024-05-27 20:18:04] [INFO ] Implicit Places using invariants in 148 ms returned [16, 94, 169]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 149 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/193 places, 195/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 157 ms. Remains : 186/193 places, 195/199 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s7 1), p1:(AND (EQ s177 0) (EQ s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-08 finished in 336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1&&G(F(p2))))&&p0)))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 189 transition count 195
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 189 transition count 195
Applied a total of 8 rules in 4 ms. Remains 189 /193 variables (removed 4) and now considering 195/199 (removed 4) transitions.
// Phase 1: matrix 195 rows 189 cols
[2024-05-27 20:18:05] [INFO ] Computed 24 invariants in 2 ms
[2024-05-27 20:18:05] [INFO ] Implicit Places using invariants in 124 ms returned [94, 169, 180]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 125 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/193 places, 195/199 transitions.
Applied a total of 0 rules in 1 ms. Remains 186 /186 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 186/193 places, 195/199 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (NEQ s16 1) (EQ s0 0) (EQ s129 1)), p1:(NEQ s16 1), p2:(AND (NEQ s42 0) (NEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-11 finished in 406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U !p1)||X(G(p2))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 189 transition count 195
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 189 transition count 195
Applied a total of 8 rules in 4 ms. Remains 189 /193 variables (removed 4) and now considering 195/199 (removed 4) transitions.
// Phase 1: matrix 195 rows 189 cols
[2024-05-27 20:18:05] [INFO ] Computed 24 invariants in 1 ms
[2024-05-27 20:18:05] [INFO ] Implicit Places using invariants in 125 ms returned [169, 180]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 128 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/193 places, 195/199 transitions.
Applied a total of 0 rules in 2 ms. Remains 187 /187 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 187/193 places, 195/199 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2)), (NOT p0), p1]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s128 0) (EQ s16 1)), p0:(OR (EQ s5 0) (EQ s89 1)), p2:(OR (EQ s21 0) (EQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 735 reset in 158 ms.
Stack based approach found an accepted trace after 3844 steps with 29 reset with depth 262 and stack size 262 in 10 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-13 finished in 522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U ((p1 U p2)||(p2 U p3))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 199/199 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 193 transition count 169
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 163 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 161 transition count 167
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 64 place count 161 transition count 150
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 98 place count 144 transition count 150
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 101 place count 141 transition count 147
Iterating global reduction 3 with 3 rules applied. Total rules applied 104 place count 141 transition count 147
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 186 place count 100 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 99 transition count 105
Applied a total of 188 rules in 22 ms. Remains 99 /193 variables (removed 94) and now considering 105/199 (removed 94) transitions.
// Phase 1: matrix 105 rows 99 cols
[2024-05-27 20:18:06] [INFO ] Computed 24 invariants in 1 ms
[2024-05-27 20:18:06] [INFO ] Implicit Places using invariants in 123 ms returned [8, 51, 87, 93]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 124 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/193 places, 105/199 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 90 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 89 transition count 99
Applied a total of 12 rules in 6 ms. Remains 89 /95 variables (removed 6) and now considering 99/105 (removed 6) transitions.
// Phase 1: matrix 99 rows 89 cols
[2024-05-27 20:18:06] [INFO ] Computed 20 invariants in 2 ms
[2024-05-27 20:18:06] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-27 20:18:06] [INFO ] Invariant cache hit.
[2024-05-27 20:18:06] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:18:06] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/193 places, 99/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 474 ms. Remains : 89/193 places, 99/199 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s74 1), p3:(OR (EQ s0 0) (EQ s69 1)), p0:(OR (EQ s0 0) (EQ s69 1) (NEQ s74 1)), p1:(OR (EQ s43 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1734 reset in 197 ms.
Product exploration explored 100000 steps with 1741 reset in 216 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) p1 p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p2) p1 (NOT p3) p0)), (X (NOT (AND (NOT p2) p1 (NOT p3) p0))), (X (AND (NOT p2) (NOT p3) p0)), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (X (AND (NOT p2) p1 (NOT p3) p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p0))))]
Knowledge based reduction with 22 factoid took 444 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 5 states, 14 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-27 20:18:08] [INFO ] Invariant cache hit.
[2024-05-27 20:18:08] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) p1 p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0))))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (G (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p2) p1 (NOT p3) p0)), (X (NOT (AND (NOT p2) p1 (NOT p3) p0))), (X (AND (NOT p2) (NOT p3) p0)), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (X (AND (NOT p2) p1 (NOT p3) p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT (AND (NOT p2) p0 (NOT p3)))), (F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F (NOT (AND p1 (NOT p2) p0)))]
Knowledge based reduction with 26 factoid took 849 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
[2024-05-27 20:18:09] [INFO ] Invariant cache hit.
[2024-05-27 20:18:09] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-27 20:18:09] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 20:18:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:18:09] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-27 20:18:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:18:09] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-27 20:18:09] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 20:18:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:18:09] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-27 20:18:09] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:18:09] [INFO ] [Nat]Added 66 Read/Feed constraints in 9 ms returned sat
[2024-05-27 20:18:09] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 5 ms to minimize.
[2024-05-27 20:18:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-27 20:18:09] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-27 20:18:09] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-27 20:18:10] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:18:10] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-27 20:18:10] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:18:10] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:18:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 364 ms
[2024-05-27 20:18:10] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 20:18:10] [INFO ] Added : 85 causal constraints over 17 iterations in 205 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 99/99 transitions.
Applied a total of 0 rules in 7 ms. Remains 89 /89 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-27 20:18:10] [INFO ] Invariant cache hit.
[2024-05-27 20:18:10] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-27 20:18:10] [INFO ] Invariant cache hit.
[2024-05-27 20:18:10] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:18:10] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-05-27 20:18:10] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:18:10] [INFO ] Invariant cache hit.
[2024-05-27 20:18:10] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 406 ms. Remains : 89/89 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (AND p1 (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (AND p1 (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3)))))]
Knowledge based reduction with 14 factoid took 376 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-27 20:18:11] [INFO ] Invariant cache hit.
[2024-05-27 20:18:11] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (AND p1 (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (AND p1 (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (X (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (F (NOT p0)), (F (NOT (AND p1 (NOT p2) (NOT p3)))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 16 factoid took 607 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
[2024-05-27 20:18:12] [INFO ] Invariant cache hit.
[2024-05-27 20:18:12] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-27 20:18:12] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 20:18:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:18:12] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-27 20:18:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:18:12] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-27 20:18:12] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 20:18:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:18:12] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-27 20:18:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:18:12] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2024-05-27 20:18:12] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-27 20:18:12] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:18:12] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-27 20:18:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:18:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-27 20:18:13] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:18:13] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-27 20:18:13] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:18:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 362 ms
[2024-05-27 20:18:13] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 20:18:13] [INFO ] Added : 85 causal constraints over 17 iterations in 204 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1736 reset in 163 ms.
Product exploration explored 100000 steps with 1743 reset in 177 ms.
Built C files in :
/tmp/ltsmin15435384070076896541
[2024-05-27 20:18:14] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-27 20:18:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:18:14] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-27 20:18:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:18:14] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-27 20:18:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:18:14] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15435384070076896541
Running compilation step : cd /tmp/ltsmin15435384070076896541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 303 ms.
Running link step : cd /tmp/ltsmin15435384070076896541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15435384070076896541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12827023911290184078.hoa' '--buchi-type=spotba'
LTSmin run took 594 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLCardinality-15 finished in 8917 ms.
All properties solved by simple procedures.
Total runtime 27864 ms.

BK_STOP 1716841096052

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="ParamProductionCell-PT-5"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is ParamProductionCell-PT-5, 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 r285-smll-171654421800032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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