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.r087-tall-171620521300012.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 CANConstruction-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521300012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 641K 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 CANConstruction-PT-020-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716215670610

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=CANConstruction-PT-020
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 14:34:32] [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-20 14:34:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:34:32] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-20 14:34:32] [INFO ] Transformed 1042 places.
[2024-05-20 14:34:32] [INFO ] Transformed 1760 transitions.
[2024-05-20 14:34:32] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA CANConstruction-PT-020-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Discarding 347 places :
Symmetric choice reduction at 0 with 347 rule applications. Total rules 347 place count 695 transition count 1066
Iterating global reduction 0 with 347 rules applied. Total rules applied 694 place count 695 transition count 1066
Applied a total of 694 rules in 112 ms. Remains 695 /1042 variables (removed 347) and now considering 1066/1760 (removed 694) transitions.
// Phase 1: matrix 1066 rows 695 cols
[2024-05-20 14:34:32] [INFO ] Computed 41 invariants in 33 ms
[2024-05-20 14:34:33] [INFO ] Implicit Places using invariants in 571 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 597 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 675/1042 places, 1066/1760 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 657 transition count 1048
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 657 transition count 1048
Applied a total of 36 rules in 33 ms. Remains 657 /675 variables (removed 18) and now considering 1048/1066 (removed 18) transitions.
// Phase 1: matrix 1048 rows 657 cols
[2024-05-20 14:34:33] [INFO ] Computed 21 invariants in 17 ms
[2024-05-20 14:34:33] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-20 14:34:33] [INFO ] Invariant cache hit.
[2024-05-20 14:34:34] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:34:35] [INFO ] Implicit Places using invariants and state equation in 2054 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 657/1042 places, 1048/1760 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3102 ms. Remains : 657/1042 places, 1048/1760 transitions.
Support contains 31 out of 657 places after structural reductions.
[2024-05-20 14:34:36] [INFO ] Flatten gal took : 128 ms
[2024-05-20 14:34:36] [INFO ] Flatten gal took : 97 ms
[2024-05-20 14:34:36] [INFO ] Input system was already deterministic with 1048 transitions.
Support contains 29 out of 657 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 768 ms. (steps per millisecond=13 ) properties (out of 22) seen :11
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-20 14:34:37] [INFO ] Invariant cache hit.
[2024-05-20 14:34:38] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2024-05-20 14:34:38] [INFO ] After 733ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0 real:2
[2024-05-20 14:34:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2024-05-20 14:34:38] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :1
[2024-05-20 14:34:38] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:34:39] [INFO ] After 152ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :10 sat :1
[2024-05-20 14:34:39] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-20 14:34:39] [INFO ] After 916ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :1
Fused 11 Parikh solutions to 1 different solutions.
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 1048/1048 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 657 transition count 917
Reduce places removed 131 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 132 rules applied. Total rules applied 263 place count 526 transition count 916
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 525 transition count 916
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 264 place count 525 transition count 896
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 304 place count 505 transition count 896
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 316 place count 493 transition count 872
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 493 transition count 872
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 10 rules applied. Total rules applied 338 place count 493 transition count 862
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 348 place count 483 transition count 862
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 386 place count 464 transition count 843
Applied a total of 386 rules in 280 ms. Remains 464 /657 variables (removed 193) and now considering 843/1048 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 464/657 places, 843/1048 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 666701 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 666701 steps, saw 133708 distinct states, run finished after 3002 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 843 rows 464 cols
[2024-05-20 14:34:42] [INFO ] Computed 21 invariants in 12 ms
[2024-05-20 14:34:42] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 14:34:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-20 14:34:43] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 14:34:43] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:34:43] [INFO ] After 84ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 14:34:43] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-20 14:34:43] [INFO ] After 619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 12 ms.
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-020-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 63 stabilizing places and 82 stable transitions
FORMULA CANConstruction-PT-020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((p0||X(F((p0&&X(F(p1)))))))))'
Support contains 5 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 1048/1048 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 644 transition count 1024
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 644 transition count 1024
Applied a total of 26 rules in 31 ms. Remains 644 /657 variables (removed 13) and now considering 1024/1048 (removed 24) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2024-05-20 14:34:43] [INFO ] Computed 21 invariants in 5 ms
[2024-05-20 14:34:44] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-05-20 14:34:44] [INFO ] Invariant cache hit.
[2024-05-20 14:34:44] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:34:46] [INFO ] Implicit Places using invariants and state equation in 1928 ms returned []
Implicit Place search using SMT with State Equation took 2646 ms to find 0 implicit places.
[2024-05-20 14:34:46] [INFO ] Invariant cache hit.
[2024-05-20 14:34:46] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 644/657 places, 1024/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3101 ms. Remains : 644/657 places, 1024/1048 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 324 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p0, acceptance={0} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ s144 s623), p1:(AND (LEQ s46 s432) (LEQ 1 s629))], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 629 ms.
Product exploration explored 100000 steps with 33333 reset in 450 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 23 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLCardinality-01 finished in 4598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 1048/1048 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 657 transition count 915
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 524 transition count 915
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 266 place count 524 transition count 895
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 306 place count 504 transition count 895
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 319 place count 491 transition count 869
Iterating global reduction 2 with 13 rules applied. Total rules applied 332 place count 491 transition count 869
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 343 place count 491 transition count 858
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 354 place count 480 transition count 858
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 390 place count 462 transition count 840
Applied a total of 390 rules in 124 ms. Remains 462 /657 variables (removed 195) and now considering 840/1048 (removed 208) transitions.
// Phase 1: matrix 840 rows 462 cols
[2024-05-20 14:34:48] [INFO ] Computed 21 invariants in 8 ms
[2024-05-20 14:34:48] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-20 14:34:48] [INFO ] Invariant cache hit.
[2024-05-20 14:34:48] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:34:50] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
[2024-05-20 14:34:50] [INFO ] Redundant transitions in 44 ms returned []
[2024-05-20 14:34:50] [INFO ] Invariant cache hit.
[2024-05-20 14:34:50] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 462/657 places, 840/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2451 ms. Remains : 462/657 places, 840/1048 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-02 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}]], initial=1, aps=[p0:(GT 1 s442)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 3254 steps with 25 reset in 33 ms.
FORMULA CANConstruction-PT-020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-02 finished in 2566 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 1 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 1048/1048 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 642 transition count 1020
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 642 transition count 1020
Applied a total of 30 rules in 22 ms. Remains 642 /657 variables (removed 15) and now considering 1020/1048 (removed 28) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-20 14:34:50] [INFO ] Computed 21 invariants in 4 ms
[2024-05-20 14:34:51] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-20 14:34:51] [INFO ] Invariant cache hit.
[2024-05-20 14:34:51] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:34:53] [INFO ] Implicit Places using invariants and state equation in 1913 ms returned []
Implicit Place search using SMT with State Equation took 2287 ms to find 0 implicit places.
[2024-05-20 14:34:53] [INFO ] Invariant cache hit.
[2024-05-20 14:34:53] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 642/657 places, 1020/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2720 ms. Remains : 642/657 places, 1020/1048 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s148)], 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]]
Stuttering criterion allowed to conclude after 391 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-020-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-03 finished in 2849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 1048/1048 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 657 transition count 915
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 524 transition count 915
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 266 place count 524 transition count 895
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 306 place count 504 transition count 895
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 319 place count 491 transition count 869
Iterating global reduction 2 with 13 rules applied. Total rules applied 332 place count 491 transition count 869
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 343 place count 491 transition count 858
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 354 place count 480 transition count 858
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 390 place count 462 transition count 840
Applied a total of 390 rules in 112 ms. Remains 462 /657 variables (removed 195) and now considering 840/1048 (removed 208) transitions.
// Phase 1: matrix 840 rows 462 cols
[2024-05-20 14:34:53] [INFO ] Computed 21 invariants in 3 ms
[2024-05-20 14:34:54] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-20 14:34:54] [INFO ] Invariant cache hit.
[2024-05-20 14:34:54] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:34:55] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 1887 ms to find 0 implicit places.
[2024-05-20 14:34:55] [INFO ] Redundant transitions in 109 ms returned []
[2024-05-20 14:34:55] [INFO ] Invariant cache hit.
[2024-05-20 14:34:56] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 462/657 places, 840/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2405 ms. Remains : 462/657 places, 840/1048 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-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:(LEQ s331 s419)], 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 758 reset in 393 ms.
Stack based approach found an accepted trace after 42735 steps with 323 reset with depth 128 and stack size 125 in 194 ms.
FORMULA CANConstruction-PT-020-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-05 finished in 3192 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)&&X((p1 U (p2||G(p1))))))'
Support contains 5 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 1048/1048 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 643 transition count 1022
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 643 transition count 1022
Applied a total of 28 rules in 28 ms. Remains 643 /657 variables (removed 14) and now considering 1022/1048 (removed 26) transitions.
// Phase 1: matrix 1022 rows 643 cols
[2024-05-20 14:34:56] [INFO ] Computed 21 invariants in 7 ms
[2024-05-20 14:34:57] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-20 14:34:57] [INFO ] Invariant cache hit.
[2024-05-20 14:34:57] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:34:59] [INFO ] Implicit Places using invariants and state equation in 1865 ms returned []
Implicit Place search using SMT with State Equation took 2145 ms to find 0 implicit places.
[2024-05-20 14:34:59] [INFO ] Invariant cache hit.
[2024-05-20 14:34:59] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 643/657 places, 1022/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2570 ms. Remains : 643/657 places, 1022/1048 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT s427 s207) (LEQ 3 s258)), p2:(AND (GT s427 s207) (GT s271 s594)), p1:(GT s271 s594)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], 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 CANConstruction-PT-020-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-10 finished in 2745 ms.
All properties solved by simple procedures.
Total runtime 27344 ms.

BK_STOP 1716215700715

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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="CANConstruction-PT-020"
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 CANConstruction-PT-020, 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 r087-tall-171620521300012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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