Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536200300.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is NoC3x3-PT-5B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536200300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 10:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 525K Mar 5 18:23 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 NoC3x3-PT-5B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678863684809

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 07:01:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 07:01:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:01:28] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2023-03-15 07:01:28] [INFO ] Transformed 1571 places.
[2023-03-15 07:01:28] [INFO ] Transformed 2173 transitions.
[2023-03-15 07:01:28] [INFO ] Found NUPN structural information;
[2023-03-15 07:01:28] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 463 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA NoC3x3-PT-5B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 1571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Discarding 437 places :
Symmetric choice reduction at 0 with 437 rule applications. Total rules 437 place count 1134 transition count 1736
Iterating global reduction 0 with 437 rules applied. Total rules applied 874 place count 1134 transition count 1736
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 993 place count 1015 transition count 1609
Iterating global reduction 0 with 119 rules applied. Total rules applied 1112 place count 1015 transition count 1609
Discarding 92 places :
Symmetric choice reduction at 0 with 92 rule applications. Total rules 1204 place count 923 transition count 1452
Iterating global reduction 0 with 92 rules applied. Total rules applied 1296 place count 923 transition count 1452
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 1319 place count 900 transition count 1406
Iterating global reduction 0 with 23 rules applied. Total rules applied 1342 place count 900 transition count 1406
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 1347 place count 895 transition count 1396
Iterating global reduction 0 with 5 rules applied. Total rules applied 1352 place count 895 transition count 1396
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 1357 place count 890 transition count 1391
Iterating global reduction 0 with 5 rules applied. Total rules applied 1362 place count 890 transition count 1391
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1364 place count 888 transition count 1387
Iterating global reduction 0 with 2 rules applied. Total rules applied 1366 place count 888 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1367 place count 887 transition count 1384
Iterating global reduction 0 with 1 rules applied. Total rules applied 1368 place count 887 transition count 1384
Applied a total of 1368 rules in 818 ms. Remains 887 /1571 variables (removed 684) and now considering 1384/2173 (removed 789) transitions.
// Phase 1: matrix 1384 rows 887 cols
[2023-03-15 07:01:29] [INFO ] Computed 66 place invariants in 39 ms
[2023-03-15 07:01:30] [INFO ] Implicit Places using invariants in 749 ms returned []
[2023-03-15 07:01:30] [INFO ] Invariant cache hit.
[2023-03-15 07:01:31] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 2124 ms to find 0 implicit places.
[2023-03-15 07:01:31] [INFO ] Invariant cache hit.
[2023-03-15 07:01:33] [INFO ] Dead Transitions using invariants and state equation in 1618 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 887/1571 places, 1384/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4564 ms. Remains : 887/1571 places, 1384/2173 transitions.
Support contains 43 out of 887 places after structural reductions.
[2023-03-15 07:01:33] [INFO ] Flatten gal took : 310 ms
[2023-03-15 07:01:33] [INFO ] Flatten gal took : 149 ms
[2023-03-15 07:01:34] [INFO ] Input system was already deterministic with 1384 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 674 ms. (steps per millisecond=14 ) properties (out of 27) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-15 07:01:35] [INFO ] Invariant cache hit.
[2023-03-15 07:01:36] [INFO ] [Real]Absence check using 66 positive place invariants in 53 ms returned sat
[2023-03-15 07:01:36] [INFO ] After 662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-15 07:01:36] [INFO ] [Nat]Absence check using 66 positive place invariants in 48 ms returned sat
[2023-03-15 07:01:38] [INFO ] After 1829ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-15 07:01:39] [INFO ] Deduced a trap composed of 22 places in 406 ms of which 8 ms to minimize.
[2023-03-15 07:01:39] [INFO ] Deduced a trap composed of 49 places in 348 ms of which 2 ms to minimize.
[2023-03-15 07:01:40] [INFO ] Deduced a trap composed of 47 places in 384 ms of which 6 ms to minimize.
[2023-03-15 07:01:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1450 ms
[2023-03-15 07:01:41] [INFO ] Deduced a trap composed of 73 places in 242 ms of which 3 ms to minimize.
[2023-03-15 07:01:41] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 2 ms to minimize.
[2023-03-15 07:01:41] [INFO ] Deduced a trap composed of 92 places in 182 ms of which 1 ms to minimize.
[2023-03-15 07:01:42] [INFO ] Deduced a trap composed of 58 places in 218 ms of which 2 ms to minimize.
[2023-03-15 07:01:42] [INFO ] Deduced a trap composed of 73 places in 256 ms of which 2 ms to minimize.
[2023-03-15 07:01:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1642 ms
[2023-03-15 07:01:43] [INFO ] Deduced a trap composed of 78 places in 349 ms of which 1 ms to minimize.
[2023-03-15 07:01:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 521 ms
[2023-03-15 07:01:43] [INFO ] After 6796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 643 ms.
[2023-03-15 07:01:44] [INFO ] After 8022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 2 properties in 192 ms.
Support contains 13 out of 887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 887 transition count 1319
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 822 transition count 1319
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 130 place count 822 transition count 1284
Deduced a syphon composed of 35 places in 11 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 200 place count 787 transition count 1284
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 228 place count 759 transition count 1182
Iterating global reduction 2 with 28 rules applied. Total rules applied 256 place count 759 transition count 1182
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 258 place count 757 transition count 1177
Iterating global reduction 2 with 2 rules applied. Total rules applied 260 place count 757 transition count 1177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 756 transition count 1174
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 756 transition count 1174
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 192
Deduced a syphon composed of 192 places in 1 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 2 with 384 rules applied. Total rules applied 646 place count 564 transition count 982
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 650 place count 564 transition count 978
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 852 place count 463 transition count 1008
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 866 place count 463 transition count 994
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 934 place count 429 transition count 1002
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 4 with 61 rules applied. Total rules applied 995 place count 429 transition count 941
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1004 place count 420 transition count 941
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1004 place count 420 transition count 936
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1014 place count 415 transition count 936
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 1048 place count 398 transition count 919
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1050 place count 397 transition count 921
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1053 place count 397 transition count 918
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1056 place count 394 transition count 918
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1057 place count 394 transition count 917
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1065 place count 394 transition count 917
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1066 place count 393 transition count 916
Applied a total of 1066 rules in 760 ms. Remains 393 /887 variables (removed 494) and now considering 916/1384 (removed 468) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 762 ms. Remains : 393/887 places, 916/1384 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-15 07:01:45] [INFO ] Flow matrix only has 914 transitions (discarded 2 similar events)
// Phase 1: matrix 914 rows 393 cols
[2023-03-15 07:01:45] [INFO ] Computed 57 place invariants in 9 ms
[2023-03-15 07:01:45] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2023-03-15 07:01:45] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 07:01:46] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2023-03-15 07:01:46] [INFO ] After 679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 07:01:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 07:01:47] [INFO ] After 251ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-15 07:01:47] [INFO ] After 636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 263 ms.
[2023-03-15 07:01:47] [INFO ] After 1830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 9 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 916/916 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 392 transition count 914
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 392 transition count 914
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 390 transition count 912
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 389 transition count 912
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 389 transition count 910
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 387 transition count 906
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 386 transition count 905
Applied a total of 17 rules in 134 ms. Remains 386 /393 variables (removed 7) and now considering 905/916 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 386/393 places, 905/916 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:01:48] [INFO ] Flow matrix only has 903 transitions (discarded 2 similar events)
// Phase 1: matrix 903 rows 386 cols
[2023-03-15 07:01:48] [INFO ] Computed 57 place invariants in 11 ms
[2023-03-15 07:01:48] [INFO ] [Real]Absence check using 57 positive place invariants in 26 ms returned sat
[2023-03-15 07:01:48] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:01:48] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-15 07:01:49] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:01:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 07:01:49] [INFO ] After 68ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:01:49] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-15 07:01:49] [INFO ] After 668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 905/905 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 386 transition count 903
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 384 transition count 903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 384 transition count 902
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 383 transition count 902
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 382 transition count 898
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 382 transition count 898
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 381 transition count 897
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 380 transition count 897
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 380 transition count 895
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 380 transition count 894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 379 transition count 894
Applied a total of 16 rules in 144 ms. Remains 379 /386 variables (removed 7) and now considering 894/905 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 379/386 places, 894/905 transitions.
Finished random walk after 3341 steps, including 15 resets, run visited all 1 properties in 29 ms. (steps per millisecond=115 )
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(X(F(p1)))))))'
Support contains 3 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 874 transition count 1363
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 874 transition count 1363
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 869 transition count 1355
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 869 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 868 transition count 1353
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 868 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 867 transition count 1350
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 867 transition count 1350
Applied a total of 40 rules in 118 ms. Remains 867 /887 variables (removed 20) and now considering 1350/1384 (removed 34) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2023-03-15 07:01:50] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-15 07:01:50] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-15 07:01:50] [INFO ] Invariant cache hit.
[2023-03-15 07:01:52] [INFO ] Implicit Places using invariants and state equation in 1621 ms returned []
Implicit Place search using SMT with State Equation took 2073 ms to find 0 implicit places.
[2023-03-15 07:01:52] [INFO ] Invariant cache hit.
[2023-03-15 07:01:54] [INFO ] Dead Transitions using invariants and state equation in 1769 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 867/887 places, 1350/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3966 ms. Remains : 867/887 places, 1350/1384 transitions.
Stuttering acceptance computed with spot in 590 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p1:(AND (EQ s238 1) (EQ s284 1)), p0:(EQ s255 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 829 steps with 0 reset in 24 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-01 finished in 4666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1)) U p2))'
Support contains 6 out of 887 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 886 transition count 1316
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 819 transition count 1316
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 134 place count 819 transition count 1281
Deduced a syphon composed of 35 places in 6 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 204 place count 784 transition count 1281
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 235 place count 753 transition count 1175
Iterating global reduction 2 with 31 rules applied. Total rules applied 266 place count 753 transition count 1175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 266 place count 753 transition count 1174
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 268 place count 752 transition count 1174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 271 place count 749 transition count 1164
Iterating global reduction 2 with 3 rules applied. Total rules applied 274 place count 749 transition count 1164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 275 place count 748 transition count 1161
Iterating global reduction 2 with 1 rules applied. Total rules applied 276 place count 748 transition count 1161
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 0 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 2 with 386 rules applied. Total rules applied 662 place count 555 transition count 968
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 665 place count 555 transition count 965
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 867 place count 454 transition count 995
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 881 place count 454 transition count 981
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 951 place count 419 transition count 989
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 1013 place count 419 transition count 927
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1022 place count 410 transition count 927
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1022 place count 410 transition count 922
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1032 place count 405 transition count 922
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1070 place count 386 transition count 903
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1071 place count 386 transition count 903
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1072 place count 385 transition count 902
Applied a total of 1072 rules in 419 ms. Remains 385 /887 variables (removed 502) and now considering 902/1384 (removed 482) transitions.
// Phase 1: matrix 902 rows 385 cols
[2023-03-15 07:01:55] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-15 07:01:55] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-15 07:01:55] [INFO ] Invariant cache hit.
[2023-03-15 07:01:56] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-15 07:01:56] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
[2023-03-15 07:01:56] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-15 07:01:56] [INFO ] Invariant cache hit.
[2023-03-15 07:01:57] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 385/887 places, 902/1384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2380 ms. Remains : 385/887 places, 902/1384 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s208 1) (EQ s241 1) (EQ s270 1)), p1:(NEQ s255 1), p0:(AND (EQ s235 1) (EQ s263 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 65 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-02 finished in 2572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G(p1))))&&(!p2 U (p3||G(!p2)))))'
Support contains 7 out of 887 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 886 transition count 1316
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 819 transition count 1315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 818 transition count 1315
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 136 place count 818 transition count 1280
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 206 place count 783 transition count 1280
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 236 place count 753 transition count 1175
Iterating global reduction 3 with 30 rules applied. Total rules applied 266 place count 753 transition count 1175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 266 place count 753 transition count 1174
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 268 place count 752 transition count 1174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 271 place count 749 transition count 1164
Iterating global reduction 3 with 3 rules applied. Total rules applied 274 place count 749 transition count 1164
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 275 place count 748 transition count 1161
Iterating global reduction 3 with 1 rules applied. Total rules applied 276 place count 748 transition count 1161
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 192
Deduced a syphon composed of 192 places in 0 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 3 with 384 rules applied. Total rules applied 660 place count 556 transition count 969
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 664 place count 556 transition count 965
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 866 place count 455 transition count 991
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 880 place count 455 transition count 977
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 950 place count 420 transition count 985
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 5 with 60 rules applied. Total rules applied 1010 place count 420 transition count 925
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1018 place count 412 transition count 925
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 1018 place count 412 transition count 922
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1024 place count 409 transition count 922
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 1062 place count 390 transition count 903
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1063 place count 389 transition count 902
Applied a total of 1063 rules in 292 ms. Remains 389 /887 variables (removed 498) and now considering 902/1384 (removed 482) transitions.
// Phase 1: matrix 902 rows 389 cols
[2023-03-15 07:01:57] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-15 07:01:58] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-15 07:01:58] [INFO ] Invariant cache hit.
[2023-03-15 07:01:58] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-15 07:01:59] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1263 ms to find 0 implicit places.
[2023-03-15 07:01:59] [INFO ] Redundant transitions in 245 ms returned []
[2023-03-15 07:01:59] [INFO ] Invariant cache hit.
[2023-03-15 07:02:00] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 389/887 places, 902/1384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2765 ms. Remains : 389/887 places, 902/1384 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), true, (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (AND (NOT p3) p2)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 3}, { cond=(OR p3 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (NOT (AND (EQ s112 1) (EQ s138 1))) (NOT (AND (EQ s106 1) (EQ s131 1)))), p2:(AND (EQ s106 1) (EQ s131 1)), p0:(EQ s218 0), p1:(AND (OR (EQ s10 0)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 470 reset in 951 ms.
Stack based approach found an accepted trace after 13137 steps with 61 reset with depth 284 and stack size 284 in 142 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-03 finished in 4113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(F(p1)))))'
Support contains 3 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 876 transition count 1366
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 876 transition count 1366
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 872 transition count 1359
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 872 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 871 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 871 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 870 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 870 transition count 1354
Applied a total of 34 rules in 130 ms. Remains 870 /887 variables (removed 17) and now considering 1354/1384 (removed 30) transitions.
// Phase 1: matrix 1354 rows 870 cols
[2023-03-15 07:02:01] [INFO ] Computed 66 place invariants in 9 ms
[2023-03-15 07:02:02] [INFO ] Implicit Places using invariants in 634 ms returned []
[2023-03-15 07:02:02] [INFO ] Invariant cache hit.
[2023-03-15 07:02:04] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned []
Implicit Place search using SMT with State Equation took 2406 ms to find 0 implicit places.
[2023-03-15 07:02:04] [INFO ] Invariant cache hit.
[2023-03-15 07:02:05] [INFO ] Dead Transitions using invariants and state equation in 1469 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 870/887 places, 1354/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4007 ms. Remains : 870/887 places, 1354/1384 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s418 0) (EQ s442 0)), p1:(EQ s126 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 939 steps with 0 reset in 6 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-04 finished in 4325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))&&F(p1))))'
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 876 transition count 1365
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 876 transition count 1365
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 873 transition count 1360
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 873 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 872 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 872 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 871 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 871 transition count 1355
Applied a total of 32 rules in 137 ms. Remains 871 /887 variables (removed 16) and now considering 1355/1384 (removed 29) transitions.
// Phase 1: matrix 1355 rows 871 cols
[2023-03-15 07:02:06] [INFO ] Computed 66 place invariants in 10 ms
[2023-03-15 07:02:06] [INFO ] Implicit Places using invariants in 667 ms returned []
[2023-03-15 07:02:06] [INFO ] Invariant cache hit.
[2023-03-15 07:02:08] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 2172 ms to find 0 implicit places.
[2023-03-15 07:02:08] [INFO ] Invariant cache hit.
[2023-03-15 07:02:09] [INFO ] Dead Transitions using invariants and state equation in 1583 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 871/887 places, 1355/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3895 ms. Remains : 871/887 places, 1355/1384 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s325 1), p0:(EQ s266 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 493 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-05 finished in 4095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G((p1||X(p1)))||X(G(p2))))))'
Support contains 4 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 874 transition count 1363
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 874 transition count 1363
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 869 transition count 1355
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 869 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 868 transition count 1353
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 868 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 867 transition count 1350
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 867 transition count 1350
Applied a total of 40 rules in 81 ms. Remains 867 /887 variables (removed 20) and now considering 1350/1384 (removed 34) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2023-03-15 07:02:10] [INFO ] Computed 66 place invariants in 6 ms
[2023-03-15 07:02:10] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-15 07:02:10] [INFO ] Invariant cache hit.
[2023-03-15 07:02:12] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 2030 ms to find 0 implicit places.
[2023-03-15 07:02:12] [INFO ] Invariant cache hit.
[2023-03-15 07:02:13] [INFO ] Dead Transitions using invariants and state equation in 1715 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 867/887 places, 1350/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3830 ms. Remains : 867/887 places, 1350/1384 transitions.
Stuttering acceptance computed with spot in 288 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=4, aps=[p0:(EQ s375 1), p1:(EQ s517 1), p2:(AND (EQ s653 1) (EQ s685 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-08 finished in 4146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 875 transition count 1364
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 875 transition count 1364
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 870 transition count 1356
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 870 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 869 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 869 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 868 transition count 1351
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 868 transition count 1351
Applied a total of 38 rules in 134 ms. Remains 868 /887 variables (removed 19) and now considering 1351/1384 (removed 33) transitions.
// Phase 1: matrix 1351 rows 868 cols
[2023-03-15 07:02:14] [INFO ] Computed 66 place invariants in 16 ms
[2023-03-15 07:02:14] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-15 07:02:14] [INFO ] Invariant cache hit.
[2023-03-15 07:02:16] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 2240 ms to find 0 implicit places.
[2023-03-15 07:02:16] [INFO ] Invariant cache hit.
[2023-03-15 07:02:17] [INFO ] Dead Transitions using invariants and state equation in 1329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 868/887 places, 1351/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3705 ms. Remains : 868/887 places, 1351/1384 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s700 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 557 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-10 finished in 3804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p0)&&F(p1))))))'
Support contains 5 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 875 transition count 1365
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 875 transition count 1365
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 871 transition count 1358
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 871 transition count 1358
Applied a total of 32 rules in 53 ms. Remains 871 /887 variables (removed 16) and now considering 1358/1384 (removed 26) transitions.
// Phase 1: matrix 1358 rows 871 cols
[2023-03-15 07:02:18] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-15 07:02:18] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-15 07:02:18] [INFO ] Invariant cache hit.
[2023-03-15 07:02:19] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
[2023-03-15 07:02:19] [INFO ] Invariant cache hit.
[2023-03-15 07:02:21] [INFO ] Dead Transitions using invariants and state equation in 1579 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 871/887 places, 1358/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3528 ms. Remains : 871/887 places, 1358/1384 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s713 1) (EQ s784 1)) (EQ s189 1)), p0:(AND (EQ s82 1) (EQ s96 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 815 steps with 1 reset in 5 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-11 finished in 3852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1||F(p2))))))'
Support contains 5 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 875 transition count 1365
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 875 transition count 1365
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 870 transition count 1357
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 870 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 869 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 869 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 868 transition count 1352
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 868 transition count 1352
Applied a total of 38 rules in 136 ms. Remains 868 /887 variables (removed 19) and now considering 1352/1384 (removed 32) transitions.
// Phase 1: matrix 1352 rows 868 cols
[2023-03-15 07:02:21] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-15 07:02:22] [INFO ] Implicit Places using invariants in 771 ms returned []
[2023-03-15 07:02:22] [INFO ] Invariant cache hit.
[2023-03-15 07:02:24] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
[2023-03-15 07:02:24] [INFO ] Invariant cache hit.
[2023-03-15 07:02:25] [INFO ] Dead Transitions using invariants and state equation in 1381 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 868/887 places, 1352/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3754 ms. Remains : 868/887 places, 1352/1384 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s75 1) (EQ s119 1)), p1:(AND (EQ s382 1) (EQ s494 1) (EQ s339 0)), p2:(AND (EQ s382 1) (EQ s494 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 543 steps with 0 reset in 8 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-13 finished in 3877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||X(F(p2)))))))'
Support contains 4 out of 887 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 886 transition count 1315
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 818 transition count 1315
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 136 place count 818 transition count 1280
Deduced a syphon composed of 35 places in 5 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 206 place count 783 transition count 1280
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 238 place count 751 transition count 1171
Iterating global reduction 2 with 32 rules applied. Total rules applied 270 place count 751 transition count 1171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 270 place count 751 transition count 1170
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 272 place count 750 transition count 1170
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 275 place count 747 transition count 1160
Iterating global reduction 2 with 3 rules applied. Total rules applied 278 place count 747 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 279 place count 746 transition count 1157
Iterating global reduction 2 with 1 rules applied. Total rules applied 280 place count 746 transition count 1157
Performed 191 Post agglomeration using F-continuation condition.Transition count delta: 191
Deduced a syphon composed of 191 places in 0 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 2 with 382 rules applied. Total rules applied 662 place count 555 transition count 966
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 665 place count 555 transition count 963
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 867 place count 454 transition count 991
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 881 place count 454 transition count 977
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 953 place count 418 transition count 985
Drop transitions removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 4 with 63 rules applied. Total rules applied 1016 place count 418 transition count 922
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1025 place count 409 transition count 922
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1025 place count 409 transition count 917
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1035 place count 404 transition count 917
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1073 place count 385 transition count 898
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1075 place count 385 transition count 898
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1076 place count 384 transition count 897
Applied a total of 1076 rules in 368 ms. Remains 384 /887 variables (removed 503) and now considering 897/1384 (removed 487) transitions.
// Phase 1: matrix 897 rows 384 cols
[2023-03-15 07:02:26] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-15 07:02:26] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-15 07:02:26] [INFO ] Invariant cache hit.
[2023-03-15 07:02:26] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-15 07:02:27] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2023-03-15 07:02:27] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-15 07:02:27] [INFO ] Invariant cache hit.
[2023-03-15 07:02:28] [INFO ] Dead Transitions using invariants and state equation in 1084 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 384/887 places, 897/1384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2839 ms. Remains : 384/887 places, 897/1384 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s318 1) (EQ s323 1)), p1:(EQ s343 1), p2:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 220 steps with 1 reset in 2 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-14 finished in 3036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0&&X((!p0&&G((!p0||G(p1)))))))'
Support contains 3 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 875 transition count 1365
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 875 transition count 1365
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 871 transition count 1360
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 871 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 870 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 870 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 869 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 869 transition count 1355
Applied a total of 36 rules in 136 ms. Remains 869 /887 variables (removed 18) and now considering 1355/1384 (removed 29) transitions.
// Phase 1: matrix 1355 rows 869 cols
[2023-03-15 07:02:28] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-15 07:02:29] [INFO ] Implicit Places using invariants in 790 ms returned []
[2023-03-15 07:02:29] [INFO ] Invariant cache hit.
[2023-03-15 07:02:31] [INFO ] Implicit Places using invariants and state equation in 1870 ms returned []
Implicit Place search using SMT with State Equation took 2662 ms to find 0 implicit places.
[2023-03-15 07:02:31] [INFO ] Invariant cache hit.
[2023-03-15 07:02:33] [INFO ] Dead Transitions using invariants and state equation in 1471 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 869/887 places, 1355/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4275 ms. Remains : 869/887 places, 1355/1384 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(NEQ s458 1), p0:(AND (EQ s145 1) (EQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 156 reset in 364 ms.
Product exploration explored 100000 steps with 158 reset in 396 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 259 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 07:02:34] [INFO ] Invariant cache hit.
[2023-03-15 07:02:35] [INFO ] [Real]Absence check using 66 positive place invariants in 57 ms returned sat
[2023-03-15 07:02:35] [INFO ] After 1055ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:02:35] [INFO ] [Nat]Absence check using 66 positive place invariants in 35 ms returned sat
[2023-03-15 07:02:36] [INFO ] After 795ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:02:37] [INFO ] After 1195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 261 ms.
[2023-03-15 07:02:37] [INFO ] After 1698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 92 ms.
Support contains 3 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1355/1355 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 869 transition count 1296
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 810 transition count 1296
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 118 place count 810 transition count 1259
Deduced a syphon composed of 37 places in 5 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 192 place count 773 transition count 1259
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 216 place count 749 transition count 1163
Iterating global reduction 2 with 24 rules applied. Total rules applied 240 place count 749 transition count 1163
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 1 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 630 place count 554 transition count 968
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 633 place count 554 transition count 965
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 835 place count 453 transition count 993
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 849 place count 453 transition count 979
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 921 place count 417 transition count 987
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 983 place count 417 transition count 925
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 992 place count 408 transition count 925
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 992 place count 408 transition count 920
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1002 place count 403 transition count 920
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1040 place count 384 transition count 901
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1041 place count 384 transition count 900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1042 place count 383 transition count 900
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1043 place count 383 transition count 899
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1048 place count 383 transition count 899
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1049 place count 382 transition count 898
Applied a total of 1049 rules in 274 ms. Remains 382 /869 variables (removed 487) and now considering 898/1355 (removed 457) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 382/869 places, 898/1355 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 898 rows 382 cols
[2023-03-15 07:02:38] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-15 07:02:38] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2023-03-15 07:02:38] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:02:38] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-15 07:02:38] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:02:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-15 07:02:38] [INFO ] After 65ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:02:39] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-15 07:02:39] [INFO ] After 659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 10 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 382/382 places, 898/898 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 235095 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 235095 steps, saw 64052 distinct states, run finished after 3005 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:02:42] [INFO ] Invariant cache hit.
[2023-03-15 07:02:42] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2023-03-15 07:02:42] [INFO ] After 613ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:02:42] [INFO ] [Nat]Absence check using 57 positive place invariants in 25 ms returned sat
[2023-03-15 07:02:43] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:02:43] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-15 07:02:43] [INFO ] After 87ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:02:43] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-15 07:02:43] [INFO ] After 920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 15 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 382/382 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 13 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2023-03-15 07:02:43] [INFO ] Invariant cache hit.
[2023-03-15 07:02:44] [INFO ] Implicit Places using invariants in 548 ms returned []
[2023-03-15 07:02:44] [INFO ] Invariant cache hit.
[2023-03-15 07:02:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-15 07:02:45] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
[2023-03-15 07:02:45] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-15 07:02:45] [INFO ] Invariant cache hit.
[2023-03-15 07:02:46] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2536 ms. Remains : 382/382 places, 898/898 transitions.
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 382 transition count 876
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 380 transition count 870
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 380 transition count 870
Applied a total of 26 rules in 39 ms. Remains 380 /382 variables (removed 2) and now considering 870/898 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 870 rows 380 cols
[2023-03-15 07:02:46] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 07:02:46] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-15 07:02:46] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:02:46] [INFO ] [Nat]Absence check using 57 positive place invariants in 15 ms returned sat
[2023-03-15 07:02:47] [INFO ] After 363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:02:47] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-15 07:02:47] [INFO ] After 569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 414 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Support contains 3 out of 869 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 869/869 places, 1355/1355 transitions.
Applied a total of 0 rules in 25 ms. Remains 869 /869 variables (removed 0) and now considering 1355/1355 (removed 0) transitions.
// Phase 1: matrix 1355 rows 869 cols
[2023-03-15 07:02:48] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-15 07:02:48] [INFO ] Implicit Places using invariants in 728 ms returned []
[2023-03-15 07:02:48] [INFO ] Invariant cache hit.
[2023-03-15 07:02:50] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
[2023-03-15 07:02:50] [INFO ] Invariant cache hit.
[2023-03-15 07:02:51] [INFO ] Dead Transitions using invariants and state equation in 1313 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3490 ms. Remains : 869/869 places, 1355/1355 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 468 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 07:02:52] [INFO ] Invariant cache hit.
[2023-03-15 07:02:52] [INFO ] [Real]Absence check using 66 positive place invariants in 39 ms returned sat
[2023-03-15 07:02:53] [INFO ] After 1007ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:02:53] [INFO ] [Nat]Absence check using 66 positive place invariants in 40 ms returned sat
[2023-03-15 07:02:54] [INFO ] After 804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:02:55] [INFO ] After 1088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 210 ms.
[2023-03-15 07:02:55] [INFO ] After 1549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 54 ms.
Support contains 3 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1355/1355 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 869 transition count 1296
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 810 transition count 1296
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 118 place count 810 transition count 1259
Deduced a syphon composed of 37 places in 5 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 192 place count 773 transition count 1259
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 216 place count 749 transition count 1163
Iterating global reduction 2 with 24 rules applied. Total rules applied 240 place count 749 transition count 1163
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 0 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 630 place count 554 transition count 968
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 633 place count 554 transition count 965
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 835 place count 453 transition count 993
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 849 place count 453 transition count 979
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 921 place count 417 transition count 987
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 983 place count 417 transition count 925
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 992 place count 408 transition count 925
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 992 place count 408 transition count 920
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1002 place count 403 transition count 920
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1040 place count 384 transition count 901
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1041 place count 384 transition count 900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1042 place count 383 transition count 900
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1043 place count 383 transition count 899
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1048 place count 383 transition count 899
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1049 place count 382 transition count 898
Applied a total of 1049 rules in 242 ms. Remains 382 /869 variables (removed 487) and now considering 898/1355 (removed 457) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 382/869 places, 898/1355 transitions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 206524 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206524 steps, saw 57954 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 898 rows 382 cols
[2023-03-15 07:02:58] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 07:02:58] [INFO ] [Real]Absence check using 57 positive place invariants in 16 ms returned sat
[2023-03-15 07:02:59] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:02:59] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-15 07:02:59] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:02:59] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-15 07:02:59] [INFO ] After 141ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 07:03:00] [INFO ] After 365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-15 07:03:00] [INFO ] After 1017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 8 ms.
Support contains 3 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 13 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 382/382 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 12 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2023-03-15 07:03:00] [INFO ] Invariant cache hit.
[2023-03-15 07:03:00] [INFO ] Implicit Places using invariants in 538 ms returned []
[2023-03-15 07:03:00] [INFO ] Invariant cache hit.
[2023-03-15 07:03:01] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-15 07:03:02] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1724 ms to find 0 implicit places.
[2023-03-15 07:03:02] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-15 07:03:02] [INFO ] Invariant cache hit.
[2023-03-15 07:03:03] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2854 ms. Remains : 382/382 places, 898/898 transitions.
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 382 transition count 876
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 380 transition count 870
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 380 transition count 870
Applied a total of 26 rules in 23 ms. Remains 380 /382 variables (removed 2) and now considering 870/898 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 870 rows 380 cols
[2023-03-15 07:03:03] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 07:03:03] [INFO ] [Real]Absence check using 57 positive place invariants in 14 ms returned sat
[2023-03-15 07:03:03] [INFO ] After 399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:03:03] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2023-03-15 07:03:04] [INFO ] After 475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:03:04] [INFO ] After 538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-15 07:03:04] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 501 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 156 reset in 511 ms.
Product exploration explored 100000 steps with 158 reset in 507 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Support contains 3 out of 869 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 869/869 places, 1355/1355 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 869 transition count 1355
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 59 place count 869 transition count 1390
Deduced a syphon composed of 78 places in 3 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 78 place count 869 transition count 1390
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 89 place count 858 transition count 1357
Deduced a syphon composed of 78 places in 6 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 100 place count 858 transition count 1357
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 111 place count 847 transition count 1324
Deduced a syphon composed of 67 places in 6 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 122 place count 847 transition count 1324
Performed 213 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 1 with 213 rules applied. Total rules applied 335 place count 847 transition count 1344
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 338 place count 847 transition count 1341
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 408 place count 777 transition count 1221
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 478 place count 777 transition count 1221
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 491 place count 764 transition count 1208
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 504 place count 764 transition count 1208
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -241
Deduced a syphon composed of 311 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 605 place count 764 transition count 1449
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 619 place count 764 transition count 1435
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 347 places in 1 ms
Iterating global reduction 3 with 36 rules applied. Total rules applied 655 place count 764 transition count 1515
Deduced a syphon composed of 347 places in 0 ms
Drop transitions removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 3 with 66 rules applied. Total rules applied 721 place count 764 transition count 1449
Reduce places removed 9 places and 0 transitions.
Graph (complete) has 4108 edges and 755 vertex of which 746 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 731 place count 746 transition count 1440
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 740 place count 737 transition count 1431
Deduced a syphon composed of 329 places in 1 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 749 place count 737 transition count 1431
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 348 places in 1 ms
Iterating global reduction 4 with 19 rules applied. Total rules applied 768 place count 737 transition count 1461
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 775 place count 730 transition count 1452
Deduced a syphon composed of 341 places in 1 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 782 place count 730 transition count 1452
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 346 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 787 place count 730 transition count 1464
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 788 place count 729 transition count 1462
Deduced a syphon composed of 345 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 789 place count 729 transition count 1462
Deduced a syphon composed of 345 places in 0 ms
Applied a total of 789 rules in 757 ms. Remains 729 /869 variables (removed 140) and now considering 1462/1355 (removed -107) transitions.
[2023-03-15 07:03:07] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 1462 rows 729 cols
[2023-03-15 07:03:07] [INFO ] Computed 57 place invariants in 8 ms
[2023-03-15 07:03:08] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 729/869 places, 1462/1355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1795 ms. Remains : 729/869 places, 1462/1355 transitions.
Built C files in :
/tmp/ltsmin2984191603346835411
[2023-03-15 07:03:08] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2984191603346835411
Running compilation step : cd /tmp/ltsmin2984191603346835411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2984191603346835411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2984191603346835411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 3 out of 869 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 869/869 places, 1355/1355 transitions.
Applied a total of 0 rules in 19 ms. Remains 869 /869 variables (removed 0) and now considering 1355/1355 (removed 0) transitions.
// Phase 1: matrix 1355 rows 869 cols
[2023-03-15 07:03:11] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-15 07:03:12] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-15 07:03:12] [INFO ] Invariant cache hit.
[2023-03-15 07:03:13] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
[2023-03-15 07:03:13] [INFO ] Invariant cache hit.
[2023-03-15 07:03:14] [INFO ] Dead Transitions using invariants and state equation in 1407 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3164 ms. Remains : 869/869 places, 1355/1355 transitions.
Built C files in :
/tmp/ltsmin4017650961391653593
[2023-03-15 07:03:14] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4017650961391653593
Running compilation step : cd /tmp/ltsmin4017650961391653593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4017650961391653593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4017650961391653593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-15 07:03:18] [INFO ] Flatten gal took : 72 ms
[2023-03-15 07:03:18] [INFO ] Flatten gal took : 68 ms
[2023-03-15 07:03:18] [INFO ] Time to serialize gal into /tmp/LTL667832605734105733.gal : 12 ms
[2023-03-15 07:03:18] [INFO ] Time to serialize properties into /tmp/LTL9412728313510851221.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL667832605734105733.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6540843415594398361.hoa' '-atoms' '/tmp/LTL9412728313510851221.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL9412728313510851221.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6540843415594398361.hoa
Detected timeout of ITS tools.
[2023-03-15 07:03:33] [INFO ] Flatten gal took : 58 ms
[2023-03-15 07:03:33] [INFO ] Flatten gal took : 64 ms
[2023-03-15 07:03:33] [INFO ] Time to serialize gal into /tmp/LTL1238603276491945126.gal : 9 ms
[2023-03-15 07:03:33] [INFO ] Time to serialize properties into /tmp/LTL10772050884153488655.ltl : 3 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1238603276491945126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10772050884153488655.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("((p190!=1)||(p259!=1))")&&(G(("((p190!=1)||(p259!=1))")||(G("(p752!=1)")))))))
Formula 0 simplified : X(!"((p190!=1)||(p259!=1))" | F(!"((p190!=1)||(p259!=1))" & F!"(p752!=1)"))
Detected timeout of ITS tools.
[2023-03-15 07:03:48] [INFO ] Flatten gal took : 44 ms
[2023-03-15 07:03:48] [INFO ] Applying decomposition
[2023-03-15 07:03:48] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12563401043796002989.txt' '-o' '/tmp/graph12563401043796002989.bin' '-w' '/tmp/graph12563401043796002989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12563401043796002989.bin' '-l' '-1' '-v' '-w' '/tmp/graph12563401043796002989.weights' '-q' '0' '-e' '0.001'
[2023-03-15 07:03:48] [INFO ] Decomposing Gal with order
[2023-03-15 07:03:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:03:49] [INFO ] Removed a total of 1196 redundant transitions.
[2023-03-15 07:03:49] [INFO ] Flatten gal took : 300 ms
[2023-03-15 07:03:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 173 labels/synchronizations in 82 ms.
[2023-03-15 07:03:49] [INFO ] Time to serialize gal into /tmp/LTL9956278728549929338.gal : 30 ms
[2023-03-15 07:03:49] [INFO ] Time to serialize properties into /tmp/LTL10768742432238194801.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9956278728549929338.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10768742432238194801.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(("((i1.u54.p190!=1)||(i1.u66.p259!=1))")&&(G(("((i1.u54.p190!=1)||(i1.u66.p259!=1))")||(G("(i5.u166.p752!=1)")))))))
Formula 0 simplified : X(!"((i1.u54.p190!=1)||(i1.u66.p259!=1))" | F(!"((i1.u54.p190!=1)||(i1.u66.p259!=1))" & F!"(i5.u166.p752!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2535126048203735909
[2023-03-15 07:04:04] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2535126048203735909
Running compilation step : cd /tmp/ltsmin2535126048203735909;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2535126048203735909;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2535126048203735909;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 NoC3x3-PT-5B-LTLFireability-15 finished in 98959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0&&X((!p0&&G((!p0||G(p1)))))))'
Found a Shortening insensitive property : NoC3x3-PT-5B-LTLFireability-15
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0]
Support contains 3 out of 887 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 886 transition count 1314
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 817 transition count 1314
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 138 place count 817 transition count 1279
Deduced a syphon composed of 35 places in 4 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 208 place count 782 transition count 1279
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 239 place count 751 transition count 1172
Iterating global reduction 2 with 31 rules applied. Total rules applied 270 place count 751 transition count 1172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 270 place count 751 transition count 1171
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 272 place count 750 transition count 1171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 274 place count 748 transition count 1164
Iterating global reduction 2 with 2 rules applied. Total rules applied 276 place count 748 transition count 1164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 277 place count 747 transition count 1161
Iterating global reduction 2 with 1 rules applied. Total rules applied 278 place count 747 transition count 1161
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 0 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 2 with 386 rules applied. Total rules applied 664 place count 554 transition count 968
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 667 place count 554 transition count 965
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 869 place count 453 transition count 993
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 883 place count 453 transition count 979
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 955 place count 417 transition count 987
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 973 place count 417 transition count 969
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 975 place count 415 transition count 969
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 995 place count 405 transition count 959
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 996 place count 405 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 997 place count 404 transition count 958
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1004 place count 397 transition count 958
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 1032 place count 383 transition count 944
Applied a total of 1032 rules in 256 ms. Remains 383 /887 variables (removed 504) and now considering 944/1384 (removed 440) transitions.
// Phase 1: matrix 944 rows 383 cols
[2023-03-15 07:04:08] [INFO ] Computed 57 place invariants in 17 ms
[2023-03-15 07:04:08] [INFO ] Implicit Places using invariants in 528 ms returned []
[2023-03-15 07:04:08] [INFO ] Invariant cache hit.
[2023-03-15 07:04:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 07:04:09] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
[2023-03-15 07:04:09] [INFO ] Invariant cache hit.
[2023-03-15 07:04:10] [INFO ] Dead Transitions using invariants and state equation in 981 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 383/887 places, 944/1384 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2729 ms. Remains : 383/887 places, 944/1384 transitions.
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(NEQ s184 1), p0:(AND (EQ s37 1) (EQ s49 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, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 522 reset in 770 ms.
Product exploration explored 100000 steps with 518 reset in 617 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 52 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 07:04:12] [INFO ] Invariant cache hit.
[2023-03-15 07:04:13] [INFO ] [Real]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-15 07:04:13] [INFO ] After 705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:04:13] [INFO ] [Nat]Absence check using 57 positive place invariants in 26 ms returned sat
[2023-03-15 07:04:14] [INFO ] After 618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:04:14] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 07:04:14] [INFO ] After 179ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 07:04:14] [INFO ] After 430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-15 07:04:14] [INFO ] After 1408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 944/944 transitions.
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 383 transition count 900
Applied a total of 44 rules in 28 ms. Remains 383 /383 variables (removed 0) and now considering 900/944 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 383/383 places, 900/944 transitions.
Incomplete random walk after 10000 steps, including 46 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 900 rows 383 cols
[2023-03-15 07:04:15] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 07:04:15] [INFO ] [Real]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-15 07:04:15] [INFO ] After 585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:04:15] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-15 07:04:16] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:04:16] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-15 07:04:16] [INFO ] After 47ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:04:16] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-15 07:04:16] [INFO ] After 579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 21 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 383/383 places, 900/900 transitions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 275536 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275536 steps, saw 70185 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:04:19] [INFO ] Invariant cache hit.
[2023-03-15 07:04:19] [INFO ] [Real]Absence check using 57 positive place invariants in 28 ms returned sat
[2023-03-15 07:04:20] [INFO ] After 590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:04:20] [INFO ] [Nat]Absence check using 57 positive place invariants in 26 ms returned sat
[2023-03-15 07:04:20] [INFO ] After 498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:04:20] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-15 07:04:20] [INFO ] After 65ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:04:20] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-15 07:04:20] [INFO ] After 829ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 15 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 383/383 places, 900/900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 20 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
[2023-03-15 07:04:20] [INFO ] Invariant cache hit.
[2023-03-15 07:04:21] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-15 07:04:21] [INFO ] Invariant cache hit.
[2023-03-15 07:04:21] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-15 07:04:22] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 1845 ms to find 0 implicit places.
[2023-03-15 07:04:22] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-15 07:04:22] [INFO ] Invariant cache hit.
[2023-03-15 07:04:23] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2996 ms. Remains : 383/383 places, 900/900 transitions.
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 383 transition count 876
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 381 transition count 870
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 381 transition count 870
Applied a total of 28 rules in 32 ms. Remains 381 /383 variables (removed 2) and now considering 870/900 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 870 rows 381 cols
[2023-03-15 07:04:23] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 07:04:24] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2023-03-15 07:04:24] [INFO ] After 478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:04:24] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-15 07:04:24] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:04:24] [INFO ] After 357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-15 07:04:24] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 944/944 transitions.
Applied a total of 0 rules in 5 ms. Remains 383 /383 variables (removed 0) and now considering 944/944 (removed 0) transitions.
// Phase 1: matrix 944 rows 383 cols
[2023-03-15 07:04:25] [INFO ] Computed 57 place invariants in 8 ms
[2023-03-15 07:04:26] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-03-15 07:04:26] [INFO ] Invariant cache hit.
[2023-03-15 07:04:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 07:04:27] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
[2023-03-15 07:04:27] [INFO ] Invariant cache hit.
[2023-03-15 07:04:27] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2332 ms. Remains : 383/383 places, 944/944 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 332 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 07:04:28] [INFO ] Invariant cache hit.
[2023-03-15 07:04:28] [INFO ] [Real]Absence check using 57 positive place invariants in 26 ms returned sat
[2023-03-15 07:04:29] [INFO ] After 648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 07:04:29] [INFO ] [Nat]Absence check using 57 positive place invariants in 26 ms returned sat
[2023-03-15 07:04:30] [INFO ] After 640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 07:04:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 07:04:30] [INFO ] After 183ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 07:04:30] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-15 07:04:30] [INFO ] After 1434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 944/944 transitions.
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 383 transition count 900
Applied a total of 44 rules in 25 ms. Remains 383 /383 variables (removed 0) and now considering 900/944 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 383/383 places, 900/944 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 900 rows 383 cols
[2023-03-15 07:04:30] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-15 07:04:31] [INFO ] [Real]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-15 07:04:31] [INFO ] After 621ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:04:31] [INFO ] [Nat]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-15 07:04:32] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:04:32] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-15 07:04:32] [INFO ] After 63ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:04:32] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-15 07:04:32] [INFO ] After 817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 12 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 383/383 places, 900/900 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 273305 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 273305 steps, saw 69849 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:04:35] [INFO ] Invariant cache hit.
[2023-03-15 07:04:35] [INFO ] [Real]Absence check using 57 positive place invariants in 16 ms returned sat
[2023-03-15 07:04:36] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:04:36] [INFO ] [Nat]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-15 07:04:36] [INFO ] After 500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:04:36] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-15 07:04:36] [INFO ] After 52ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:04:36] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-15 07:04:36] [INFO ] After 813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 12 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 383/383 places, 900/900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 13 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
[2023-03-15 07:04:36] [INFO ] Invariant cache hit.
[2023-03-15 07:04:37] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-15 07:04:37] [INFO ] Invariant cache hit.
[2023-03-15 07:04:37] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-15 07:04:38] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
[2023-03-15 07:04:38] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-15 07:04:38] [INFO ] Invariant cache hit.
[2023-03-15 07:04:39] [INFO ] Dead Transitions using invariants and state equation in 833 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2633 ms. Remains : 383/383 places, 900/900 transitions.
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 383 transition count 876
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 381 transition count 870
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 381 transition count 870
Applied a total of 28 rules in 29 ms. Remains 381 /383 variables (removed 2) and now considering 870/900 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 870 rows 381 cols
[2023-03-15 07:04:39] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 07:04:39] [INFO ] [Real]Absence check using 57 positive place invariants in 26 ms returned sat
[2023-03-15 07:04:40] [INFO ] After 600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:04:40] [INFO ] [Nat]Absence check using 57 positive place invariants in 25 ms returned sat
[2023-03-15 07:04:40] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:04:40] [INFO ] After 541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-15 07:04:40] [INFO ] After 753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 553 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 170 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 170 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 510 reset in 742 ms.
Product exploration explored 100000 steps with 521 reset in 519 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 944/944 transitions.
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 383 transition count 900
Applied a total of 44 rules in 15 ms. Remains 383 /383 variables (removed 0) and now considering 900/944 (removed 44) transitions.
[2023-03-15 07:04:43] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 900 rows 383 cols
[2023-03-15 07:04:43] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 07:04:44] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 383/383 places, 900/944 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 836 ms. Remains : 383/383 places, 900/944 transitions.
Built C files in :
/tmp/ltsmin1776964373092326097
[2023-03-15 07:04:44] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1776964373092326097
Running compilation step : cd /tmp/ltsmin1776964373092326097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2486 ms.
Running link step : cd /tmp/ltsmin1776964373092326097;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin1776964373092326097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17209973397454223506.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 944/944 transitions.
Applied a total of 0 rules in 3 ms. Remains 383 /383 variables (removed 0) and now considering 944/944 (removed 0) transitions.
// Phase 1: matrix 944 rows 383 cols
[2023-03-15 07:04:59] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 07:04:59] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-15 07:04:59] [INFO ] Invariant cache hit.
[2023-03-15 07:05:00] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 07:05:01] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
[2023-03-15 07:05:01] [INFO ] Invariant cache hit.
[2023-03-15 07:05:02] [INFO ] Dead Transitions using invariants and state equation in 1029 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2727 ms. Remains : 383/383 places, 944/944 transitions.
Built C files in :
/tmp/ltsmin10529137456542564936
[2023-03-15 07:05:02] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10529137456542564936
Running compilation step : cd /tmp/ltsmin10529137456542564936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2628 ms.
Running link step : cd /tmp/ltsmin10529137456542564936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin10529137456542564936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10402443000296501714.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 07:05:17] [INFO ] Flatten gal took : 34 ms
[2023-03-15 07:05:17] [INFO ] Flatten gal took : 33 ms
[2023-03-15 07:05:17] [INFO ] Time to serialize gal into /tmp/LTL13228129250174605385.gal : 8 ms
[2023-03-15 07:05:17] [INFO ] Time to serialize properties into /tmp/LTL2198398250652050053.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13228129250174605385.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18003833511458158476.hoa' '-atoms' '/tmp/LTL2198398250652050053.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2198398250652050053.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18003833511458158476.hoa
Detected timeout of ITS tools.
[2023-03-15 07:05:32] [INFO ] Flatten gal took : 40 ms
[2023-03-15 07:05:32] [INFO ] Flatten gal took : 30 ms
[2023-03-15 07:05:32] [INFO ] Time to serialize gal into /tmp/LTL7794727360302581134.gal : 6 ms
[2023-03-15 07:05:32] [INFO ] Time to serialize properties into /tmp/LTL666337561884529467.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7794727360302581134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL666337561884529467.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(("((p190!=1)||(p259!=1))")&&(G(("((p190!=1)||(p259!=1))")||(G("(p752!=1)")))))))
Formula 0 simplified : X(!"((p190!=1)||(p259!=1))" | F(!"((p190!=1)||(p259!=1))" & F!"(p752!=1)"))
Detected timeout of ITS tools.
[2023-03-15 07:05:47] [INFO ] Flatten gal took : 39 ms
[2023-03-15 07:05:47] [INFO ] Applying decomposition
[2023-03-15 07:05:47] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8178722693818508596.txt' '-o' '/tmp/graph8178722693818508596.bin' '-w' '/tmp/graph8178722693818508596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8178722693818508596.bin' '-l' '-1' '-v' '-w' '/tmp/graph8178722693818508596.weights' '-q' '0' '-e' '0.001'
[2023-03-15 07:05:47] [INFO ] Decomposing Gal with order
[2023-03-15 07:05:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:05:47] [INFO ] Removed a total of 612 redundant transitions.
[2023-03-15 07:05:47] [INFO ] Flatten gal took : 72 ms
[2023-03-15 07:05:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 792 labels/synchronizations in 16 ms.
[2023-03-15 07:05:47] [INFO ] Time to serialize gal into /tmp/LTL7161989961256358758.gal : 8 ms
[2023-03-15 07:05:47] [INFO ] Time to serialize properties into /tmp/LTL3935150573501056609.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7161989961256358758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3935150573501056609.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(("((i1.u7.p190!=1)||(i1.u7.p259!=1))")&&(G(("((i1.u7.p190!=1)||(i1.u7.p259!=1))")||(G("(i4.i1.u21.p752!=1)")))))))
Formula 0 simplified : X(!"((i1.u7.p190!=1)||(i1.u7.p259!=1))" | F(!"((i1.u7.p190!=1)||(i1.u7.p259!=1))" & F!"(i4.i1.u21.p752!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3913575087762572941
[2023-03-15 07:06:03] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3913575087762572941
Running compilation step : cd /tmp/ltsmin3913575087762572941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2519 ms.
Running link step : cd /tmp/ltsmin3913575087762572941;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3913575087762572941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(((LTLAPp0==true)&&[](([]((LTLAPp2==true))||(LTLAPp1==true)))))&&(LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-5B-LTLFireability-15 finished in 130447 ms.
[2023-03-15 07:06:18] [INFO ] Flatten gal took : 68 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13655110104251149316
[2023-03-15 07:06:18] [INFO ] Computing symmetric may disable matrix : 1384 transitions.
[2023-03-15 07:06:18] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 07:06:18] [INFO ] Computing symmetric may enable matrix : 1384 transitions.
[2023-03-15 07:06:18] [INFO ] Applying decomposition
[2023-03-15 07:06:18] [INFO ] Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 07:06:18] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6516027290437176598.txt' '-o' '/tmp/graph6516027290437176598.bin' '-w' '/tmp/graph6516027290437176598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6516027290437176598.bin' '-l' '-1' '-v' '-w' '/tmp/graph6516027290437176598.weights' '-q' '0' '-e' '0.001'
[2023-03-15 07:06:18] [INFO ] Decomposing Gal with order
[2023-03-15 07:06:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:06:18] [INFO ] Removed a total of 1106 redundant transitions.
[2023-03-15 07:06:18] [INFO ] Flatten gal took : 94 ms
[2023-03-15 07:06:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 178 labels/synchronizations in 36 ms.
[2023-03-15 07:06:18] [INFO ] Time to serialize gal into /tmp/LTLFireability7455881882568557072.gal : 12 ms
[2023-03-15 07:06:18] [INFO ] Time to serialize properties into /tmp/LTLFireability15421712482253646124.ltl : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7455881882568557072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15421712482253646124.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
[2023-03-15 07:06:18] [INFO ] Computing Do-Not-Accords matrix : 1384 transitions.
[2023-03-15 07:06:18] [INFO ] Computation of Completed DNA matrix. took 84 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Checking formula 0 : !((X((!("((i2.u63.p190==1)&&(i2.u63.p259==1))"))&&(G((!("((i2.u63.p190==1)&&(i2.u63.p259==1))"))||(G("(i6.u151.p752!=1)")))))))
Formula 0 simplified : X("((i2.u63.p190==1)&&(i2.u63.p259==1))" | F("((i2.u63.p190==1)&&(i2.u63.p259==1))" & F!"(i6.u151.p752!=1)"))
[2023-03-15 07:06:18] [INFO ] Built C files in 724ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13655110104251149316
Running compilation step : cd /tmp/ltsmin13655110104251149316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 7574 ms.
Running link step : cd /tmp/ltsmin13655110104251149316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin13655110104251149316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(LTLAPp0==true)&&X((!(LTLAPp0==true)&&[]((!(LTLAPp0==true)||[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.052: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.052: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.052: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.052: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.334: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.334: LTL layer: formula: (!(LTLAPp0==true)&&X((!(LTLAPp0==true)&&[]((!(LTLAPp0==true)||[]((LTLAPp1==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.334: "(!(LTLAPp0==true)&&X((!(LTLAPp0==true)&&[]((!(LTLAPp0==true)||[]((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.335: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.353: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.369: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.387: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.407: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.417: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.438: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.439: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.449: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.082: DFS-FIFO for weak LTL, using special progress label 1387
pins2lts-mc-linux64( 0/ 8), 1.082: There are 1388 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.082: State length is 888, there are 1394 groups
pins2lts-mc-linux64( 0/ 8), 1.082: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.082: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.082: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.082: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.216: ~1 levels ~960 states ~2584 transitions
pins2lts-mc-linux64( 0/ 8), 1.409: ~1 levels ~1920 states ~6432 transitions
pins2lts-mc-linux64( 0/ 8), 1.669: ~1 levels ~3840 states ~14472 transitions
pins2lts-mc-linux64( 0/ 8), 2.162: ~1 levels ~7680 states ~29256 transitions
pins2lts-mc-linux64( 0/ 8), 3.026: ~1 levels ~15360 states ~60592 transitions
pins2lts-mc-linux64( 5/ 8), 4.823: ~1 levels ~30720 states ~158328 transitions
pins2lts-mc-linux64( 5/ 8), 8.131: ~1 levels ~61440 states ~349344 transitions
pins2lts-mc-linux64( 0/ 8), 14.084: ~1 levels ~122880 states ~653536 transitions
pins2lts-mc-linux64( 0/ 8), 24.803: ~1 levels ~245760 states ~1363976 transitions
pins2lts-mc-linux64( 6/ 8), 44.891: ~1 levels ~491520 states ~2863728 transitions
pins2lts-mc-linux64( 6/ 8), 84.192: ~1 levels ~983040 states ~6063288 transitions
pins2lts-mc-linux64( 6/ 8), 162.920: ~1 levels ~1966080 states ~12766296 transitions
pins2lts-mc-linux64( 6/ 8), 321.681: ~1 levels ~3932160 states ~26411848 transitions
pins2lts-mc-linux64( 6/ 8), 642.487: ~1 levels ~7864320 states ~54773752 transitions
pins2lts-mc-linux64( 3/ 8), 1172.446: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1172.536:
pins2lts-mc-linux64( 0/ 8), 1172.536: mean standard work distribution: 24.8% (states) 25.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 1172.536:
pins2lts-mc-linux64( 0/ 8), 1172.536: Explored 11676609 states 89136036 transitions, fanout: 7.634
pins2lts-mc-linux64( 0/ 8), 1172.536: Total exploration time 1171.440 sec (1171.350 sec minimum, 1171.381 sec on average)
pins2lts-mc-linux64( 0/ 8), 1172.536: States per second: 9968, Transitions per second: 76091
pins2lts-mc-linux64( 0/ 8), 1172.536:
pins2lts-mc-linux64( 0/ 8), 1172.536: Progress states detected: 19482949
pins2lts-mc-linux64( 0/ 8), 1172.536: Redundant explorations: -40.0676
pins2lts-mc-linux64( 0/ 8), 1172.536:
pins2lts-mc-linux64( 0/ 8), 1172.536: Queue width: 8B, total height: 13895095, memory: 106.01MB
pins2lts-mc-linux64( 0/ 8), 1172.536: Tree memory: 404.6MB, 21.8 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1172.536: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1172.536: Stored 1411 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1172.536: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1172.536: Est. total memory use: 510.7MB (~1130.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13655110104251149316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(LTLAPp0==true)&&X((!(LTLAPp0==true)&&[]((!(LTLAPp0==true)||[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13655110104251149316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!(LTLAPp0==true)&&X((!(LTLAPp0==true)&&[]((!(LTLAPp0==true)||[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-15 07:27:55] [INFO ] Applying decomposition
[2023-03-15 07:27:55] [INFO ] Flatten gal took : 50 ms
[2023-03-15 07:27:55] [INFO ] Decomposing Gal with order
[2023-03-15 07:27:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:27:55] [INFO ] Removed a total of 769 redundant transitions.
[2023-03-15 07:27:55] [INFO ] Flatten gal took : 104 ms
[2023-03-15 07:27:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 1571 labels/synchronizations in 103 ms.
[2023-03-15 07:27:56] [INFO ] Time to serialize gal into /tmp/LTLFireability13506989850812323001.gal : 11 ms
[2023-03-15 07:27:56] [INFO ] Time to serialize properties into /tmp/LTLFireability16634443196292569496.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13506989850812323001.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16634443196292569496.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X((!("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....891
Formula 0 simplified : X("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...875
Detected timeout of ITS tools.
[2023-03-15 07:49:37] [INFO ] Flatten gal took : 1144 ms
[2023-03-15 07:49:42] [INFO ] Input system was already deterministic with 1384 transitions.
[2023-03-15 07:49:42] [INFO ] Transformed 887 places.
[2023-03-15 07:49:42] [INFO ] Transformed 1384 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 07:49:43] [INFO ] Time to serialize gal into /tmp/LTLFireability5337973765991329380.gal : 53 ms
[2023-03-15 07:49:43] [INFO ] Time to serialize properties into /tmp/LTLFireability10685810224009364614.ltl : 5 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5337973765991329380.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10685810224009364614.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((!("((p190==1)&&(p259==1))"))&&(G((!("((p190==1)&&(p259==1))"))||(G("(p752!=1)")))))))
Formula 0 simplified : X("((p190==1)&&(p259==1))" | F("((p190==1)&&(p259==1))" & F!"(p752!=1)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 3477956 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15906680 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-5B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536200300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-5B.tgz
mv NoC3x3-PT-5B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;