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.r021-smll-171620128100197.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 Anderson-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620128100197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 15:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 15:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 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 Anderson-PT-04-LTLCardinality-00
FORMULA_NAME Anderson-PT-04-LTLCardinality-01
FORMULA_NAME Anderson-PT-04-LTLCardinality-02
FORMULA_NAME Anderson-PT-04-LTLCardinality-03
FORMULA_NAME Anderson-PT-04-LTLCardinality-04
FORMULA_NAME Anderson-PT-04-LTLCardinality-05
FORMULA_NAME Anderson-PT-04-LTLCardinality-06
FORMULA_NAME Anderson-PT-04-LTLCardinality-07
FORMULA_NAME Anderson-PT-04-LTLCardinality-08
FORMULA_NAME Anderson-PT-04-LTLCardinality-09
FORMULA_NAME Anderson-PT-04-LTLCardinality-10
FORMULA_NAME Anderson-PT-04-LTLCardinality-11
FORMULA_NAME Anderson-PT-04-LTLCardinality-12
FORMULA_NAME Anderson-PT-04-LTLCardinality-13
FORMULA_NAME Anderson-PT-04-LTLCardinality-14
FORMULA_NAME Anderson-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716515134137

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=Anderson-PT-04
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 01:45:37] [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-24 01:45:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 01:45:38] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-05-24 01:45:38] [INFO ] Transformed 105 places.
[2024-05-24 01:45:38] [INFO ] Transformed 200 transitions.
[2024-05-24 01:45:38] [INFO ] Found NUPN structural information;
[2024-05-24 01:45:38] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 200/200 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 89 transition count 136
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 89 transition count 136
Applied a total of 32 rules in 40 ms. Remains 89 /105 variables (removed 16) and now considering 136/200 (removed 64) transitions.
// Phase 1: matrix 136 rows 89 cols
[2024-05-24 01:45:38] [INFO ] Computed 11 invariants in 23 ms
[2024-05-24 01:45:38] [INFO ] Implicit Places using invariants in 479 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 540 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/105 places, 136/200 transitions.
Applied a total of 0 rules in 8 ms. Remains 88 /88 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 589 ms. Remains : 88/105 places, 136/200 transitions.
Support contains 24 out of 88 places after structural reductions.
[2024-05-24 01:45:39] [INFO ] Flatten gal took : 89 ms
[2024-05-24 01:45:39] [INFO ] Flatten gal took : 35 ms
[2024-05-24 01:45:39] [INFO ] Input system was already deterministic with 136 transitions.
Finished random walk after 707 steps, including 0 resets, run visited all 16 properties in 140 ms. (steps per millisecond=5 )
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' '!(G(F((G((G((p1&&F(p2))) U p2))||p0))))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 88 transition count 122
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 74 transition count 122
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 28 place count 74 transition count 112
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 48 place count 64 transition count 112
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 56 place count 56 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 64 place count 56 transition count 80
Applied a total of 64 rules in 36 ms. Remains 56 /88 variables (removed 32) and now considering 80/136 (removed 56) transitions.
// Phase 1: matrix 80 rows 56 cols
[2024-05-24 01:45:40] [INFO ] Computed 10 invariants in 4 ms
[2024-05-24 01:45:40] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-24 01:45:40] [INFO ] Invariant cache hit.
[2024-05-24 01:45:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:45:40] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-05-24 01:45:40] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-24 01:45:40] [INFO ] Invariant cache hit.
[2024-05-24 01:45:40] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/88 places, 80/136 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 670 ms. Remains : 56/88 places, 80/136 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 556 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s54 1)), p2:(OR (EQ s35 0) (EQ s55 1)), p1:(NEQ s34 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 717 reset in 600 ms.
Product exploration explored 100000 steps with 711 reset in 261 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 p0 p2 p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 188 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 01:45:42] [INFO ] Invariant cache hit.
[2024-05-24 01:45:42] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 01:45:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-24 01:45:42] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-24 01:45:42] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (NOT p0)), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 13 factoid took 787 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 80/80 transitions.
Applied a total of 0 rules in 7 ms. Remains 56 /56 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-24 01:45:44] [INFO ] Invariant cache hit.
[2024-05-24 01:45:44] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-24 01:45:44] [INFO ] Invariant cache hit.
[2024-05-24 01:45:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:45:44] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-05-24 01:45:44] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 01:45:44] [INFO ] Invariant cache hit.
[2024-05-24 01:45:44] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 513 ms. Remains : 56/56 places, 80/80 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 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 264 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :6
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.
[2024-05-24 01:45:45] [INFO ] Invariant cache hit.
[2024-05-24 01:45:45] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 01:45:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-24 01:45:45] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-24 01:45:45] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (NOT p0)), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 13 factoid took 786 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 645 reset in 230 ms.
Product exploration explored 100000 steps with 699 reset in 245 ms.
Built C files in :
/tmp/ltsmin10100176927404756142
[2024-05-24 01:45:47] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2024-05-24 01:45:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:45:47] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2024-05-24 01:45:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:45:47] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2024-05-24 01:45:47] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:45:47] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10100176927404756142
Running compilation step : cd /tmp/ltsmin10100176927404756142;'/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 408 ms.
Running link step : cd /tmp/ltsmin10100176927404756142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin10100176927404756142;'/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/stateBased2885381907300240850.hoa' '--buchi-type=spotba'
LTSmin run took 246 ms.
FORMULA Anderson-PT-04-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-04-LTLCardinality-00 finished in 8709 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 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 81 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 81 transition count 111
Applied a total of 14 rules in 13 ms. Remains 81 /88 variables (removed 7) and now considering 111/136 (removed 25) transitions.
// Phase 1: matrix 111 rows 81 cols
[2024-05-24 01:45:48] [INFO ] Computed 10 invariants in 4 ms
[2024-05-24 01:45:48] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-24 01:45:48] [INFO ] Invariant cache hit.
[2024-05-24 01:45:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:45:49] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-24 01:45:49] [INFO ] Invariant cache hit.
[2024-05-24 01:45:49] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/88 places, 111/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 81/88 places, 111/136 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-02 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:(AND (EQ s54 0) (EQ s15 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 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLCardinality-02 finished in 753 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((X((p1||F(p2)))&&p0)))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 83 transition count 113
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 83 transition count 113
Applied a total of 10 rules in 11 ms. Remains 83 /88 variables (removed 5) and now considering 113/136 (removed 23) transitions.
// Phase 1: matrix 113 rows 83 cols
[2024-05-24 01:45:49] [INFO ] Computed 10 invariants in 4 ms
[2024-05-24 01:45:49] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-24 01:45:49] [INFO ] Invariant cache hit.
[2024-05-24 01:45:49] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:45:49] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2024-05-24 01:45:49] [INFO ] Invariant cache hit.
[2024-05-24 01:45:50] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 83/88 places, 113/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 648 ms. Remains : 83/88 places, 113/136 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s44 0) (NEQ s19 1)), p2:(NEQ s27 1), p1:(AND (NEQ s60 0) (NEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 277 reset in 205 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 1 ms.
FORMULA Anderson-PT-04-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLCardinality-04 finished in 1063 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 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 88 transition count 121
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 73 transition count 121
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 30 place count 73 transition count 109
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 54 place count 61 transition count 109
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 62 place count 53 transition count 77
Iterating global reduction 2 with 8 rules applied. Total rules applied 70 place count 53 transition count 77
Applied a total of 70 rules in 20 ms. Remains 53 /88 variables (removed 35) and now considering 77/136 (removed 59) transitions.
// Phase 1: matrix 77 rows 53 cols
[2024-05-24 01:45:50] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 01:45:50] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-24 01:45:50] [INFO ] Invariant cache hit.
[2024-05-24 01:45:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:45:50] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-24 01:45:50] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 01:45:50] [INFO ] Invariant cache hit.
[2024-05-24 01:45:50] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/88 places, 77/136 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 473 ms. Remains : 53/88 places, 77/136 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-05 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:(EQ s52 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 729 reset in 162 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA Anderson-PT-04-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLCardinality-05 finished in 758 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&&(G(p2)||F(p3)||p1))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 88 transition count 121
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 73 transition count 121
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 73 transition count 111
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 63 transition count 111
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 57 transition count 87
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 57 transition count 87
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 64 place count 56 transition count 86
Applied a total of 64 rules in 27 ms. Remains 56 /88 variables (removed 32) and now considering 86/136 (removed 50) transitions.
// Phase 1: matrix 86 rows 56 cols
[2024-05-24 01:45:51] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 01:45:51] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-24 01:45:51] [INFO ] Invariant cache hit.
[2024-05-24 01:45:51] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:45:51] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-05-24 01:45:51] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 01:45:51] [INFO ] Invariant cache hit.
[2024-05-24 01:45:51] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/88 places, 86/136 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 521 ms. Remains : 56/88 places, 86/136 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s15 1), p1:(OR (EQ s20 0) (EQ s34 1)), p2:(EQ s24 0), p3:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 769 reset in 183 ms.
Stack based approach found an accepted trace after 51 steps with 1 reset with depth 18 and stack size 18 in 1 ms.
FORMULA Anderson-PT-04-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLCardinality-08 finished in 920 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(F(p0))||(F(p0)&&G(!p1)))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 88 transition count 124
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 76 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 74 transition count 122
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 28 place count 74 transition count 110
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 52 place count 62 transition count 110
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 59 place count 55 transition count 85
Iterating global reduction 3 with 7 rules applied. Total rules applied 66 place count 55 transition count 85
Applied a total of 66 rules in 20 ms. Remains 55 /88 variables (removed 33) and now considering 85/136 (removed 51) transitions.
// Phase 1: matrix 85 rows 55 cols
[2024-05-24 01:45:52] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 01:45:52] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-24 01:45:52] [INFO ] Invariant cache hit.
[2024-05-24 01:45:52] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:45:52] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-05-24 01:45:52] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 01:45:52] [INFO ] Invariant cache hit.
[2024-05-24 01:45:52] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/88 places, 85/136 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 444 ms. Remains : 55/88 places, 85/136 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s53 0) (EQ s48 1)), p0:(OR (EQ s16 0) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 690 reset in 190 ms.
Product exploration explored 100000 steps with 661 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 p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 145 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Finished random walk after 336 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 274 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 55 /55 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-24 01:45:54] [INFO ] Invariant cache hit.
[2024-05-24 01:45:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-24 01:45:54] [INFO ] Invariant cache hit.
[2024-05-24 01:45:54] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:45:54] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-24 01:45:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 01:45:54] [INFO ] Invariant cache hit.
[2024-05-24 01:45:54] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 55/55 places, 85/85 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 p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 129 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Finished random walk after 102 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 682 reset in 181 ms.
Product exploration explored 100000 steps with 664 reset in 202 ms.
Built C files in :
/tmp/ltsmin7403383313383455654
[2024-05-24 01:45:55] [INFO ] Computing symmetric may disable matrix : 85 transitions.
[2024-05-24 01:45:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:45:55] [INFO ] Computing symmetric may enable matrix : 85 transitions.
[2024-05-24 01:45:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:45:55] [INFO ] Computing Do-Not-Accords matrix : 85 transitions.
[2024-05-24 01:45:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:45:55] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7403383313383455654
Running compilation step : cd /tmp/ltsmin7403383313383455654;'/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 412 ms.
Running link step : cd /tmp/ltsmin7403383313383455654;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7403383313383455654;'/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/stateBased16159360960603845931.hoa' '--buchi-type=spotba'
LTSmin run took 141 ms.
FORMULA Anderson-PT-04-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-04-LTLCardinality-09 finished in 4347 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(G(p0))))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 81 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 81 transition count 105
Applied a total of 14 rules in 12 ms. Remains 81 /88 variables (removed 7) and now considering 105/136 (removed 31) transitions.
// Phase 1: matrix 105 rows 81 cols
[2024-05-24 01:45:56] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 01:45:56] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-24 01:45:56] [INFO ] Invariant cache hit.
[2024-05-24 01:45:56] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:45:56] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-05-24 01:45:56] [INFO ] Invariant cache hit.
[2024-05-24 01:45:57] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/88 places, 105/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 556 ms. Remains : 81/88 places, 105/136 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s28 0) (EQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLCardinality-11 finished in 742 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))'
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 80 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 80 transition count 104
Applied a total of 16 rules in 10 ms. Remains 80 /88 variables (removed 8) and now considering 104/136 (removed 32) transitions.
// Phase 1: matrix 104 rows 80 cols
[2024-05-24 01:45:57] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 01:45:57] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-24 01:45:57] [INFO ] Invariant cache hit.
[2024-05-24 01:45:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:45:57] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-05-24 01:45:57] [INFO ] Invariant cache hit.
[2024-05-24 01:45:57] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/88 places, 104/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 561 ms. Remains : 80/88 places, 104/136 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s10 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-04-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-04-LTLCardinality-14 finished in 1243 ms.
All properties solved by simple procedures.
Total runtime 20713 ms.

BK_STOP 1716515159626

--------------------
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="Anderson-PT-04"
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 Anderson-PT-04, 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 r021-smll-171620128100197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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