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.r131-smll-171624288600222.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 DLCshifumi-PT-6a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-171624288600222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.3M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 14 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 14 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 14 01:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 14 01:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:38 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 6.9M 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 DLCshifumi-PT-6a-LTLCardinality-00
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-01
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-02
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-03
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-04
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-05
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-06
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-07
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-08
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-09
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-10
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-11
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-12
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-13
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-14
FORMULA_NAME DLCshifumi-PT-6a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716414323745

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=DLCshifumi-PT-6a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 21:45:26] [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-22 21:45:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 21:45:27] [INFO ] Load time of PNML (sax parser for PT used): 1154 ms
[2024-05-22 21:45:27] [INFO ] Transformed 3568 places.
[2024-05-22 21:45:27] [INFO ] Transformed 25936 transitions.
[2024-05-22 21:45:27] [INFO ] Found NUPN structural information;
[2024-05-22 21:45:27] [INFO ] Parsed PT model containing 3568 places and 25936 transitions and 101182 arcs in 1380 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 6 formulas.
Ensure Unique test removed 2976 transitions
Reduce redundant transitions removed 2976 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA DLCshifumi-PT-6a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-6a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-6a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-6a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-6a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-6a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-6a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-6a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-6a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-6a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 3568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3568/3568 places, 22960/22960 transitions.
Discarding 374 places :
Symmetric choice reduction at 0 with 374 rule applications. Total rules 374 place count 3194 transition count 18146
Iterating global reduction 0 with 374 rules applied. Total rules applied 748 place count 3194 transition count 18146
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Iterating post reduction 0 with 180 rules applied. Total rules applied 928 place count 3194 transition count 17966
Drop transitions removed 5580 transitions
Redundant transition composition rules discarded 5580 transitions
Iterating global reduction 1 with 5580 rules applied. Total rules applied 6508 place count 3194 transition count 12386
Applied a total of 6508 rules in 3648 ms. Remains 3194 /3568 variables (removed 374) and now considering 12386/22960 (removed 10574) transitions.
[2024-05-22 21:45:31] [INFO ] Flow matrix only has 1374 transitions (discarded 11012 similar events)
// Phase 1: matrix 1374 rows 3194 cols
[2024-05-22 21:45:31] [INFO ] Computed 2415 invariants in 33 ms
[2024-05-22 21:45:35] [INFO ] Implicit Places using invariants in 3733 ms returned []
Implicit Place search using SMT only with invariants took 3782 ms to find 0 implicit places.
[2024-05-22 21:45:35] [INFO ] Flow matrix only has 1374 transitions (discarded 11012 similar events)
[2024-05-22 21:45:35] [INFO ] Invariant cache hit.
[2024-05-22 21:45:45] [INFO ] Dead Transitions using invariants and state equation in 9885 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3194/3568 places, 12386/22960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17325 ms. Remains : 3194/3568 places, 12386/22960 transitions.
Support contains 25 out of 3194 places after structural reductions.
[2024-05-22 21:45:47] [INFO ] Flatten gal took : 1560 ms
[2024-05-22 21:45:48] [INFO ] Flatten gal took : 1282 ms
[2024-05-22 21:45:49] [INFO ] Input system was already deterministic with 12386 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1215 ms. (steps per millisecond=8 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-22 21:45:53] [INFO ] Flow matrix only has 1374 transitions (discarded 11012 similar events)
[2024-05-22 21:45:53] [INFO ] Invariant cache hit.
[2024-05-22 21:45:55] [INFO ] After 1242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 21:45:57] [INFO ] [Nat]Absence check using 2415 positive place invariants in 1375 ms returned sat
[2024-05-22 21:45:57] [INFO ] After 2301ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
FORMULA DLCshifumi-PT-6a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-6a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2227 stabilizing places and 1 stable transitions
FORMULA DLCshifumi-PT-6a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-6a-LTLCardinality-07 TRUE 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' '!(F((G(p1)&&p0)))'
Support contains 3 out of 3194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3194/3194 places, 12386/12386 transitions.
Graph (trivial) has 1166 edges and 3194 vertex of which 388 / 3194 are part of one of the 188 SCC in 14 ms
Free SCC test removed 200 places
Ensure Unique test removed 1522 transitions
Reduce isomorphic transitions removed 1522 transitions.
Drop transitions removed 181 transitions
Trivial Post-agglo rules discarded 181 transitions
Performed 181 trivial Post agglomeration. Transition count delta: 181
Iterating post reduction 0 with 181 rules applied. Total rules applied 182 place count 2994 transition count 10683
Reduce places removed 181 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 182 rules applied. Total rules applied 364 place count 2813 transition count 10682
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 365 place count 2812 transition count 10682
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 365 place count 2812 transition count 10681
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 367 place count 2811 transition count 10681
Discarding 177 places :
Symmetric choice reduction at 3 with 177 rule applications. Total rules 544 place count 2634 transition count 10504
Iterating global reduction 3 with 177 rules applied. Total rules applied 721 place count 2634 transition count 10504
Ensure Unique test removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 3 with 1062 rules applied. Total rules applied 1783 place count 2634 transition count 9442
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 190
Deduced a syphon composed of 190 places in 4 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 4 with 380 rules applied. Total rules applied 2163 place count 2444 transition count 9252
Ensure Unique test removed 1128 transitions
Reduce isomorphic transitions removed 1128 transitions.
Iterating post reduction 4 with 1128 rules applied. Total rules applied 3291 place count 2444 transition count 8124
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 3297 place count 2441 transition count 8136
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 3315 place count 2441 transition count 8118
Drop transitions removed 4446 transitions
Redundant transition composition rules discarded 4446 transitions
Iterating global reduction 6 with 4446 rules applied. Total rules applied 7761 place count 2441 transition count 3672
Reduce places removed 1068 places and 0 transitions.
Iterating post reduction 6 with 1068 rules applied. Total rules applied 8829 place count 1373 transition count 3672
Discarding 1286 places :
Symmetric choice reduction at 7 with 1286 rule applications. Total rules 10115 place count 87 transition count 216
Iterating global reduction 7 with 1286 rules applied. Total rules applied 11401 place count 87 transition count 216
Applied a total of 11401 rules in 3022 ms. Remains 87 /3194 variables (removed 3107) and now considering 216/12386 (removed 12170) transitions.
[2024-05-22 21:46:01] [INFO ] Flow matrix only has 52 transitions (discarded 164 similar events)
// Phase 1: matrix 52 rows 87 cols
[2024-05-22 21:46:01] [INFO ] Computed 61 invariants in 1 ms
[2024-05-22 21:46:01] [INFO ] Implicit Places using invariants in 200 ms returned [39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 79, 80, 81, 82, 83, 84, 85, 86]
Discarding 47 places :
Ensure Unique test removed 138 transitions
Reduce isomorphic transitions removed 138 transitions.
Implicit Place search using SMT only with invariants took 205 ms to find 47 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/3194 places, 78/12386 transitions.
Graph (trivial) has 67 edges and 40 vertex of which 32 / 40 are part of one of the 10 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 9 transition count 13
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 9 transition count 12
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 8 transition count 11
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 8 transition count 11
Applied a total of 22 rules in 6 ms. Remains 8 /40 variables (removed 32) and now considering 11/78 (removed 67) transitions.
[2024-05-22 21:46:01] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 8 cols
[2024-05-22 21:46:01] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 21:46:01] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 21:46:01] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 21:46:01] [INFO ] Invariant cache hit.
[2024-05-22 21:46:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:46:01] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/3194 places, 11/12386 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3296 ms. Remains : 8/3194 places, 11/12386 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 330 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-6a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s4 0) (NEQ s5 1)), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 449 ms.
Product exploration explored 100000 steps with 0 reset in 218 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 14 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Detected a total of 3/8 stabilizing places and 1/11 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 124 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 334 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
[2024-05-22 21:46:03] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 21:46:03] [INFO ] Invariant cache hit.
[2024-05-22 21:46:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 21:46:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 21:46:03] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-22 21:46:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:46:03] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-22 21:46:03] [INFO ] Computed and/alt/rep : 10/18/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-22 21:46:03] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-22 21:46:03] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 21:46:03] [INFO ] Invariant cache hit.
[2024-05-22 21:46:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 21:46:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 21:46:03] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-22 21:46:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:46:03] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-22 21:46:03] [INFO ] Computed and/alt/rep : 10/18/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-22 21:46:03] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-22 21:46:03] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 21:46:03] [INFO ] Invariant cache hit.
[2024-05-22 21:46:03] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 21:46:03] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 21:46:03] [INFO ] Invariant cache hit.
[2024-05-22 21:46:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:46:03] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-22 21:46:03] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 21:46:03] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 21:46:03] [INFO ] Invariant cache hit.
[2024-05-22 21:46:03] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 8/8 places, 11/11 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 14 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Detected a total of 3/8 stabilizing places and 1/11 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 132 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 241 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
[2024-05-22 21:46:04] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 21:46:04] [INFO ] Invariant cache hit.
[2024-05-22 21:46:04] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 21:46:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 21:46:04] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-22 21:46:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:46:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-22 21:46:04] [INFO ] Computed and/alt/rep : 10/18/7 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 21:46:04] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-22 21:46:04] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 21:46:04] [INFO ] Invariant cache hit.
[2024-05-22 21:46:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 21:46:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 21:46:04] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-22 21:46:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:46:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-22 21:46:04] [INFO ] Computed and/alt/rep : 10/18/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-22 21:46:04] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 237 ms.
Product exploration explored 100000 steps with 0 reset in 185 ms.
Built C files in :
/tmp/ltsmin7301258642069491377
[2024-05-22 21:46:04] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2024-05-22 21:46:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 21:46:04] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2024-05-22 21:46:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 21:46:04] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2024-05-22 21:46:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 21:46:04] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7301258642069491377
Running compilation step : cd /tmp/ltsmin7301258642069491377;'/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 294 ms.
Running link step : cd /tmp/ltsmin7301258642069491377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin7301258642069491377;'/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/stateBased1420147418003432112.hoa' '--buchi-type=spotba'
LTSmin run took 105 ms.
FORMULA DLCshifumi-PT-6a-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DLCshifumi-PT-6a-LTLCardinality-08 finished in 7219 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)||(((F(p2)||p1) U p0) U !p3)))'
Support contains 5 out of 3194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3194/3194 places, 12386/12386 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3192 transition count 12372
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3192 transition count 12372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 3192 transition count 12371
Applied a total of 5 rules in 1786 ms. Remains 3192 /3194 variables (removed 2) and now considering 12371/12386 (removed 15) transitions.
[2024-05-22 21:46:06] [INFO ] Flow matrix only has 1371 transitions (discarded 11000 similar events)
// Phase 1: matrix 1371 rows 3192 cols
[2024-05-22 21:46:06] [INFO ] Computed 2415 invariants in 13 ms
[2024-05-22 21:46:11] [INFO ] Implicit Places using invariants in 4145 ms returned []
Implicit Place search using SMT only with invariants took 4152 ms to find 0 implicit places.
[2024-05-22 21:46:11] [INFO ] Flow matrix only has 1371 transitions (discarded 11000 similar events)
[2024-05-22 21:46:11] [INFO ] Invariant cache hit.
[2024-05-22 21:46:23] [INFO ] Dead Transitions using invariants and state equation in 12294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3192/3194 places, 12371/12386 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18240 ms. Remains : 3192/3194 places, 12371/12386 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) p3), (AND (NOT p2) (NOT p0) p1), (NOT p0), (AND (NOT p0) p3), (NOT p2), p3]
Running random walk in product with property : DLCshifumi-PT-6a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p3, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(OR (EQ s101 0) (EQ s140 1)), p0:(OR (EQ s604 0) (EQ s891 1)), p1:(OR (EQ s604 0) (EQ s891 1)), p2:(NEQ s153 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 23410 steps with 11705 reset in 10002 ms.
Product exploration timeout after 23610 steps with 11805 reset in 10002 ms.
Computed a total of 2227 stabilizing places and 1 stable transitions
Computed a total of 2227 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 p0 p1 p2), (X p0), (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2))))), (X (X p3)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 27 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCshifumi-PT-6a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCshifumi-PT-6a-LTLCardinality-15 finished in 38700 ms.
All properties solved by simple procedures.
Total runtime 77628 ms.

BK_STOP 1716414405146

--------------------
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="DLCshifumi-PT-6a"
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 DLCshifumi-PT-6a, 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 r131-smll-171624288600222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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