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.r373-tall-171683788700167.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 ShieldIIPt-PT-010B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788700167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 12 20:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 20:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 20:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 167K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-010B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716951930287

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=ShieldIIPt-PT-010B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 03:05: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-29 03:05:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:05:32] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-29 03:05:32] [INFO ] Transformed 703 places.
[2024-05-29 03:05:32] [INFO ] Transformed 653 transitions.
[2024-05-29 03:05:32] [INFO ] Found NUPN structural information;
[2024-05-29 03:05:32] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 166 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 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-010B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 653/653 transitions.
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 105 place count 598 transition count 548
Iterating global reduction 0 with 105 rules applied. Total rules applied 210 place count 598 transition count 548
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 211 place count 597 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 212 place count 597 transition count 547
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 213 place count 596 transition count 546
Iterating global reduction 0 with 1 rules applied. Total rules applied 214 place count 596 transition count 546
Applied a total of 214 rules in 166 ms. Remains 596 /703 variables (removed 107) and now considering 546/653 (removed 107) transitions.
// Phase 1: matrix 546 rows 596 cols
[2024-05-29 03:05:32] [INFO ] Computed 91 invariants in 28 ms
[2024-05-29 03:05:33] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-29 03:05:33] [INFO ] Invariant cache hit.
[2024-05-29 03:05:33] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
[2024-05-29 03:05:33] [INFO ] Invariant cache hit.
[2024-05-29 03:05:33] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/703 places, 546/653 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1338 ms. Remains : 596/703 places, 546/653 transitions.
Support contains 22 out of 596 places after structural reductions.
[2024-05-29 03:05:34] [INFO ] Flatten gal took : 64 ms
[2024-05-29 03:05:34] [INFO ] Flatten gal took : 29 ms
[2024-05-29 03:05:34] [INFO ] Input system was already deterministic with 546 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 13) seen :12
Finished Best-First random walk after 2243 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=280 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ShieldIIPt-PT-010B-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 161 stabilizing places and 161 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 546/546 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 595 transition count 425
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 475 transition count 425
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 240 place count 475 transition count 348
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 394 place count 398 transition count 348
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 398 place count 394 transition count 344
Iterating global reduction 2 with 4 rules applied. Total rules applied 402 place count 394 transition count 344
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 402 place count 394 transition count 341
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 408 place count 391 transition count 341
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 163
Deduced a syphon composed of 163 places in 0 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 2 with 326 rules applied. Total rules applied 734 place count 228 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 735 place count 228 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 737 place count 227 transition count 176
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 793 place count 199 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 795 place count 197 transition count 192
Applied a total of 795 rules in 101 ms. Remains 197 /596 variables (removed 399) and now considering 192/546 (removed 354) transitions.
// Phase 1: matrix 192 rows 197 cols
[2024-05-29 03:05:34] [INFO ] Computed 91 invariants in 1 ms
[2024-05-29 03:05:34] [INFO ] Implicit Places using invariants in 116 ms returned [190]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 196/596 places, 192/546 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 196 transition count 191
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 191
Applied a total of 2 rules in 9 ms. Remains 195 /196 variables (removed 1) and now considering 191/192 (removed 1) transitions.
// Phase 1: matrix 191 rows 195 cols
[2024-05-29 03:05:34] [INFO ] Computed 90 invariants in 2 ms
[2024-05-29 03:05:35] [INFO ] Implicit Places using invariants in 106 ms returned [183]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 194/596 places, 191/546 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 190
Applied a total of 2 rules in 8 ms. Remains 193 /194 variables (removed 1) and now considering 190/191 (removed 1) transitions.
// Phase 1: matrix 190 rows 193 cols
[2024-05-29 03:05:35] [INFO ] Computed 89 invariants in 1 ms
[2024-05-29 03:05:35] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-29 03:05:35] [INFO ] Invariant cache hit.
[2024-05-29 03:05:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 03:05:35] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 193/596 places, 190/546 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 626 ms. Remains : 193/596 places, 190/546 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 225 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLCardinality-01 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:(OR (AND (EQ s74 0) (EQ s179 1)) (AND (EQ s48 0) (EQ s97 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 2 reset in 4 ms.
FORMULA ShieldIIPt-PT-010B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-LTLCardinality-01 finished in 920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&G(p1))))'
Support contains 4 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 546/546 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 591 transition count 541
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 591 transition count 541
Applied a total of 10 rules in 25 ms. Remains 591 /596 variables (removed 5) and now considering 541/546 (removed 5) transitions.
// Phase 1: matrix 541 rows 591 cols
[2024-05-29 03:05:35] [INFO ] Computed 91 invariants in 7 ms
[2024-05-29 03:05:35] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-29 03:05:35] [INFO ] Invariant cache hit.
[2024-05-29 03:05:36] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2024-05-29 03:05:36] [INFO ] Invariant cache hit.
[2024-05-29 03:05:36] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 591/596 places, 541/546 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 937 ms. Remains : 591/596 places, 541/546 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s255 0) (EQ s306 1)), p0:(OR (EQ s371 0) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 73 reset in 393 ms.
Stack based approach found an accepted trace after 11262 steps with 8 reset with depth 1773 and stack size 1756 in 40 ms.
FORMULA ShieldIIPt-PT-010B-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010B-LTLCardinality-02 finished in 1567 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||(p1&&X(p1))) U (G((!p0||(p1&&X(p1))))||((!p0||(p1&&X(p1)))&&G(p2)))))'
Support contains 4 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 546/546 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 591 transition count 541
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 591 transition count 541
Applied a total of 10 rules in 19 ms. Remains 591 /596 variables (removed 5) and now considering 541/546 (removed 5) transitions.
[2024-05-29 03:05:37] [INFO ] Invariant cache hit.
[2024-05-29 03:05:37] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-29 03:05:37] [INFO ] Invariant cache hit.
[2024-05-29 03:05:37] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-05-29 03:05:37] [INFO ] Invariant cache hit.
[2024-05-29 03:05:38] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 591/596 places, 541/546 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 840 ms. Remains : 591/596 places, 541/546 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND p0 (NOT p1)), true, (NOT p1), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p2 p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p2 p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p2:(NEQ s475 1), p0:(OR (EQ s530 0) (EQ s372 1)), p1:(NEQ s493 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33341 reset in 428 ms.
Product exploration explored 100000 steps with 33226 reset in 345 ms.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p2 p0 (NOT p1)))), (X (OR (AND p2 (NOT p0)) (AND p2 p1))), (X p1), (X (AND p2 p0 p1)), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p2)), (X (X (OR (AND p2 (NOT p0)) (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p2 p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 360 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND p0 (NOT p1)), true, (NOT p1), (AND p0 (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:05:39] [INFO ] Invariant cache hit.
[2024-05-29 03:05:40] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:05:40] [INFO ] [Nat]Absence check using 91 positive place invariants in 19 ms returned sat
[2024-05-29 03:05:40] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:05:40] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 4 ms to minimize.
[2024-05-29 03:05:40] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 1 ms to minimize.
[2024-05-29 03:05:40] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 2 ms to minimize.
[2024-05-29 03:05:41] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2024-05-29 03:05:41] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2024-05-29 03:05:41] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2024-05-29 03:05:41] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-05-29 03:05:41] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-29 03:05:41] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-29 03:05:41] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2024-05-29 03:05:41] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2024-05-29 03:05:41] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2024-05-29 03:05:41] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-05-29 03:05:41] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1525 ms
[2024-05-29 03:05:42] [INFO ] After 1836ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-29 03:05:42] [INFO ] After 2017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 40 ms.
Support contains 4 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 541/541 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 591 transition count 425
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 232 place count 475 transition count 425
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 232 place count 475 transition count 344
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 394 place count 394 transition count 344
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 732 place count 225 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 733 place count 225 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 735 place count 224 transition count 173
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 791 place count 196 transition count 190
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 792 place count 196 transition count 189
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 801 place count 196 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 802 place count 195 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 804 place count 193 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 804 place count 193 transition count 187
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 806 place count 192 transition count 187
Applied a total of 806 rules in 69 ms. Remains 192 /591 variables (removed 399) and now considering 187/541 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 192/591 places, 187/541 transitions.
Finished random walk after 1032 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p2 p0 (NOT p1)))), (X (OR (AND p2 (NOT p0)) (AND p2 p1))), (X p1), (X (AND p2 p0 p1)), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p2)), (X (X (OR (AND p2 (NOT p0)) (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p2 p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1 p2))), (F (AND p0 (NOT p1) p2)), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (AND p0 (NOT p1) (NOT p2)))
Knowledge based reduction with 23 factoid took 664 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-010B-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-010B-LTLCardinality-04 finished in 5721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0 U p1)))||G(p0)))'
Support contains 4 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 546/546 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 595 transition count 427
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 477 transition count 427
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 236 place count 477 transition count 351
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 388 place count 401 transition count 351
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 391 place count 398 transition count 348
Iterating global reduction 2 with 3 rules applied. Total rules applied 394 place count 398 transition count 348
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 394 place count 398 transition count 346
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 398 place count 396 transition count 346
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 1 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 736 place count 227 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 737 place count 227 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 739 place count 226 transition count 175
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 793 place count 199 transition count 191
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 795 place count 197 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 796 place count 196 transition count 189
Applied a total of 796 rules in 153 ms. Remains 196 /596 variables (removed 400) and now considering 189/546 (removed 357) transitions.
// Phase 1: matrix 189 rows 196 cols
[2024-05-29 03:05:43] [INFO ] Computed 90 invariants in 3 ms
[2024-05-29 03:05:43] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-29 03:05:43] [INFO ] Invariant cache hit.
[2024-05-29 03:05:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:05:43] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2024-05-29 03:05:43] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-29 03:05:43] [INFO ] Invariant cache hit.
[2024-05-29 03:05:43] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 196/596 places, 189/546 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 996 ms. Remains : 196/596 places, 189/546 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s187 0) (EQ s193 1)), p1:(OR (EQ s130 0) (EQ s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 301 ms.
Product exploration explored 100000 steps with 0 reset in 446 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 324 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 3336 steps, including 1 resets, run visited all 4 properties in 24 ms. (steps per millisecond=139 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 433 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 189/189 transitions.
Applied a total of 0 rules in 8 ms. Remains 196 /196 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2024-05-29 03:05:46] [INFO ] Invariant cache hit.
[2024-05-29 03:05:46] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-29 03:05:46] [INFO ] Invariant cache hit.
[2024-05-29 03:05:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:05:46] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-29 03:05:46] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-29 03:05:46] [INFO ] Invariant cache hit.
[2024-05-29 03:05:46] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 196/196 places, 189/189 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 374 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 3338 steps, including 1 resets, run visited all 4 properties in 42 ms. (steps per millisecond=79 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 451 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 342 ms.
Product exploration explored 100000 steps with 0 reset in 373 ms.
Built C files in :
/tmp/ltsmin6360046596821597794
[2024-05-29 03:05:48] [INFO ] Computing symmetric may disable matrix : 189 transitions.
[2024-05-29 03:05:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:05:48] [INFO ] Computing symmetric may enable matrix : 189 transitions.
[2024-05-29 03:05:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:05:48] [INFO ] Computing Do-Not-Accords matrix : 189 transitions.
[2024-05-29 03:05:48] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:05:48] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6360046596821597794
Running compilation step : cd /tmp/ltsmin6360046596821597794;'/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 541 ms.
Running link step : cd /tmp/ltsmin6360046596821597794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin6360046596821597794;'/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/stateBased3896718208272565069.hoa' '--buchi-type=spotba'
LTSmin run took 395 ms.
FORMULA ShieldIIPt-PT-010B-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-010B-LTLCardinality-07 finished in 6669 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(F(p1))&&p0))))'
Support contains 4 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 546/546 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 593 transition count 543
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 593 transition count 543
Applied a total of 6 rules in 23 ms. Remains 593 /596 variables (removed 3) and now considering 543/546 (removed 3) transitions.
// Phase 1: matrix 543 rows 593 cols
[2024-05-29 03:05:49] [INFO ] Computed 91 invariants in 6 ms
[2024-05-29 03:05:49] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-29 03:05:49] [INFO ] Invariant cache hit.
[2024-05-29 03:05:50] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2024-05-29 03:05:50] [INFO ] Invariant cache hit.
[2024-05-29 03:05:50] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 593/596 places, 543/546 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1031 ms. Remains : 593/596 places, 543/546 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (NEQ s27 0) (NEQ s152 1)), p0:(AND (NEQ s453 0) (NEQ s518 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 15 reset in 269 ms.
Stack based approach found an accepted trace after 730 steps with 1 reset with depth 409 and stack size 409 in 2 ms.
FORMULA ShieldIIPt-PT-010B-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010B-LTLCardinality-08 finished in 1516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 1 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 546/546 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 592 transition count 542
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 592 transition count 542
Applied a total of 8 rules in 24 ms. Remains 592 /596 variables (removed 4) and now considering 542/546 (removed 4) transitions.
// Phase 1: matrix 542 rows 592 cols
[2024-05-29 03:05:51] [INFO ] Computed 91 invariants in 5 ms
[2024-05-29 03:05:51] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-29 03:05:51] [INFO ] Invariant cache hit.
[2024-05-29 03:05:51] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-05-29 03:05:51] [INFO ] Invariant cache hit.
[2024-05-29 03:05:52] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 592/596 places, 542/546 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 952 ms. Remains : 592/596 places, 542/546 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-010B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s334 0), p0:(EQ s334 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 338 ms.
Product exploration explored 100000 steps with 33333 reset in 351 ms.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 25 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-010B-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-010B-LTLCardinality-14 finished in 1867 ms.
All properties solved by simple procedures.
Total runtime 20763 ms.

BK_STOP 1716951953989

--------------------
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="ShieldIIPt-PT-010B"
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 ShieldIIPt-PT-010B, 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 r373-tall-171683788700167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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