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.r649-smll-171774451600072.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 ResIsolation-PT-N11P1, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r649-smll-171774451600072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 45M
-rw-r--r-- 1 mcc users 6.6K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 45M Jun 7 06:26 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 ResIsolation-PT-N11P1-LTLCardinality-00
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-01
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-02
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-03
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-04
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-05
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-06
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-07
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-08
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-09
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-10
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-11
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-12
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-13
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-14
FORMULA_NAME ResIsolation-PT-N11P1-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717818535361

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResIsolation-PT-N11P1
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-08 03:48:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-08 03:48:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-08 03:49:00] [INFO ] Load time of PNML (sax parser for PT used): 2690 ms
[2024-06-08 03:49:00] [INFO ] Transformed 357 places.
[2024-06-08 03:49:01] [INFO ] Transformed 37184 transitions.
[2024-06-08 03:49:01] [INFO ] Found NUPN structural information;
[2024-06-08 03:49:01] [INFO ] Parsed PT model containing 357 places and 37184 transitions and 885387 arcs in 3222 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 ResIsolation-PT-N11P1-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N11P1-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N11P1-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N11P1-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 37184/37184 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 347 transition count 37184
Discarding 193 places :
Symmetric choice reduction at 1 with 193 rule applications. Total rules 203 place count 154 transition count 36991
Iterating global reduction 1 with 193 rules applied. Total rules applied 396 place count 154 transition count 36991
Ensure Unique test removed 3587 transitions
Reduce isomorphic transitions removed 3587 transitions.
Iterating post reduction 1 with 3587 rules applied. Total rules applied 3983 place count 154 transition count 33404
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 3999 place count 138 transition count 31341
Iterating global reduction 2 with 16 rules applied. Total rules applied 4015 place count 138 transition count 31341
Applied a total of 4015 rules in 1839 ms. Remains 138 /357 variables (removed 219) and now considering 31341/37184 (removed 5843) transitions.
// Phase 1: matrix 31341 rows 138 cols
[2024-06-08 03:49:04] [INFO ] Computed 2 invariants in 907 ms
[2024-06-08 03:49:12] [INFO ] Implicit Places using invariants in 8394 ms returned []
Implicit Place search using SMT only with invariants took 8447 ms to find 0 implicit places.
[2024-06-08 03:49:12] [INFO ] Invariant cache hit.
[2024-06-08 03:49:36] [INFO ] Dead Transitions using invariants and state equation in 24042 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/357 places, 31341/37184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34353 ms. Remains : 138/357 places, 31341/37184 transitions.
Support contains 19 out of 138 places after structural reductions.
[2024-06-08 03:49:44] [INFO ] Flatten gal took : 7222 ms
[2024-06-08 03:49:51] [INFO ] Flatten gal took : 6726 ms
[2024-06-08 03:50:02] [INFO ] Input system was already deterministic with 31341 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2884 ms. (steps per millisecond=3 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 647 ms. (steps per millisecond=15 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-06-08 03:50:08] [INFO ] Invariant cache hit.
[2024-06-08 03:50:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-08 03:50:08] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-08 03:50:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-08 03:50:28] [INFO ] After 20146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-08 03:52:34] [INFO ] Deduced a trap composed of 0 places in 120429 ms of which 61 ms to minimize.
[2024-06-08 03:52:34] [INFO ] After 145578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-06-08 03:52:34] [INFO ] After 145702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 31341/31341 transitions.
Graph (trivial) has 91 edges and 138 vertex of which 33 / 138 are part of one of the 11 SCC in 14 ms
Free SCC test removed 22 places
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (complete) has 1212 edges and 116 vertex of which 105 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.494 ms
Discarding 11 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 105 transition count 31267
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 84 transition count 31266
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 56 place count 84 transition count 31264
Deduced a syphon composed of 2 places in 43 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 82 transition count 31264
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 82 transition count 31263
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 81 transition count 31262
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 81 transition count 31262
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 18 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 105 place count 60 transition count 31241
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 60 transition count 31240
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 60 transition count 31236
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1536 transitions
Reduce isomorphic transitions removed 1536 transitions.
Iterating post reduction 4 with 1540 rules applied. Total rules applied 1650 place count 56 transition count 29700
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1651 place count 55 transition count 29699
Applied a total of 1651 rules in 9161 ms. Remains 55 /138 variables (removed 83) and now considering 29699/31341 (removed 1642) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9166 ms. Remains : 55/138 places, 29699/31341 transitions.
FORMULA ResIsolation-PT-N11P1-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ResIsolation-PT-N11P1-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 53 stabilizing places and 63 stable transitions
Graph (complete) has 1258 edges and 138 vertex of which 127 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.990 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(X(X(G(p0))))))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 31341/31341 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 31341
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 124 transition count 31329
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 124 transition count 31329
Ensure Unique test removed 2562 transitions
Reduce isomorphic transitions removed 2562 transitions.
Iterating post reduction 1 with 2562 rules applied. Total rules applied 2588 place count 124 transition count 28767
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2593 place count 119 transition count 24668
Iterating global reduction 2 with 5 rules applied. Total rules applied 2598 place count 119 transition count 24668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2599 place count 119 transition count 24667
Applied a total of 2599 rules in 1447 ms. Remains 119 /138 variables (removed 19) and now considering 24667/31341 (removed 6674) transitions.
// Phase 1: matrix 24667 rows 119 cols
[2024-06-08 03:52:46] [INFO ] Computed 0 invariants in 751 ms
[2024-06-08 03:52:51] [INFO ] Implicit Places using invariants in 5774 ms returned []
Implicit Place search using SMT only with invariants took 5776 ms to find 0 implicit places.
[2024-06-08 03:52:51] [INFO ] Invariant cache hit.
[2024-06-08 03:53:07] [INFO ] Dead Transitions using invariants and state equation in 16178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/138 places, 24667/31341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23409 ms. Remains : 119/138 places, 24667/31341 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 372 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N11P1-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(EQ s64 0)], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 103 steps with 0 reset in 93 ms.
FORMULA ResIsolation-PT-N11P1-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N11P1-LTLCardinality-01 finished in 24058 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))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 31341/31341 transitions.
Graph (trivial) has 95 edges and 138 vertex of which 30 / 138 are part of one of the 10 SCC in 2 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 1228 edges and 118 vertex of which 107 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.292 ms
Discarding 11 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 106 transition count 31304
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 99 transition count 31302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 98 transition count 31302
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 19 place count 98 transition count 31287
Deduced a syphon composed of 15 places in 46 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 49 place count 83 transition count 31287
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 81 transition count 31285
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 81 transition count 31285
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 15 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 81 place count 67 transition count 31270
Ensure Unique test removed 2561 transitions
Reduce isomorphic transitions removed 2561 transitions.
Iterating post reduction 3 with 2561 rules applied. Total rules applied 2642 place count 67 transition count 28709
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2644 place count 65 transition count 24613
Iterating global reduction 4 with 2 rules applied. Total rules applied 2646 place count 65 transition count 24613
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2648 place count 65 transition count 24611
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2648 place count 65 transition count 24609
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2652 place count 63 transition count 24609
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 2658 place count 60 transition count 24617
Applied a total of 2658 rules in 10732 ms. Remains 60 /138 variables (removed 78) and now considering 24617/31341 (removed 6724) transitions.
[2024-06-08 03:53:19] [INFO ] Flow matrix only has 24607 transitions (discarded 10 similar events)
// Phase 1: matrix 24607 rows 60 cols
[2024-06-08 03:53:19] [INFO ] Computed 0 invariants in 126 ms
[2024-06-08 03:53:25] [INFO ] Implicit Places using invariants in 5977 ms returned []
Implicit Place search using SMT only with invariants took 5979 ms to find 0 implicit places.
[2024-06-08 03:53:25] [INFO ] Flow matrix only has 24607 transitions (discarded 10 similar events)
[2024-06-08 03:53:25] [INFO ] Invariant cache hit.
[2024-06-08 03:53:42] [INFO ] Dead Transitions using invariants and state equation in 17011 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/138 places, 24617/31341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33730 ms. Remains : 60/138 places, 24617/31341 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N11P1-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s5 0) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 6 ms.
FORMULA ResIsolation-PT-N11P1-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N11P1-LTLCardinality-02 finished in 33899 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))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 31341/31341 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 31341
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 123 transition count 31328
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 123 transition count 31328
Ensure Unique test removed 2562 transitions
Reduce isomorphic transitions removed 2562 transitions.
Iterating post reduction 1 with 2562 rules applied. Total rules applied 2590 place count 123 transition count 28766
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2595 place count 118 transition count 24667
Iterating global reduction 2 with 5 rules applied. Total rules applied 2600 place count 118 transition count 24667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2601 place count 118 transition count 24666
Applied a total of 2601 rules in 1075 ms. Remains 118 /138 variables (removed 20) and now considering 24666/31341 (removed 6675) transitions.
// Phase 1: matrix 24666 rows 118 cols
[2024-06-08 03:53:44] [INFO ] Computed 0 invariants in 549 ms
[2024-06-08 03:53:48] [INFO ] Implicit Places using invariants in 5243 ms returned []
Implicit Place search using SMT only with invariants took 5244 ms to find 0 implicit places.
[2024-06-08 03:53:48] [INFO ] Invariant cache hit.
[2024-06-08 03:54:04] [INFO ] Dead Transitions using invariants and state equation in 15791 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/138 places, 24666/31341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22124 ms. Remains : 118/138 places, 24666/31341 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ResIsolation-PT-N11P1-LTLCardinality-03 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}]], initial=1, aps=[p0:(EQ s4 0)], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2444 ms.
Product exploration explored 100000 steps with 50000 reset in 2033 ms.
Computed a total of 41 stabilizing places and 53 stable transitions
Graph (complete) has 1113 edges and 118 vertex of which 116 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.378 ms
Computed a total of 41 stabilizing places and 53 stable transitions
Detected a total of 41/118 stabilizing places and 53/24666 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 34 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N11P1-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N11P1-LTLCardinality-03 finished in 27409 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 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 31341/31341 transitions.
Graph (trivial) has 98 edges and 138 vertex of which 33 / 138 are part of one of the 11 SCC in 2 ms
Free SCC test removed 22 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 1225 edges and 116 vertex of which 105 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.254 ms
Discarding 11 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 104 transition count 31299
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 94 transition count 31298
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 23 place count 94 transition count 31284
Deduced a syphon composed of 14 places in 41 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 51 place count 80 transition count 31284
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 78 transition count 31282
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 78 transition count 31282
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 8 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 81 place count 65 transition count 31268
Ensure Unique test removed 1537 transitions
Reduce isomorphic transitions removed 1537 transitions.
Iterating post reduction 2 with 1537 rules applied. Total rules applied 1618 place count 65 transition count 29731
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1619 place count 64 transition count 27683
Iterating global reduction 3 with 1 rules applied. Total rules applied 1620 place count 64 transition count 27683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1621 place count 64 transition count 27682
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1621 place count 64 transition count 27681
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1623 place count 63 transition count 27681
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1629 place count 60 transition count 27689
Applied a total of 1629 rules in 8070 ms. Remains 60 /138 variables (removed 78) and now considering 27689/31341 (removed 3652) transitions.
[2024-06-08 03:54:17] [INFO ] Flow matrix only has 27678 transitions (discarded 11 similar events)
// Phase 1: matrix 27678 rows 60 cols
[2024-06-08 03:54:18] [INFO ] Computed 0 invariants in 153 ms
[2024-06-08 03:54:23] [INFO ] Implicit Places using invariants in 5555 ms returned []
Implicit Place search using SMT only with invariants took 5557 ms to find 0 implicit places.
[2024-06-08 03:54:23] [INFO ] Flow matrix only has 27678 transitions (discarded 11 similar events)
[2024-06-08 03:54:23] [INFO ] Invariant cache hit.
[2024-06-08 03:54:39] [INFO ] Dead Transitions using invariants and state equation in 16476 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/138 places, 27689/31341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30109 ms. Remains : 60/138 places, 27689/31341 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N11P1-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:(EQ s8 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 4 steps with 0 reset in 2 ms.
FORMULA ResIsolation-PT-N11P1-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N11P1-LTLCardinality-07 finished in 30253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 31341/31341 transitions.
Graph (trivial) has 96 edges and 138 vertex of which 33 / 138 are part of one of the 11 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 1225 edges and 116 vertex of which 106 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.147 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 105 transition count 31300
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 95 transition count 31299
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 23 place count 95 transition count 31285
Deduced a syphon composed of 14 places in 38 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 51 place count 81 transition count 31285
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 80 transition count 31284
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 80 transition count 31284
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 9 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 81 place count 66 transition count 31270
Ensure Unique test removed 2561 transitions
Reduce isomorphic transitions removed 2561 transitions.
Iterating post reduction 2 with 2561 rules applied. Total rules applied 2642 place count 66 transition count 28709
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2644 place count 64 transition count 24613
Iterating global reduction 3 with 2 rules applied. Total rules applied 2646 place count 64 transition count 24613
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2648 place count 64 transition count 24611
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2648 place count 64 transition count 24609
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2652 place count 62 transition count 24609
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2658 place count 59 transition count 24617
Applied a total of 2658 rules in 8393 ms. Remains 59 /138 variables (removed 79) and now considering 24617/31341 (removed 6724) transitions.
[2024-06-08 03:54:48] [INFO ] Flow matrix only has 24606 transitions (discarded 11 similar events)
// Phase 1: matrix 24606 rows 59 cols
[2024-06-08 03:54:48] [INFO ] Computed 0 invariants in 147 ms
[2024-06-08 03:54:53] [INFO ] Implicit Places using invariants in 5293 ms returned []
Implicit Place search using SMT only with invariants took 5295 ms to find 0 implicit places.
[2024-06-08 03:54:53] [INFO ] Flow matrix only has 24606 transitions (discarded 11 similar events)
[2024-06-08 03:54:53] [INFO ] Invariant cache hit.
[2024-06-08 03:55:10] [INFO ] Dead Transitions using invariants and state equation in 17162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/138 places, 24617/31341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30854 ms. Remains : 59/138 places, 24617/31341 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N11P1-LTLCardinality-09 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 (NEQ s47 0) (NEQ s54 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 1 steps with 0 reset in 8 ms.
FORMULA ResIsolation-PT-N11P1-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N11P1-LTLCardinality-09 finished in 31081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(G(p2)&&p1)))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 31341/31341 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 31341
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 125 transition count 31330
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 125 transition count 31330
Ensure Unique test removed 2562 transitions
Reduce isomorphic transitions removed 2562 transitions.
Iterating post reduction 1 with 2562 rules applied. Total rules applied 2586 place count 125 transition count 28768
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 2590 place count 121 transition count 24670
Iterating global reduction 2 with 4 rules applied. Total rules applied 2594 place count 121 transition count 24670
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2595 place count 121 transition count 24669
Applied a total of 2595 rules in 1409 ms. Remains 121 /138 variables (removed 17) and now considering 24669/31341 (removed 6672) transitions.
// Phase 1: matrix 24669 rows 121 cols
[2024-06-08 03:55:13] [INFO ] Computed 0 invariants in 828 ms
[2024-06-08 03:55:19] [INFO ] Implicit Places using invariants in 6638 ms returned []
Implicit Place search using SMT only with invariants took 6640 ms to find 0 implicit places.
[2024-06-08 03:55:19] [INFO ] Invariant cache hit.
[2024-06-08 03:55:42] [INFO ] Dead Transitions using invariants and state equation in 23146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/138 places, 24669/31341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31202 ms. Remains : 121/138 places, 24669/31341 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ResIsolation-PT-N11P1-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s78 1), p1:(AND (EQ s86 0) (EQ s32 1)), p2:(AND (EQ s86 0) (EQ s32 1))], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ResIsolation-PT-N11P1-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N11P1-LTLCardinality-10 finished in 31536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 31341/31341 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 31341
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 124 transition count 31329
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 124 transition count 31329
Ensure Unique test removed 2561 transitions
Reduce isomorphic transitions removed 2561 transitions.
Iterating post reduction 1 with 2561 rules applied. Total rules applied 2587 place count 124 transition count 28768
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2592 place count 119 transition count 24669
Iterating global reduction 2 with 5 rules applied. Total rules applied 2597 place count 119 transition count 24669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2598 place count 119 transition count 24668
Applied a total of 2598 rules in 1242 ms. Remains 119 /138 variables (removed 19) and now considering 24668/31341 (removed 6673) transitions.
// Phase 1: matrix 24668 rows 119 cols
[2024-06-08 03:55:44] [INFO ] Computed 0 invariants in 850 ms
[2024-06-08 03:55:49] [INFO ] Implicit Places using invariants in 5943 ms returned []
Implicit Place search using SMT only with invariants took 5946 ms to find 0 implicit places.
[2024-06-08 03:55:49] [INFO ] Invariant cache hit.
[2024-06-08 03:56:05] [INFO ] Dead Transitions using invariants and state equation in 15868 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/138 places, 24668/31341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23059 ms. Remains : 119/138 places, 24668/31341 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ResIsolation-PT-N11P1-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s58 0) (EQ s88 1)), p0:(NEQ s52 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1680 ms.
Product exploration explored 100000 steps with 50000 reset in 1597 ms.
Computed a total of 41 stabilizing places and 53 stable transitions
Graph (complete) has 1126 edges and 119 vertex of which 117 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.371 ms
Computed a total of 41 stabilizing places and 53 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N11P1-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N11P1-LTLCardinality-11 finished in 27152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 31341/31341 transitions.
Graph (trivial) has 97 edges and 138 vertex of which 33 / 138 are part of one of the 11 SCC in 2 ms
Free SCC test removed 22 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 1225 edges and 116 vertex of which 105 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.254 ms
Discarding 11 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 104 transition count 31299
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 94 transition count 31298
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 23 place count 94 transition count 31284
Deduced a syphon composed of 14 places in 34 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 51 place count 80 transition count 31284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 79 transition count 31283
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 79 transition count 31283
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 9 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 79 place count 66 transition count 31269
Ensure Unique test removed 513 transitions
Reduce isomorphic transitions removed 513 transitions.
Iterating post reduction 2 with 513 rules applied. Total rules applied 592 place count 66 transition count 30756
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 598 place count 63 transition count 30764
Applied a total of 598 rules in 6725 ms. Remains 63 /138 variables (removed 75) and now considering 30764/31341 (removed 577) transitions.
[2024-06-08 03:56:16] [INFO ] Flow matrix only has 30753 transitions (discarded 11 similar events)
// Phase 1: matrix 30753 rows 63 cols
[2024-06-08 03:56:16] [INFO ] Computed 0 invariants in 136 ms
[2024-06-08 03:56:23] [INFO ] Implicit Places using invariants in 7325 ms returned []
Implicit Place search using SMT only with invariants took 7326 ms to find 0 implicit places.
[2024-06-08 03:56:23] [INFO ] Flow matrix only has 30753 transitions (discarded 11 similar events)
[2024-06-08 03:56:24] [INFO ] Invariant cache hit.
[2024-06-08 03:56:41] [INFO ] Dead Transitions using invariants and state equation in 17628 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/138 places, 30764/31341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31689 ms. Remains : 63/138 places, 30764/31341 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N11P1-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s23 0) (EQ s46 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 2 steps with 0 reset in 1 ms.
FORMULA ResIsolation-PT-N11P1-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N11P1-LTLCardinality-13 finished in 31820 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 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 31341/31341 transitions.
Graph (trivial) has 98 edges and 138 vertex of which 33 / 138 are part of one of the 11 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 1225 edges and 116 vertex of which 108 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.208 ms
Discarding 8 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 107 transition count 31300
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 96 transition count 31299
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 25 place count 96 transition count 31285
Deduced a syphon composed of 14 places in 35 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 53 place count 82 transition count 31285
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 80 transition count 31283
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 80 transition count 31283
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 9 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 85 place count 66 transition count 31268
Ensure Unique test removed 2561 transitions
Reduce isomorphic transitions removed 2561 transitions.
Iterating post reduction 2 with 2561 rules applied. Total rules applied 2646 place count 66 transition count 28707
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2648 place count 64 transition count 24611
Iterating global reduction 3 with 2 rules applied. Total rules applied 2650 place count 64 transition count 24611
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2652 place count 64 transition count 24609
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2652 place count 64 transition count 24607
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2656 place count 62 transition count 24607
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2662 place count 59 transition count 24615
Applied a total of 2662 rules in 9275 ms. Remains 59 /138 variables (removed 79) and now considering 24615/31341 (removed 6726) transitions.
[2024-06-08 03:56:51] [INFO ] Flow matrix only has 24604 transitions (discarded 11 similar events)
// Phase 1: matrix 24604 rows 59 cols
[2024-06-08 03:56:51] [INFO ] Computed 1 invariants in 108 ms
[2024-06-08 03:56:56] [INFO ] Implicit Places using invariants in 5146 ms returned []
Implicit Place search using SMT only with invariants took 5149 ms to find 0 implicit places.
[2024-06-08 03:56:56] [INFO ] Flow matrix only has 24604 transitions (discarded 11 similar events)
[2024-06-08 03:56:56] [INFO ] Invariant cache hit.
[2024-06-08 03:57:08] [INFO ] Dead Transitions using invariants and state equation in 12813 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/138 places, 24615/31341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27249 ms. Remains : 59/138 places, 24615/31341 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N11P1-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s17 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 1 steps with 0 reset in 1 ms.
FORMULA ResIsolation-PT-N11P1-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N11P1-LTLCardinality-14 finished in 27368 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 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 31341/31341 transitions.
Graph (trivial) has 95 edges and 138 vertex of which 33 / 138 are part of one of the 11 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 1225 edges and 116 vertex of which 105 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.150 ms
Discarding 11 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 104 transition count 31299
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 94 transition count 31298
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 23 place count 94 transition count 31285
Deduced a syphon composed of 13 places in 35 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 49 place count 81 transition count 31285
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 80 transition count 31284
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 80 transition count 31284
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 12 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 79 place count 66 transition count 31270
Ensure Unique test removed 2561 transitions
Reduce isomorphic transitions removed 2561 transitions.
Iterating post reduction 2 with 2561 rules applied. Total rules applied 2640 place count 66 transition count 28709
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2642 place count 64 transition count 24613
Iterating global reduction 3 with 2 rules applied. Total rules applied 2644 place count 64 transition count 24613
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2646 place count 64 transition count 24611
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2646 place count 64 transition count 24609
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2650 place count 62 transition count 24609
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2656 place count 59 transition count 24617
Applied a total of 2656 rules in 8378 ms. Remains 59 /138 variables (removed 79) and now considering 24617/31341 (removed 6724) transitions.
[2024-06-08 03:57:17] [INFO ] Flow matrix only has 24606 transitions (discarded 11 similar events)
// Phase 1: matrix 24606 rows 59 cols
[2024-06-08 03:57:17] [INFO ] Computed 0 invariants in 101 ms
[2024-06-08 03:57:23] [INFO ] Implicit Places using invariants in 5848 ms returned []
Implicit Place search using SMT only with invariants took 5850 ms to find 0 implicit places.
[2024-06-08 03:57:23] [INFO ] Flow matrix only has 24606 transitions (discarded 11 similar events)
[2024-06-08 03:57:23] [INFO ] Invariant cache hit.
[2024-06-08 03:57:36] [INFO ] Dead Transitions using invariants and state equation in 13583 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/138 places, 24617/31341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27820 ms. Remains : 59/138 places, 24617/31341 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N11P1-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s54 0) (EQ s18 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]]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Product exploration explored 100000 steps with 0 reset in 123 ms.
Computed a total of 10 stabilizing places and 33 stable transitions
Computed a total of 10 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 909 resets, run finished after 3645 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2664 steps, run visited all 1 properties in 118 ms. (steps per millisecond=22 )
Probabilistic random walk after 2664 steps, saw 2240 distinct states, run finished after 124 ms. (steps per millisecond=21 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 24617/24617 transitions.
Applied a total of 0 rules in 998 ms. Remains 59 /59 variables (removed 0) and now considering 24617/24617 (removed 0) transitions.
[2024-06-08 03:57:43] [INFO ] Flow matrix only has 24606 transitions (discarded 11 similar events)
[2024-06-08 03:57:43] [INFO ] Invariant cache hit.
[2024-06-08 03:57:49] [INFO ] Implicit Places using invariants in 5621 ms returned []
Implicit Place search using SMT only with invariants took 5626 ms to find 0 implicit places.
[2024-06-08 03:57:49] [INFO ] Flow matrix only has 24606 transitions (discarded 11 similar events)
[2024-06-08 03:57:49] [INFO ] Invariant cache hit.
[2024-06-08 03:58:05] [INFO ] Dead Transitions using invariants and state equation in 15814 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22447 ms. Remains : 59/59 places, 24617/24617 transitions.
Computed a total of 10 stabilizing places and 33 stable transitions
Computed a total of 10 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 375 steps, including 32 resets, run visited all 1 properties in 643 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 99 ms.
Product exploration explored 100000 steps with 0 reset in 178 ms.
Built C files in :
/tmp/ltsmin5449634622227791321
[2024-06-08 03:58:07] [INFO ] Too many transitions (24617) to apply POR reductions. Disabling POR matrices.
[2024-06-08 03:58:08] [INFO ] Built C files in 806ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5449634622227791321
Running compilation step : cd /tmp/ltsmin5449634622227791321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin5449634622227791321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5449634622227791321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 24617/24617 transitions.
Applied a total of 0 rules in 981 ms. Remains 59 /59 variables (removed 0) and now considering 24617/24617 (removed 0) transitions.
[2024-06-08 03:58:12] [INFO ] Flow matrix only has 24606 transitions (discarded 11 similar events)
[2024-06-08 03:58:12] [INFO ] Invariant cache hit.
[2024-06-08 03:58:18] [INFO ] Implicit Places using invariants in 6042 ms returned []
Implicit Place search using SMT only with invariants took 6053 ms to find 0 implicit places.
[2024-06-08 03:58:18] [INFO ] Flow matrix only has 24606 transitions (discarded 11 similar events)
[2024-06-08 03:58:18] [INFO ] Invariant cache hit.
[2024-06-08 03:58:34] [INFO ] Dead Transitions using invariants and state equation in 16702 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23744 ms. Remains : 59/59 places, 24617/24617 transitions.
Built C files in :
/tmp/ltsmin11803815231559616709
[2024-06-08 03:58:34] [INFO ] Too many transitions (24617) to apply POR reductions. Disabling POR matrices.
[2024-06-08 03:58:35] [INFO ] Built C files in 432ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11803815231559616709
Running compilation step : cd /tmp/ltsmin11803815231559616709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin11803815231559616709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11803815231559616709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-08 03:58:46] [INFO ] Flatten gal took : 3492 ms
[2024-06-08 03:58:49] [INFO ] Flatten gal took : 2777 ms
[2024-06-08 03:58:49] [INFO ] Time to serialize gal into /tmp/LTL1504616140624239868.gal : 487 ms
[2024-06-08 03:58:49] [INFO ] Time to serialize properties into /tmp/LTL18309536974653466015.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1504616140624239868.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16083221908848238746.hoa' '-atoms' '/tmp/LTL18309536974653466015.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2024-06-08 03:59:12] [INFO ] Flatten gal took : 3434 ms
[2024-06-08 03:59:15] [INFO ] Flatten gal took : 2788 ms
[2024-06-08 03:59:15] [INFO ] Time to serialize gal into /tmp/LTL6508480099663861712.gal : 353 ms
[2024-06-08 03:59:15] [INFO ] Time to serialize properties into /tmp/LTL2991080928603586799.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6508480099663861712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2991080928603586799.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Detected timeout of ITS tools.
[2024-06-08 03:59:34] [INFO ] Flatten gal took : 2889 ms
[2024-06-08 03:59:34] [INFO ] Applying decomposition
[2024-06-08 03:59:37] [INFO ] Flatten gal took : 2807 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12979257051616669897.txt' '-o' '/tmp/graph12979257051616669897.bin' '-w' '/tmp/graph12979257051616669897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12979257051616669897.bin' '-l' '-1' '-v' '-w' '/tmp/graph12979257051616669897.weights' '-q' '0' '-e' '0.001'
[2024-06-08 03:59:44] [INFO ] Decomposing Gal with order
[2024-06-08 03:59:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-08 03:59:53] [INFO ] Removed a total of 294821 redundant transitions.
[2024-06-08 03:59:53] [INFO ] Flatten gal took : 7316 ms
[2024-06-08 03:59:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2271 ms.
[2024-06-08 03:59:57] [INFO ] Time to serialize gal into /tmp/LTL1766208545434201624.gal : 236 ms
[2024-06-08 03:59:57] [INFO ] Time to serialize properties into /tmp/LTL17148707381058751724.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1766208545434201624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17148707381058751724.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.u12.p338==0)||(u0.p132==1))"))))
Formula 0 simplified : FG!"((i1.u12.p338==0)||(u0.p132==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2943428922796368058
[2024-06-08 04:00:12] [INFO ] Built C files in 428ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2943428922796368058
Running compilation step : cd /tmp/ltsmin2943428922796368058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin2943428922796368058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2943428922796368058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ResIsolation-PT-N11P1-LTLCardinality-15 finished in 186820 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)))'
[2024-06-08 04:00:22] [INFO ] Flatten gal took : 6514 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4467130458029111261
[2024-06-08 04:00:26] [INFO ] Too many transitions (31341) to apply POR reductions. Disabling POR matrices.
[2024-06-08 04:00:28] [INFO ] Built C files in 1381ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4467130458029111261
Running compilation step : cd /tmp/ltsmin4467130458029111261;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-06-08 04:00:30] [INFO ] Applying decomposition
[2024-06-08 04:00:37] [INFO ] Flatten gal took : 7196 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9641041596236987206.txt' '-o' '/tmp/graph9641041596236987206.bin' '-w' '/tmp/graph9641041596236987206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9641041596236987206.bin' '-l' '-1' '-v' '-w' '/tmp/graph9641041596236987206.weights' '-q' '0' '-e' '0.001'
[2024-06-08 04:00:54] [INFO ] Decomposing Gal with order
[2024-06-08 04:00:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-08 04:01:08] [INFO ] Removed a total of 390175 redundant transitions.
[2024-06-08 04:01:09] [INFO ] Flatten gal took : 12541 ms
[2024-06-08 04:01:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 3562 ms.
[2024-06-08 04:01:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality589290436092382.gal : 206 ms
[2024-06-08 04:01:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality1798197263821368669.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality589290436092382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1798197263821368669.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...272
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u27.p338==0)||(i1.i1.u15.p132==1))"))))
Formula 0 simplified : FG!"((i0.u27.p338==0)||(i1.i1.u15.p132==1))"

BK_STOP 1717819447199

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ResIsolation-PT-N11P1, 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 r649-smll-171774451600072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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