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-165463872400060.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-070, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872400060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 9.0K May 30 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 30 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 30 15:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 30 15:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 25 12:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 12:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 25 12:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 12:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 13K May 30 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 30 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 30 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 30 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 25 12:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 25 12:59 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 30M 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-070-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654720368891

Running Version 202205111006
[2022-06-08 20:32:50] [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 20:32:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 20:32:52] [INFO ] Load time of PNML (sax parser for PT used): 1533 ms
[2022-06-08 20:32:52] [INFO ] Transformed 10644 places.
[2022-06-08 20:32:52] [INFO ] Transformed 29820 transitions.
[2022-06-08 20:32:52] [INFO ] Parsed PT model containing 10644 places and 29820 transitions in 1987 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 54 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 10644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10643 transition count 29820
Applied a total of 1 rules in 4739 ms. Remains 10643 /10644 variables (removed 1) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:33:06] [INFO ] Computed 72 place invariants in 7598 ms
[2022-06-08 20:33:08] [INFO ] Implicit Places using invariants in 10005 ms returned []
Implicit Place search using SMT only with invariants took 10067 ms to find 0 implicit places.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:33:15] [INFO ] Computed 72 place invariants in 7208 ms
[2022-06-08 20:33:17] [INFO ] Dead Transitions using invariants and state equation in 9559 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 10643/10644 places, 29820/29820 transitions.
Finished structural reductions, in 1 iterations. Remains : 10643/10644 places, 29820/29820 transitions.
Support contains 40 out of 10643 places after structural reductions.
[2022-06-08 20:33:20] [INFO ] Flatten gal took : 1670 ms
[2022-06-08 20:33:21] [INFO ] Flatten gal took : 1222 ms
[2022-06-08 20:33:23] [INFO ] Input system was already deterministic with 29820 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1370 ms. (steps per millisecond=7 ) properties (out of 30) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:33:32] [INFO ] Computed 72 place invariants in 7630 ms
[2022-06-08 20:33:41] [INFO ] [Real]Absence check using 70 positive place invariants in 245 ms returned sat
[2022-06-08 20:33:41] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 436 ms returned sat
[2022-06-08 20:33:57] [INFO ] After 11256ms SMT Verify possible using state equation in real domain returned unsat :0 sat :21
[2022-06-08 20:33:58] [INFO ] State equation strengthened by 9730 read => feed constraints.
[2022-06-08 20:33:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 20:33:58] [INFO ] After 25245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 29 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 482 transitions
Trivial Post-agglo rules discarded 482 transitions
Performed 482 trivial Post agglomeration. Transition count delta: 482
Iterating post reduction 0 with 482 rules applied. Total rules applied 482 place count 10643 transition count 29338
Reduce places removed 482 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 483 rules applied. Total rules applied 965 place count 10161 transition count 29337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 966 place count 10160 transition count 29337
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 966 place count 10160 transition count 29336
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 968 place count 10159 transition count 29336
Performed 4814 Post agglomeration using F-continuation condition.Transition count delta: 4814
Deduced a syphon composed of 4814 places in 26 ms
Reduce places removed 4814 places and 0 transitions.
Iterating global reduction 3 with 9628 rules applied. Total rules applied 10596 place count 5345 transition count 24522
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 10601 place count 5345 transition count 24517
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 10606 place count 5340 transition count 24517
Partial Free-agglomeration rule applied 4965 times.
Drop transitions removed 4965 transitions
Iterating global reduction 4 with 4965 rules applied. Total rules applied 15571 place count 5340 transition count 24517
Partial Free-agglomeration rule applied 70 times.
Drop transitions removed 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 15641 place count 5340 transition count 24517
Applied a total of 15641 rules in 16361 ms. Remains 5340 /10643 variables (removed 5303) and now considering 24517/29820 (removed 5303) transitions.
Finished structural reductions, in 1 iterations. Remains : 5340/10643 places, 24517/29820 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 952 ms. (steps per millisecond=10 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2022-06-08 20:34:15] [INFO ] Flow matrix only has 24510 transitions (discarded 7 similar events)
// Phase 1: matrix 24510 rows 5340 cols
[2022-06-08 20:34:17] [INFO ] Computed 72 place invariants in 1812 ms
[2022-06-08 20:34:20] [INFO ] [Real]Absence check using 70 positive place invariants in 121 ms returned sat
[2022-06-08 20:34:20] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 172 ms returned sat
[2022-06-08 20:34:42] [INFO ] After 19413ms SMT Verify possible using state equation in real domain returned unsat :0 sat :14
[2022-06-08 20:34:43] [INFO ] State equation strengthened by 24246 read => feed constraints.
[2022-06-08 20:34:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 20:34:43] [INFO ] After 25617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 15 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 21 out of 5340 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5340/5340 places, 24517/24517 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 5335 transition count 24512
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 5335 transition count 24512
Applied a total of 12 rules in 6296 ms. Remains 5335 /5340 variables (removed 5) and now considering 24512/24517 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 5335/5340 places, 24512/24517 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 972 ms. (steps per millisecond=10 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2022-06-08 20:34:50] [INFO ] Flow matrix only has 24507 transitions (discarded 5 similar events)
// Phase 1: matrix 24507 rows 5335 cols
[2022-06-08 20:34:52] [INFO ] Computed 72 place invariants in 1860 ms
[2022-06-08 20:34:54] [INFO ] [Real]Absence check using 70 positive place invariants in 121 ms returned sat
[2022-06-08 20:34:54] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 137 ms returned sat
[2022-06-08 20:35:17] [INFO ] After 21593ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11
[2022-06-08 20:35:18] [INFO ] State equation strengthened by 24260 read => feed constraints.
[2022-06-08 20:35:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 20:35:18] [INFO ] After 25558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 15 out of 5335 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5335/5335 places, 24512/24512 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5334 transition count 24511
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 5334 transition count 24511
Applied a total of 5 rules in 6569 ms. Remains 5334 /5335 variables (removed 1) and now considering 24511/24512 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 5334/5335 places, 24511/24512 transitions.
Computed a total of 282 stabilizing places and 490 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 3243 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:35:35] [INFO ] Computed 72 place invariants in 6969 ms
[2022-06-08 20:35:37] [INFO ] Implicit Places using invariants in 8631 ms returned []
Implicit Place search using SMT only with invariants took 8636 ms to find 0 implicit places.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:35:43] [INFO ] Computed 72 place invariants in 6774 ms
[2022-06-08 20:35:45] [INFO ] Dead Transitions using invariants and state equation in 8227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 390 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LT s9762 1) (OR (LT s740 1) (LT s749 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 33333 reset in 7732 ms.
Product exploration explored 100000 steps with 33333 reset in 6786 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-00 finished in 35488 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F(!((F(p0) U p0) U (G(p1) U p1))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 10643 transition count 29331
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 18 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10636 place count 5325 transition count 24502
Applied a total of 10636 rules in 10848 ms. Remains 5325 /10643 variables (removed 5318) and now considering 24502/29820 (removed 5318) transitions.
[2022-06-08 20:36:11] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2022-06-08 20:36:14] [INFO ] Computed 72 place invariants in 2476 ms
[2022-06-08 20:36:16] [INFO ] Implicit Places using invariants in 4732 ms returned []
Implicit Place search using SMT only with invariants took 4735 ms to find 0 implicit places.
[2022-06-08 20:36:16] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2022-06-08 20:36:18] [INFO ] Computed 72 place invariants in 2624 ms
[2022-06-08 20:36:47] [INFO ] Dead Transitions using invariants and state equation in 31521 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5325/10643 places, 24502/29820 transitions.
Finished structural reductions, in 1 iterations. Remains : 5325/10643 places, 24502/29820 transitions.
Stuttering acceptance computed with spot in 200 ms :[p1, p1, (AND p0 p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s383 1) (GEQ s696 1)), p1:(GEQ s5064 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 284 reset in 2656 ms.
Product exploration explored 100000 steps with 284 reset in 3348 ms.
Computed a total of 214 stabilizing places and 351 stable transitions
Computed a total of 214 stabilizing places and 351 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 429 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 134 ms :[p1, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 28 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-08 20:36:55] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2022-06-08 20:36:57] [INFO ] Computed 72 place invariants in 2143 ms
[2022-06-08 20:36:58] [INFO ] [Real]Absence check using 70 positive place invariants in 71 ms returned sat
[2022-06-08 20:36:58] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 105 ms returned sat
[2022-06-08 20:37:12] [INFO ] After 13702ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 20:37:12] [INFO ] State equation strengthened by 14627 read => feed constraints.
[2022-06-08 20:37:15] [INFO ] After 3187ms SMT Verify possible using 14627 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 20:37:15] [INFO ] After 18399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 20:37:16] [INFO ] [Nat]Absence check using 70 positive place invariants in 72 ms returned sat
[2022-06-08 20:37:17] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 107 ms returned sat
[2022-06-08 20:37:30] [INFO ] After 13506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 20:37:38] [INFO ] After 8183ms SMT Verify possible using 14627 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 20:37:40] [INFO ] After 9629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 545 ms.
[2022-06-08 20:37:40] [INFO ] After 25079ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5325 transition count 24500
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 4970 times.
Drop transitions removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4974 place count 5323 transition count 24500
Applied a total of 4974 rules in 5848 ms. Remains 5323 /5325 variables (removed 2) and now considering 24500/24502 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5325 places, 24500/24502 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 61259 steps, run timeout after 3002 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61259 steps, saw 51430 distinct states, run finished after 3005 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-08 20:37:50] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
// Phase 1: matrix 24499 rows 5323 cols
[2022-06-08 20:37:51] [INFO ] Computed 72 place invariants in 1847 ms
[2022-06-08 20:37:53] [INFO ] [Real]Absence check using 70 positive place invariants in 85 ms returned sat
[2022-06-08 20:37:53] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 100 ms returned sat
[2022-06-08 20:38:09] [INFO ] After 15828ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 20:38:09] [INFO ] State equation strengthened by 24286 read => feed constraints.
[2022-06-08 20:38:15] [INFO ] After 5990ms SMT Verify possible using 24286 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 20:38:15] [INFO ] After 23591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 20:38:16] [INFO ] [Nat]Absence check using 70 positive place invariants in 74 ms returned sat
[2022-06-08 20:38:16] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 108 ms returned sat
[2022-06-08 20:38:33] [INFO ] After 16279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 20:38:37] [INFO ] After 4797ms SMT Verify possible using 24286 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 20:38:39] [INFO ] After 6322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1059 ms.
[2022-06-08 20:38:40] [INFO ] After 24998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 5323 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 4778 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 3654 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
[2022-06-08 20:38:49] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
// Phase 1: matrix 24499 rows 5323 cols
[2022-06-08 20:38:50] [INFO ] Computed 72 place invariants in 1833 ms
[2022-06-08 20:38:51] [INFO ] Implicit Places using invariants in 2693 ms returned []
Implicit Place search using SMT only with invariants took 2699 ms to find 0 implicit places.
[2022-06-08 20:38:51] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
// Phase 1: matrix 24499 rows 5323 cols
[2022-06-08 20:38:54] [INFO ] Computed 72 place invariants in 2450 ms
[2022-06-08 20:38:55] [INFO ] Dead Transitions using invariants and state equation in 3347 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (OR p0 p1)), (F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 553 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 121 ms :[p1, p1, (AND p0 p1)]
Support contains 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Applied a total of 0 rules in 1688 ms. Remains 5325 /5325 variables (removed 0) and now considering 24502/24502 (removed 0) transitions.
[2022-06-08 20:38:57] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2022-06-08 20:38:59] [INFO ] Computed 72 place invariants in 2351 ms
[2022-06-08 20:39:00] [INFO ] Implicit Places using invariants in 3193 ms returned []
Implicit Place search using SMT only with invariants took 3200 ms to find 0 implicit places.
[2022-06-08 20:39:00] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2022-06-08 20:39:03] [INFO ] Computed 72 place invariants in 2428 ms
[2022-06-08 20:39:29] [INFO ] Dead Transitions using invariants and state equation in 28729 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5325/5325 places, 24502/24502 transitions.
Computed a total of 214 stabilizing places and 351 stable transitions
Computed a total of 214 stabilizing places and 351 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 500 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 169 ms :[p1, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 28 resets, run finished after 947 ms. (steps per millisecond=10 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 45589 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 45589 steps, saw 37763 distinct states, run finished after 3002 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 6 properties.
[2022-06-08 20:39:34] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2022-06-08 20:39:36] [INFO ] Computed 72 place invariants in 2253 ms
[2022-06-08 20:39:38] [INFO ] [Real]Absence check using 70 positive place invariants in 81 ms returned sat
[2022-06-08 20:39:38] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 115 ms returned sat
[2022-06-08 20:39:55] [INFO ] After 16889ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2022-06-08 20:39:55] [INFO ] State equation strengthened by 14627 read => feed constraints.
[2022-06-08 20:40:01] [INFO ] After 6053ms SMT Verify possible using 14627 Read/Feed constraints in real domain returned unsat :0 sat :1 real:4
[2022-06-08 20:40:01] [INFO ] After 6056ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-08 20:40:01] [INFO ] After 25052ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2022-06-08 20:40:03] [INFO ] [Nat]Absence check using 70 positive place invariants in 95 ms returned sat
[2022-06-08 20:40:03] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 120 ms returned sat
[2022-06-08 20:40:26] [INFO ] After 22310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-08 20:40:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 20:40:26] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1 real:4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 102 ms.
Support contains 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5325 transition count 24500
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 4970 times.
Drop transitions removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4974 place count 5323 transition count 24500
Applied a total of 4974 rules in 9804 ms. Remains 5323 /5325 variables (removed 2) and now considering 24500/24502 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5325 places, 24500/24502 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 447 ms. (steps per millisecond=22 ) 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 30 ms. (steps per millisecond=333 ) 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
Interrupted probabilistic random walk after 54625 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54625 steps, saw 50437 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-08 20:40:40] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
// Phase 1: matrix 24499 rows 5323 cols
[2022-06-08 20:40:42] [INFO ] Computed 72 place invariants in 2250 ms
[2022-06-08 20:40:43] [INFO ] [Real]Absence check using 70 positive place invariants in 88 ms returned sat
[2022-06-08 20:40:44] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 119 ms returned sat
[2022-06-08 20:41:03] [INFO ] After 19119ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-06-08 20:41:03] [INFO ] State equation strengthened by 24286 read => feed constraints.
[2022-06-08 20:41:07] [INFO ] After 4014ms SMT Verify possible using 24286 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 20:41:07] [INFO ] After 4016ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 20:41:07] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 20:41:08] [INFO ] [Nat]Absence check using 70 positive place invariants in 90 ms returned sat
[2022-06-08 20:41:08] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 115 ms returned sat
[2022-06-08 20:41:30] [INFO ] After 21495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-08 20:41:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 20:41:32] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 5323 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 2863 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 2192 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
[2022-06-08 20:41:37] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
// Phase 1: matrix 24499 rows 5323 cols
[2022-06-08 20:41:40] [INFO ] Computed 72 place invariants in 2310 ms
[2022-06-08 20:41:40] [INFO ] Implicit Places using invariants in 3147 ms returned []
Implicit Place search using SMT only with invariants took 3165 ms to find 0 implicit places.
[2022-06-08 20:41:40] [INFO ] Flow matrix only has 24499 transitions (discarded 1 similar events)
// Phase 1: matrix 24499 rows 5323 cols
[2022-06-08 20:41:42] [INFO ] Computed 72 place invariants in 1953 ms
[2022-06-08 20:41:43] [INFO ] Dead Transitions using invariants and state equation in 2776 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (OR p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 515 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 128 ms :[p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 140 ms :[p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 158 ms :[p1, p1, (AND p0 p1)]
Product exploration explored 100000 steps with 283 reset in 2977 ms.
Product exploration explored 100000 steps with 282 reset in 2912 ms.
Built C files in :
/tmp/ltsmin13595748738118600184
[2022-06-08 20:41:50] [INFO ] Too many transitions (24502) to apply POR reductions. Disabling POR matrices.
[2022-06-08 20:41:51] [INFO ] Built C files in 395ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13595748738118600184
Running compilation step : cd /tmp/ltsmin13595748738118600184;'/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/ltsmin13595748738118600184;'/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/ltsmin13595748738118600184;'/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 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Applied a total of 0 rules in 1858 ms. Remains 5325 /5325 variables (removed 0) and now considering 24502/24502 (removed 0) transitions.
[2022-06-08 20:41:55] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2022-06-08 20:41:58] [INFO ] Computed 72 place invariants in 2490 ms
[2022-06-08 20:42:00] [INFO ] Implicit Places using invariants in 4619 ms returned []
Implicit Place search using SMT only with invariants took 4641 ms to find 0 implicit places.
[2022-06-08 20:42:00] [INFO ] Flow matrix only has 19811 transitions (discarded 4691 similar events)
// Phase 1: matrix 19811 rows 5325 cols
[2022-06-08 20:42:03] [INFO ] Computed 72 place invariants in 2390 ms
[2022-06-08 20:42:03] [INFO ] Dead Transitions using invariants and state equation in 3221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5325/5325 places, 24502/24502 transitions.
Built C files in :
/tmp/ltsmin4038418724727786880
[2022-06-08 20:42:03] [INFO ] Too many transitions (24502) to apply POR reductions. Disabling POR matrices.
[2022-06-08 20:42:04] [INFO ] Built C files in 250ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4038418724727786880
Running compilation step : cd /tmp/ltsmin4038418724727786880;'/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/ltsmin4038418724727786880;'/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/ltsmin4038418724727786880;'/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 20:42:09] [INFO ] Flatten gal took : 761 ms
[2022-06-08 20:42:10] [INFO ] Flatten gal took : 819 ms
[2022-06-08 20:42:10] [INFO ] Time to serialize gal into /tmp/LTL17082379186898426034.gal : 341 ms
[2022-06-08 20:42:10] [INFO ] Time to serialize properties into /tmp/LTL305867285134030368.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/LTL17082379186898426034.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL305867285134030368.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/LTL1708237...266
Read 1 LTL properties
Checking formula 0 : !((G(F(F(!(((F("((Node63IsInserted>=1)&&(Node3requestsent63>=1))"))U("((Node63IsInserted>=1)&&(Node3requestsent63>=1))"))U((G("(Node66...209
Formula 0 simplified : !GF!((F"((Node63IsInserted>=1)&&(Node3requestsent63>=1))" U "((Node63IsInserted>=1)&&(Node3requestsent63>=1))") U (G"(Node66GiveAnsw...194
Detected timeout of ITS tools.
[2022-06-08 20:42:26] [INFO ] Flatten gal took : 736 ms
[2022-06-08 20:42:26] [INFO ] Applying decomposition
[2022-06-08 20:42:27] [INFO ] Flatten gal took : 830 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/graph993867773361506433.txt' '-o' '/tmp/graph993867773361506433.bin' '-w' '/tmp/graph993867773361506433.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph993867773361506433.bin' '-l' '-1' '-v' '-w' '/tmp/graph993867773361506433.weights' '-q' '0' '-e' '0.001'
[2022-06-08 20:42:29] [INFO ] Decomposing Gal with order
[2022-06-08 20:42:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 20:42:36] [INFO ] Removed a total of 19429 redundant transitions.
[2022-06-08 20:42:37] [INFO ] Flatten gal took : 6576 ms
[2022-06-08 20:42:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 14352 labels/synchronizations in 18006 ms.
[2022-06-08 20:42:56] [INFO ] Time to serialize gal into /tmp/LTL13484790391338284759.gal : 226 ms
[2022-06-08 20:42:56] [INFO ] Time to serialize properties into /tmp/LTL1177186005965102525.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/LTL13484790391338284759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1177186005965102525.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/LTL1348479...246
Read 1 LTL properties
Checking formula 0 : !((G(F(F(!(((F("((u64.Node63IsInserted>=1)&&(u4.Node3requestsent63>=1))"))U("((u64.Node63IsInserted>=1)&&(u4.Node3requestsent63>=1))")...231
Formula 0 simplified : !GF!((F"((u64.Node63IsInserted>=1)&&(u4.Node3requestsent63>=1))" U "((u64.Node63IsInserted>=1)&&(u4.Node3requestsent63>=1))") U (G"(...216
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14842978785527910701
[2022-06-08 20:43:12] [INFO ] Built C files in 301ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14842978785527910701
Running compilation step : cd /tmp/ltsmin14842978785527910701;'/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/ltsmin14842978785527910701;'/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/ltsmin14842978785527910701;'/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-070-LTLFireability-01 finished in 434682 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1 U p2)||G(p3))))'
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 12567 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:43:42] [INFO ] Computed 72 place invariants in 14938 ms
[2022-06-08 20:43:46] [INFO ] Implicit Places using invariants in 18363 ms returned []
Implicit Place search using SMT only with invariants took 18364 ms to find 0 implicit places.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:43:59] [INFO ] Computed 72 place invariants in 12926 ms
[2022-06-08 20:44:02] [INFO ] Dead Transitions using invariants and state equation in 16159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 497 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s8106 1) (GEQ s1684 1)), p2:(GEQ s9678 1), p1:(GEQ s9736 1), p3:(GEQ s1348 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 timeout after 67980 steps with 33990 reset in 10001 ms.
Product exploration timeout after 46540 steps with 23270 reset in 10001 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3)))
Knowledge based reduction with 14 factoid took 722 ms. Reduced automaton from 5 states, 10 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-02 finished in 68859 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4828 Post agglomeration using F-continuation condition.Transition count delta: 4828
Deduced a syphon composed of 4828 places in 31 ms
Reduce places removed 4828 places and 0 transitions.
Iterating global reduction 2 with 9656 rules applied. Total rules applied 10636 place count 5325 transition count 24502
Applied a total of 10636 rules in 21465 ms. Remains 5325 /10643 variables (removed 5318) and now considering 24502/29820 (removed 5318) transitions.
[2022-06-08 20:44:45] [INFO ] Flow matrix only has 19812 transitions (discarded 4690 similar events)
// Phase 1: matrix 19812 rows 5325 cols
[2022-06-08 20:44:50] [INFO ] Computed 72 place invariants in 4335 ms
[2022-06-08 20:44:51] [INFO ] Implicit Places using invariants in 5209 ms returned []
Implicit Place search using SMT only with invariants took 5210 ms to find 0 implicit places.
[2022-06-08 20:44:51] [INFO ] Flow matrix only has 19812 transitions (discarded 4690 similar events)
// Phase 1: matrix 19812 rows 5325 cols
[2022-06-08 20:44:55] [INFO ] Computed 72 place invariants in 4055 ms
[2022-06-08 20:44:56] [INFO ] Dead Transitions using invariants and state equation in 5153 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5325/10643 places, 24502/29820 transitions.
Finished structural reductions, in 1 iterations. Remains : 5325/10643 places, 24502/29820 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1956 1), p1:(LT s1713 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 284 reset in 5617 ms.
Product exploration explored 100000 steps with 285 reset in 5459 ms.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 480 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 27 resets, run finished after 743 ms. (steps per millisecond=13 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-08 20:45:09] [INFO ] Flow matrix only has 19812 transitions (discarded 4690 similar events)
// Phase 1: matrix 19812 rows 5325 cols
[2022-06-08 20:45:14] [INFO ] Computed 72 place invariants in 4985 ms
[2022-06-08 20:45:15] [INFO ] [Real]Absence check using 70 positive place invariants in 114 ms returned sat
[2022-06-08 20:45:15] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 234 ms returned sat
[2022-06-08 20:45:39] [INFO ] After 25042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5324 transition count 24501
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 5324 transition count 24500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 4971 times.
Drop transitions removed 4971 transitions
Iterating global reduction 1 with 4971 rules applied. Total rules applied 4975 place count 5323 transition count 24500
Applied a total of 4975 rules in 25292 ms. Remains 5323 /5325 variables (removed 2) and now considering 24500/24502 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5325 places, 24500/24502 transitions.
Finished random walk after 1150 steps, including 2 resets, run visited all 1 properties in 46 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 334 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Applied a total of 0 rules in 4008 ms. Remains 5325 /5325 variables (removed 0) and now considering 24502/24502 (removed 0) transitions.
[2022-06-08 20:46:09] [INFO ] Flow matrix only has 19812 transitions (discarded 4690 similar events)
// Phase 1: matrix 19812 rows 5325 cols
[2022-06-08 20:46:13] [INFO ] Computed 72 place invariants in 4453 ms
[2022-06-08 20:46:14] [INFO ] Implicit Places using invariants in 5506 ms returned []
Implicit Place search using SMT only with invariants took 5508 ms to find 0 implicit places.
[2022-06-08 20:46:14] [INFO ] Flow matrix only has 19812 transitions (discarded 4690 similar events)
// Phase 1: matrix 19812 rows 5325 cols
[2022-06-08 20:46:20] [INFO ] Computed 72 place invariants in 5379 ms
[2022-06-08 20:46:22] [INFO ] Dead Transitions using invariants and state equation in 7507 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5325/5325 places, 24502/24502 transitions.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 360 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 28 resets, run finished after 714 ms. (steps per millisecond=14 ) properties (out of 2) 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 1) seen :0
Running SMT prover for 1 properties.
[2022-06-08 20:46:23] [INFO ] Flow matrix only has 19812 transitions (discarded 4690 similar events)
// Phase 1: matrix 19812 rows 5325 cols
[2022-06-08 20:46:28] [INFO ] Computed 72 place invariants in 4887 ms
[2022-06-08 20:46:29] [INFO ] [Real]Absence check using 70 positive place invariants in 108 ms returned sat
[2022-06-08 20:46:30] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 139 ms returned sat
[2022-06-08 20:46:53] [INFO ] After 25041ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 5325 transition count 24501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5324 transition count 24501
Partial Free-agglomeration rule applied 4971 times.
Drop transitions removed 4971 transitions
Iterating global reduction 1 with 4971 rules applied. Total rules applied 4973 place count 5324 transition count 24501
Applied a total of 4973 rules in 11162 ms. Remains 5324 /5325 variables (removed 1) and now considering 24501/24502 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 5324/5325 places, 24501/24502 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 60271 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60271 steps, saw 51367 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 24501 rows 5324 cols
[2022-06-08 20:47:12] [INFO ] Computed 72 place invariants in 3820 ms
[2022-06-08 20:47:13] [INFO ] [Real]Absence check using 70 positive place invariants in 205 ms returned sat
[2022-06-08 20:47:14] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 309 ms returned sat
[2022-06-08 20:47:37] [INFO ] After 25058ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 7411 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5324/5324 places, 24501/24501 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 6251 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
// Phase 1: matrix 24501 rows 5324 cols
[2022-06-08 20:47:56] [INFO ] Computed 72 place invariants in 5082 ms
[2022-06-08 20:47:56] [INFO ] Implicit Places using invariants in 5926 ms returned []
Implicit Place search using SMT only with invariants took 5927 ms to find 0 implicit places.
// Phase 1: matrix 24501 rows 5324 cols
[2022-06-08 20:48:00] [INFO ] Computed 72 place invariants in 3958 ms
[2022-06-08 20:48:02] [INFO ] Dead Transitions using invariants and state equation in 5519 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5324/5324 places, 24501/24501 transitions.
Graph (trivial) has 24074 edges and 5324 vertex of which 5039 / 5324 are part of one of the 2 SCC in 127 ms
Free SCC test removed 5037 places
Drop transitions removed 19247 transitions
Ensure Unique test removed 4962 transitions
Reduce isomorphic transitions removed 24209 transitions.
Graph (complete) has 714 edges and 287 vertex of which 76 are kept as prefixes of interest. Removing 211 places using SCC suffix rule.3 ms
Discarding 211 places :
Also discarding 69 output transitions
Drop transitions removed 69 transitions
Drop transitions removed 141 transitions
Reduce isomorphic transitions removed 141 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 142 rules applied. Total rules applied 144 place count 76 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 145 place count 75 transition count 81
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 213 place count 7 transition count 13
Iterating global reduction 2 with 68 rules applied. Total rules applied 281 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 283 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 284 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 286 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 287 place count 5 transition count 8
Applied a total of 287 rules in 588 ms. Remains 5 /5324 variables (removed 5319) and now considering 8/24501 (removed 24493) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 5 cols
[2022-06-08 20:48:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-06-08 20:48:03] [INFO ] After 5ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 20:48:03] [INFO ] After 10ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-06-08 20:48:03] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-06-08 20:48:03] [INFO ] Flatten gal took : 6 ms
[2022-06-08 20:48:03] [INFO ] Flatten gal took : 0 ms
[2022-06-08 20:48:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13088676307275726906.gal : 19 ms
[2022-06-08 20:48:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality896212977039527067.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms889543916354363476;'/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/ReachabilityCardinality13088676307275726906.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality896212977039527067.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...319
Loading property file /tmp/ReachabilityCardinality896212977039527067.prop.
Reachability property apf1 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.046333,3312,2,10,6,49,6,0,27,30,0
Total reachable state count : 9

Verifying 1 reachability properties.
Reachability property apf1 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
apf1,1,0.047132,3736,2,6,6,49,7,0,32,30,0
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 611 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 284 reset in 7971 ms.
Product exploration explored 100000 steps with 283 reset in 7377 ms.
Built C files in :
/tmp/ltsmin1491675983866602212
[2022-06-08 20:48:20] [INFO ] Too many transitions (24502) to apply POR reductions. Disabling POR matrices.
[2022-06-08 20:48:21] [INFO ] Built C files in 526ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1491675983866602212
Running compilation step : cd /tmp/ltsmin1491675983866602212;'/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/ltsmin1491675983866602212;'/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/ltsmin1491675983866602212;'/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 5325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5325/5325 places, 24502/24502 transitions.
Applied a total of 0 rules in 5947 ms. Remains 5325 /5325 variables (removed 0) and now considering 24502/24502 (removed 0) transitions.
[2022-06-08 20:48:30] [INFO ] Flow matrix only has 19812 transitions (discarded 4690 similar events)
// Phase 1: matrix 19812 rows 5325 cols
[2022-06-08 20:48:35] [INFO ] Computed 72 place invariants in 5831 ms
[2022-06-08 20:48:45] [INFO ] Implicit Places using invariants in 15496 ms returned []
Implicit Place search using SMT only with invariants took 15507 ms to find 0 implicit places.
[2022-06-08 20:48:45] [INFO ] Flow matrix only has 19812 transitions (discarded 4690 similar events)
// Phase 1: matrix 19812 rows 5325 cols
[2022-06-08 20:48:52] [INFO ] Computed 72 place invariants in 6816 ms
[2022-06-08 20:48:54] [INFO ] Dead Transitions using invariants and state equation in 8924 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5325/5325 places, 24502/24502 transitions.
Built C files in :
/tmp/ltsmin11796142797412148479
[2022-06-08 20:48:54] [INFO ] Too many transitions (24502) to apply POR reductions. Disabling POR matrices.
[2022-06-08 20:48:54] [INFO ] Built C files in 314ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11796142797412148479
Running compilation step : cd /tmp/ltsmin11796142797412148479;'/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/ltsmin11796142797412148479;'/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/ltsmin11796142797412148479;'/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 20:49:00] [INFO ] Flatten gal took : 1296 ms
[2022-06-08 20:49:01] [INFO ] Flatten gal took : 1616 ms
[2022-06-08 20:49:02] [INFO ] Time to serialize gal into /tmp/LTL11529144314174602583.gal : 204 ms
[2022-06-08 20:49:02] [INFO ] Time to serialize properties into /tmp/LTL15481045601100652134.ltl : 13 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/LTL11529144314174602583.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15481045601100652134.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/LTL1152914...268
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-06-08 20:49:18] [INFO ] Flatten gal took : 1598 ms
[2022-06-08 20:49:18] [INFO ] Applying decomposition
[2022-06-08 20:49:20] [INFO ] Flatten gal took : 1600 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/graph11314280209969262202.txt' '-o' '/tmp/graph11314280209969262202.bin' '-w' '/tmp/graph11314280209969262202.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11314280209969262202.bin' '-l' '-1' '-v' '-w' '/tmp/graph11314280209969262202.weights' '-q' '0' '-e' '0.001'
[2022-06-08 20:49:24] [INFO ] Decomposing Gal with order
[2022-06-08 20:49:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 20:49:37] [INFO ] Removed a total of 19398 redundant transitions.
[2022-06-08 20:49:39] [INFO ] Flatten gal took : 12434 ms
[2022-06-08 20:49:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 14351 labels/synchronizations in 12964 ms.
[2022-06-08 20:49:53] [INFO ] Time to serialize gal into /tmp/LTL8740686656479145337.gal : 417 ms
[2022-06-08 20:49:53] [INFO ] Time to serialize properties into /tmp/LTL16997513052950782980.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/LTL8740686656479145337.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16997513052950782980.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/LTL8740686...246
Read 1 LTL properties
Checking formula 0 : !((F(("(u63.Node21GiveAnswer62>=1)")||(G(F("(u31.Node18GiveAnswer30<1)"))))))
Formula 0 simplified : !F("(u63.Node21GiveAnswer62>=1)" | GF"(u31.Node18GiveAnswer30<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7032542846904640863
[2022-06-08 20:50:09] [INFO ] Built C files in 464ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7032542846904640863
Running compilation step : cd /tmp/ltsmin7032542846904640863;'/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/ltsmin7032542846904640863;'/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/ltsmin7032542846904640863;'/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-070-LTLFireability-03 finished in 347997 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 10643 transition count 29331
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4830 Post agglomeration using F-continuation condition.Transition count delta: 4830
Deduced a syphon composed of 4830 places in 37 ms
Reduce places removed 4830 places and 0 transitions.
Iterating global reduction 2 with 9660 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 42662 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2022-06-08 20:50:55] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
// Phase 1: matrix 19809 rows 5324 cols
[2022-06-08 20:51:02] [INFO ] Computed 72 place invariants in 7429 ms
[2022-06-08 20:51:04] [INFO ] Implicit Places using invariants in 9853 ms returned []
Implicit Place search using SMT only with invariants took 9854 ms to find 0 implicit places.
[2022-06-08 20:51:04] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
// Phase 1: matrix 19809 rows 5324 cols
[2022-06-08 20:51:13] [INFO ] Computed 72 place invariants in 8261 ms
[2022-06-08 20:51:15] [INFO ] Dead Transitions using invariants and state equation in 10563 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions, in 1 iterations. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s395 1) (GEQ s2448 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 325 steps with 0 reset in 32 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-04 finished in 63642 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 18001 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:51:59] [INFO ] Computed 72 place invariants in 24947 ms
[2022-06-08 20:52:03] [INFO ] Implicit Places using invariants in 29883 ms returned []
Implicit Place search using SMT only with invariants took 29895 ms to find 0 implicit places.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:52:30] [INFO ] Computed 72 place invariants in 26391 ms
[2022-06-08 20:52:36] [INFO ] Dead Transitions using invariants and state equation in 32204 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s8298 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 63050 steps with 36 reset in 6814 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-05 finished in 87454 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(p1)&&X(p2)&&p2))||p0)))'
Support contains 6 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 18150 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:53:30] [INFO ] Computed 72 place invariants in 28557 ms
[2022-06-08 20:53:37] [INFO ] Implicit Places using invariants in 35659 ms returned []
Implicit Place search using SMT only with invariants took 35671 ms to find 0 implicit places.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:54:05] [INFO ] Computed 72 place invariants in 27993 ms
[2022-06-08 20:54:09] [INFO ] Dead Transitions using invariants and state equation in 32423 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 740 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LT s413 1) (LT s10149 1)), p1:(AND (GEQ s32 1) (GEQ s124 1) (GEQ s497 1)), p2:(GEQ s7524 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21860 steps with 12 reset in 2086 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-06 finished in 89459 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 14201 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:54:52] [INFO ] Computed 72 place invariants in 25350 ms
[2022-06-08 20:54:59] [INFO ] Implicit Places using invariants in 32860 ms returned []
Implicit Place search using SMT only with invariants took 32861 ms to find 0 implicit places.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:55:29] [INFO ] Computed 72 place invariants in 29418 ms
[2022-06-08 20:55:36] [INFO ] Dead Transitions using invariants and state equation in 36666 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 558 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s5986 1) (LT s5227 1)), p1:(GEQ s5227 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1742 steps with 0 reset in 103 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-07 finished in 84677 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||(F(p1) U p2))))'
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 15875 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:56:18] [INFO ] Computed 72 place invariants in 24397 ms
[2022-06-08 20:56:23] [INFO ] Implicit Places using invariants in 29583 ms returned []
Implicit Place search using SMT only with invariants took 29599 ms to find 0 implicit places.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:56:56] [INFO ] Computed 72 place invariants in 33175 ms
[2022-06-08 20:57:00] [INFO ] Dead Transitions using invariants and state equation in 37260 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 711 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s35 1) (GEQ s5679 1) (GEQ s4634 1)), p1:(AND (GEQ s203 1) (GEQ s4461 1)), p0:(OR (LT s35 1) (LT s5679 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]]
Product exploration timeout after 28550 steps with 11432 reset in 10001 ms.
Product exploration timeout after 29470 steps with 11774 reset in 10001 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 1355 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 768 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1244 ms. (steps per millisecond=8 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) 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 7) seen :0
Interrupted probabilistic random walk after 19987 steps, run timeout after 3002 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19987 steps, saw 19638 distinct states, run finished after 3003 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 20:58:02] [INFO ] Computed 72 place invariants in 33829 ms
[2022-06-08 20:58:14] [INFO ] [Real]Absence check using 70 positive place invariants in 472 ms returned sat
[2022-06-08 20:58:15] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 865 ms returned sat
[2022-06-08 20:58:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 20:58:27] [INFO ] After 25050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Iterating post reduction 1 with 488 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 70 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10637 place count 5326 transition count 24500
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10640 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 4969 times.
Drop transitions removed 4969 transitions
Iterating global reduction 3 with 4969 rules applied. Total rules applied 15609 place count 5323 transition count 24500
Applied a total of 15609 rules in 70858 ms. Remains 5323 /10643 variables (removed 5320) and now considering 24500/29820 (removed 5320) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/10643 places, 24500/29820 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT p1))), (G (NOT (AND p2 p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 2296 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 717 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 788 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 19949 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 21:00:26] [INFO ] Computed 72 place invariants in 23738 ms
[2022-06-08 21:00:29] [INFO ] Implicit Places using invariants in 26536 ms returned []
Implicit Place search using SMT only with invariants took 26540 ms to find 0 implicit places.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 21:01:10] [INFO ] Computed 72 place invariants in 41358 ms
[2022-06-08 21:01:18] [INFO ] Dead Transitions using invariants and state equation in 49563 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10643/10643 places, 29820/29820 transitions.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 1732 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 1343 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 1419 ms. (steps per millisecond=7 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 46902 steps, run timeout after 6018 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 46902 steps, saw 46032 distinct states, run finished after 6018 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 21:02:03] [INFO ] Computed 72 place invariants in 32066 ms
[2022-06-08 21:02:13] [INFO ] [Real]Absence check using 70 positive place invariants in 504 ms returned sat
[2022-06-08 21:02:14] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 761 ms returned sat
[2022-06-08 21:02:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 21:02:28] [INFO ] After 25442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Iterating post reduction 1 with 488 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 28 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10637 place count 5326 transition count 24500
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10640 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 4969 times.
Drop transitions removed 4969 transitions
Iterating global reduction 3 with 4969 rules applied. Total rules applied 15609 place count 5323 transition count 24500
Applied a total of 15609 rules in 59677 ms. Remains 5323 /10643 variables (removed 5320) and now considering 24500/29820 (removed 5320) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/10643 places, 24500/29820 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 975 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 763 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 842 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 727 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration timeout after 44290 steps with 17786 reset in 10001 ms.
Product exploration timeout after 47230 steps with 18859 reset in 10011 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 754 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Performed 348 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 10643 transition count 29820
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 72 Pre rules applied. Total rules applied 348 place count 10643 transition count 29820
Deduced a syphon composed of 420 places in 46 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 420 place count 10643 transition count 29820
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 560 place count 10503 transition count 29680
Deduced a syphon composed of 280 places in 38 ms
Iterating global reduction 1 with 140 rules applied. Total rules applied 700 place count 10503 transition count 29680
Performed 4897 Post agglomeration using F-continuation condition.Transition count delta: -9518
Deduced a syphon composed of 5177 places in 33 ms
Iterating global reduction 1 with 4897 rules applied. Total rules applied 5597 place count 10503 transition count 39198
Discarding 276 places :
Symmetric choice reduction at 1 with 276 rule applications. Total rules 5873 place count 10227 transition count 38922
Deduced a syphon composed of 4901 places in 45 ms
Iterating global reduction 1 with 276 rules applied. Total rules applied 6149 place count 10227 transition count 38922
Deduced a syphon composed of 4901 places in 27 ms
Applied a total of 6149 rules in 110324 ms. Remains 10227 /10643 variables (removed 416) and now considering 38922/29820 (removed -9102) transitions.
[2022-06-08 21:05:43] [INFO ] Flow matrix only has 34231 transitions (discarded 4691 similar events)
// Phase 1: matrix 34231 rows 10227 cols
[2022-06-08 21:06:09] [INFO ] Computed 72 place invariants in 25723 ms
[2022-06-08 21:06:12] [INFO ] Dead Transitions using invariants and state equation in 28763 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10227/10643 places, 38922/29820 transitions.
Finished structural reductions, in 1 iterations. Remains : 10227/10643 places, 38922/29820 transitions.
Product exploration timeout after 2890 steps with 1166 reset in 10047 ms.
Product exploration timeout after 3080 steps with 1254 reset in 10054 ms.
Built C files in :
/tmp/ltsmin5065592835406579162
[2022-06-08 21:06:33] [INFO ] Built C files in 598ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5065592835406579162
Running compilation step : cd /tmp/ltsmin5065592835406579162;'/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/ltsmin5065592835406579162;'/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/ltsmin5065592835406579162;'/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 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 15458 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2022-06-08 21:07:16] [INFO ] Computed 72 place invariants in 24621 ms
[2022-06-08 21:07:19] [INFO ] Implicit Places using invariants in 27938 ms returned []
Implicit Place search using SMT only with invariants took 27941 ms to find 0 implicit places.
// Phase 1: matrix 29820 rows 10643 cols

BK_STOP 1654722487750

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-070"
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-070, 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-165463872400060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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