Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 9.9K May 30 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 30 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 30 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 30 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 25 12:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 25 12:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 25 12:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 25 12:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 18K May 30 15:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K May 30 15:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 30 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 25 12:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 25 12:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 2.6M May 29 12:20 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 CANInsertWithFailure-PT-020-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654651120605

Running Version 202205111006
[2022-06-08 01:18:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-08 01:18:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 01:18:44] [INFO ] Load time of PNML (sax parser for PT used): 691 ms
[2022-06-08 01:18:44] [INFO ] Transformed 1044 places.
[2022-06-08 01:18:44] [INFO ] Transformed 2520 transitions.
[2022-06-08 01:18:44] [INFO ] Parsed PT model containing 1044 places and 2520 transitions in 1059 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 1044 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1043 transition count 2520
Applied a total of 1 rules in 154 ms. Remains 1043 /1044 variables (removed 1) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:18:44] [INFO ] Computed 22 place invariants in 105 ms
[2022-06-08 01:18:45] [INFO ] Implicit Places using invariants in 1059 ms returned []
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:18:45] [INFO ] Computed 22 place invariants in 123 ms
[2022-06-08 01:18:46] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-06-08 01:18:47] [INFO ] Implicit Places using invariants and state equation in 1941 ms returned []
Implicit Place search using SMT with State Equation took 3049 ms to find 0 implicit places.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:18:47] [INFO ] Computed 22 place invariants in 96 ms
[2022-06-08 01:18:50] [INFO ] Dead Transitions using invariants and state equation in 2658 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1043/1044 places, 2520/2520 transitions.
Finished structural reductions, in 1 iterations. Remains : 1043/1044 places, 2520/2520 transitions.
Support contains 43 out of 1043 places after structural reductions.
[2022-06-08 01:18:51] [INFO ] Flatten gal took : 368 ms
[2022-06-08 01:18:51] [INFO ] Flatten gal took : 221 ms
[2022-06-08 01:18:51] [INFO ] Input system was already deterministic with 2520 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 1160 ms. (steps per millisecond=8 ) properties (out of 37) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:18:53] [INFO ] Computed 22 place invariants in 101 ms
[2022-06-08 01:18:53] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2022-06-08 01:18:53] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 18 ms returned sat
[2022-06-08 01:18:55] [INFO ] After 1684ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2022-06-08 01:18:55] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-06-08 01:18:56] [INFO ] After 572ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-08 01:18:56] [INFO ] After 3023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-08 01:18:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 81 ms returned sat
[2022-06-08 01:18:56] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 15 ms returned sat
[2022-06-08 01:18:58] [INFO ] After 1497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-08 01:19:00] [INFO ] After 2196ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-08 01:19:01] [INFO ] After 3361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 835 ms.
[2022-06-08 01:19:02] [INFO ] After 6237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 165 ms.
Support contains 8 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 278 place count 904 transition count 2380
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 2 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 3 with 710 rules applied. Total rules applied 990 place count 548 transition count 2025
Drop transitions removed 320 transitions
Redundant transition composition rules discarded 320 transitions
Iterating global reduction 3 with 320 rules applied. Total rules applied 1310 place count 548 transition count 1705
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1311 place count 548 transition count 1704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1312 place count 547 transition count 1704
Partial Free-agglomeration rule applied 458 times.
Drop transitions removed 458 transitions
Iterating global reduction 4 with 458 rules applied. Total rules applied 1770 place count 547 transition count 1704
Applied a total of 1770 rules in 730 ms. Remains 547 /1043 variables (removed 496) and now considering 1704/2520 (removed 816) transitions.
Finished structural reductions, in 1 iterations. Remains : 547/1043 places, 1704/2520 transitions.
Incomplete random walk after 10000 steps, including 93 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1704 rows 547 cols
[2022-06-08 01:19:03] [INFO ] Computed 22 place invariants in 29 ms
[2022-06-08 01:19:03] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2022-06-08 01:19:03] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-08 01:19:04] [INFO ] After 485ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 01:19:04] [INFO ] State equation strengthened by 1569 read => feed constraints.
[2022-06-08 01:19:04] [INFO ] After 258ms SMT Verify possible using 1569 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 01:19:04] [INFO ] After 925ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 01:19:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-06-08 01:19:04] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2022-06-08 01:19:05] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 01:19:05] [INFO ] After 268ms SMT Verify possible using 1569 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 01:19:05] [INFO ] After 370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2022-06-08 01:19:05] [INFO ] After 1174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 547/547 places, 1704/1704 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 543 transition count 1700
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 543 transition count 1699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 542 transition count 1699
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 542 transition count 1699
Applied a total of 11 rules in 143 ms. Remains 542 /547 variables (removed 5) and now considering 1699/1704 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 542/547 places, 1699/1704 transitions.
Incomplete random walk after 10000 steps, including 99 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 342319 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 342319 steps, saw 45402 distinct states, run finished after 3002 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1699 rows 542 cols
[2022-06-08 01:19:09] [INFO ] Computed 22 place invariants in 21 ms
[2022-06-08 01:19:09] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2022-06-08 01:19:09] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2022-06-08 01:19:09] [INFO ] After 517ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 01:19:09] [INFO ] State equation strengthened by 1616 read => feed constraints.
[2022-06-08 01:19:09] [INFO ] After 243ms SMT Verify possible using 1616 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 01:19:09] [INFO ] After 917ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 01:19:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-06-08 01:19:10] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2022-06-08 01:19:10] [INFO ] After 506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 01:19:10] [INFO ] After 265ms SMT Verify possible using 1616 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 01:19:10] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-06-08 01:19:11] [INFO ] After 1046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 542/542 places, 1699/1699 transitions.
Applied a total of 0 rules in 34 ms. Remains 542 /542 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 542/542 places, 1699/1699 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 542/542 places, 1699/1699 transitions.
Applied a total of 0 rules in 38 ms. Remains 542 /542 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
// Phase 1: matrix 1699 rows 542 cols
[2022-06-08 01:19:11] [INFO ] Computed 22 place invariants in 18 ms
[2022-06-08 01:19:12] [INFO ] Implicit Places using invariants in 946 ms returned []
// Phase 1: matrix 1699 rows 542 cols
[2022-06-08 01:19:12] [INFO ] Computed 22 place invariants in 27 ms
[2022-06-08 01:19:12] [INFO ] State equation strengthened by 1616 read => feed constraints.
[2022-06-08 01:19:18] [INFO ] Implicit Places using invariants and state equation in 6853 ms returned []
Implicit Place search using SMT with State Equation took 7803 ms to find 0 implicit places.
[2022-06-08 01:19:19] [INFO ] Redundant transitions in 147 ms returned []
// Phase 1: matrix 1699 rows 542 cols
[2022-06-08 01:19:19] [INFO ] Computed 22 place invariants in 17 ms
[2022-06-08 01:19:20] [INFO ] Dead Transitions using invariants and state equation in 1280 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 542/542 places, 1699/1699 transitions.
Graph (trivial) has 1554 edges and 542 vertex of which 458 / 542 are part of one of the 2 SCC in 7 ms
Free SCC test removed 456 places
Drop transitions removed 1196 transitions
Ensure Unique test removed 411 transitions
Reduce isomorphic transitions removed 1607 transitions.
Graph (complete) has 212 edges and 86 vertex of which 26 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.8 ms
Discarding 60 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 26 transition count 32
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 64 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 82 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 5 transition count 8
Applied a total of 88 rules in 31 ms. Remains 5 /542 variables (removed 537) and now considering 8/1699 (removed 1691) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 5 cols
[2022-06-08 01:19:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-06-08 01:19:20] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 01:19:20] [INFO ] After 9ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-08 01:19:20] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-06-08 01:19:20] [INFO ] Flatten gal took : 3 ms
[2022-06-08 01:19:20] [INFO ] Flatten gal took : 1 ms
[2022-06-08 01:19:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4201008031195932049.gal : 2 ms
[2022-06-08 01:19:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12341883981723096498.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms13118374031926146499;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4201008031195932049.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12341883981723096498.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality12341883981723096498.prop.
Reachability property AtomicPropp18 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9,0.012793,3312,2,10,6,50,6,0,27,30,0
Total reachable state count : 9

Verifying 1 reachability properties.
Reachability property AtomicPropp18 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp18,1,0.013269,3736,2,6,6,50,7,0,32,30,0
FORMULA CANInsertWithFailure-PT-020-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CANInsertWithFailure-PT-020-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 82 stabilizing places and 140 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((!(p0 U p1) U p2))&&(X(p0)||G(p3))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 118 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:19:21] [INFO ] Computed 22 place invariants in 35 ms
[2022-06-08 01:19:21] [INFO ] Implicit Places using invariants in 645 ms returned []
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:19:21] [INFO ] Computed 22 place invariants in 36 ms
[2022-06-08 01:19:23] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-06-08 01:19:26] [INFO ] Implicit Places using invariants and state equation in 4460 ms returned []
Implicit Place search using SMT with State Equation took 5113 ms to find 0 implicit places.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:19:26] [INFO ] Computed 22 place invariants in 51 ms
[2022-06-08 01:19:28] [INFO ] Dead Transitions using invariants and state equation in 2467 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 617 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2 (NOT p3))), true, p1, (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=p3, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 5}], [{ cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) (NOT p0) (NOT p1))), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 4}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(GEQ s722 1), p2:(AND (GEQ s35 1) (GEQ s285 1)), p1:(GEQ s246 1), p0:(GEQ s898 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-00 finished in 8431 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X((G(p0)&&p1)) U !F(p2)))||G(p1)))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 377 Post agglomeration using F-continuation condition.Transition count delta: 377
Deduced a syphon composed of 377 places in 1 ms
Reduce places removed 377 places and 0 transitions.
Iterating global reduction 2 with 754 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions removed 339 transitions
Redundant transition composition rules discarded 339 transitions
Iterating global reduction 2 with 339 rules applied. Total rules applied 1373 place count 526 transition count 1664
Applied a total of 1373 rules in 280 ms. Remains 526 /1043 variables (removed 517) and now considering 1664/2520 (removed 856) transitions.
// Phase 1: matrix 1664 rows 526 cols
[2022-06-08 01:19:29] [INFO ] Computed 22 place invariants in 35 ms
[2022-06-08 01:19:30] [INFO ] Implicit Places using invariants in 426 ms returned []
// Phase 1: matrix 1664 rows 526 cols
[2022-06-08 01:19:30] [INFO ] Computed 22 place invariants in 14 ms
[2022-06-08 01:19:30] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2022-06-08 01:19:33] [INFO ] Implicit Places using invariants and state equation in 3390 ms returned []
Implicit Place search using SMT with State Equation took 3819 ms to find 0 implicit places.
[2022-06-08 01:19:33] [INFO ] Redundant transitions in 125 ms returned []
// Phase 1: matrix 1664 rows 526 cols
[2022-06-08 01:19:33] [INFO ] Computed 22 place invariants in 15 ms
[2022-06-08 01:19:35] [INFO ] Dead Transitions using invariants and state equation in 1523 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 526/1043 places, 1664/2520 transitions.
Finished structural reductions, in 1 iterations. Remains : 526/1043 places, 1664/2520 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) p2), p2]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s341 1), p2:(OR (GEQ s236 1) (GEQ s454 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 962 reset in 1199 ms.
Stack based approach found an accepted trace after 4766 steps with 45 reset with depth 89 and stack size 88 in 36 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-01 finished in 7127 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((G((X(p1)&&p1))||X(G(p2))))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 36 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:19:36] [INFO ] Computed 22 place invariants in 45 ms
[2022-06-08 01:19:37] [INFO ] Implicit Places using invariants in 764 ms returned []
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:19:37] [INFO ] Computed 22 place invariants in 62 ms
[2022-06-08 01:19:38] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-06-08 01:19:39] [INFO ] Implicit Places using invariants and state equation in 1704 ms returned []
Implicit Place search using SMT with State Equation took 2481 ms to find 0 implicit places.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:19:39] [INFO ] Computed 22 place invariants in 52 ms
[2022-06-08 01:19:42] [INFO ] Dead Transitions using invariants and state equation in 2972 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 350 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(AND (GEQ s569 1) (GEQ s181 1) (GEQ s182 1)), p1:(GEQ s742 1), p2:(AND (GEQ s181 1) (GEQ s182 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, null, null, null, null][false, 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 CANInsertWithFailure-PT-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-02 finished in 5871 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(p0) U X(G(X(F((G(p0)&&p1))))))))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 380 Post agglomeration using F-continuation condition.Transition count delta: 380
Deduced a syphon composed of 380 places in 1 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 2 with 760 rules applied. Total rules applied 1040 place count 523 transition count 2000
Drop transitions removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1382 place count 523 transition count 1658
Applied a total of 1382 rules in 279 ms. Remains 523 /1043 variables (removed 520) and now considering 1658/2520 (removed 862) transitions.
// Phase 1: matrix 1658 rows 523 cols
[2022-06-08 01:19:42] [INFO ] Computed 22 place invariants in 18 ms
[2022-06-08 01:19:43] [INFO ] Implicit Places using invariants in 413 ms returned []
// Phase 1: matrix 1658 rows 523 cols
[2022-06-08 01:19:43] [INFO ] Computed 22 place invariants in 11 ms
[2022-06-08 01:19:43] [INFO ] State equation strengthened by 1178 read => feed constraints.
[2022-06-08 01:19:46] [INFO ] Implicit Places using invariants and state equation in 3392 ms returned []
Implicit Place search using SMT with State Equation took 3809 ms to find 0 implicit places.
[2022-06-08 01:19:46] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 1658 rows 523 cols
[2022-06-08 01:19:46] [INFO ] Computed 22 place invariants in 13 ms
[2022-06-08 01:19:48] [INFO ] Dead Transitions using invariants and state equation in 1463 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 523/1043 places, 1658/2520 transitions.
Finished structural reductions, in 1 iterations. Remains : 523/1043 places, 1658/2520 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s490 1), p0:(GEQ s318 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 959 reset in 985 ms.
Product exploration explored 100000 steps with 968 reset in 690 ms.
Computed a total of 63 stabilizing places and 100 stable transitions
Computed a total of 63 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 97 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1658 rows 523 cols
[2022-06-08 01:19:50] [INFO ] Computed 22 place invariants in 13 ms
[2022-06-08 01:19:50] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-06-08 01:19:50] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2022-06-08 01:19:51] [INFO ] After 650ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 01:19:51] [INFO ] State equation strengthened by 1178 read => feed constraints.
[2022-06-08 01:19:51] [INFO ] After 246ms SMT Verify possible using 1178 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 01:19:51] [INFO ] After 1088ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 01:19:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-06-08 01:19:51] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2022-06-08 01:19:52] [INFO ] After 727ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 01:19:52] [INFO ] After 307ms SMT Verify possible using 1178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 01:19:52] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-06-08 01:19:52] [INFO ] After 1419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 319 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 97 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 1658/1658 transitions.
Applied a total of 0 rules in 60 ms. Remains 523 /523 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
// Phase 1: matrix 1658 rows 523 cols
[2022-06-08 01:19:53] [INFO ] Computed 22 place invariants in 18 ms
[2022-06-08 01:19:53] [INFO ] Implicit Places using invariants in 493 ms returned []
// Phase 1: matrix 1658 rows 523 cols
[2022-06-08 01:19:53] [INFO ] Computed 22 place invariants in 17 ms
[2022-06-08 01:19:54] [INFO ] State equation strengthened by 1178 read => feed constraints.
[2022-06-08 01:19:57] [INFO ] Implicit Places using invariants and state equation in 3577 ms returned []
Implicit Place search using SMT with State Equation took 4075 ms to find 0 implicit places.
[2022-06-08 01:19:57] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 1658 rows 523 cols
[2022-06-08 01:19:57] [INFO ] Computed 22 place invariants in 17 ms
[2022-06-08 01:19:59] [INFO ] Dead Transitions using invariants and state equation in 1605 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 523/523 places, 1658/1658 transitions.
Computed a total of 63 stabilizing places and 100 stable transitions
Computed a total of 63 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 98 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1658 rows 523 cols
[2022-06-08 01:19:59] [INFO ] Computed 22 place invariants in 17 ms
[2022-06-08 01:19:59] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2022-06-08 01:19:59] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-08 01:20:00] [INFO ] After 731ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 01:20:00] [INFO ] State equation strengthened by 1178 read => feed constraints.
[2022-06-08 01:20:00] [INFO ] After 196ms SMT Verify possible using 1178 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 01:20:00] [INFO ] After 1128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 01:20:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2022-06-08 01:20:00] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2022-06-08 01:20:01] [INFO ] After 670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 01:20:01] [INFO ] After 218ms SMT Verify possible using 1178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 01:20:01] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-06-08 01:20:01] [INFO ] After 1155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 329 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 93 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 104 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 976 reset in 879 ms.
Product exploration explored 100000 steps with 964 reset in 868 ms.
Built C files in :
/tmp/ltsmin5298028469880038627
[2022-06-08 01:20:04] [INFO ] Too many transitions (1658) to apply POR reductions. Disabling POR matrices.
[2022-06-08 01:20:04] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5298028469880038627
Running compilation step : cd /tmp/ltsmin5298028469880038627;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5298028469880038627;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5298028469880038627;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 1658/1658 transitions.
Applied a total of 0 rules in 41 ms. Remains 523 /523 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
// Phase 1: matrix 1658 rows 523 cols
[2022-06-08 01:20:07] [INFO ] Computed 22 place invariants in 17 ms
[2022-06-08 01:20:07] [INFO ] Implicit Places using invariants in 535 ms returned []
// Phase 1: matrix 1658 rows 523 cols
[2022-06-08 01:20:08] [INFO ] Computed 22 place invariants in 34 ms
[2022-06-08 01:20:08] [INFO ] State equation strengthened by 1178 read => feed constraints.
[2022-06-08 01:20:11] [INFO ] Implicit Places using invariants and state equation in 3283 ms returned []
Implicit Place search using SMT with State Equation took 3821 ms to find 0 implicit places.
[2022-06-08 01:20:11] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 1658 rows 523 cols
[2022-06-08 01:20:11] [INFO ] Computed 22 place invariants in 12 ms
[2022-06-08 01:20:12] [INFO ] Dead Transitions using invariants and state equation in 1590 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 523/523 places, 1658/1658 transitions.
Built C files in :
/tmp/ltsmin2117021944553185157
[2022-06-08 01:20:12] [INFO ] Too many transitions (1658) to apply POR reductions. Disabling POR matrices.
[2022-06-08 01:20:12] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2117021944553185157
Running compilation step : cd /tmp/ltsmin2117021944553185157;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2117021944553185157;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2117021944553185157;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-08 01:20:16] [INFO ] Flatten gal took : 74 ms
[2022-06-08 01:20:16] [INFO ] Flatten gal took : 75 ms
[2022-06-08 01:20:16] [INFO ] Time to serialize gal into /tmp/LTL6262726446799034252.gal : 24 ms
[2022-06-08 01:20:16] [INFO ] Time to serialize properties into /tmp/LTL11181407407794802415.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6262726446799034252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11181407407794802415.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6262726...267
Read 1 LTL properties
Checking formula 0 : !((X(!((F("(Node9requestsent16>=1)"))U(X(G(X(F((G("(Node9requestsent16>=1)"))&&("(Node18requestsent7>=1)"))))))))))
Formula 0 simplified : !X!(F"(Node9requestsent16>=1)" U XGXF("(Node18requestsent7>=1)" & G"(Node9requestsent16>=1)"))
Detected timeout of ITS tools.
[2022-06-08 01:20:31] [INFO ] Flatten gal took : 84 ms
[2022-06-08 01:20:31] [INFO ] Applying decomposition
[2022-06-08 01:20:31] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2716159398872979843.txt' '-o' '/tmp/graph2716159398872979843.bin' '-w' '/tmp/graph2716159398872979843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2716159398872979843.bin' '-l' '-1' '-v' '-w' '/tmp/graph2716159398872979843.weights' '-q' '0' '-e' '0.001'
[2022-06-08 01:20:31] [INFO ] Decomposing Gal with order
[2022-06-08 01:20:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 01:20:32] [INFO ] Removed a total of 1209 redundant transitions.
[2022-06-08 01:20:32] [INFO ] Flatten gal took : 563 ms
[2022-06-08 01:20:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 761 labels/synchronizations in 115 ms.
[2022-06-08 01:20:32] [INFO ] Time to serialize gal into /tmp/LTL2880520263910753996.gal : 21 ms
[2022-06-08 01:20:32] [INFO ] Time to serialize properties into /tmp/LTL3427587962549508243.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2880520263910753996.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3427587962549508243.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2880520...245
Read 1 LTL properties
Checking formula 0 : !((X(!((F("(u10.Node9requestsent16>=1)"))U(X(G(X(F((G("(u10.Node9requestsent16>=1)"))&&("(u19.Node18requestsent7>=1)"))))))))))
Formula 0 simplified : !X!(F"(u10.Node9requestsent16>=1)" U XGXF("(u19.Node18requestsent7>=1)" & G"(u10.Node9requestsent16>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2564138555459339129
[2022-06-08 01:20:47] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2564138555459339129
Running compilation step : cd /tmp/ltsmin2564138555459339129;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2564138555459339129;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2564138555459339129;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-03 finished in 68262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(((p1 U p2) U p3))))))'
Support contains 7 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 35 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:20:50] [INFO ] Computed 22 place invariants in 53 ms
[2022-06-08 01:20:51] [INFO ] Implicit Places using invariants in 533 ms returned []
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:20:51] [INFO ] Computed 22 place invariants in 54 ms
[2022-06-08 01:20:52] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-06-08 01:20:55] [INFO ] Implicit Places using invariants and state equation in 4458 ms returned []
Implicit Place search using SMT with State Equation took 4996 ms to find 0 implicit places.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:20:55] [INFO ] Computed 22 place invariants in 34 ms
[2022-06-08 01:20:58] [INFO ] Dead Transitions using invariants and state equation in 2405 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p0)), (NOT p0), (NOT p3), (NOT p3), true, (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (GEQ s480 1) (GEQ s524 1) (AND (GEQ s189 1) (GEQ s278 1))), p3:(GEQ s574 1), p2:(AND (GEQ s231 1) (GEQ s264 1)), p1:(AND (GEQ s189 1) (GEQ s278 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 319 steps with 1 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-05 finished in 7733 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(((X(p1) U p2)&&p3)))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 32 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:20:58] [INFO ] Computed 22 place invariants in 49 ms
[2022-06-08 01:20:59] [INFO ] Implicit Places using invariants in 546 ms returned []
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:20:59] [INFO ] Computed 22 place invariants in 32 ms
[2022-06-08 01:21:00] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-06-08 01:21:03] [INFO ] Implicit Places using invariants and state equation in 4219 ms returned []
Implicit Place search using SMT with State Equation took 4773 ms to find 0 implicit places.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:21:03] [INFO ] Computed 22 place invariants in 36 ms
[2022-06-08 01:21:05] [INFO ] Dead Transitions using invariants and state equation in 2382 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), true, (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 6}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p3), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND p3 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(OR (AND p3 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=3 dest: 2}], [{ cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p0) (NOT p2) p1)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p0 p3 (NOT p2)) (AND p0 (NOT p2) p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 9}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 10}], [{ cond=p0, acceptance={} source=5 dest: 7}, { cond=(NOT p0), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 9}, { cond=p0, acceptance={} source=7 dest: 10}], [{ cond=true, acceptance={} source=8 dest: 1}], [{ cond=(NOT p3), acceptance={} source=9 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=9 dest: 2}], [{ cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=10 dest: 3}, { cond=(AND p0 p3 (NOT p2)), acceptance={0} source=10 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=10 dest: 9}, { cond=(AND p0 (NOT p3)), acceptance={0} source=10 dest: 10}]], initial=5, aps=[p2:(AND (GEQ s490 1) (GEQ s834 1)), p1:(AND (GEQ s77 1) (GEQ s278 1)), p3:(GEQ s490 1), p0:(LT s834 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 468 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-06 finished in 7721 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1043 transition count 2381
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 380 Post agglomeration using F-continuation condition.Transition count delta: 380
Deduced a syphon composed of 380 places in 1 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 2 with 760 rules applied. Total rules applied 1038 place count 524 transition count 2001
Drop transitions removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1380 place count 524 transition count 1659
Applied a total of 1380 rules in 158 ms. Remains 524 /1043 variables (removed 519) and now considering 1659/2520 (removed 861) transitions.
// Phase 1: matrix 1659 rows 524 cols
[2022-06-08 01:21:06] [INFO ] Computed 22 place invariants in 14 ms
[2022-06-08 01:21:06] [INFO ] Implicit Places using invariants in 328 ms returned []
// Phase 1: matrix 1659 rows 524 cols
[2022-06-08 01:21:06] [INFO ] Computed 22 place invariants in 13 ms
[2022-06-08 01:21:07] [INFO ] State equation strengthened by 1178 read => feed constraints.
[2022-06-08 01:21:09] [INFO ] Implicit Places using invariants and state equation in 2684 ms returned []
Implicit Place search using SMT with State Equation took 3020 ms to find 0 implicit places.
[2022-06-08 01:21:09] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 1659 rows 524 cols
[2022-06-08 01:21:09] [INFO ] Computed 22 place invariants in 22 ms
[2022-06-08 01:21:10] [INFO ] Dead Transitions using invariants and state equation in 1389 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 524/1043 places, 1659/2520 transitions.
Finished structural reductions, in 1 iterations. Remains : 524/1043 places, 1659/2520 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s35 1) (GEQ s349 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-08 finished in 4704 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1043 transition count 2381
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 380 Post agglomeration using F-continuation condition.Transition count delta: 380
Deduced a syphon composed of 380 places in 0 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 2 with 760 rules applied. Total rules applied 1038 place count 524 transition count 2001
Drop transitions removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1380 place count 524 transition count 1659
Applied a total of 1380 rules in 144 ms. Remains 524 /1043 variables (removed 519) and now considering 1659/2520 (removed 861) transitions.
// Phase 1: matrix 1659 rows 524 cols
[2022-06-08 01:21:11] [INFO ] Computed 22 place invariants in 18 ms
[2022-06-08 01:21:11] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 1659 rows 524 cols
[2022-06-08 01:21:11] [INFO ] Computed 22 place invariants in 13 ms
[2022-06-08 01:21:11] [INFO ] State equation strengthened by 1178 read => feed constraints.
[2022-06-08 01:21:14] [INFO ] Implicit Places using invariants and state equation in 3052 ms returned []
Implicit Place search using SMT with State Equation took 3399 ms to find 0 implicit places.
[2022-06-08 01:21:14] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1659 rows 524 cols
[2022-06-08 01:21:14] [INFO ] Computed 22 place invariants in 11 ms
[2022-06-08 01:21:15] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 524/1043 places, 1659/2520 transitions.
Finished structural reductions, in 1 iterations. Remains : 524/1043 places, 1659/2520 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s138 1), p0:(AND (GEQ s59 1) (GEQ s232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1580 steps with 14 reset in 12 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-09 finished in 4638 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 32 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:21:15] [INFO ] Computed 22 place invariants in 44 ms
[2022-06-08 01:21:16] [INFO ] Implicit Places using invariants in 542 ms returned []
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:21:16] [INFO ] Computed 22 place invariants in 58 ms
[2022-06-08 01:21:17] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-06-08 01:21:20] [INFO ] Implicit Places using invariants and state equation in 4084 ms returned []
Implicit Place search using SMT with State Equation took 4629 ms to find 0 implicit places.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:21:20] [INFO ] Computed 22 place invariants in 37 ms
[2022-06-08 01:21:21] [INFO ] Dead Transitions using invariants and state equation in 1601 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s231 1) (LT s731 1)), p0:(GEQ s956 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1563 ms.
Product exploration explored 100000 steps with 50000 reset in 1507 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 114 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-10 finished in 9600 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(X(G(p0)))||G(p1))))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 33 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:21:25] [INFO ] Computed 22 place invariants in 31 ms
[2022-06-08 01:21:25] [INFO ] Implicit Places using invariants in 536 ms returned []
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:21:25] [INFO ] Computed 22 place invariants in 37 ms
[2022-06-08 01:21:26] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-06-08 01:21:30] [INFO ] Implicit Places using invariants and state equation in 4489 ms returned []
Implicit Place search using SMT with State Equation took 5027 ms to find 0 implicit places.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:21:30] [INFO ] Computed 22 place invariants in 32 ms
[2022-06-08 01:21:32] [INFO ] Dead Transitions using invariants and state equation in 2691 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 423 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={} source=9 dest: 7}]], initial=8, aps=[p0:(LT s726 1), p1:(OR (LT s83 1) (LT s85 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4154 steps with 9 reset in 26 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-12 finished in 8227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 56 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:21:33] [INFO ] Computed 22 place invariants in 51 ms
[2022-06-08 01:21:34] [INFO ] Implicit Places using invariants in 841 ms returned []
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:21:34] [INFO ] Computed 22 place invariants in 50 ms
[2022-06-08 01:21:35] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-06-08 01:21:36] [INFO ] Implicit Places using invariants and state equation in 1830 ms returned []
Implicit Place search using SMT with State Equation took 2673 ms to find 0 implicit places.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:21:36] [INFO ] Computed 22 place invariants in 45 ms
[2022-06-08 01:21:38] [INFO ] Dead Transitions using invariants and state equation in 2572 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s832 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 506 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-14 finished in 5410 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(F(p0) U F(X(X(p1))))||F(p0)||p2)))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 32 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:21:38] [INFO ] Computed 22 place invariants in 35 ms
[2022-06-08 01:21:39] [INFO ] Implicit Places using invariants in 725 ms returned []
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:21:39] [INFO ] Computed 22 place invariants in 31 ms
[2022-06-08 01:21:40] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-06-08 01:21:41] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 2266 ms to find 0 implicit places.
// Phase 1: matrix 2520 rows 1043 cols
[2022-06-08 01:21:41] [INFO ] Computed 22 place invariants in 30 ms
[2022-06-08 01:21:43] [INFO ] Dead Transitions using invariants and state equation in 2018 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GEQ s530 1), p2:(LT s721 1), p1:(GEQ s512 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1644 ms.
Product exploration explored 100000 steps with 50000 reset in 1479 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p0))))
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-15 finished in 7721 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(p0) U X(G(X(F((G(p0)&&p1))))))))'
[2022-06-08 01:21:46] [INFO ] Flatten gal took : 85 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6244453141299572765
[2022-06-08 01:21:46] [INFO ] Too many transitions (2520) to apply POR reductions. Disabling POR matrices.
[2022-06-08 01:21:46] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6244453141299572765
Running compilation step : cd /tmp/ltsmin6244453141299572765;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-08 01:21:46] [INFO ] Applying decomposition
[2022-06-08 01:21:47] [INFO ] Flatten gal took : 80 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12414810279417837264.txt' '-o' '/tmp/graph12414810279417837264.bin' '-w' '/tmp/graph12414810279417837264.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12414810279417837264.bin' '-l' '-1' '-v' '-w' '/tmp/graph12414810279417837264.weights' '-q' '0' '-e' '0.001'
[2022-06-08 01:21:47] [INFO ] Decomposing Gal with order
[2022-06-08 01:21:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 01:21:47] [INFO ] Removed a total of 1204 redundant transitions.
[2022-06-08 01:21:47] [INFO ] Flatten gal took : 208 ms
[2022-06-08 01:21:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1142 labels/synchronizations in 116 ms.
[2022-06-08 01:21:47] [INFO ] Time to serialize gal into /tmp/LTLFireability15661845182902447342.gal : 19 ms
[2022-06-08 01:21:47] [INFO ] Time to serialize properties into /tmp/LTLFireability8247047256274981150.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15661845182902447342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8247047256274981150.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((X(!((F("(i13.u37.Node9requestsent16>=1)"))U(X(G(X(F((G("(i13.u37.Node9requestsent16>=1)"))&&("(i28.u73.Node18requestsent7>=1)")))))...160
Formula 0 simplified : !X!(F"(i13.u37.Node9requestsent16>=1)" U XGXF("(i28.u73.Node18requestsent7>=1)" & G"(i13.u37.Node9requestsent16>=1)"))
Compilation finished in 8725 ms.
Running link step : cd /tmp/ltsmin6244453141299572765;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 109 ms.
Running LTSmin : cd /tmp/ltsmin6244453141299572765;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(!(<>((LTLAPp0==true)) U X([](X(<>(([]((LTLAPp0==true))&&(LTLAPp1==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-08 01:42:50] [INFO ] Flatten gal took : 245 ms
[2022-06-08 01:42:50] [INFO ] Time to serialize gal into /tmp/LTLFireability16921828037262924500.gal : 62 ms
[2022-06-08 01:42:50] [INFO ] Time to serialize properties into /tmp/LTLFireability10429249480559260133.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16921828037262924500.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10429249480559260133.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 1 LTL properties
Checking formula 0 : !((X(!((F("(Node9requestsent16>=1)"))U(X(G(X(F((G("(Node9requestsent16>=1)"))&&("(Node18requestsent7>=1)"))))))))))
Formula 0 simplified : !X!(F"(Node9requestsent16>=1)" U XGXF("(Node18requestsent7>=1)" & G"(Node9requestsent16>=1)"))
Detected timeout of ITS tools.
[2022-06-08 02:03:52] [INFO ] Flatten gal took : 165 ms
[2022-06-08 02:03:53] [INFO ] Input system was already deterministic with 2520 transitions.
[2022-06-08 02:03:53] [INFO ] Transformed 1043 places.
[2022-06-08 02:03:53] [INFO ] Transformed 2520 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-06-08 02:03:54] [INFO ] Time to serialize gal into /tmp/LTLFireability17993771598319695664.gal : 41 ms
[2022-06-08 02:03:54] [INFO ] Time to serialize properties into /tmp/LTLFireability2475139869443172947.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17993771598319695664.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2475139869443172947.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(!((F("(Node9requestsent16>=1)"))U(X(G(X(F((G("(Node9requestsent16>=1)"))&&("(Node18requestsent7>=1)"))))))))))
Formula 0 simplified : !X!(F"(Node9requestsent16>=1)" U XGXF("(Node18requestsent7>=1)" & G"(Node9requestsent16>=1)"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-020"
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-4028"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-020, 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 r294-smll-165463872300020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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