Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918600523.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r024-tall-165251918600523
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 12K Apr 29 12:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 29 12:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 29 12:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 12:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 3.8M May 10 09:33 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 1652649573974

Running Version 202205111006
[2022-05-15 21:19:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 21:19:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 21:19:35] [INFO ] Load time of PNML (sax parser for PT used): 398 ms
[2022-05-15 21:19:35] [INFO ] Transformed 5602 places.
[2022-05-15 21:19:35] [INFO ] Transformed 10400 transitions.
[2022-05-15 21:19:35] [INFO ] Parsed PT model containing 5602 places and 10400 transitions in 545 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-050-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 5602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Discarding 2382 places :
Symmetric choice reduction at 0 with 2382 rule applications. Total rules 2382 place count 3220 transition count 5636
Iterating global reduction 0 with 2382 rules applied. Total rules applied 4764 place count 3220 transition count 5636
Applied a total of 4764 rules in 905 ms. Remains 3220 /5602 variables (removed 2382) and now considering 5636/10400 (removed 4764) transitions.
// Phase 1: matrix 5636 rows 3220 cols
[2022-05-15 21:19:36] [INFO ] Computed 101 place invariants in 91 ms
[2022-05-15 21:19:39] [INFO ] Implicit Places using invariants in 3117 ms returned []
// Phase 1: matrix 5636 rows 3220 cols
[2022-05-15 21:19:40] [INFO ] Computed 101 place invariants in 46 ms
[2022-05-15 21:19:41] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:19:57] [INFO ] Implicit Places using invariants and state equation in 17089 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 with State Equation took 20264 ms to find 50 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3170/5602 places, 5636/10400 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 3121 transition count 5587
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 3121 transition count 5587
Applied a total of 98 rules in 1085 ms. Remains 3121 /3170 variables (removed 49) and now considering 5587/5636 (removed 49) transitions.
// Phase 1: matrix 5587 rows 3121 cols
[2022-05-15 21:19:58] [INFO ] Computed 51 place invariants in 41 ms
[2022-05-15 21:20:00] [INFO ] Implicit Places using invariants in 1880 ms returned []
// Phase 1: matrix 5587 rows 3121 cols
[2022-05-15 21:20:00] [INFO ] Computed 51 place invariants in 34 ms
[2022-05-15 21:20:00] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:20:15] [INFO ] Implicit Places using invariants and state equation in 15170 ms returned []
Implicit Place search using SMT with State Equation took 17063 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3121/5602 places, 5587/10400 transitions.
Finished structural reductions, in 2 iterations. Remains : 3121/5602 places, 5587/10400 transitions.
Support contains 36 out of 3121 places after structural reductions.
[2022-05-15 21:20:15] [INFO ] Flatten gal took : 307 ms
[2022-05-15 21:20:15] [INFO ] Flatten gal took : 195 ms
[2022-05-15 21:20:16] [INFO ] Input system was already deterministic with 5587 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 744 ms. (steps per millisecond=13 ) properties (out of 24) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 5587 rows 3121 cols
[2022-05-15 21:20:17] [INFO ] Computed 51 place invariants in 30 ms
[2022-05-15 21:20:18] [INFO ] [Real]Absence check using 51 positive place invariants in 64 ms returned sat
[2022-05-15 21:20:18] [INFO ] After 1487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-15 21:20:20] [INFO ] [Nat]Absence check using 51 positive place invariants in 71 ms returned sat
[2022-05-15 21:20:23] [INFO ] After 3140ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :11
[2022-05-15 21:20:23] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:20:26] [INFO ] After 2889ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :9 sat :11
[2022-05-15 21:20:29] [INFO ] After 5943ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :11
Attempting to minimize the solution found.
Minimization took 1899 ms.
[2022-05-15 21:20:31] [INFO ] After 12750ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :11
Fused 20 Parikh solutions to 6 different solutions.
Finished Parikh walk after 171 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=57 )
Parikh walk visited 11 properties in 33 ms.
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-050-LTLCardinality-05 TRUE 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
FORMULA CANConstruction-PT-050-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 152 stabilizing places and 201 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 3121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3121/3121 places, 5587/5587 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 3102 transition count 5550
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 3102 transition count 5550
Applied a total of 38 rules in 583 ms. Remains 3102 /3121 variables (removed 19) and now considering 5550/5587 (removed 37) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:20:32] [INFO ] Computed 51 place invariants in 31 ms
[2022-05-15 21:20:34] [INFO ] Implicit Places using invariants in 1952 ms returned []
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:20:34] [INFO ] Computed 51 place invariants in 27 ms
[2022-05-15 21:20:35] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:20:50] [INFO ] Implicit Places using invariants and state equation in 15669 ms returned []
Implicit Place search using SMT with State Equation took 17629 ms to find 0 implicit places.
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:20:50] [INFO ] Computed 51 place invariants in 31 ms
[2022-05-15 21:20:52] [INFO ] Dead Transitions using invariants and state equation in 2772 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3102/3121 places, 5550/5587 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3121 places, 5550/5587 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ 1 s1282)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-00 finished in 21321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&F(p1))))'
Support contains 2 out of 3121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3121/3121 places, 5587/5587 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 3103 transition count 5552
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 3103 transition count 5552
Applied a total of 36 rules in 552 ms. Remains 3103 /3121 variables (removed 18) and now considering 5552/5587 (removed 35) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2022-05-15 21:20:53] [INFO ] Computed 51 place invariants in 34 ms
[2022-05-15 21:20:55] [INFO ] Implicit Places using invariants in 1976 ms returned []
// Phase 1: matrix 5552 rows 3103 cols
[2022-05-15 21:20:55] [INFO ] Computed 51 place invariants in 32 ms
[2022-05-15 21:20:56] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:21:11] [INFO ] Implicit Places using invariants and state equation in 16184 ms returned []
Implicit Place search using SMT with State Equation took 18170 ms to find 0 implicit places.
// Phase 1: matrix 5552 rows 3103 cols
[2022-05-15 21:21:11] [INFO ] Computed 51 place invariants in 49 ms
[2022-05-15 21:21:14] [INFO ] Dead Transitions using invariants and state equation in 2976 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3103/3121 places, 5552/5587 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3121 places, 5552/5587 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s983), p1:(LEQ 1 s2996)], 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]]
Stuttering criterion allowed to conclude after 877 steps with 0 reset in 13 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-01 finished in 21983 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 3121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3121/3121 places, 5587/5587 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 3104 transition count 5553
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 3104 transition count 5553
Applied a total of 34 rules in 520 ms. Remains 3104 /3121 variables (removed 17) and now considering 5553/5587 (removed 34) transitions.
// Phase 1: matrix 5553 rows 3104 cols
[2022-05-15 21:21:15] [INFO ] Computed 51 place invariants in 42 ms
[2022-05-15 21:21:17] [INFO ] Implicit Places using invariants in 1784 ms returned []
// Phase 1: matrix 5553 rows 3104 cols
[2022-05-15 21:21:17] [INFO ] Computed 51 place invariants in 25 ms
[2022-05-15 21:21:18] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:21:33] [INFO ] Implicit Places using invariants and state equation in 15968 ms returned []
Implicit Place search using SMT with State Equation took 17753 ms to find 0 implicit places.
// Phase 1: matrix 5553 rows 3104 cols
[2022-05-15 21:21:33] [INFO ] Computed 51 place invariants in 38 ms
[2022-05-15 21:21:36] [INFO ] Dead Transitions using invariants and state equation in 2835 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3104/3121 places, 5553/5587 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3121 places, 5553/5587 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s2493 s425)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-02 finished in 21239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 4 out of 3121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3121/3121 places, 5587/5587 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 3104 transition count 5554
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 3104 transition count 5554
Applied a total of 34 rules in 533 ms. Remains 3104 /3121 variables (removed 17) and now considering 5554/5587 (removed 33) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:21:36] [INFO ] Computed 51 place invariants in 46 ms
[2022-05-15 21:21:38] [INFO ] Implicit Places using invariants in 1793 ms returned []
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:21:38] [INFO ] Computed 51 place invariants in 30 ms
[2022-05-15 21:21:39] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:21:56] [INFO ] Implicit Places using invariants and state equation in 17804 ms returned []
Implicit Place search using SMT with State Equation took 19602 ms to find 0 implicit places.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:21:56] [INFO ] Computed 51 place invariants in 29 ms
[2022-05-15 21:21:59] [INFO ] Dead Transitions using invariants and state equation in 2904 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3104/3121 places, 5554/5587 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3121 places, 5554/5587 transitions.
Stuttering acceptance computed with spot in 504 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ s962 s1951), p0:(LEQ s2869 s1901)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1791 ms.
Product exploration explored 100000 steps with 50000 reset in 1739 ms.
Computed a total of 151 stabilizing places and 200 stable transitions
Computed a total of 151 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CANConstruction-PT-050-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-050-LTLCardinality-03 finished in 27252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((true U p1)&&p0))))'
Support contains 4 out of 3121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3121/3121 places, 5587/5587 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 3104 transition count 5554
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 3104 transition count 5554
Applied a total of 34 rules in 544 ms. Remains 3104 /3121 variables (removed 17) and now considering 5554/5587 (removed 33) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:22:04] [INFO ] Computed 51 place invariants in 37 ms
[2022-05-15 21:22:05] [INFO ] Implicit Places using invariants in 1806 ms returned []
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:22:06] [INFO ] Computed 51 place invariants in 26 ms
[2022-05-15 21:22:06] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:22:24] [INFO ] Implicit Places using invariants and state equation in 19001 ms returned []
Implicit Place search using SMT with State Equation took 20809 ms to find 0 implicit places.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:22:25] [INFO ] Computed 51 place invariants in 30 ms
[2022-05-15 21:22:27] [INFO ] Dead Transitions using invariants and state equation in 2921 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3104/3121 places, 5554/5587 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3121 places, 5554/5587 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s2241 s1063), p0:(AND (LEQ s1777 s1867) (LEQ s2241 s1063))], 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]]
Product exploration explored 100000 steps with 50000 reset in 1765 ms.
Product exploration explored 100000 steps with 50000 reset in 1765 ms.
Computed a total of 151 stabilizing places and 200 stable transitions
Computed a total of 151 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CANConstruction-PT-050-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-050-LTLCardinality-06 finished in 28116 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(G(F(G(X(G(p0)))))))))'
Support contains 2 out of 3121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3121/3121 places, 5587/5587 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 3121 transition count 5251
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 2785 transition count 5251
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 672 place count 2785 transition count 5201
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 772 place count 2735 transition count 5201
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 788 place count 2719 transition count 5169
Iterating global reduction 2 with 16 rules applied. Total rules applied 804 place count 2719 transition count 5169
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 818 place count 2719 transition count 5155
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 832 place count 2705 transition count 5155
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 934 place count 2654 transition count 5104
Applied a total of 934 rules in 995 ms. Remains 2654 /3121 variables (removed 467) and now considering 5104/5587 (removed 483) transitions.
// Phase 1: matrix 5104 rows 2654 cols
[2022-05-15 21:22:32] [INFO ] Computed 51 place invariants in 40 ms
[2022-05-15 21:22:34] [INFO ] Implicit Places using invariants in 1668 ms returned []
// Phase 1: matrix 5104 rows 2654 cols
[2022-05-15 21:22:34] [INFO ] Computed 51 place invariants in 34 ms
[2022-05-15 21:22:35] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:22:46] [INFO ] Implicit Places using invariants and state equation in 11652 ms returned []
Implicit Place search using SMT with State Equation took 13322 ms to find 0 implicit places.
[2022-05-15 21:22:46] [INFO ] Redundant transitions in 389 ms returned []
// Phase 1: matrix 5104 rows 2654 cols
[2022-05-15 21:22:46] [INFO ] Computed 51 place invariants in 60 ms
[2022-05-15 21:22:48] [INFO ] Dead Transitions using invariants and state equation in 2307 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2654/3121 places, 5104/5587 transitions.
Finished structural reductions, in 1 iterations. Remains : 2654/3121 places, 5104/5587 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-07 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 s1080 s1614)], 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 392 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-07 finished in 17087 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))||p1) U G(X(p2))))'
Support contains 5 out of 3121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3121/3121 places, 5587/5587 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 3104 transition count 5554
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 3104 transition count 5554
Applied a total of 34 rules in 528 ms. Remains 3104 /3121 variables (removed 17) and now considering 5554/5587 (removed 33) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:22:49] [INFO ] Computed 51 place invariants in 33 ms
[2022-05-15 21:22:51] [INFO ] Implicit Places using invariants in 1920 ms returned []
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:22:51] [INFO ] Computed 51 place invariants in 29 ms
[2022-05-15 21:22:52] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:23:07] [INFO ] Implicit Places using invariants and state equation in 16631 ms returned []
Implicit Place search using SMT with State Equation took 18567 ms to find 0 implicit places.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:23:07] [INFO ] Computed 51 place invariants in 31 ms
[2022-05-15 21:23:10] [INFO ] Dead Transitions using invariants and state equation in 2759 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3104/3121 places, 5554/5587 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3121 places, 5554/5587 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s1674 s1359), p2:(LEQ s2286 s2784), p0:(LEQ 1 s3099)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 114 reset in 806 ms.
Product exploration explored 100000 steps with 115 reset in 862 ms.
Computed a total of 151 stabilizing places and 200 stable transitions
Computed a total of 151 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X p2), (X (X (AND p1 p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 460 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 11 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:23:13] [INFO ] Computed 51 place invariants in 25 ms
[2022-05-15 21:23:13] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 21:23:14] [INFO ] [Nat]Absence check using 51 positive place invariants in 53 ms returned sat
[2022-05-15 21:23:16] [INFO ] After 1906ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 21:23:16] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:23:17] [INFO ] After 919ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 21:23:17] [INFO ] After 1512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 371 ms.
[2022-05-15 21:23:18] [INFO ] After 4302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 6 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X p2), (X (X (AND p1 p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 11 factoid took 541 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Support contains 5 out of 3104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3104/3104 places, 5554/5554 transitions.
Applied a total of 0 rules in 266 ms. Remains 3104 /3104 variables (removed 0) and now considering 5554/5554 (removed 0) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:23:19] [INFO ] Computed 51 place invariants in 26 ms
[2022-05-15 21:23:21] [INFO ] Implicit Places using invariants in 1830 ms returned []
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:23:21] [INFO ] Computed 51 place invariants in 28 ms
[2022-05-15 21:23:22] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:23:36] [INFO ] Implicit Places using invariants and state equation in 15520 ms returned []
Implicit Place search using SMT with State Equation took 17352 ms to find 0 implicit places.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:23:36] [INFO ] Computed 51 place invariants in 32 ms
[2022-05-15 21:23:39] [INFO ] Dead Transitions using invariants and state equation in 2756 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3104 places, 5554/5554 transitions.
Computed a total of 151 stabilizing places and 200 stable transitions
Computed a total of 151 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X p2), (X (X (AND p1 p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 638 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 11 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:23:40] [INFO ] Computed 51 place invariants in 25 ms
[2022-05-15 21:23:41] [INFO ] After 598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 21:23:41] [INFO ] [Nat]Absence check using 51 positive place invariants in 53 ms returned sat
[2022-05-15 21:23:44] [INFO ] After 2155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 21:23:44] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:23:45] [INFO ] After 1231ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-15 21:23:46] [INFO ] After 2373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 727 ms.
[2022-05-15 21:23:47] [INFO ] After 5978ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 13 ms.
Support contains 3 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3104/3104 places, 5554/5554 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 3104 transition count 5206
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 696 place count 2756 transition count 5206
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 696 place count 2756 transition count 5156
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 796 place count 2706 transition count 5156
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 900 place count 2654 transition count 5104
Applied a total of 900 rules in 690 ms. Remains 2654 /3104 variables (removed 450) and now considering 5104/5554 (removed 450) transitions.
Finished structural reductions, in 1 iterations. Remains : 2654/3104 places, 5104/5554 transitions.
Finished random walk after 722 steps, including 2 resets, run visited all 2 properties in 19 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X p2), (X (X (AND p1 p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 11 factoid took 623 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 112 reset in 770 ms.
Product exploration explored 100000 steps with 113 reset in 749 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Support contains 5 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 5554/5554 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 3104 transition count 5554
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 200 place count 3104 transition count 5554
Deduced a syphon composed of 250 places in 1 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 250 place count 3104 transition count 5554
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 350 place count 3004 transition count 5454
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 450 place count 3004 transition count 5454
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 350 places in 1 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 650 place count 3004 transition count 5454
Discarding 250 places :
Symmetric choice reduction at 1 with 250 rule applications. Total rules 900 place count 2754 transition count 5204
Deduced a syphon composed of 100 places in 1 ms
Iterating global reduction 1 with 250 rules applied. Total rules applied 1150 place count 2754 transition count 5204
Deduced a syphon composed of 100 places in 1 ms
Applied a total of 1150 rules in 1678 ms. Remains 2754 /3104 variables (removed 350) and now considering 5204/5554 (removed 350) transitions.
[2022-05-15 21:23:53] [INFO ] Redundant transitions in 571 ms returned []
// Phase 1: matrix 5204 rows 2754 cols
[2022-05-15 21:23:53] [INFO ] Computed 51 place invariants in 60 ms
[2022-05-15 21:23:55] [INFO ] Dead Transitions using invariants and state equation in 2571 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2754/3104 places, 5204/5554 transitions.
Finished structural reductions, in 1 iterations. Remains : 2754/3104 places, 5204/5554 transitions.
Product exploration explored 100000 steps with 114 reset in 810 ms.
Product exploration explored 100000 steps with 111 reset in 754 ms.
Built C files in :
/tmp/ltsmin3218982970961010839
[2022-05-15 21:23:57] [INFO ] Built C files in 269ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3218982970961010839
Running compilation step : cd /tmp/ltsmin3218982970961010839;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3218982970961010839;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3218982970961010839;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 3104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3104/3104 places, 5554/5554 transitions.
Applied a total of 0 rules in 401 ms. Remains 3104 /3104 variables (removed 0) and now considering 5554/5554 (removed 0) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:24:01] [INFO ] Computed 51 place invariants in 26 ms
[2022-05-15 21:24:13] [INFO ] Implicit Places using invariants in 12635 ms returned []
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:24:14] [INFO ] Computed 51 place invariants in 39 ms
[2022-05-15 21:24:14] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:24:29] [INFO ] Implicit Places using invariants and state equation in 15075 ms returned []
Implicit Place search using SMT with State Equation took 27713 ms to find 0 implicit places.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:24:29] [INFO ] Computed 51 place invariants in 34 ms
[2022-05-15 21:24:31] [INFO ] Dead Transitions using invariants and state equation in 2777 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3104 places, 5554/5554 transitions.
Built C files in :
/tmp/ltsmin9769164491975292250
[2022-05-15 21:24:31] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9769164491975292250
Running compilation step : cd /tmp/ltsmin9769164491975292250;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9769164491975292250;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9769164491975292250;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:24:35] [INFO ] Flatten gal took : 182 ms
[2022-05-15 21:24:35] [INFO ] Flatten gal took : 167 ms
[2022-05-15 21:24:35] [INFO ] Time to serialize gal into /tmp/LTL5069370014012009713.gal : 56 ms
[2022-05-15 21:24:35] [INFO ] Time to serialize properties into /tmp/LTL1240979499482809721.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5069370014012009713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1240979499482809721.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5069370...266
Read 1 LTL properties
Checking formula 0 : !((((G(F("(Node49requestsent44>=1)")))||("(Node20requestsent43<=Node14requestsent22)"))U(G(X("(Node33GiveAnswer16<=Node43GiveAnswer23)...161
Formula 0 simplified : !(("(Node20requestsent43<=Node14requestsent22)" | GF"(Node49requestsent44>=1)") U GX"(Node33GiveAnswer16<=Node43GiveAnswer23)")
Detected timeout of ITS tools.
[2022-05-15 21:24:50] [INFO ] Flatten gal took : 142 ms
[2022-05-15 21:24:50] [INFO ] Applying decomposition
[2022-05-15 21:24:50] [INFO ] Flatten gal took : 146 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8194832566565931598.txt' '-o' '/tmp/graph8194832566565931598.bin' '-w' '/tmp/graph8194832566565931598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8194832566565931598.bin' '-l' '-1' '-v' '-w' '/tmp/graph8194832566565931598.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:24:51] [INFO ] Decomposing Gal with order
[2022-05-15 21:24:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:24:53] [INFO ] Removed a total of 4951 redundant transitions.
[2022-05-15 21:24:53] [INFO ] Flatten gal took : 1578 ms
[2022-05-15 21:24:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 4800 labels/synchronizations in 534 ms.
[2022-05-15 21:24:55] [INFO ] Time to serialize gal into /tmp/LTL2874927773948683362.gal : 30 ms
[2022-05-15 21:24:55] [INFO ] Time to serialize properties into /tmp/LTL7624525616416304126.ltl : 43 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2874927773948683362.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7624525616416304126.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2874927...266
Read 1 LTL properties
Checking formula 0 : !((((G(F("(gi0.gi19.gu224.Node49requestsent44>=1)")))||("(gu226.Node20requestsent43<=gu226.Node14requestsent22)"))U(G(X("(gu227.Node33...200
Formula 0 simplified : !(("(gu226.Node20requestsent43<=gu226.Node14requestsent22)" | GF"(gi0.gi19.gu224.Node49requestsent44>=1)") U GX"(gu227.Node33GiveAns...189
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10111647042044339513
[2022-05-15 21:25:10] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10111647042044339513
Running compilation step : cd /tmp/ltsmin10111647042044339513;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10111647042044339513;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10111647042044339513;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-050-LTLCardinality-09 finished in 144574 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 3 out of 3121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3121/3121 places, 5587/5587 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 3104 transition count 5554
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 3104 transition count 5554
Applied a total of 34 rules in 989 ms. Remains 3104 /3121 variables (removed 17) and now considering 5554/5587 (removed 33) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:25:14] [INFO ] Computed 51 place invariants in 38 ms
[2022-05-15 21:25:20] [INFO ] Implicit Places using invariants in 6312 ms returned []
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:25:20] [INFO ] Computed 51 place invariants in 27 ms
[2022-05-15 21:25:22] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:25:39] [INFO ] Implicit Places using invariants and state equation in 18301 ms returned []
Implicit Place search using SMT with State Equation took 24622 ms to find 0 implicit places.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:25:39] [INFO ] Computed 51 place invariants in 97 ms
[2022-05-15 21:25:41] [INFO ] Dead Transitions using invariants and state equation in 2760 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3104/3121 places, 5554/5587 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3121 places, 5554/5587 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ s91 s3092) (LEQ 1 s1659)), p0:(LEQ s91 s3092)], 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 113 reset in 737 ms.
Stack based approach found an accepted trace after 83385 steps with 94 reset with depth 809 and stack size 809 in 712 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-13 finished in 30020 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))||p1) U G(X(p2))))'
Found a SL insensitive property : CANConstruction-PT-050-LTLCardinality-09
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Support contains 5 out of 3121 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 3121/3121 places, 5587/5587 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 3121 transition count 5251
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 2785 transition count 5251
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 672 place count 2785 transition count 5201
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 772 place count 2735 transition count 5201
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 788 place count 2719 transition count 5169
Iterating global reduction 2 with 16 rules applied. Total rules applied 804 place count 2719 transition count 5169
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 818 place count 2719 transition count 5155
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 832 place count 2705 transition count 5155
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 934 place count 2654 transition count 5104
Applied a total of 934 rules in 678 ms. Remains 2654 /3121 variables (removed 467) and now considering 5104/5587 (removed 483) transitions.
// Phase 1: matrix 5104 rows 2654 cols
[2022-05-15 21:25:44] [INFO ] Computed 51 place invariants in 33 ms
[2022-05-15 21:25:45] [INFO ] Implicit Places using invariants in 1585 ms returned []
// Phase 1: matrix 5104 rows 2654 cols
[2022-05-15 21:25:45] [INFO ] Computed 51 place invariants in 33 ms
[2022-05-15 21:25:46] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:25:57] [INFO ] Implicit Places using invariants and state equation in 11142 ms returned []
Implicit Place search using SMT with State Equation took 12731 ms to find 0 implicit places.
// Phase 1: matrix 5104 rows 2654 cols
[2022-05-15 21:25:57] [INFO ] Computed 51 place invariants in 45 ms
[2022-05-15 21:25:59] [INFO ] Dead Transitions using invariants and state equation in 2157 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2654/3121 places, 5104/5587 transitions.
Finished structural reductions, in 1 iterations. Remains : 2654/3121 places, 5104/5587 transitions.
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s1224 s909), p2:(LEQ s1836 s2334), p0:(LEQ 1 s2649)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 294 reset in 1101 ms.
Stack based approach found an accepted trace after 90918 steps with 265 reset with depth 211 and stack size 211 in 949 ms.
Treatment of property CANConstruction-PT-050-LTLCardinality-09 finished in 17894 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-09 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-15 21:26:01] [INFO ] Flatten gal took : 153 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 386358 ms.

BK_STOP 1652649961600

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="itstools"
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-4028"
echo " Executing tool itstools"
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 r024-tall-165251918600523"
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 ;