Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r649-smll-171774451600057.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-N10P2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r649-smll-171774451600057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 45M
-rw-r--r-- 1 mcc users 6.1K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 19K 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 150K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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-N10P2-LTLCardinality-00
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-01
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-02
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-03
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-04
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-05
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-06
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-07
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-08
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-09
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-10
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-11
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-12
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-13
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-14
FORMULA_NAME ResIsolation-PT-N10P2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717806665834

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-N10P2
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-08 00:31:08] [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 00:31:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-08 00:31:11] [INFO ] Load time of PNML (sax parser for PT used): 2561 ms
[2024-06-08 00:31:11] [INFO ] Transformed 367 places.
[2024-06-08 00:31:11] [INFO ] Transformed 37193 transitions.
[2024-06-08 00:31:11] [INFO ] Found NUPN structural information;
[2024-06-08 00:31:11] [INFO ] Parsed PT model containing 367 places and 37193 transitions and 885405 arcs in 3044 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ResIsolation-PT-N10P2-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N10P2-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N10P2-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N10P2-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N10P2-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N10P2-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 37193/37193 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 356 transition count 37193
Discarding 185 places :
Symmetric choice reduction at 1 with 185 rule applications. Total rules 196 place count 171 transition count 37008
Iterating global reduction 1 with 185 rules applied. Total rules applied 381 place count 171 transition count 37008
Ensure Unique test removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 512 place count 171 transition count 36877
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 531 place count 152 transition count 36858
Iterating global reduction 2 with 19 rules applied. Total rules applied 550 place count 152 transition count 36858
Applied a total of 550 rules in 2150 ms. Remains 152 /367 variables (removed 215) and now considering 36858/37193 (removed 335) transitions.
// Phase 1: matrix 36858 rows 152 cols
[2024-06-08 00:31:16] [INFO ] Computed 1 invariants in 1469 ms
[2024-06-08 00:31:24] [INFO ] Implicit Places using invariants in 9797 ms returned []
Implicit Place search using SMT only with invariants took 10040 ms to find 0 implicit places.
[2024-06-08 00:31:24] [INFO ] Invariant cache hit.
[2024-06-08 00:31:45] [INFO ] Dead Transitions using invariants and state equation in 21190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/367 places, 36858/37193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33397 ms. Remains : 152/367 places, 36858/37193 transitions.
Support contains 22 out of 152 places after structural reductions.
[2024-06-08 00:31:56] [INFO ] Flatten gal took : 9174 ms
[2024-06-08 00:32:04] [INFO ] Flatten gal took : 8392 ms
[2024-06-08 00:32:16] [INFO ] Input system was already deterministic with 36858 transitions.
Support contains 21 out of 152 places (down from 22) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8015 ms. (steps per millisecond=1 ) properties (out of 17) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1177 ms. (steps per millisecond=8 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1413 ms. (steps per millisecond=7 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1090 ms. (steps per millisecond=9 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1164 ms. (steps per millisecond=8 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1312 ms. (steps per millisecond=7 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2349 ms. (steps per millisecond=4 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1011 ms. (steps per millisecond=9 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 990 ms. (steps per millisecond=10 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1339 ms. (steps per millisecond=7 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1418 ms. (steps per millisecond=7 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1369 ms. (steps per millisecond=7 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1258 ms. (steps per millisecond=7 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-06-08 00:32:41] [INFO ] Invariant cache hit.
[2024-06-08 00:32:41] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-06-08 00:32:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-08 00:33:06] [INFO ] After 24836ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-06-08 00:33:06] [INFO ] After 24958ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-06-08 00:33:06] [INFO ] After 25160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 16 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 36858/36858 transitions.
Graph (trivial) has 97 edges and 152 vertex of which 30 / 152 are part of one of the 10 SCC in 15 ms
Free SCC test removed 20 places
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 1468 edges and 132 vertex of which 125 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.278 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 125 transition count 36786
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 64 place count 101 transition count 36784
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 99 transition count 36784
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 97 transition count 36782
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 97 transition count 36782
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 18 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 114 place count 75 transition count 36760
Drop transitions removed 1 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 3 with 129 rules applied. Total rules applied 243 place count 75 transition count 36631
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 253 place count 75 transition count 36621
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1792 transitions
Reduce isomorphic transitions removed 1792 transitions.
Iterating post reduction 4 with 1802 rules applied. Total rules applied 2055 place count 65 transition count 34829
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2056 place count 64 transition count 34828
Applied a total of 2056 rules in 12091 ms. Remains 64 /152 variables (removed 88) and now considering 34828/36858 (removed 2030) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12095 ms. Remains : 64/152 places, 34828/36858 transitions.
Finished random walk after 112 steps, including 0 resets, run visited all 12 properties in 2401 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ResIsolation-PT-N10P2-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 50 stabilizing places and 61 stable transitions
Graph (complete) has 1524 edges and 152 vertex of which 145 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.792 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 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 36858/36858 transitions.
Graph (trivial) has 109 edges and 152 vertex of which 30 / 152 are part of one of the 10 SCC in 4 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 1494 edges and 132 vertex of which 125 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.309 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 124 transition count 36818
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 111 transition count 36817
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 110 transition count 36817
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 30 place count 110 transition count 36805
Deduced a syphon composed of 12 places in 57 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 54 place count 98 transition count 36805
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 59 place count 93 transition count 36800
Iterating global reduction 3 with 5 rules applied. Total rules applied 64 place count 93 transition count 36800
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 93 transition count 36799
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 65 place count 93 transition count 36798
Deduced a syphon composed of 1 places in 54 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 92 transition count 36798
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 20 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 105 place count 73 transition count 36779
Ensure Unique test removed 1921 transitions
Reduce isomorphic transitions removed 1921 transitions.
Iterating post reduction 4 with 1921 rules applied. Total rules applied 2026 place count 73 transition count 34858
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 18 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 2032 place count 70 transition count 34866
Applied a total of 2032 rules in 13084 ms. Remains 70 /152 variables (removed 82) and now considering 34866/36858 (removed 1992) transitions.
[2024-06-08 00:33:35] [INFO ] Flow matrix only has 34856 transitions (discarded 10 similar events)
// Phase 1: matrix 34856 rows 70 cols
[2024-06-08 00:33:35] [INFO ] Computed 0 invariants in 304 ms
[2024-06-08 00:33:43] [INFO ] Implicit Places using invariants in 8258 ms returned []
Implicit Place search using SMT only with invariants took 8262 ms to find 0 implicit places.
[2024-06-08 00:33:43] [INFO ] Flow matrix only has 34856 transitions (discarded 10 similar events)
[2024-06-08 00:33:43] [INFO ] Invariant cache hit.
[2024-06-08 00:34:01] [INFO ] Dead Transitions using invariants and state equation in 17774 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/152 places, 34866/36858 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39128 ms. Remains : 70/152 places, 34866/36858 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 216 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N10P2-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s4 0) (NEQ s11 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 3 steps with 0 reset in 12 ms.
FORMULA ResIsolation-PT-N10P2-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N10P2-LTLCardinality-02 finished in 39569 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((((p2 U (p3||G(p2)))&&p1)||p0))))'
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 36858/36858 transitions.
Graph (trivial) has 107 edges and 152 vertex of which 30 / 152 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 1494 edges and 132 vertex of which 125 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.198 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 124 transition count 36817
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 110 transition count 36817
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 30 place count 110 transition count 36805
Deduced a syphon composed of 12 places in 47 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 54 place count 98 transition count 36805
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 95 transition count 36802
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 95 transition count 36802
Ensure Unique test removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 2 with 512 rules applied. Total rules applied 572 place count 95 transition count 36290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 572 place count 95 transition count 36289
Deduced a syphon composed of 1 places in 59 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 574 place count 94 transition count 36289
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 15 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 608 place count 77 transition count 36272
Ensure Unique test removed 1537 transitions
Reduce isomorphic transitions removed 1537 transitions.
Iterating post reduction 3 with 1537 rules applied. Total rules applied 2145 place count 77 transition count 34735
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 16 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2151 place count 74 transition count 34743
Applied a total of 2151 rules in 11099 ms. Remains 74 /152 variables (removed 78) and now considering 34743/36858 (removed 2115) transitions.
[2024-06-08 00:34:12] [INFO ] Flow matrix only has 34733 transitions (discarded 10 similar events)
// Phase 1: matrix 34733 rows 74 cols
[2024-06-08 00:34:13] [INFO ] Computed 0 invariants in 237 ms
[2024-06-08 00:34:20] [INFO ] Implicit Places using invariants in 8106 ms returned []
Implicit Place search using SMT only with invariants took 8108 ms to find 0 implicit places.
[2024-06-08 00:34:20] [INFO ] Flow matrix only has 34733 transitions (discarded 10 similar events)
[2024-06-08 00:34:20] [INFO ] Invariant cache hit.
[2024-06-08 00:34:38] [INFO ] Dead Transitions using invariants and state equation in 17343 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/152 places, 34743/36858 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36556 ms. Remains : 74/152 places, 34743/36858 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : ResIsolation-PT-N10P2-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(AND (OR (EQ s1 0) (EQ s54 1)) (NEQ s31 1)), p0:(OR (EQ s65 0) (EQ s32 1)), p2:(NEQ s31 1), p1:(AND (EQ s54 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 270 ms.
Product exploration explored 100000 steps with 0 reset in 158 ms.
Computed a total of 9 stabilizing places and 32 stable transitions
Computed a total of 9 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p3 p0 p2 (NOT p1)), (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p3) p1 (NOT p0) p2))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 131 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 1000 resets, run finished after 9888 ms. (steps per millisecond=1 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 1011 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 988 ms. (steps per millisecond=10 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 1041 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 981 ms. (steps per millisecond=10 ) properties (out of 4) seen :0
Finished probabilistic random walk after 223063 steps, run visited all 4 properties in 34757 ms. (steps per millisecond=6 )
Probabilistic random walk after 223063 steps, saw 49130 distinct states, run finished after 34759 ms. (steps per millisecond=6 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 p0 p2 (NOT p1)), (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p3) p1 (NOT p0) p2))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p2 (NOT p3))), (F (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p0) p2 (NOT p3) p1))]
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 34743/34743 transitions.
Applied a total of 0 rules in 995 ms. Remains 74 /74 variables (removed 0) and now considering 34743/34743 (removed 0) transitions.
[2024-06-08 00:35:30] [INFO ] Flow matrix only has 34733 transitions (discarded 10 similar events)
[2024-06-08 00:35:30] [INFO ] Invariant cache hit.
[2024-06-08 00:35:37] [INFO ] Implicit Places using invariants in 7660 ms returned []
Implicit Place search using SMT only with invariants took 7663 ms to find 0 implicit places.
[2024-06-08 00:35:37] [INFO ] Flow matrix only has 34733 transitions (discarded 10 similar events)
[2024-06-08 00:35:37] [INFO ] Invariant cache hit.
[2024-06-08 00:35:57] [INFO ] Dead Transitions using invariants and state equation in 20077 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28737 ms. Remains : 74/74 places, 34743/34743 transitions.
Computed a total of 9 stabilizing places and 32 stable transitions
Computed a total of 9 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p0 p2 p3 (NOT p1)), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 121 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 1000 resets, run finished after 8846 ms. (steps per millisecond=1 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 880 ms. (steps per millisecond=11 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 804 ms. (steps per millisecond=12 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 814 ms. (steps per millisecond=12 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 750 ms. (steps per millisecond=13 ) properties (out of 4) seen :0
Finished probabilistic random walk after 223063 steps, run visited all 4 properties in 32540 ms. (steps per millisecond=6 )
Probabilistic random walk after 223063 steps, saw 49130 distinct states, run finished after 32541 ms. (steps per millisecond=6 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p3 (NOT p1)), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p2 (NOT p3))), (F (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p0) p2 (NOT p3) p1))]
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Product exploration explored 100000 steps with 0 reset in 74 ms.
Built C files in :
/tmp/ltsmin16676092236815772344
[2024-06-08 00:36:44] [INFO ] Too many transitions (34743) to apply POR reductions. Disabling POR matrices.
[2024-06-08 00:36:45] [INFO ] Built C files in 773ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16676092236815772344
Running compilation step : cd /tmp/ltsmin16676092236815772344;'/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/ltsmin16676092236815772344;'/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/ltsmin16676092236815772344;'/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 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 34743/34743 transitions.
Applied a total of 0 rules in 997 ms. Remains 74 /74 variables (removed 0) and now considering 34743/34743 (removed 0) transitions.
[2024-06-08 00:36:49] [INFO ] Flow matrix only has 34733 transitions (discarded 10 similar events)
[2024-06-08 00:36:49] [INFO ] Invariant cache hit.
[2024-06-08 00:36:57] [INFO ] Implicit Places using invariants in 7761 ms returned []
Implicit Place search using SMT only with invariants took 7763 ms to find 0 implicit places.
[2024-06-08 00:36:57] [INFO ] Flow matrix only has 34733 transitions (discarded 10 similar events)
[2024-06-08 00:36:57] [INFO ] Invariant cache hit.
[2024-06-08 00:37:16] [INFO ] Dead Transitions using invariants and state equation in 19559 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28327 ms. Remains : 74/74 places, 34743/34743 transitions.
Built C files in :
/tmp/ltsmin7234894735853888798
[2024-06-08 00:37:16] [INFO ] Too many transitions (34743) to apply POR reductions. Disabling POR matrices.
[2024-06-08 00:37:17] [INFO ] Built C files in 677ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7234894735853888798
Running compilation step : cd /tmp/ltsmin7234894735853888798;'/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/ltsmin7234894735853888798;'/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/ltsmin7234894735853888798;'/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 00:37:31] [INFO ] Flatten gal took : 5301 ms
[2024-06-08 00:37:35] [INFO ] Flatten gal took : 4500 ms
[2024-06-08 00:37:36] [INFO ] Time to serialize gal into /tmp/LTL11125917537567232100.gal : 523 ms
[2024-06-08 00:37:36] [INFO ] Time to serialize properties into /tmp/LTL12585743582133383912.prop : 0 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/LTL11125917537567232100.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15359899903432979355.hoa' '-atoms' '/tmp/LTL12585743582133383912.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...320
Detected timeout of ITS tools.
[2024-06-08 00:38:01] [INFO ] Flatten gal took : 4721 ms
[2024-06-08 00:38:05] [INFO ] Flatten gal took : 4288 ms
[2024-06-08 00:38:05] [INFO ] Time to serialize gal into /tmp/LTL17537026660718565801.gal : 480 ms
[2024-06-08 00:38:05] [INFO ] Time to serialize properties into /tmp/LTL1205557993891252889.ltl : 6 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/LTL17537026660718565801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1205557993891252889.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...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2024-06-08 00:38:25] [INFO ] Flatten gal took : 4262 ms
[2024-06-08 00:38:25] [INFO ] Applying decomposition
[2024-06-08 00:38:29] [INFO ] Flatten gal took : 4197 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/graph8428305264795365000.txt' '-o' '/tmp/graph8428305264795365000.bin' '-w' '/tmp/graph8428305264795365000.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8428305264795365000.bin' '-l' '-1' '-v' '-w' '/tmp/graph8428305264795365000.weights' '-q' '0' '-e' '0.001'
[2024-06-08 00:38:42] [INFO ] Decomposing Gal with order
[2024-06-08 00:38:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-08 00:38:54] [INFO ] Removed a total of 425880 redundant transitions.
[2024-06-08 00:38:55] [INFO ] Flatten gal took : 10237 ms
[2024-06-08 00:39:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3173 ms.
[2024-06-08 00:39:00] [INFO ] Time to serialize gal into /tmp/LTL15283629621554633098.gal : 340 ms
[2024-06-08 00:39:00] [INFO ] Time to serialize properties into /tmp/LTL13816408020757939603.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/LTL15283629621554633098.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13816408020757939603.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...256
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12303411213990931804
[2024-06-08 00:39:16] [INFO ] Built C files in 670ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12303411213990931804
Running compilation step : cd /tmp/ltsmin12303411213990931804;'/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/ltsmin12303411213990931804;'/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/ltsmin12303411213990931804;'/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-N10P2-LTLCardinality-05 finished in 317727 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 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 36858/36858 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 36858
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 135 transition count 36842
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 135 transition count 36842
Ensure Unique test removed 2946 transitions
Reduce isomorphic transitions removed 2946 transitions.
Iterating post reduction 1 with 2946 rules applied. Total rules applied 2979 place count 135 transition count 33896
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2981 place count 133 transition count 33894
Iterating global reduction 2 with 2 rules applied. Total rules applied 2983 place count 133 transition count 33894
Applied a total of 2983 rules in 1533 ms. Remains 133 /152 variables (removed 19) and now considering 33894/36858 (removed 2964) transitions.
// Phase 1: matrix 33894 rows 133 cols
[2024-06-08 00:39:22] [INFO ] Computed 0 invariants in 1082 ms
[2024-06-08 00:39:29] [INFO ] Implicit Places using invariants in 8768 ms returned []
Implicit Place search using SMT only with invariants took 8770 ms to find 0 implicit places.
[2024-06-08 00:39:29] [INFO ] Invariant cache hit.
[2024-06-08 00:39:47] [INFO ] Dead Transitions using invariants and state equation in 18028 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/152 places, 33894/36858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28338 ms. Remains : 133/152 places, 33894/36858 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ResIsolation-PT-N10P2-LTLCardinality-06 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 s123 1)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ResIsolation-PT-N10P2-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N10P2-LTLCardinality-06 finished in 28600 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(F(!p0))||(p0&&F(!p0)))))'
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 36858/36858 transitions.
Graph (trivial) has 110 edges and 152 vertex of which 30 / 152 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 1494 edges and 132 vertex of which 125 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.198 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 124 transition count 36817
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 110 transition count 36817
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 110 transition count 36806
Deduced a syphon composed of 11 places in 54 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 99 transition count 36806
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 93 transition count 36800
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 93 transition count 36800
Ensure Unique test removed 513 transitions
Reduce isomorphic transitions removed 513 transitions.
Iterating post reduction 2 with 513 rules applied. Total rules applied 577 place count 93 transition count 36287
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 577 place count 93 transition count 36285
Deduced a syphon composed of 2 places in 58 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 581 place count 91 transition count 36285
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 17 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 617 place count 73 transition count 36267
Ensure Unique test removed 1921 transitions
Reduce isomorphic transitions removed 1921 transitions.
Iterating post reduction 3 with 1921 rules applied. Total rules applied 2538 place count 73 transition count 34346
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 17 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2544 place count 70 transition count 34354
Applied a total of 2544 rules in 12055 ms. Remains 70 /152 variables (removed 82) and now considering 34354/36858 (removed 2504) transitions.
[2024-06-08 00:40:00] [INFO ] Flow matrix only has 34344 transitions (discarded 10 similar events)
// Phase 1: matrix 34344 rows 70 cols
[2024-06-08 00:40:00] [INFO ] Computed 0 invariants in 191 ms
[2024-06-08 00:40:08] [INFO ] Implicit Places using invariants in 7980 ms returned []
Implicit Place search using SMT only with invariants took 7981 ms to find 0 implicit places.
[2024-06-08 00:40:08] [INFO ] Flow matrix only has 34344 transitions (discarded 10 similar events)
[2024-06-08 00:40:08] [INFO ] Invariant cache hit.
[2024-06-08 00:40:29] [INFO ] Dead Transitions using invariants and state equation in 21407 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/152 places, 34354/36858 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41452 ms. Remains : 70/152 places, 34354/36858 transitions.
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Running random walk in product with property : ResIsolation-PT-N10P2-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s55 0) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA ResIsolation-PT-N10P2-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N10P2-LTLCardinality-07 finished in 41641 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 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 36858/36858 transitions.
Graph (trivial) has 111 edges and 152 vertex of which 30 / 152 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 1494 edges and 132 vertex of which 128 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.195 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 127 transition count 36818
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 32 place count 112 transition count 36818
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 32 place count 112 transition count 36806
Deduced a syphon composed of 12 places in 47 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 56 place count 100 transition count 36806
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 94 transition count 36800
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 94 transition count 36800
Ensure Unique test removed 513 transitions
Reduce isomorphic transitions removed 513 transitions.
Iterating post reduction 2 with 513 rules applied. Total rules applied 581 place count 94 transition count 36287
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 581 place count 94 transition count 36285
Deduced a syphon composed of 2 places in 55 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 585 place count 92 transition count 36285
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 15 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 621 place count 74 transition count 36267
Ensure Unique test removed 2433 transitions
Reduce isomorphic transitions removed 2433 transitions.
Iterating post reduction 3 with 2433 rules applied. Total rules applied 3054 place count 74 transition count 33834
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 15 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 3060 place count 71 transition count 33842
Applied a total of 3060 rules in 12586 ms. Remains 71 /152 variables (removed 81) and now considering 33842/36858 (removed 3016) transitions.
[2024-06-08 00:40:42] [INFO ] Flow matrix only has 33832 transitions (discarded 10 similar events)
// Phase 1: matrix 33832 rows 71 cols
[2024-06-08 00:40:42] [INFO ] Computed 1 invariants in 182 ms
[2024-06-08 00:40:49] [INFO ] Implicit Places using invariants in 7634 ms returned []
Implicit Place search using SMT only with invariants took 7638 ms to find 0 implicit places.
[2024-06-08 00:40:49] [INFO ] Flow matrix only has 33832 transitions (discarded 10 similar events)
[2024-06-08 00:40:49] [INFO ] Invariant cache hit.
[2024-06-08 00:41:10] [INFO ] Dead Transitions using invariants and state equation in 20439 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/152 places, 33842/36858 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40666 ms. Remains : 71/152 places, 33842/36858 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N10P2-LTLCardinality-08 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 s54 0) (NEQ s32 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-N10P2-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N10P2-LTLCardinality-08 finished in 40822 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)&&G((F(G(p1))&&F(p2)))))'
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 36858/36858 transitions.
Graph (trivial) has 109 edges and 152 vertex of which 30 / 152 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 1494 edges and 132 vertex of which 125 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.196 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 124 transition count 36817
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 110 transition count 36817
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 30 place count 110 transition count 36805
Deduced a syphon composed of 12 places in 54 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 54 place count 98 transition count 36805
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 93 transition count 36800
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 93 transition count 36800
Ensure Unique test removed 513 transitions
Reduce isomorphic transitions removed 513 transitions.
Iterating post reduction 2 with 513 rules applied. Total rules applied 577 place count 93 transition count 36287
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 577 place count 93 transition count 36285
Deduced a syphon composed of 2 places in 53 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 581 place count 91 transition count 36285
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 15 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 613 place count 75 transition count 36269
Ensure Unique test removed 1153 transitions
Reduce isomorphic transitions removed 1153 transitions.
Iterating post reduction 3 with 1153 rules applied. Total rules applied 1766 place count 75 transition count 35116
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 16 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1772 place count 72 transition count 35124
Applied a total of 1772 rules in 11618 ms. Remains 72 /152 variables (removed 80) and now considering 35124/36858 (removed 1734) transitions.
[2024-06-08 00:41:22] [INFO ] Flow matrix only has 35114 transitions (discarded 10 similar events)
// Phase 1: matrix 35114 rows 72 cols
[2024-06-08 00:41:22] [INFO ] Computed 0 invariants in 314 ms
[2024-06-08 00:41:30] [INFO ] Implicit Places using invariants in 8686 ms returned []
Implicit Place search using SMT only with invariants took 8688 ms to find 0 implicit places.
[2024-06-08 00:41:30] [INFO ] Flow matrix only has 35114 transitions (discarded 10 similar events)
[2024-06-08 00:41:30] [INFO ] Invariant cache hit.
[2024-06-08 00:41:49] [INFO ] Dead Transitions using invariants and state equation in 19046 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/152 places, 35124/36858 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39356 ms. Remains : 72/152 places, 35124/36858 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ResIsolation-PT-N10P2-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s44 0), p1:(OR (EQ s26 0) (EQ s32 1)), p2:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA ResIsolation-PT-N10P2-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N10P2-LTLCardinality-10 finished in 39705 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)))'
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 36858/36858 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 36858
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 135 transition count 36842
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 135 transition count 36842
Ensure Unique test removed 2946 transitions
Reduce isomorphic transitions removed 2946 transitions.
Iterating post reduction 1 with 2946 rules applied. Total rules applied 2979 place count 135 transition count 33896
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2981 place count 133 transition count 33894
Iterating global reduction 2 with 2 rules applied. Total rules applied 2983 place count 133 transition count 33894
Applied a total of 2983 rules in 1584 ms. Remains 133 /152 variables (removed 19) and now considering 33894/36858 (removed 2964) transitions.
// Phase 1: matrix 33894 rows 133 cols
[2024-06-08 00:41:52] [INFO ] Computed 0 invariants in 1082 ms
[2024-06-08 00:42:00] [INFO ] Implicit Places using invariants in 8536 ms returned []
Implicit Place search using SMT only with invariants took 8537 ms to find 0 implicit places.
[2024-06-08 00:42:00] [INFO ] Invariant cache hit.
[2024-06-08 00:42:22] [INFO ] Dead Transitions using invariants and state equation in 22027 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/152 places, 33894/36858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32154 ms. Remains : 133/152 places, 33894/36858 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N10P2-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s57 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][false, false, false]]
Product exploration timeout after 54160 steps with 0 reset in 10001 ms.
Product exploration timeout after 54850 steps with 0 reset in 10001 ms.
Computed a total of 45 stabilizing places and 57 stable transitions
Graph (complete) has 1197 edges and 133 vertex of which 131 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.527 ms
Computed a total of 45 stabilizing places and 57 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3371 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 79872 steps, run timeout after 9001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 79872 steps, saw 42080 distinct states, run finished after 9004 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-08 00:42:56] [INFO ] Invariant cache hit.
[2024-06-08 00:43:15] [INFO ] After 18847ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-08 00:43:17] [INFO ] After 21135ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1088 ms.
[2024-06-08 00:43:18] [INFO ] After 22279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 33894/33894 transitions.
Graph (trivial) has 95 edges and 133 vertex of which 30 / 133 are part of one of the 10 SCC in 2 ms
Free SCC test removed 20 places
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (complete) has 1157 edges and 113 vertex of which 111 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.101 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 111 transition count 33824
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 66 place count 85 transition count 33824
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 66 place count 85 transition count 33822
Deduced a syphon composed of 2 places in 49 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 83 transition count 33822
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 83 transition count 33821
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 10 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 115 place count 61 transition count 33799
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 127 place count 61 transition count 33787
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 9216 transitions
Reduce isomorphic transitions removed 9216 transitions.
Iterating post reduction 3 with 9228 rules applied. Total rules applied 9355 place count 49 transition count 24571
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 9356 place count 48 transition count 24570
Applied a total of 9356 rules in 11956 ms. Remains 48 /133 variables (removed 85) and now considering 24570/33894 (removed 9324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11958 ms. Remains : 48/133 places, 24570/33894 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 121 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N10P2-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N10P2-LTLCardinality-11 finished in 101038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0))&&X(G((X((!p2 U (!p0||G(!p2))))&&p1)))))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 36858/36858 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 36858
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 139 transition count 36846
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 139 transition count 36846
Ensure Unique test removed 1666 transitions
Reduce isomorphic transitions removed 1666 transitions.
Iterating post reduction 1 with 1666 rules applied. Total rules applied 1691 place count 139 transition count 35180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1692 place count 138 transition count 35179
Iterating global reduction 2 with 1 rules applied. Total rules applied 1693 place count 138 transition count 35179
Applied a total of 1693 rules in 1267 ms. Remains 138 /152 variables (removed 14) and now considering 35179/36858 (removed 1679) transitions.
// Phase 1: matrix 35179 rows 138 cols
[2024-06-08 00:43:33] [INFO ] Computed 0 invariants in 888 ms
[2024-06-08 00:43:41] [INFO ] Implicit Places using invariants in 8784 ms returned []
Implicit Place search using SMT only with invariants took 8785 ms to find 0 implicit places.
[2024-06-08 00:43:41] [INFO ] Invariant cache hit.
[2024-06-08 00:44:08] [INFO ] Dead Transitions using invariants and state equation in 27318 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/152 places, 35179/36858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37372 ms. Remains : 138/152 places, 35179/36858 transitions.
Stuttering acceptance computed with spot in 284 ms :[true, (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (AND p0 p2)), (OR (NOT p0) (NOT p1) p2)]
Running random walk in product with property : ResIsolation-PT-N10P2-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND p0 p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=4 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 4}]], initial=1, aps=[p0:(OR (EQ s55 0) (EQ s58 1)), p1:(AND (NEQ s95 0) (NEQ s83 1)), p2:(OR (EQ s95 0) (EQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 1 steps with 0 reset in 2 ms.
FORMULA ResIsolation-PT-N10P2-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N10P2-LTLCardinality-12 finished in 37825 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 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 36858/36858 transitions.
Graph (trivial) has 112 edges and 152 vertex of which 30 / 152 are part of one of the 10 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 1494 edges and 132 vertex of which 125 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.196 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 124 transition count 36817
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 110 transition count 36817
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 30 place count 110 transition count 36805
Deduced a syphon composed of 12 places in 46 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 54 place count 98 transition count 36805
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 92 transition count 36799
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 92 transition count 36799
Ensure Unique test removed 513 transitions
Reduce isomorphic transitions removed 513 transitions.
Iterating post reduction 2 with 513 rules applied. Total rules applied 579 place count 92 transition count 36286
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 579 place count 92 transition count 36284
Deduced a syphon composed of 2 places in 49 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 583 place count 90 transition count 36284
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 14 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 619 place count 72 transition count 36266
Ensure Unique test removed 2433 transitions
Reduce isomorphic transitions removed 2433 transitions.
Iterating post reduction 3 with 2433 rules applied. Total rules applied 3052 place count 72 transition count 33833
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 14 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 3058 place count 69 transition count 33841
Applied a total of 3058 rules in 12559 ms. Remains 69 /152 variables (removed 83) and now considering 33841/36858 (removed 3017) transitions.
[2024-06-08 00:44:21] [INFO ] Flow matrix only has 33831 transitions (discarded 10 similar events)
// Phase 1: matrix 33831 rows 69 cols
[2024-06-08 00:44:21] [INFO ] Computed 0 invariants in 180 ms
[2024-06-08 00:44:29] [INFO ] Implicit Places using invariants in 7615 ms returned []
Implicit Place search using SMT only with invariants took 7620 ms to find 0 implicit places.
[2024-06-08 00:44:29] [INFO ] Flow matrix only has 33831 transitions (discarded 10 similar events)
[2024-06-08 00:44:29] [INFO ] Invariant cache hit.
[2024-06-08 00:44:47] [INFO ] Dead Transitions using invariants and state equation in 17929 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/152 places, 33841/36858 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38119 ms. Remains : 69/152 places, 33841/36858 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N10P2-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s43 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 2 ms.
FORMULA ResIsolation-PT-N10P2-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N10P2-LTLCardinality-13 finished in 38255 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((((p2 U (p3||G(p2)))&&p1)||p0))))'
[2024-06-08 00:44:55] [INFO ] Flatten gal took : 7134 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4414663627621780598
[2024-06-08 00:45:00] [INFO ] Too many transitions (36858) to apply POR reductions. Disabling POR matrices.
[2024-06-08 00:45:01] [INFO ] Built C files in 1348ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4414663627621780598
Running compilation step : cd /tmp/ltsmin4414663627621780598;'/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 00:45:05] [INFO ] Applying decomposition
[2024-06-08 00:45:13] [INFO ] Flatten gal took : 8139 ms
[2024-06-08 00:46:58] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15703276466956626538.txt' '-o' '/tmp/graph15703276466956626538.bin' '-w' '/tmp/graph15703276466956626538.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:106)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:855)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)

BK_STOP 1717807628481

--------------------
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-N10P2"
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-N10P2, 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-171774451600057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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