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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 2.1M 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-12-LTLCardinality-00
FORMULA_NAME Anderson-PT-12-LTLCardinality-01
FORMULA_NAME Anderson-PT-12-LTLCardinality-02
FORMULA_NAME Anderson-PT-12-LTLCardinality-03
FORMULA_NAME Anderson-PT-12-LTLCardinality-04
FORMULA_NAME Anderson-PT-12-LTLCardinality-05
FORMULA_NAME Anderson-PT-12-LTLCardinality-06
FORMULA_NAME Anderson-PT-12-LTLCardinality-07
FORMULA_NAME Anderson-PT-12-LTLCardinality-08
FORMULA_NAME Anderson-PT-12-LTLCardinality-09
FORMULA_NAME Anderson-PT-12-LTLCardinality-10
FORMULA_NAME Anderson-PT-12-LTLCardinality-11
FORMULA_NAME Anderson-PT-12-LTLCardinality-12
FORMULA_NAME Anderson-PT-12-LTLCardinality-13
FORMULA_NAME Anderson-PT-12-LTLCardinality-14
FORMULA_NAME Anderson-PT-12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716535767650

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-12
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 07:29:30] [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 07:29:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 07:29:30] [INFO ] Load time of PNML (sax parser for PT used): 342 ms
[2024-05-24 07:29:30] [INFO ] Transformed 889 places.
[2024-05-24 07:29:30] [INFO ] Transformed 4152 transitions.
[2024-05-24 07:29:30] [INFO ] Found NUPN structural information;
[2024-05-24 07:29:30] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 585 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-12-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Discarding 251 places :
Symmetric choice reduction at 0 with 251 rule applications. Total rules 251 place count 638 transition count 1151
Iterating global reduction 0 with 251 rules applied. Total rules applied 502 place count 638 transition count 1151
Applied a total of 502 rules in 221 ms. Remains 638 /889 variables (removed 251) and now considering 1151/4152 (removed 3001) transitions.
// Phase 1: matrix 1151 rows 638 cols
[2024-05-24 07:29:31] [INFO ] Computed 27 invariants in 101 ms
[2024-05-24 07:29:32] [INFO ] Implicit Places using invariants in 1572 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1619 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 637/889 places, 1151/4152 transitions.
Applied a total of 0 rules in 16 ms. Remains 637 /637 variables (removed 0) and now considering 1151/1151 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1857 ms. Remains : 637/889 places, 1151/4152 transitions.
Support contains 29 out of 637 places after structural reductions.
[2024-05-24 07:29:33] [INFO ] Flatten gal took : 172 ms
[2024-05-24 07:29:33] [INFO ] Flatten gal took : 113 ms
[2024-05-24 07:29:33] [INFO ] Input system was already deterministic with 1151 transitions.
Support contains 24 out of 637 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 696 ms. (steps per millisecond=14 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1151 rows 637 cols
[2024-05-24 07:29:34] [INFO ] Computed 26 invariants in 40 ms
[2024-05-24 07:29:35] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 07:29:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2024-05-24 07:29:35] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 35 ms returned sat
[2024-05-24 07:29:36] [INFO ] After 760ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-24 07:29:36] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:29:36] [INFO ] After 241ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-24 07:29:36] [INFO ] After 626ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2024-05-24 07:29:36] [INFO ] After 1745ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1151/1151 transitions.
Drop transitions removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 637 transition count 1007
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 1 with 144 rules applied. Total rules applied 288 place count 493 transition count 1007
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 288 place count 493 transition count 877
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 548 place count 363 transition count 877
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 560 place count 351 transition count 711
Iterating global reduction 2 with 12 rules applied. Total rules applied 572 place count 351 transition count 711
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 574 place count 350 transition count 710
Applied a total of 574 rules in 142 ms. Remains 350 /637 variables (removed 287) and now considering 710/1151 (removed 441) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 350/637 places, 710/1151 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished probabilistic random walk after 37043 steps, run visited all 1 properties in 187 ms. (steps per millisecond=198 )
Probabilistic random walk after 37043 steps, saw 30850 distinct states, run finished after 187 ms. (steps per millisecond=198 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA Anderson-PT-12-LTLCardinality-03 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' '!(X(G(p0)))'
Support contains 2 out of 637 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 637/637 places, 1151/1151 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 624 transition count 984
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 624 transition count 984
Applied a total of 26 rules in 61 ms. Remains 624 /637 variables (removed 13) and now considering 984/1151 (removed 167) transitions.
// Phase 1: matrix 984 rows 624 cols
[2024-05-24 07:29:37] [INFO ] Computed 26 invariants in 15 ms
[2024-05-24 07:29:38] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-24 07:29:38] [INFO ] Invariant cache hit.
[2024-05-24 07:29:38] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:29:41] [INFO ] Implicit Places using invariants and state equation in 2946 ms returned []
Implicit Place search using SMT with State Equation took 3610 ms to find 0 implicit places.
[2024-05-24 07:29:41] [INFO ] Invariant cache hit.
[2024-05-24 07:29:42] [INFO ] Dead Transitions using invariants and state equation in 1679 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 624/637 places, 984/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5351 ms. Remains : 624/637 places, 984/1151 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 282 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-12-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 s399 0) (EQ s281 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 2 ms.
FORMULA Anderson-PT-12-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLCardinality-02 finished in 5720 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' '!((p0 U X(p1)))'
Support contains 3 out of 637 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 637/637 places, 1151/1151 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 625 transition count 985
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 625 transition count 985
Applied a total of 24 rules in 45 ms. Remains 625 /637 variables (removed 12) and now considering 985/1151 (removed 166) transitions.
// Phase 1: matrix 985 rows 625 cols
[2024-05-24 07:29:43] [INFO ] Computed 26 invariants in 8 ms
[2024-05-24 07:29:44] [INFO ] Implicit Places using invariants in 935 ms returned []
[2024-05-24 07:29:44] [INFO ] Invariant cache hit.
[2024-05-24 07:29:44] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:29:47] [INFO ] Implicit Places using invariants and state equation in 3792 ms returned []
Implicit Place search using SMT with State Equation took 4730 ms to find 0 implicit places.
[2024-05-24 07:29:47] [INFO ] Invariant cache hit.
[2024-05-24 07:29:49] [INFO ] Dead Transitions using invariants and state equation in 1732 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 625/637 places, 985/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6517 ms. Remains : 625/637 places, 985/1151 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(EQ s416 1), p1:(OR (EQ s226 0) (EQ s192 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1100 ms.
Product exploration explored 100000 steps with 50000 reset in 997 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) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 25 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLCardinality-06 finished in 8855 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(p0)))'
Support contains 2 out of 637 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 637/637 places, 1151/1151 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 625 transition count 1007
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 625 transition count 1007
Applied a total of 24 rules in 40 ms. Remains 625 /637 variables (removed 12) and now considering 1007/1151 (removed 144) transitions.
// Phase 1: matrix 1007 rows 625 cols
[2024-05-24 07:29:52] [INFO ] Computed 26 invariants in 8 ms
[2024-05-24 07:29:52] [INFO ] Implicit Places using invariants in 720 ms returned []
[2024-05-24 07:29:52] [INFO ] Invariant cache hit.
[2024-05-24 07:29:53] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:29:56] [INFO ] Implicit Places using invariants and state equation in 3941 ms returned []
Implicit Place search using SMT with State Equation took 4664 ms to find 0 implicit places.
[2024-05-24 07:29:56] [INFO ] Invariant cache hit.
[2024-05-24 07:29:58] [INFO ] Dead Transitions using invariants and state equation in 1751 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 625/637 places, 1007/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6467 ms. Remains : 625/637 places, 1007/1151 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s395 0) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 826 ms.
Product exploration explored 100000 steps with 50000 reset in 841 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLCardinality-07 finished in 8272 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 2 out of 637 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 637/637 places, 1151/1151 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 625 transition count 1007
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 625 transition count 1007
Applied a total of 24 rules in 42 ms. Remains 625 /637 variables (removed 12) and now considering 1007/1151 (removed 144) transitions.
// Phase 1: matrix 1007 rows 625 cols
[2024-05-24 07:30:00] [INFO ] Computed 26 invariants in 8 ms
[2024-05-24 07:30:01] [INFO ] Implicit Places using invariants in 972 ms returned []
[2024-05-24 07:30:01] [INFO ] Invariant cache hit.
[2024-05-24 07:30:01] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:30:04] [INFO ] Implicit Places using invariants and state equation in 3583 ms returned []
Implicit Place search using SMT with State Equation took 4559 ms to find 0 implicit places.
[2024-05-24 07:30:04] [INFO ] Invariant cache hit.
[2024-05-24 07:30:06] [INFO ] Dead Transitions using invariants and state equation in 1726 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 625/637 places, 1007/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6329 ms. Remains : 625/637 places, 1007/1151 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Anderson-PT-12-LTLCardinality-11 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:(AND (NEQ s482 0) (NEQ s43 1))], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-12-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLCardinality-11 finished in 6442 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&&G(F(p1)))) U G(p2)))'
Support contains 6 out of 637 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 637/637 places, 1151/1151 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 626 transition count 986
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 626 transition count 986
Applied a total of 22 rules in 37 ms. Remains 626 /637 variables (removed 11) and now considering 986/1151 (removed 165) transitions.
// Phase 1: matrix 986 rows 626 cols
[2024-05-24 07:30:06] [INFO ] Computed 26 invariants in 8 ms
[2024-05-24 07:30:07] [INFO ] Implicit Places using invariants in 914 ms returned []
[2024-05-24 07:30:07] [INFO ] Invariant cache hit.
[2024-05-24 07:30:08] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:30:10] [INFO ] Implicit Places using invariants and state equation in 3194 ms returned []
Implicit Place search using SMT with State Equation took 4113 ms to find 0 implicit places.
[2024-05-24 07:30:10] [INFO ] Invariant cache hit.
[2024-05-24 07:30:12] [INFO ] Dead Transitions using invariants and state equation in 1620 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 626/637 places, 986/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5772 ms. Remains : 626/637 places, 986/1151 transitions.
Stuttering acceptance computed with spot in 459 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (NOT p1), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Anderson-PT-12-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p2 p0), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 3}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(OR (EQ s72 0) (EQ s255 1)), p0:(OR (EQ s443 0) (EQ s228 1)), p1:(OR (EQ s213 0) (EQ s145 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24891 reset in 616 ms.
Product exploration explored 100000 steps with 24878 reset in 660 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 p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 254 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (AND p2 (NOT p0)), true, (NOT p1), (NOT p1), (AND (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 07:30:15] [INFO ] Invariant cache hit.
[2024-05-24 07:30:15] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 07:30:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2024-05-24 07:30:15] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 31 ms returned sat
[2024-05-24 07:30:16] [INFO ] After 901ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-24 07:30:16] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:30:17] [INFO ] After 992ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-24 07:30:17] [INFO ] After 1100ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-24 07:30:17] [INFO ] After 2268ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 986/986 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 626 transition count 843
Reduce places removed 143 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 144 rules applied. Total rules applied 287 place count 483 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 288 place count 482 transition count 842
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 288 place count 482 transition count 713
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 546 place count 353 transition count 713
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 547 place count 352 transition count 712
Iterating global reduction 3 with 1 rules applied. Total rules applied 548 place count 352 transition count 712
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 550 place count 351 transition count 711
Applied a total of 550 rules in 79 ms. Remains 351 /626 variables (removed 275) and now considering 711/986 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 351/626 places, 711/986 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Finished Best-First random walk after 4727 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=787 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (G (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (NOT p1)), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p2)))
Knowledge based reduction with 21 factoid took 773 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLCardinality-12 finished in 11849 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(G(p1))&&p0)))'
Support contains 4 out of 637 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 637/637 places, 1151/1151 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 627 transition count 1031
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 627 transition count 1031
Applied a total of 20 rules in 41 ms. Remains 627 /637 variables (removed 10) and now considering 1031/1151 (removed 120) transitions.
// Phase 1: matrix 1031 rows 627 cols
[2024-05-24 07:30:18] [INFO ] Computed 26 invariants in 8 ms
[2024-05-24 07:30:19] [INFO ] Implicit Places using invariants in 706 ms returned []
[2024-05-24 07:30:19] [INFO ] Invariant cache hit.
[2024-05-24 07:30:19] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-24 07:30:22] [INFO ] Implicit Places using invariants and state equation in 3233 ms returned []
Implicit Place search using SMT with State Equation took 3943 ms to find 0 implicit places.
[2024-05-24 07:30:22] [INFO ] Invariant cache hit.
[2024-05-24 07:30:24] [INFO ] Dead Transitions using invariants and state equation in 1664 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 627/637 places, 1031/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5650 ms. Remains : 627/637 places, 1031/1151 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s37 0) (EQ s125 1)), p1:(OR (EQ s23 0) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLCardinality-13 finished in 5803 ms.
All properties solved by simple procedures.
Total runtime 54032 ms.

BK_STOP 1716535825363

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

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