Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521300027.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CANConstruction-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521300027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 8.8K 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 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 19:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 19:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.8M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716217196064

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 14:59:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 14:59:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:59:57] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2024-05-20 14:59:57] [INFO ] Transformed 5602 places.
[2024-05-20 14:59:58] [INFO ] Transformed 10400 transitions.
[2024-05-20 14:59:58] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 563 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.
FORMULA CANConstruction-PT-050-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 5602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Discarding 2386 places :
Symmetric choice reduction at 0 with 2386 rule applications. Total rules 2386 place count 3216 transition count 5628
Iterating global reduction 0 with 2386 rules applied. Total rules applied 4772 place count 3216 transition count 5628
Applied a total of 4772 rules in 874 ms. Remains 3216 /5602 variables (removed 2386) and now considering 5628/10400 (removed 4772) transitions.
// Phase 1: matrix 5628 rows 3216 cols
[2024-05-20 14:59:59] [INFO ] Computed 101 invariants in 89 ms
[2024-05-20 15:00:02] [INFO ] Implicit Places using invariants in 3732 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 3762 ms to find 50 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3166/5602 places, 5628/10400 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 3118 transition count 5580
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 3118 transition count 5580
Applied a total of 96 rules in 920 ms. Remains 3118 /3166 variables (removed 48) and now considering 5580/5628 (removed 48) transitions.
// Phase 1: matrix 5580 rows 3118 cols
[2024-05-20 15:00:03] [INFO ] Computed 51 invariants in 46 ms
[2024-05-20 15:00:05] [INFO ] Implicit Places using invariants in 1905 ms returned []
[2024-05-20 15:00:05] [INFO ] Invariant cache hit.
[2024-05-20 15:00:06] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:00:19] [INFO ] Implicit Places using invariants and state equation in 13654 ms returned []
Implicit Place search using SMT with State Equation took 15566 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3118/5602 places, 5580/10400 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21123 ms. Remains : 3118/5602 places, 5580/10400 transitions.
Support contains 45 out of 3118 places after structural reductions.
[2024-05-20 15:00:20] [INFO ] Flatten gal took : 379 ms
[2024-05-20 15:00:20] [INFO ] Flatten gal took : 176 ms
[2024-05-20 15:00:20] [INFO ] Input system was already deterministic with 5580 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 25) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-20 15:00:21] [INFO ] Invariant cache hit.
[2024-05-20 15:00:22] [INFO ] After 1159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-20 15:00:23] [INFO ] [Nat]Absence check using 51 positive place invariants in 51 ms returned sat
[2024-05-20 15:00:27] [INFO ] After 2976ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :10
[2024-05-20 15:00:27] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:00:29] [INFO ] After 2481ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :7 sat :10
[2024-05-20 15:00:32] [INFO ] After 5127ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :10
Attempting to minimize the solution found.
Minimization took 1637 ms.
[2024-05-20 15:00:33] [INFO ] After 11368ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :10
Fused 17 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 112 ms.
Support contains 20 out of 3118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3118/3118 places, 5580/5580 transitions.
Drop transitions removed 341 transitions
Trivial Post-agglo rules discarded 341 transitions
Performed 341 trivial Post agglomeration. Transition count delta: 341
Iterating post reduction 0 with 341 rules applied. Total rules applied 341 place count 3118 transition count 5239
Reduce places removed 341 places and 0 transitions.
Iterating post reduction 1 with 341 rules applied. Total rules applied 682 place count 2777 transition count 5239
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 682 place count 2777 transition count 5189
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 782 place count 2727 transition count 5189
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 792 place count 2717 transition count 5169
Iterating global reduction 2 with 10 rules applied. Total rules applied 802 place count 2717 transition count 5169
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 810 place count 2717 transition count 5161
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 818 place count 2709 transition count 5161
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 920 place count 2658 transition count 5110
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 921 place count 2658 transition count 5109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 922 place count 2657 transition count 5109
Applied a total of 922 rules in 1465 ms. Remains 2657 /3118 variables (removed 461) and now considering 5109/5580 (removed 471) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1469 ms. Remains : 2657/3118 places, 5109/5580 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5109 rows 2657 cols
[2024-05-20 15:00:35] [INFO ] Computed 51 invariants in 42 ms
[2024-05-20 15:00:36] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 15:00:36] [INFO ] [Nat]Absence check using 51 positive place invariants in 45 ms returned sat
[2024-05-20 15:00:38] [INFO ] After 1775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 15:00:38] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:00:39] [INFO ] After 1134ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 15:00:40] [INFO ] After 1842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 471 ms.
[2024-05-20 15:00:40] [INFO ] After 4674ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 8 out of 2657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2657/2657 places, 5109/5109 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2657 transition count 5108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2656 transition count 5108
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 2653 transition count 5102
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 2653 transition count 5102
Applied a total of 8 rules in 454 ms. Remains 2653 /2657 variables (removed 4) and now considering 5102/5109 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 455 ms. Remains : 2653/2657 places, 5102/5109 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 5102 rows 2653 cols
[2024-05-20 15:00:41] [INFO ] Computed 51 invariants in 52 ms
[2024-05-20 15:00:41] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:00:42] [INFO ] [Nat]Absence check using 51 positive place invariants in 45 ms returned sat
[2024-05-20 15:00:43] [INFO ] After 1592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 15:00:43] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:00:44] [INFO ] After 666ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 15:00:44] [INFO ] After 937ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 165 ms.
[2024-05-20 15:00:45] [INFO ] After 3106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-050-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 153 stabilizing places and 202 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' '!(F(G(p0)))'
Support contains 3 out of 3118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3118/3118 places, 5580/5580 transitions.
Drop transitions removed 342 transitions
Trivial Post-agglo rules discarded 342 transitions
Performed 342 trivial Post agglomeration. Transition count delta: 342
Iterating post reduction 0 with 342 rules applied. Total rules applied 342 place count 3118 transition count 5238
Reduce places removed 342 places and 0 transitions.
Iterating post reduction 1 with 342 rules applied. Total rules applied 684 place count 2776 transition count 5238
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 684 place count 2776 transition count 5188
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 784 place count 2726 transition count 5188
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 797 place count 2713 transition count 5162
Iterating global reduction 2 with 13 rules applied. Total rules applied 810 place count 2713 transition count 5162
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 820 place count 2713 transition count 5152
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 830 place count 2703 transition count 5152
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 928 place count 2654 transition count 5103
Applied a total of 928 rules in 772 ms. Remains 2654 /3118 variables (removed 464) and now considering 5103/5580 (removed 477) transitions.
// Phase 1: matrix 5103 rows 2654 cols
[2024-05-20 15:00:46] [INFO ] Computed 51 invariants in 63 ms
[2024-05-20 15:00:47] [INFO ] Implicit Places using invariants in 1695 ms returned []
[2024-05-20 15:00:47] [INFO ] Invariant cache hit.
[2024-05-20 15:00:48] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:01:01] [INFO ] Implicit Places using invariants and state equation in 13800 ms returned []
Implicit Place search using SMT with State Equation took 15498 ms to find 0 implicit places.
[2024-05-20 15:01:01] [INFO ] Redundant transitions in 354 ms returned []
[2024-05-20 15:01:01] [INFO ] Invariant cache hit.
[2024-05-20 15:01:04] [INFO ] Dead Transitions using invariants and state equation in 2211 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2654/3118 places, 5103/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18851 ms. Remains : 2654/3118 places, 5103/5580 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 153 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT s1983 s2229) (GT 1 s26))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 287 reset in 1167 ms.
Stack based approach found an accepted trace after 647 steps with 1 reset with depth 299 and stack size 299 in 11 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-01 finished in 20250 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)))'
Support contains 2 out of 3118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3118/3118 places, 5580/5580 transitions.
Drop transitions removed 343 transitions
Trivial Post-agglo rules discarded 343 transitions
Performed 343 trivial Post agglomeration. Transition count delta: 343
Iterating post reduction 0 with 343 rules applied. Total rules applied 343 place count 3118 transition count 5237
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 1 with 343 rules applied. Total rules applied 686 place count 2775 transition count 5237
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 686 place count 2775 transition count 5187
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 786 place count 2725 transition count 5187
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 800 place count 2711 transition count 5159
Iterating global reduction 2 with 14 rules applied. Total rules applied 814 place count 2711 transition count 5159
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 825 place count 2711 transition count 5148
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 836 place count 2700 transition count 5148
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 932 place count 2652 transition count 5100
Applied a total of 932 rules in 721 ms. Remains 2652 /3118 variables (removed 466) and now considering 5100/5580 (removed 480) transitions.
// Phase 1: matrix 5100 rows 2652 cols
[2024-05-20 15:01:06] [INFO ] Computed 51 invariants in 52 ms
[2024-05-20 15:01:07] [INFO ] Implicit Places using invariants in 1661 ms returned []
[2024-05-20 15:01:07] [INFO ] Invariant cache hit.
[2024-05-20 15:01:08] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:01:21] [INFO ] Implicit Places using invariants and state equation in 13662 ms returned []
Implicit Place search using SMT with State Equation took 15328 ms to find 0 implicit places.
[2024-05-20 15:01:21] [INFO ] Redundant transitions in 330 ms returned []
[2024-05-20 15:01:21] [INFO ] Invariant cache hit.
[2024-05-20 15:01:24] [INFO ] Dead Transitions using invariants and state equation in 2148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2652/3118 places, 5100/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18540 ms. Remains : 2652/3118 places, 5100/5580 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1274 s1682)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 371 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-02 finished in 18613 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(p0)&&F((X(p0)&&F(p1))))||G((F(p1)&&F(p0))))))'
Support contains 4 out of 3118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3118/3118 places, 5580/5580 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3104 transition count 5554
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3104 transition count 5554
Applied a total of 28 rules in 447 ms. Remains 3104 /3118 variables (removed 14) and now considering 5554/5580 (removed 26) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2024-05-20 15:01:24] [INFO ] Computed 51 invariants in 36 ms
[2024-05-20 15:01:26] [INFO ] Implicit Places using invariants in 1656 ms returned []
[2024-05-20 15:01:26] [INFO ] Invariant cache hit.
[2024-05-20 15:01:27] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:01:40] [INFO ] Implicit Places using invariants and state equation in 13925 ms returned []
Implicit Place search using SMT with State Equation took 15583 ms to find 0 implicit places.
[2024-05-20 15:01:40] [INFO ] Invariant cache hit.
[2024-05-20 15:01:43] [INFO ] Dead Transitions using invariants and state equation in 2849 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3104/3118 places, 5554/5580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18881 ms. Remains : 3104/3118 places, 5554/5580 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s1435 s1648), p0:(LEQ s828 s1915)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 967 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-05 finished in 19092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 3118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3118/3118 places, 5580/5580 transitions.
Drop transitions removed 343 transitions
Trivial Post-agglo rules discarded 343 transitions
Performed 343 trivial Post agglomeration. Transition count delta: 343
Iterating post reduction 0 with 343 rules applied. Total rules applied 343 place count 3118 transition count 5237
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 1 with 343 rules applied. Total rules applied 686 place count 2775 transition count 5237
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 686 place count 2775 transition count 5187
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 786 place count 2725 transition count 5187
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 800 place count 2711 transition count 5159
Iterating global reduction 2 with 14 rules applied. Total rules applied 814 place count 2711 transition count 5159
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 825 place count 2711 transition count 5148
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 836 place count 2700 transition count 5148
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 932 place count 2652 transition count 5100
Applied a total of 932 rules in 710 ms. Remains 2652 /3118 variables (removed 466) and now considering 5100/5580 (removed 480) transitions.
// Phase 1: matrix 5100 rows 2652 cols
[2024-05-20 15:01:44] [INFO ] Computed 51 invariants in 50 ms
[2024-05-20 15:01:45] [INFO ] Implicit Places using invariants in 1611 ms returned []
[2024-05-20 15:01:45] [INFO ] Invariant cache hit.
[2024-05-20 15:01:46] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:01:58] [INFO ] Implicit Places using invariants and state equation in 13336 ms returned []
Implicit Place search using SMT with State Equation took 14954 ms to find 0 implicit places.
[2024-05-20 15:01:59] [INFO ] Redundant transitions in 225 ms returned []
[2024-05-20 15:01:59] [INFO ] Invariant cache hit.
[2024-05-20 15:02:01] [INFO ] Dead Transitions using invariants and state equation in 2123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2652/3118 places, 5100/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18034 ms. Remains : 2652/3118 places, 5100/5580 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-06 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 (LEQ 1 s1977) (LEQ s2355 s1684))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 293 reset in 1056 ms.
Stack based approach found an accepted trace after 25304 steps with 74 reset with depth 308 and stack size 308 in 264 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-06 finished in 19458 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) U ((p1&&X(p0))||X(G(p0)))))'
Support contains 3 out of 3118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3118/3118 places, 5580/5580 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3103 transition count 5552
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3103 transition count 5552
Applied a total of 30 rules in 457 ms. Remains 3103 /3118 variables (removed 15) and now considering 5552/5580 (removed 28) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2024-05-20 15:02:03] [INFO ] Computed 51 invariants in 32 ms
[2024-05-20 15:02:05] [INFO ] Implicit Places using invariants in 1868 ms returned []
[2024-05-20 15:02:05] [INFO ] Invariant cache hit.
[2024-05-20 15:02:05] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:02:20] [INFO ] Implicit Places using invariants and state equation in 15396 ms returned []
Implicit Place search using SMT with State Equation took 17276 ms to find 0 implicit places.
[2024-05-20 15:02:20] [INFO ] Invariant cache hit.
[2024-05-20 15:02:23] [INFO ] Dead Transitions using invariants and state equation in 2849 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3103/3118 places, 5552/5580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20585 ms. Remains : 3103/3118 places, 5552/5580 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s1299 s1080), p1:(GT 3 s2878)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-07 finished in 20720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 2 out of 3118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3118/3118 places, 5580/5580 transitions.
Drop transitions removed 343 transitions
Trivial Post-agglo rules discarded 343 transitions
Performed 343 trivial Post agglomeration. Transition count delta: 343
Iterating post reduction 0 with 343 rules applied. Total rules applied 343 place count 3118 transition count 5237
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 1 with 343 rules applied. Total rules applied 686 place count 2775 transition count 5237
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 686 place count 2775 transition count 5187
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 786 place count 2725 transition count 5187
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 799 place count 2712 transition count 5161
Iterating global reduction 2 with 13 rules applied. Total rules applied 812 place count 2712 transition count 5161
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 822 place count 2712 transition count 5151
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 832 place count 2702 transition count 5151
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 930 place count 2653 transition count 5102
Applied a total of 930 rules in 683 ms. Remains 2653 /3118 variables (removed 465) and now considering 5102/5580 (removed 478) transitions.
// Phase 1: matrix 5102 rows 2653 cols
[2024-05-20 15:02:24] [INFO ] Computed 51 invariants in 42 ms
[2024-05-20 15:02:25] [INFO ] Implicit Places using invariants in 1609 ms returned []
[2024-05-20 15:02:25] [INFO ] Invariant cache hit.
[2024-05-20 15:02:26] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:02:38] [INFO ] Implicit Places using invariants and state equation in 13028 ms returned []
Implicit Place search using SMT with State Equation took 14641 ms to find 0 implicit places.
[2024-05-20 15:02:38] [INFO ] Redundant transitions in 221 ms returned []
[2024-05-20 15:02:39] [INFO ] Invariant cache hit.
[2024-05-20 15:02:41] [INFO ] Dead Transitions using invariants and state equation in 2026 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2653/3118 places, 5102/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17590 ms. Remains : 2653/3118 places, 5102/5580 transitions.
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s615 s1053)], 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 323 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-08 finished in 17693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(F(p1) U p2)))))'
Support contains 5 out of 3118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3118/3118 places, 5580/5580 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3105 transition count 5556
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3105 transition count 5556
Applied a total of 26 rules in 472 ms. Remains 3105 /3118 variables (removed 13) and now considering 5556/5580 (removed 24) transitions.
// Phase 1: matrix 5556 rows 3105 cols
[2024-05-20 15:02:41] [INFO ] Computed 51 invariants in 36 ms
[2024-05-20 15:02:43] [INFO ] Implicit Places using invariants in 1754 ms returned []
[2024-05-20 15:02:43] [INFO ] Invariant cache hit.
[2024-05-20 15:02:44] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:02:57] [INFO ] Implicit Places using invariants and state equation in 13967 ms returned []
Implicit Place search using SMT with State Equation took 15728 ms to find 0 implicit places.
[2024-05-20 15:02:57] [INFO ] Invariant cache hit.
[2024-05-20 15:03:00] [INFO ] Dead Transitions using invariants and state equation in 2720 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3105/3118 places, 5556/5580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18923 ms. Remains : 3105/3118 places, 5556/5580 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s1123), p2:(LEQ s2297 s1047), p1:(LEQ s2505 s2430)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-09 finished in 19123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 3118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3118/3118 places, 5580/5580 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3102 transition count 5550
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3102 transition count 5550
Applied a total of 32 rules in 445 ms. Remains 3102 /3118 variables (removed 16) and now considering 5550/5580 (removed 30) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2024-05-20 15:03:00] [INFO ] Computed 51 invariants in 37 ms
[2024-05-20 15:03:02] [INFO ] Implicit Places using invariants in 1669 ms returned []
[2024-05-20 15:03:02] [INFO ] Invariant cache hit.
[2024-05-20 15:03:03] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:03:16] [INFO ] Implicit Places using invariants and state equation in 13868 ms returned []
Implicit Place search using SMT with State Equation took 15540 ms to find 0 implicit places.
[2024-05-20 15:03:16] [INFO ] Invariant cache hit.
[2024-05-20 15:03:18] [INFO ] Dead Transitions using invariants and state equation in 2488 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3102/3118 places, 5550/5580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18474 ms. Remains : 3102/3118 places, 5550/5580 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s2968)], 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][false, false, false]]
Stuttering criterion allowed to conclude after 958 steps with 0 reset in 8 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-10 finished in 18624 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)))'
Support contains 2 out of 3118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3118/3118 places, 5580/5580 transitions.
Drop transitions removed 343 transitions
Trivial Post-agglo rules discarded 343 transitions
Performed 343 trivial Post agglomeration. Transition count delta: 343
Iterating post reduction 0 with 343 rules applied. Total rules applied 343 place count 3118 transition count 5237
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 1 with 343 rules applied. Total rules applied 686 place count 2775 transition count 5237
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 686 place count 2775 transition count 5187
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 786 place count 2725 transition count 5187
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 800 place count 2711 transition count 5159
Iterating global reduction 2 with 14 rules applied. Total rules applied 814 place count 2711 transition count 5159
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 825 place count 2711 transition count 5148
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 836 place count 2700 transition count 5148
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 932 place count 2652 transition count 5100
Applied a total of 932 rules in 710 ms. Remains 2652 /3118 variables (removed 466) and now considering 5100/5580 (removed 480) transitions.
// Phase 1: matrix 5100 rows 2652 cols
[2024-05-20 15:03:19] [INFO ] Computed 51 invariants in 47 ms
[2024-05-20 15:03:21] [INFO ] Implicit Places using invariants in 1629 ms returned []
[2024-05-20 15:03:21] [INFO ] Invariant cache hit.
[2024-05-20 15:03:22] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:03:34] [INFO ] Implicit Places using invariants and state equation in 13367 ms returned []
Implicit Place search using SMT with State Equation took 14999 ms to find 0 implicit places.
[2024-05-20 15:03:34] [INFO ] Redundant transitions in 221 ms returned []
[2024-05-20 15:03:34] [INFO ] Invariant cache hit.
[2024-05-20 15:03:37] [INFO ] Dead Transitions using invariants and state equation in 2241 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2652/3118 places, 5100/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18190 ms. Remains : 2652/3118 places, 5100/5580 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s336 s1309)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 290 reset in 1091 ms.
Product exploration explored 100000 steps with 287 reset in 1068 ms.
Computed a total of 51 stabilizing places and 100 stable transitions
Computed a total of 51 stabilizing places and 100 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 3377 steps, including 9 resets, run visited all 1 properties in 40 ms. (steps per millisecond=84 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 2 out of 2652 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2652/2652 places, 5100/5100 transitions.
Applied a total of 0 rules in 227 ms. Remains 2652 /2652 variables (removed 0) and now considering 5100/5100 (removed 0) transitions.
[2024-05-20 15:03:39] [INFO ] Invariant cache hit.
[2024-05-20 15:03:41] [INFO ] Implicit Places using invariants in 1609 ms returned []
[2024-05-20 15:03:41] [INFO ] Invariant cache hit.
[2024-05-20 15:03:42] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:03:55] [INFO ] Implicit Places using invariants and state equation in 13861 ms returned []
Implicit Place search using SMT with State Equation took 15472 ms to find 0 implicit places.
[2024-05-20 15:03:55] [INFO ] Redundant transitions in 225 ms returned []
[2024-05-20 15:03:55] [INFO ] Invariant cache hit.
[2024-05-20 15:03:57] [INFO ] Dead Transitions using invariants and state equation in 2206 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18143 ms. Remains : 2652/2652 places, 5100/5100 transitions.
Computed a total of 51 stabilizing places and 100 stable transitions
Computed a total of 51 stabilizing places and 100 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 27 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6232 steps, run visited all 1 properties in 47 ms. (steps per millisecond=132 )
Probabilistic random walk after 6232 steps, saw 6002 distinct states, run finished after 48 ms. (steps per millisecond=129 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 289 reset in 1038 ms.
Stack based approach found an accepted trace after 27746 steps with 80 reset with depth 276 and stack size 276 in 288 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-13 finished in 40765 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(X(p0))&&(F(!p0)||!(p0 U p1)))))'
Support contains 4 out of 3118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3118/3118 places, 5580/5580 transitions.
Drop transitions removed 343 transitions
Trivial Post-agglo rules discarded 343 transitions
Performed 343 trivial Post agglomeration. Transition count delta: 343
Iterating post reduction 0 with 343 rules applied. Total rules applied 343 place count 3118 transition count 5237
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 1 with 343 rules applied. Total rules applied 686 place count 2775 transition count 5237
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 686 place count 2775 transition count 5187
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 786 place count 2725 transition count 5187
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 799 place count 2712 transition count 5161
Iterating global reduction 2 with 13 rules applied. Total rules applied 812 place count 2712 transition count 5161
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 822 place count 2712 transition count 5151
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 832 place count 2702 transition count 5151
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 930 place count 2653 transition count 5102
Applied a total of 930 rules in 696 ms. Remains 2653 /3118 variables (removed 465) and now considering 5102/5580 (removed 478) transitions.
// Phase 1: matrix 5102 rows 2653 cols
[2024-05-20 15:04:00] [INFO ] Computed 51 invariants in 52 ms
[2024-05-20 15:04:02] [INFO ] Implicit Places using invariants in 1667 ms returned []
[2024-05-20 15:04:02] [INFO ] Invariant cache hit.
[2024-05-20 15:04:02] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 15:04:15] [INFO ] Implicit Places using invariants and state equation in 13923 ms returned []
Implicit Place search using SMT with State Equation took 15591 ms to find 0 implicit places.
[2024-05-20 15:04:16] [INFO ] Redundant transitions in 228 ms returned []
[2024-05-20 15:04:16] [INFO ] Invariant cache hit.
[2024-05-20 15:04:18] [INFO ] Dead Transitions using invariants and state equation in 2106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2653/3118 places, 5102/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18636 ms. Remains : 2653/3118 places, 5102/5580 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s555 s2532), p1:(LEQ s1688 s2557)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1418 steps with 3 reset in 18 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-14 finished in 18809 ms.
All properties solved by simple procedures.
Total runtime 260980 ms.

BK_STOP 1716217459310

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CANConstruction-PT-050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521300027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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