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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.2K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 20:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 20:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 20:33 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-1-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716840396394

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-1
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 20:06:39] [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:06:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:06:39] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-05-27 20:06:39] [INFO ] Transformed 231 places.
[2024-05-27 20:06:39] [INFO ] Transformed 202 transitions.
[2024-05-27 20:06:39] [INFO ] Found NUPN structural information;
[2024-05-27 20:06:39] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-1-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLCardinality-12 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 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 89 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2024-05-27 20:06:39] [INFO ] Computed 59 invariants in 24 ms
[2024-05-27 20:06:40] [INFO ] Implicit Places using invariants in 774 ms returned [1, 15, 16, 18, 19, 31, 35, 36, 41, 42, 47, 59, 64, 65, 73, 78, 98, 101, 113, 114, 116, 118, 119, 160, 161, 163, 165, 166, 190, 192, 193, 196, 197, 202, 203, 207, 218]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 839 ms to find 37 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/231 places, 198/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 188 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 188 transition count 196
Applied a total of 4 rules in 38 ms. Remains 188 /190 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 188 cols
[2024-05-27 20:06:40] [INFO ] Computed 22 invariants in 4 ms
[2024-05-27 20:06:40] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-27 20:06:40] [INFO ] Invariant cache hit.
[2024-05-27 20:06:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:06:41] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 188/231 places, 196/202 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1715 ms. Remains : 188/231 places, 196/202 transitions.
Support contains 27 out of 188 places after structural reductions.
[2024-05-27 20:06:41] [INFO ] Flatten gal took : 58 ms
[2024-05-27 20:06:41] [INFO ] Flatten gal took : 25 ms
[2024-05-27 20:06:41] [INFO ] Input system was already deterministic with 196 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) 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 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-27 20:06:42] [INFO ] Invariant cache hit.
[2024-05-27 20:06:42] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-27 20:06:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2024-05-27 20:06:43] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-27 20:06:43] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 8 simplifications.
FORMULA ParamProductionCell-PT-1-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(F(G((p0||X(F(p1))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 188 transition count 158
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 150 transition count 158
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 76 place count 150 transition count 151
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 90 place count 143 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 142 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 142 transition count 150
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 166 place count 105 transition count 113
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 2 with 2 rules applied. Total rules applied 168 place count 104 transition count 112
Applied a total of 168 rules in 87 ms. Remains 104 /188 variables (removed 84) and now considering 112/196 (removed 84) transitions.
// Phase 1: matrix 112 rows 104 cols
[2024-05-27 20:06:43] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 20:06:43] [INFO ] Implicit Places using invariants in 246 ms returned [0, 3, 5, 8, 19, 32, 38, 43, 66]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 248 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/188 places, 112/196 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 95 transition count 108
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 91 transition count 108
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 40 place count 75 transition count 92
Applied a total of 40 rules in 13 ms. Remains 75 /95 variables (removed 20) and now considering 92/112 (removed 20) transitions.
// Phase 1: matrix 92 rows 75 cols
[2024-05-27 20:06:43] [INFO ] Computed 13 invariants in 0 ms
[2024-05-27 20:06:43] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-27 20:06:43] [INFO ] Invariant cache hit.
[2024-05-27 20:06:43] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:06:44] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/188 places, 92/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 745 ms. Remains : 75/188 places, 92/196 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 406 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s46 0) (EQ s43 1)), p1:(AND (EQ s51 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5263 reset in 464 ms.
Product exploration explored 100000 steps with 5263 reset in 346 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 (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 52 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 141 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 20:06:45] [INFO ] Invariant cache hit.
[2024-05-27 20:06:46] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-27 20:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:06:46] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-27 20:06:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:06:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-27 20:06:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:06:46] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-27 20:06:46] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:06:46] [INFO ] [Nat]Added 67 Read/Feed constraints in 11 ms returned sat
[2024-05-27 20:06:46] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 4 ms to minimize.
[2024-05-27 20:06:46] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-27 20:06:46] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-27 20:06:46] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 3 ms to minimize.
[2024-05-27 20:06:46] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:06:46] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-27 20:06:46] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-27 20:06:46] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-27 20:06:47] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-27 20:06:47] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-27 20:06:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 842 ms
[2024-05-27 20:06:47] [INFO ] Computed and/alt/rep : 91/213/91 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-27 20:06:47] [INFO ] Added : 85 causal constraints over 18 iterations in 290 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-27 20:06:47] [INFO ] Invariant cache hit.
[2024-05-27 20:06:48] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-05-27 20:06:48] [INFO ] Invariant cache hit.
[2024-05-27 20:06:48] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:06:48] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2024-05-27 20:06:48] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:06:48] [INFO ] Invariant cache hit.
[2024-05-27 20:06:48] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 942 ms. Remains : 75/75 places, 92/92 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 p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 52 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 20:06:48] [INFO ] Invariant cache hit.
[2024-05-27 20:06:48] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-27 20:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:06:49] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-27 20:06:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:06:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 20:06:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:06:49] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-27 20:06:49] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:06:49] [INFO ] [Nat]Added 67 Read/Feed constraints in 11 ms returned sat
[2024-05-27 20:06:49] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-27 20:06:49] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:06:49] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2024-05-27 20:06:49] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:06:49] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:06:49] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-27 20:06:49] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:06:49] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-27 20:06:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-27 20:06:49] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-27 20:06:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 484 ms
[2024-05-27 20:06:49] [INFO ] Computed and/alt/rep : 91/213/91 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 20:06:49] [INFO ] Added : 85 causal constraints over 18 iterations in 202 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5263 reset in 204 ms.
Product exploration explored 100000 steps with 5263 reset in 212 ms.
Built C files in :
/tmp/ltsmin11940532149264271654
[2024-05-27 20:06:50] [INFO ] Computing symmetric may disable matrix : 92 transitions.
[2024-05-27 20:06:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:06:50] [INFO ] Computing symmetric may enable matrix : 92 transitions.
[2024-05-27 20:06:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:06:50] [INFO ] Computing Do-Not-Accords matrix : 92 transitions.
[2024-05-27 20:06:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:06:50] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11940532149264271654
Running compilation step : cd /tmp/ltsmin11940532149264271654;'/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 473 ms.
Running link step : cd /tmp/ltsmin11940532149264271654;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin11940532149264271654;'/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/stateBased10767077165160493653.hoa' '--buchi-type=spotba'
LTSmin run took 212 ms.
FORMULA ParamProductionCell-PT-1-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLCardinality-01 finished in 8044 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(p0) U G(p0)))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 15 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-05-27 20:06:51] [INFO ] Computed 22 invariants in 2 ms
[2024-05-27 20:06:51] [INFO ] Implicit Places using invariants in 171 ms returned [19, 36, 63, 82]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 172 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/188 places, 194/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 182 /182 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 193 ms. Remains : 182/188 places, 194/196 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s173 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-1-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLCardinality-06 finished in 312 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((F(p1)||p0)))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 10 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
[2024-05-27 20:06:51] [INFO ] Invariant cache hit.
[2024-05-27 20:06:51] [INFO ] Implicit Places using invariants in 126 ms returned [19, 63, 82]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 129 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/188 places, 194/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 183 /183 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 183/188 places, 194/196 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s35 0) (EQ s142 1)), p0:(OR (EQ s35 0) (EQ s142 1) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Product exploration explored 100000 steps with 50000 reset in 266 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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-1-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-1-LTLCardinality-07 finished in 862 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 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 188 transition count 159
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 151 transition count 159
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 74 place count 151 transition count 152
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 88 place count 144 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 142 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 142 transition count 150
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 168 place count 104 transition count 112
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 2 with 2 rules applied. Total rules applied 170 place count 103 transition count 111
Applied a total of 170 rules in 34 ms. Remains 103 /188 variables (removed 85) and now considering 111/196 (removed 85) transitions.
// Phase 1: matrix 111 rows 103 cols
[2024-05-27 20:06:52] [INFO ] Computed 22 invariants in 2 ms
[2024-05-27 20:06:52] [INFO ] Implicit Places using invariants in 116 ms returned [0, 3, 5, 8, 19, 32, 36, 41, 66]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 119 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/188 places, 111/196 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 94 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 93 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 93 transition count 107
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 90 transition count 107
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 40 place count 74 transition count 91
Applied a total of 40 rules in 14 ms. Remains 74 /94 variables (removed 20) and now considering 91/111 (removed 20) transitions.
// Phase 1: matrix 91 rows 74 cols
[2024-05-27 20:06:52] [INFO ] Computed 13 invariants in 1 ms
[2024-05-27 20:06:52] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 20:06:52] [INFO ] Invariant cache hit.
[2024-05-27 20:06:52] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:06:52] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/188 places, 91/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 406 ms. Remains : 74/188 places, 91/196 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLCardinality-08 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 s47 0) (EQ s38 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 1851 reset in 119 ms.
Product exploration explored 100000 steps with 1851 reset in 132 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-05-27 20:06:53] [INFO ] Invariant cache hit.
[2024-05-27 20:06:53] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-27 20:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:06:53] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-27 20:06:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:06:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-27 20:06:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:06:53] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-27 20:06:53] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:06:53] [INFO ] [Nat]Added 67 Read/Feed constraints in 10 ms returned sat
[2024-05-27 20:06:53] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-27 20:06:54] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-27 20:06:54] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-27 20:06:54] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-27 20:06:54] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-27 20:06:54] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-27 20:06:54] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:06:54] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-27 20:06:54] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-27 20:06:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 395 ms
[2024-05-27 20:06:54] [INFO ] Computed and/alt/rep : 90/212/90 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 20:06:54] [INFO ] Added : 89 causal constraints over 18 iterations in 200 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-27 20:06:54] [INFO ] Invariant cache hit.
[2024-05-27 20:06:54] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-27 20:06:54] [INFO ] Invariant cache hit.
[2024-05-27 20:06:54] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:06:54] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-27 20:06:54] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:06:54] [INFO ] Invariant cache hit.
[2024-05-27 20:06:54] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 377 ms. Remains : 74/74 places, 91/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-05-27 20:06:55] [INFO ] Invariant cache hit.
[2024-05-27 20:06:55] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-27 20:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:06:55] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-27 20:06:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:06:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-27 20:06:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:06:55] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-27 20:06:55] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:06:55] [INFO ] [Nat]Added 67 Read/Feed constraints in 10 ms returned sat
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:06:56] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-27 20:06:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 405 ms
[2024-05-27 20:06:56] [INFO ] Computed and/alt/rep : 90/212/90 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 20:06:56] [INFO ] Added : 89 causal constraints over 18 iterations in 185 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1851 reset in 114 ms.
Product exploration explored 100000 steps with 1851 reset in 133 ms.
Built C files in :
/tmp/ltsmin2699548043106865532
[2024-05-27 20:06:56] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2024-05-27 20:06:56] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:06:56] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2024-05-27 20:06:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:06:56] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2024-05-27 20:06:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:06:56] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2699548043106865532
Running compilation step : cd /tmp/ltsmin2699548043106865532;'/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 269 ms.
Running link step : cd /tmp/ltsmin2699548043106865532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2699548043106865532;'/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/stateBased2062160376256031523.hoa' '--buchi-type=spotba'
LTSmin run took 356 ms.
FORMULA ParamProductionCell-PT-1-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLCardinality-08 finished in 4737 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(((X(p0)||F(p1))&&(p0||F(p2))))))'
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 188 transition count 162
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 154 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 153 transition count 161
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 70 place count 153 transition count 155
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 82 place count 147 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 145 transition count 153
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 145 transition count 153
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 160 place count 108 transition count 116
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 162 place count 107 transition count 115
Applied a total of 162 rules in 35 ms. Remains 107 /188 variables (removed 81) and now considering 115/196 (removed 81) transitions.
// Phase 1: matrix 115 rows 107 cols
[2024-05-27 20:06:57] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 20:06:57] [INFO ] Implicit Places using invariants in 145 ms returned [0, 3, 5, 8, 21, 35, 40, 45, 68]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 146 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/188 places, 115/196 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 114
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 97 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 95 transition count 112
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 95 transition count 109
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 92 transition count 109
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 42 place count 77 transition count 94
Applied a total of 42 rules in 12 ms. Remains 77 /98 variables (removed 21) and now considering 94/115 (removed 21) transitions.
// Phase 1: matrix 94 rows 77 cols
[2024-05-27 20:06:57] [INFO ] Computed 13 invariants in 0 ms
[2024-05-27 20:06:57] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-27 20:06:57] [INFO ] Invariant cache hit.
[2024-05-27 20:06:57] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:06:57] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/188 places, 94/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 507 ms. Remains : 77/188 places, 94/196 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}]], initial=0, aps=[p1:(AND (EQ s42 0) (EQ s24 1)), p0:(AND (EQ s67 0) (EQ s26 1)), p2:(OR (EQ s8 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 33393 reset in 155 ms.
Product exploration explored 100000 steps with 33165 reset in 171 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 p1) p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 168 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) seen :4
Finished Best-First random walk after 143 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=71 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 12 factoid took 622 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 247 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-05-27 20:07:00] [INFO ] Invariant cache hit.
[2024-05-27 20:07:00] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-27 20:07:00] [INFO ] Invariant cache hit.
[2024-05-27 20:07:00] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:07:00] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-27 20:07:00] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:07:00] [INFO ] Invariant cache hit.
[2024-05-27 20:07:00] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 368 ms. Remains : 77/77 places, 94/94 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 p1) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 175 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 293 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 6) seen :4
Finished Best-First random walk after 137 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=68 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 13 factoid took 447 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 266 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5858 reset in 155 ms.
Product exploration explored 100000 steps with 5805 reset in 442 ms.
Built C files in :
/tmp/ltsmin6359001733099883749
[2024-05-27 20:07:02] [INFO ] Computing symmetric may disable matrix : 94 transitions.
[2024-05-27 20:07:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:02] [INFO ] Computing symmetric may enable matrix : 94 transitions.
[2024-05-27 20:07:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:02] [INFO ] Computing Do-Not-Accords matrix : 94 transitions.
[2024-05-27 20:07:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:02] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6359001733099883749
Running compilation step : cd /tmp/ltsmin6359001733099883749;'/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 318 ms.
Running link step : cd /tmp/ltsmin6359001733099883749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6359001733099883749;'/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/stateBased9613984759141864034.hoa' '--buchi-type=spotba'
LTSmin run took 259 ms.
FORMULA ParamProductionCell-PT-1-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLCardinality-10 finished in 6325 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(G(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 4 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-05-27 20:07:03] [INFO ] Computed 22 invariants in 9 ms
[2024-05-27 20:07:03] [INFO ] Implicit Places using invariants in 225 ms returned [19, 36, 63, 82]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 227 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/188 places, 194/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 182 /182 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 233 ms. Remains : 182/188 places, 194/196 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s58 0) (EQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-1-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLCardinality-11 finished in 341 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(p1))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 4 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
[2024-05-27 20:07:03] [INFO ] Invariant cache hit.
[2024-05-27 20:07:04] [INFO ] Implicit Places using invariants in 143 ms returned [19, 36, 63, 82]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 145 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/188 places, 194/196 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 182/188 places, 194/196 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s145 0) (EQ s17 1)), p1:(OR (EQ s12 0) (EQ s149 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 108 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-1-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLCardinality-13 finished in 255 ms.
All properties solved by simple procedures.
Total runtime 25121 ms.

BK_STOP 1716840425573

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

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