Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 18:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 18:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 18:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 18:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.4M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716215723930

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 14:35:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 14:35:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:35:25] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-05-20 14:35:25] [INFO ] Transformed 2162 places.
[2024-05-20 14:35:25] [INFO ] Transformed 3840 transitions.
[2024-05-20 14:35:25] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-030-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 2162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Discarding 830 places :
Symmetric choice reduction at 0 with 830 rule applications. Total rules 830 place count 1332 transition count 2180
Iterating global reduction 0 with 830 rules applied. Total rules applied 1660 place count 1332 transition count 2180
Applied a total of 1660 rules in 558 ms. Remains 1332 /2162 variables (removed 830) and now considering 2180/3840 (removed 1660) transitions.
// Phase 1: matrix 2180 rows 1332 cols
[2024-05-20 14:35:26] [INFO ] Computed 61 invariants in 46 ms
[2024-05-20 14:35:27] [INFO ] Implicit Places using invariants in 851 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 334, 348, 362, 376, 390, 404, 418]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 877 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1303/2162 places, 2180/3840 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1274 transition count 2151
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1274 transition count 2151
Applied a total of 58 rules in 79 ms. Remains 1274 /1303 variables (removed 29) and now considering 2151/2180 (removed 29) transitions.
// Phase 1: matrix 2151 rows 1274 cols
[2024-05-20 14:35:27] [INFO ] Computed 32 invariants in 24 ms
[2024-05-20 14:35:27] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-05-20 14:35:27] [INFO ] Invariant cache hit.
[2024-05-20 14:35:28] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:35:34] [INFO ] Implicit Places using invariants and state equation in 7011 ms returned []
Implicit Place search using SMT with State Equation took 7575 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1274/2162 places, 2151/3840 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9092 ms. Remains : 1274/2162 places, 2151/3840 transitions.
Support contains 42 out of 1274 places after structural reductions.
[2024-05-20 14:35:35] [INFO ] Flatten gal took : 138 ms
[2024-05-20 14:35:35] [INFO ] Flatten gal took : 90 ms
[2024-05-20 14:35:35] [INFO ] Input system was already deterministic with 2151 transitions.
Support contains 40 out of 1274 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 27) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-20 14:35:35] [INFO ] Invariant cache hit.
[2024-05-20 14:35:36] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2024-05-20 14:35:36] [INFO ] [Real]Absence check using 31 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 14:35:37] [INFO ] After 780ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2024-05-20 14:35:37] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:35:37] [INFO ] After 400ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 14:35:37] [INFO ] After 1586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 14:35:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2024-05-20 14:35:37] [INFO ] [Nat]Absence check using 31 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 14:35:38] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 14:35:39] [INFO ] After 432ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 14:35:39] [INFO ] After 913ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 283 ms.
[2024-05-20 14:35:39] [INFO ] After 2289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 6 ms.
Support contains 4 out of 1274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1274/1274 places, 2151/2151 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1274 transition count 1950
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1073 transition count 1950
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 402 place count 1073 transition count 1921
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 460 place count 1044 transition count 1921
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 468 place count 1036 transition count 1905
Iterating global reduction 2 with 8 rules applied. Total rules applied 476 place count 1036 transition count 1905
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 7 rules applied. Total rules applied 483 place count 1036 transition count 1898
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 490 place count 1029 transition count 1898
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 552 place count 998 transition count 1867
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 554 place count 998 transition count 1865
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 556 place count 996 transition count 1865
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 557 place count 996 transition count 1864
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 558 place count 995 transition count 1864
Applied a total of 558 rules in 546 ms. Remains 995 /1274 variables (removed 279) and now considering 1864/2151 (removed 287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 995/1274 places, 1864/2151 transitions.
Finished random walk after 2607 steps, including 12 resets, run visited all 3 properties in 46 ms. (steps per millisecond=56 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CANConstruction-PT-030-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 92 stabilizing places and 121 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1274/1274 places, 2151/2151 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1274 transition count 1950
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1073 transition count 1950
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 402 place count 1073 transition count 1921
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 460 place count 1044 transition count 1921
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 470 place count 1034 transition count 1901
Iterating global reduction 2 with 10 rules applied. Total rules applied 480 place count 1034 transition count 1901
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 489 place count 1034 transition count 1892
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 498 place count 1025 transition count 1892
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 556 place count 996 transition count 1863
Applied a total of 556 rules in 195 ms. Remains 996 /1274 variables (removed 278) and now considering 1863/2151 (removed 288) transitions.
// Phase 1: matrix 1863 rows 996 cols
[2024-05-20 14:35:40] [INFO ] Computed 32 invariants in 17 ms
[2024-05-20 14:35:41] [INFO ] Implicit Places using invariants in 517 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 527 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/1274 places, 1863/2151 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 995 transition count 1861
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 993 transition count 1861
Applied a total of 4 rules in 61 ms. Remains 993 /995 variables (removed 2) and now considering 1861/1863 (removed 2) transitions.
// Phase 1: matrix 1861 rows 993 cols
[2024-05-20 14:35:41] [INFO ] Computed 31 invariants in 15 ms
[2024-05-20 14:35:42] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-05-20 14:35:42] [INFO ] Invariant cache hit.
[2024-05-20 14:35:42] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:35:49] [INFO ] Implicit Places using invariants and state equation in 7670 ms returned []
Implicit Place search using SMT with State Equation took 8159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 993/1274 places, 1861/2151 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8942 ms. Remains : 993/1274 places, 1861/2151 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 166 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s22 1) (GEQ s419 1))], 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 211 steps with 0 reset in 8 ms.
FORMULA CANConstruction-PT-030-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-00 finished in 9183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))&&F(p1)))))'
Support contains 3 out of 1274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1274/1274 places, 2151/2151 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1265 transition count 2133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1265 transition count 2133
Applied a total of 18 rules in 83 ms. Remains 1265 /1274 variables (removed 9) and now considering 2133/2151 (removed 18) transitions.
// Phase 1: matrix 2133 rows 1265 cols
[2024-05-20 14:35:50] [INFO ] Computed 32 invariants in 17 ms
[2024-05-20 14:35:50] [INFO ] Implicit Places using invariants in 579 ms returned [276]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 582 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1264/1274 places, 2133/2151 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1263 transition count 2132
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1263 transition count 2132
Applied a total of 2 rules in 98 ms. Remains 1263 /1264 variables (removed 1) and now considering 2132/2133 (removed 1) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2024-05-20 14:35:50] [INFO ] Computed 31 invariants in 16 ms
[2024-05-20 14:35:51] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-05-20 14:35:51] [INFO ] Invariant cache hit.
[2024-05-20 14:35:51] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:35:58] [INFO ] Implicit Places using invariants and state equation in 7392 ms returned []
Implicit Place search using SMT with State Equation took 7949 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1263/1274 places, 2132/2151 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8712 ms. Remains : 1263/1274 places, 2132/2151 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1)), (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-030-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s554 1), p1:(OR (LT s554 1) (AND (GEQ s294 1) (GEQ s822 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 562 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-030-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-01 finished in 8974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1274/1274 places, 2151/2151 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1274 transition count 1950
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1073 transition count 1950
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 402 place count 1073 transition count 1921
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 460 place count 1044 transition count 1921
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 469 place count 1035 transition count 1903
Iterating global reduction 2 with 9 rules applied. Total rules applied 478 place count 1035 transition count 1903
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 486 place count 1035 transition count 1895
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 494 place count 1027 transition count 1895
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 556 place count 996 transition count 1864
Applied a total of 556 rules in 190 ms. Remains 996 /1274 variables (removed 278) and now considering 1864/2151 (removed 287) transitions.
// Phase 1: matrix 1864 rows 996 cols
[2024-05-20 14:35:59] [INFO ] Computed 32 invariants in 16 ms
[2024-05-20 14:35:59] [INFO ] Implicit Places using invariants in 504 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 507 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/1274 places, 1864/2151 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 995 transition count 1862
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 993 transition count 1862
Applied a total of 4 rules in 67 ms. Remains 993 /995 variables (removed 2) and now considering 1862/1864 (removed 2) transitions.
// Phase 1: matrix 1862 rows 993 cols
[2024-05-20 14:35:59] [INFO ] Computed 31 invariants in 11 ms
[2024-05-20 14:36:00] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-20 14:36:00] [INFO ] Invariant cache hit.
[2024-05-20 14:36:00] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:36:06] [INFO ] Implicit Places using invariants and state equation in 6787 ms returned []
Implicit Place search using SMT with State Equation took 7266 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 993/1274 places, 1862/2151 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8035 ms. Remains : 993/1274 places, 1862/2151 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s756 1)], 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 243 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-030-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-02 finished in 8096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1274/1274 places, 2151/2151 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1274 transition count 1951
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1074 transition count 1951
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 400 place count 1074 transition count 1922
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 458 place count 1045 transition count 1922
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 468 place count 1035 transition count 1902
Iterating global reduction 2 with 10 rules applied. Total rules applied 478 place count 1035 transition count 1902
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 487 place count 1035 transition count 1893
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 496 place count 1026 transition count 1893
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 554 place count 997 transition count 1864
Applied a total of 554 rules in 157 ms. Remains 997 /1274 variables (removed 277) and now considering 1864/2151 (removed 287) transitions.
// Phase 1: matrix 1864 rows 997 cols
[2024-05-20 14:36:07] [INFO ] Computed 32 invariants in 21 ms
[2024-05-20 14:36:07] [INFO ] Implicit Places using invariants in 496 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 497 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 996/1274 places, 1864/2151 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 996 transition count 1862
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 994 transition count 1862
Applied a total of 4 rules in 57 ms. Remains 994 /996 variables (removed 2) and now considering 1862/1864 (removed 2) transitions.
// Phase 1: matrix 1862 rows 994 cols
[2024-05-20 14:36:07] [INFO ] Computed 31 invariants in 13 ms
[2024-05-20 14:36:08] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-20 14:36:08] [INFO ] Invariant cache hit.
[2024-05-20 14:36:08] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:36:14] [INFO ] Implicit Places using invariants and state equation in 6766 ms returned []
Implicit Place search using SMT with State Equation took 7293 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 994/1274 places, 1862/2151 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8004 ms. Remains : 994/1274 places, 1862/2151 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s74 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 233 steps with 0 reset in 6 ms.
FORMULA CANConstruction-PT-030-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-03 finished in 8106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((p0 U !(G(p1) U !(G(p3)&&p2))))))'
Support contains 6 out of 1274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1274/1274 places, 2151/2151 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1265 transition count 2133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1265 transition count 2133
Applied a total of 18 rules in 99 ms. Remains 1265 /1274 variables (removed 9) and now considering 2133/2151 (removed 18) transitions.
// Phase 1: matrix 2133 rows 1265 cols
[2024-05-20 14:36:15] [INFO ] Computed 32 invariants in 15 ms
[2024-05-20 14:36:15] [INFO ] Implicit Places using invariants in 526 ms returned [276]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 529 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1264/1274 places, 2133/2151 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1263 transition count 2132
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1263 transition count 2132
Applied a total of 2 rules in 93 ms. Remains 1263 /1264 variables (removed 1) and now considering 2132/2133 (removed 1) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2024-05-20 14:36:15] [INFO ] Computed 31 invariants in 15 ms
[2024-05-20 14:36:16] [INFO ] Implicit Places using invariants in 589 ms returned []
[2024-05-20 14:36:16] [INFO ] Invariant cache hit.
[2024-05-20 14:36:17] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:36:23] [INFO ] Implicit Places using invariants and state equation in 7184 ms returned []
Implicit Place search using SMT with State Equation took 7776 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1263/1274 places, 2132/2151 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8498 ms. Remains : 1263/1274 places, 2132/2151 transitions.
Stuttering acceptance computed with spot in 522 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p3), (OR (NOT p3) (NOT p2)), (NOT p3), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), p1, (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 p3) p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p3) p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p3 p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 p2 p3 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND p1 p2 p3 p0), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))), acceptance={} source=4 dest: 2}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p3) p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p2 p3 p0), acceptance={1} source=4 dest: 5}, { cond=(AND p1 p2 p3 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p1 p2 p3 p0), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p3 p0), acceptance={1} source=5 dest: 5}], [{ cond=(AND p1 p2 p3), acceptance={} source=6 dest: 6}, { cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), acceptance={} source=6 dest: 8}], [{ cond=(AND p1 p2 p3 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p2 p3 p0), acceptance={0} source=7 dest: 7}, { cond=(OR (AND p1 (NOT p2) p0) (AND p1 (NOT p3) p0)), acceptance={0, 1} source=7 dest: 7}, { cond=(OR (AND p1 (NOT p2) (NOT p0)) (AND p1 (NOT p3) (NOT p0))), acceptance={} source=7 dest: 8}, { cond=(AND p1 p2 p3 p0), acceptance={1} source=7 dest: 10}], [{ cond=p1, acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p3), acceptance={} source=9 dest: 9}], [{ cond=(AND p1 (NOT p3) p0), acceptance={0, 1} source=10 dest: 7}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=10 dest: 8}, { cond=(AND p1 p3 (NOT p0)), acceptance={} source=10 dest: 9}, { cond=(AND p1 p3 p0), acceptance={1} source=10 dest: 10}]], initial=0, aps=[p2:(AND (GEQ s18 1) (GEQ s275 1)), p3:(GEQ s595 1), p0:(AND (GEQ s210 1) (GEQ s553 1)), p1:(GEQ s241 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-030-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-06 finished in 9061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 1274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1274/1274 places, 2151/2151 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1274 transition count 1950
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1073 transition count 1950
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 402 place count 1073 transition count 1921
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 460 place count 1044 transition count 1921
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 468 place count 1036 transition count 1905
Iterating global reduction 2 with 8 rules applied. Total rules applied 476 place count 1036 transition count 1905
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 7 rules applied. Total rules applied 483 place count 1036 transition count 1898
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 490 place count 1029 transition count 1898
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 554 place count 997 transition count 1866
Applied a total of 554 rules in 175 ms. Remains 997 /1274 variables (removed 277) and now considering 1866/2151 (removed 285) transitions.
// Phase 1: matrix 1866 rows 997 cols
[2024-05-20 14:36:24] [INFO ] Computed 32 invariants in 10 ms
[2024-05-20 14:36:24] [INFO ] Implicit Places using invariants in 493 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 495 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 996/1274 places, 1866/2151 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 996 transition count 1864
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 994 transition count 1864
Applied a total of 4 rules in 56 ms. Remains 994 /996 variables (removed 2) and now considering 1864/1866 (removed 2) transitions.
// Phase 1: matrix 1864 rows 994 cols
[2024-05-20 14:36:24] [INFO ] Computed 31 invariants in 18 ms
[2024-05-20 14:36:25] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-20 14:36:25] [INFO ] Invariant cache hit.
[2024-05-20 14:36:25] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:36:31] [INFO ] Implicit Places using invariants and state equation in 6451 ms returned []
Implicit Place search using SMT with State Equation took 6969 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 994/1274 places, 1864/2151 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7695 ms. Remains : 994/1274 places, 1864/2151 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LT s989 1), p1:(GEQ s445 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 492 reset in 659 ms.
Stack based approach found an accepted trace after 33491 steps with 162 reset with depth 204 and stack size 194 in 229 ms.
FORMULA CANConstruction-PT-030-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-07 finished in 8655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&G(p2)))))'
Support contains 6 out of 1274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1274/1274 places, 2151/2151 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1264 transition count 2131
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1264 transition count 2131
Applied a total of 20 rules in 95 ms. Remains 1264 /1274 variables (removed 10) and now considering 2131/2151 (removed 20) transitions.
// Phase 1: matrix 2131 rows 1264 cols
[2024-05-20 14:36:32] [INFO ] Computed 32 invariants in 17 ms
[2024-05-20 14:36:33] [INFO ] Implicit Places using invariants in 535 ms returned [276]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 540 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1263/1274 places, 2131/2151 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1262 transition count 2130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1262 transition count 2130
Applied a total of 2 rules in 101 ms. Remains 1262 /1263 variables (removed 1) and now considering 2130/2131 (removed 1) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2024-05-20 14:36:33] [INFO ] Computed 31 invariants in 17 ms
[2024-05-20 14:36:34] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-05-20 14:36:34] [INFO ] Invariant cache hit.
[2024-05-20 14:36:34] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:36:42] [INFO ] Implicit Places using invariants and state equation in 7891 ms returned []
Implicit Place search using SMT with State Equation took 8455 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1262/1274 places, 2130/2151 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9191 ms. Remains : 1262/1274 places, 2130/2151 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s258 1) (GEQ s963 1)), p1:(OR (LT s18 1) (LT s770 1)), p2:(AND (GEQ s54 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 490 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-030-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-08 finished in 9428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 3 out of 1274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1274/1274 places, 2151/2151 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1265 transition count 2133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1265 transition count 2133
Applied a total of 18 rules in 91 ms. Remains 1265 /1274 variables (removed 9) and now considering 2133/2151 (removed 18) transitions.
// Phase 1: matrix 2133 rows 1265 cols
[2024-05-20 14:36:42] [INFO ] Computed 32 invariants in 12 ms
[2024-05-20 14:36:42] [INFO ] Implicit Places using invariants in 577 ms returned [276]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 579 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1264/1274 places, 2133/2151 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1263 transition count 2132
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1263 transition count 2132
Applied a total of 2 rules in 92 ms. Remains 1263 /1264 variables (removed 1) and now considering 2132/2133 (removed 1) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2024-05-20 14:36:43] [INFO ] Computed 31 invariants in 20 ms
[2024-05-20 14:36:43] [INFO ] Implicit Places using invariants in 579 ms returned []
[2024-05-20 14:36:43] [INFO ] Invariant cache hit.
[2024-05-20 14:36:44] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:36:50] [INFO ] Implicit Places using invariants and state equation in 7366 ms returned []
Implicit Place search using SMT with State Equation took 7946 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1263/1274 places, 2132/2151 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8710 ms. Remains : 1263/1274 places, 2132/2151 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (GEQ s761 1) (AND (GEQ s114 1) (GEQ s953 1))), p0:(OR (LT s114 1) (LT s953 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 535 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-030-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-09 finished in 8870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 3 out of 1274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1274/1274 places, 2151/2151 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1265 transition count 2133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1265 transition count 2133
Applied a total of 18 rules in 89 ms. Remains 1265 /1274 variables (removed 9) and now considering 2133/2151 (removed 18) transitions.
// Phase 1: matrix 2133 rows 1265 cols
[2024-05-20 14:36:51] [INFO ] Computed 32 invariants in 17 ms
[2024-05-20 14:36:51] [INFO ] Implicit Places using invariants in 544 ms returned [276]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 545 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1264/1274 places, 2133/2151 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1263 transition count 2132
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1263 transition count 2132
Applied a total of 2 rules in 90 ms. Remains 1263 /1264 variables (removed 1) and now considering 2132/2133 (removed 1) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2024-05-20 14:36:51] [INFO ] Computed 31 invariants in 12 ms
[2024-05-20 14:36:52] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-20 14:36:52] [INFO ] Invariant cache hit.
[2024-05-20 14:36:53] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:36:59] [INFO ] Implicit Places using invariants and state equation in 7043 ms returned []
Implicit Place search using SMT with State Equation took 7575 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1263/1274 places, 2132/2151 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8301 ms. Remains : 1263/1274 places, 2132/2151 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s568 1) (AND (GEQ s119 1) (GEQ s342 1))), p1:(OR (LT s119 1) (LT s342 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 800 steps with 1 reset in 7 ms.
FORMULA CANConstruction-PT-030-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-10 finished in 8420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||(X(p2)&&p1)))))'
Support contains 6 out of 1274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1274/1274 places, 2151/2151 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1264 transition count 2131
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1264 transition count 2131
Applied a total of 20 rules in 84 ms. Remains 1264 /1274 variables (removed 10) and now considering 2131/2151 (removed 20) transitions.
// Phase 1: matrix 2131 rows 1264 cols
[2024-05-20 14:36:59] [INFO ] Computed 32 invariants in 17 ms
[2024-05-20 14:37:00] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-05-20 14:37:00] [INFO ] Invariant cache hit.
[2024-05-20 14:37:00] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:37:07] [INFO ] Implicit Places using invariants and state equation in 7454 ms returned []
Implicit Place search using SMT with State Equation took 8016 ms to find 0 implicit places.
[2024-05-20 14:37:07] [INFO ] Invariant cache hit.
[2024-05-20 14:37:08] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1264/1274 places, 2131/2151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8917 ms. Remains : 1264/1274 places, 2131/2151 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s59 1) (LT s150 1)), p1:(AND (GEQ s276 1) (GEQ s277 1)), p2:(OR (LT s30 1) (LT s301 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2453 steps with 4 reset in 17 ms.
FORMULA CANConstruction-PT-030-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-12 finished in 9166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(p1)))))'
Support contains 3 out of 1274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1274/1274 places, 2151/2151 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1265 transition count 2133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1265 transition count 2133
Applied a total of 18 rules in 97 ms. Remains 1265 /1274 variables (removed 9) and now considering 2133/2151 (removed 18) transitions.
// Phase 1: matrix 2133 rows 1265 cols
[2024-05-20 14:37:08] [INFO ] Computed 32 invariants in 15 ms
[2024-05-20 14:37:09] [INFO ] Implicit Places using invariants in 560 ms returned [276]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 564 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1264/1274 places, 2133/2151 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1263 transition count 2132
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1263 transition count 2132
Applied a total of 2 rules in 92 ms. Remains 1263 /1264 variables (removed 1) and now considering 2132/2133 (removed 1) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2024-05-20 14:37:09] [INFO ] Computed 31 invariants in 16 ms
[2024-05-20 14:37:10] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-05-20 14:37:10] [INFO ] Invariant cache hit.
[2024-05-20 14:37:10] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:37:17] [INFO ] Implicit Places using invariants and state equation in 7541 ms returned []
Implicit Place search using SMT with State Equation took 8123 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1263/1274 places, 2132/2151 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8878 ms. Remains : 1263/1274 places, 2132/2151 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s114 1) (GEQ s1011 1)), p0:(GEQ s409 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-030-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-13 finished in 9033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1274/1274 places, 2151/2151 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1265 transition count 2133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1265 transition count 2133
Applied a total of 18 rules in 94 ms. Remains 1265 /1274 variables (removed 9) and now considering 2133/2151 (removed 18) transitions.
// Phase 1: matrix 2133 rows 1265 cols
[2024-05-20 14:37:17] [INFO ] Computed 32 invariants in 16 ms
[2024-05-20 14:37:18] [INFO ] Implicit Places using invariants in 568 ms returned [276]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 570 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1264/1274 places, 2133/2151 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1263 transition count 2132
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1263 transition count 2132
Applied a total of 2 rules in 90 ms. Remains 1263 /1264 variables (removed 1) and now considering 2132/2133 (removed 1) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2024-05-20 14:37:18] [INFO ] Computed 31 invariants in 15 ms
[2024-05-20 14:37:19] [INFO ] Implicit Places using invariants in 587 ms returned []
[2024-05-20 14:37:19] [INFO ] Invariant cache hit.
[2024-05-20 14:37:19] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:37:26] [INFO ] Implicit Places using invariants and state equation in 7405 ms returned []
Implicit Place search using SMT with State Equation took 7997 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1263/1274 places, 2132/2151 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8755 ms. Remains : 1263/1274 places, 2132/2151 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s499 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 526 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-030-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-14 finished in 8851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 2 out of 1274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1274/1274 places, 2151/2151 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1274 transition count 1953
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 397 place count 1076 transition count 1952
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 1075 transition count 1952
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 398 place count 1075 transition count 1923
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 456 place count 1046 transition count 1923
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 465 place count 1037 transition count 1905
Iterating global reduction 3 with 9 rules applied. Total rules applied 474 place count 1037 transition count 1905
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 482 place count 1037 transition count 1897
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 490 place count 1029 transition count 1897
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 552 place count 998 transition count 1866
Applied a total of 552 rules in 159 ms. Remains 998 /1274 variables (removed 276) and now considering 1866/2151 (removed 285) transitions.
// Phase 1: matrix 1866 rows 998 cols
[2024-05-20 14:37:26] [INFO ] Computed 32 invariants in 16 ms
[2024-05-20 14:37:27] [INFO ] Implicit Places using invariants in 510 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 512 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 997/1274 places, 1866/2151 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 997 transition count 1864
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 995 transition count 1864
Applied a total of 4 rules in 62 ms. Remains 995 /997 variables (removed 2) and now considering 1864/1866 (removed 2) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2024-05-20 14:37:27] [INFO ] Computed 31 invariants in 14 ms
[2024-05-20 14:37:27] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-05-20 14:37:27] [INFO ] Invariant cache hit.
[2024-05-20 14:37:28] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-20 14:37:34] [INFO ] Implicit Places using invariants and state equation in 6542 ms returned []
Implicit Place search using SMT with State Equation took 7027 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 995/1274 places, 1864/2151 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7761 ms. Remains : 995/1274 places, 1864/2151 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s649 1), p0:(LT s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 479 reset in 527 ms.
Stack based approach found an accepted trace after 10322 steps with 48 reset with depth 201 and stack size 200 in 57 ms.
FORMULA CANConstruction-PT-030-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-15 finished in 8440 ms.
All properties solved by simple procedures.
Total runtime 129682 ms.

BK_STOP 1716215855948

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-030.tgz
mv CANConstruction-PT-030 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;