Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505300171.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CANInsertWithFailure-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505300171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 60M May 18 16:42 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-100-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716265770427

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 04:29:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 04:29:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 04:29:33] [INFO ] Load time of PNML (sax parser for PT used): 1322 ms
[2024-05-21 04:29:33] [INFO ] Transformed 21204 places.
[2024-05-21 04:29:33] [INFO ] Transformed 60600 transitions.
[2024-05-21 04:29:33] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1613 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 21204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21204/21204 places, 60600/60600 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21203 transition count 60600
Applied a total of 1 rules in 9503 ms. Remains 21203 /21204 variables (removed 1) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2024-05-21 04:30:11] [INFO ] Computed 102 invariants in 28301 ms
[2024-05-21 04:30:46] [INFO ] Performed 847/21203 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 04:31:05] [INFO ] Implicit Places using invariants in 81979 ms returned []
Implicit Place search using SMT only with invariants took 82012 ms to find 0 implicit places.
Running 60500 sub problems to find dead transitions.
[2024-05-21 04:31:06] [INFO ] Invariant cache hit.
[2024-05-21 04:31:06] [INFO ] State equation strengthened by 19900 read => feed constraints.
SMT process timed out in 440408ms, After SMT, problems are : Problem set: 0 solved, 60500 unsolved
Search for dead transitions found 0 dead transitions in 440970ms
Starting structural reductions in LTL mode, iteration 1 : 21203/21204 places, 60600/60600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532694 ms. Remains : 21203/21204 places, 60600/60600 transitions.
Support contains 34 out of 21203 places after structural reductions.
[2024-05-21 04:38:28] [INFO ] Flatten gal took : 1497 ms
[2024-05-21 04:38:29] [INFO ] Flatten gal took : 1184 ms
[2024-05-21 04:38:32] [INFO ] Input system was already deterministic with 60600 transitions.
RANDOM walk for 40000 steps (15 resets) in 4781 ms. (8 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 75157 steps, run timeout after 3005 ms. (steps per millisecond=25 ) properties seen :0 out of 25
Probabilistic random walk after 75157 steps, saw 74186 distinct states, run finished after 3015 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-21 04:38:37] [INFO ] Invariant cache hit.
[2024-05-21 04:38:38] [INFO ] State equation strengthened by 19900 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 20968/21001 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 21001/81803 variables, and 1 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/21203 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 20968/21001 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-21 04:38:47] [INFO ] Deduced a trap composed of 5 places in 1066 ms of which 33 ms to minimize.
[2024-05-21 04:38:48] [INFO ] Deduced a trap composed of 5 places in 953 ms of which 4 ms to minimize.
SMT process timed out in 10981ms, After SMT, problems are : Problem set: 0 solved, 25 unsolved
Fused 25 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 33 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9880 Post agglomeration using F-continuation condition.Transition count delta: 9880
Deduced a syphon composed of 9880 places in 23 ms
Reduce places removed 9880 places and 0 transitions.
Iterating global reduction 2 with 19760 rules applied. Total rules applied 21160 place count 10623 transition count 50020
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21161 place count 10623 transition count 50019
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21162 place count 10622 transition count 50019
Partial Free-agglomeration rule applied 10088 times.
Drop transitions (Partial Free agglomeration) removed 10088 transitions
Iterating global reduction 3 with 10088 rules applied. Total rules applied 31250 place count 10622 transition count 50019
Applied a total of 31250 rules in 29120 ms. Remains 10622 /21203 variables (removed 10581) and now considering 50019/60600 (removed 10581) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29122 ms. Remains : 10622/21203 places, 50019/60600 transitions.
RANDOM walk for 40000 steps (64 resets) in 3313 ms. (12 steps per ms) remains 21/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
[2024-05-21 04:39:18] [INFO ] Flow matrix only has 50006 transitions (discarded 13 similar events)
// Phase 1: matrix 50006 rows 10622 cols
[2024-05-21 04:39:29] [INFO ] Computed 102 invariants in 10553 ms
[2024-05-21 04:39:30] [INFO ] State equation strengthened by 49634 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 10396/10420 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10420 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 198/10618 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10618 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 2/10620 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10620 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 60626/60628 variables, and 10722 constraints, problems are : Problem set: 0 solved, 21 unsolved in 45047 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 10620/10622 constraints, ReadFeed: 0/49634 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 10396/10420 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-21 04:40:17] [INFO ] Deduced a trap composed of 2 places in 461 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10420 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10420 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 198/10618 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10618 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 2/10620 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-21 04:41:17] [INFO ] Deduced a trap composed of 111 places in 35974 ms of which 78 ms to minimize.
SMT process timed out in 118550ms, After SMT, problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 24 out of 10622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10622/10622 places, 50019/50019 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 10619 transition count 50016
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 10619 transition count 50016
Applied a total of 12 rules in 18404 ms. Remains 10619 /10622 variables (removed 3) and now considering 50016/50019 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18406 ms. Remains : 10619/10622 places, 50016/50019 transitions.
Computed a total of 402 stabilizing places and 700 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9900 Post agglomeration using F-continuation condition.Transition count delta: 9900
Deduced a syphon composed of 9900 places in 24 ms
Reduce places removed 9900 places and 0 transitions.
Iterating global reduction 2 with 19800 rules applied. Total rules applied 21200 place count 10603 transition count 50000
Applied a total of 21200 rules in 17631 ms. Remains 10603 /21203 variables (removed 10600) and now considering 50000/60600 (removed 10600) transitions.
[2024-05-21 04:41:53] [INFO ] Flow matrix only has 40298 transitions (discarded 9702 similar events)
// Phase 1: matrix 40298 rows 10603 cols
[2024-05-21 04:42:02] [INFO ] Computed 102 invariants in 9095 ms
[2024-05-21 04:42:28] [INFO ] Implicit Places using invariants in 34418 ms returned []
Implicit Place search using SMT only with invariants took 34419 ms to find 0 implicit places.
Running 49900 sub problems to find dead transitions.
[2024-05-21 04:42:28] [INFO ] Flow matrix only has 40298 transitions (discarded 9702 similar events)
[2024-05-21 04:42:28] [INFO ] Invariant cache hit.
[2024-05-21 04:42:29] [INFO ] State equation strengthened by 29898 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10602 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 49900 unsolved
SMT process timed out in 322110ms, After SMT, problems are : Problem set: 0 solved, 49900 unsolved
Search for dead transitions found 0 dead transitions in 322536ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10603/21203 places, 50000/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 374651 ms. Remains : 10603/21203 places, 50000/60600 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-00
Stuttering criterion allowed to conclude after 515 steps with 0 reset in 48 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-00 finished in 375030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9899 Post agglomeration using F-continuation condition.Transition count delta: 9899
Deduced a syphon composed of 9899 places in 21 ms
Reduce places removed 9899 places and 0 transitions.
Iterating global reduction 2 with 19798 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Applied a total of 21198 rules in 16060 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
[2024-05-21 04:48:07] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
// Phase 1: matrix 40300 rows 10604 cols
[2024-05-21 04:48:16] [INFO ] Computed 102 invariants in 9571 ms
[2024-05-21 04:48:41] [INFO ] Implicit Places using invariants in 34508 ms returned []
Implicit Place search using SMT only with invariants took 34510 ms to find 0 implicit places.
Running 49901 sub problems to find dead transitions.
[2024-05-21 04:48:42] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2024-05-21 04:48:42] [INFO ] Invariant cache hit.
[2024-05-21 04:48:42] [INFO ] State equation strengthened by 29897 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10603/50904 variables, and 100 constraints, problems are : Problem set: 0 solved, 49901 unsolved in 30584 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10604 constraints, ReadFeed: 0/29897 constraints, PredecessorRefiner: 49901/49901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10603/50904 variables, and 100 constraints, problems are : Problem set: 0 solved, 49901 unsolved in 30539 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10604 constraints, ReadFeed: 0/29897 constraints, PredecessorRefiner: 0/49901 constraints, Known Traps: 0/0 constraints]
After SMT, in 336136ms problems are : Problem set: 0 solved, 49901 unsolved
Search for dead transitions found 0 dead transitions in 336621ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10604/21203 places, 50001/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 387269 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-01
Product exploration explored 100000 steps with 198 reset in 3992 ms.
Product exploration explored 100000 steps with 198 reset in 3672 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 40000 steps (76 resets) in 2119 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 66722 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 66722 steps, saw 64655 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-21 04:54:30] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2024-05-21 04:54:30] [INFO ] Invariant cache hit.
[2024-05-21 04:54:30] [INFO ] State equation strengthened by 29897 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10401/10402 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 04:54:32] [INFO ] Deduced a trap composed of 2 places in 545 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10402 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10402 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 198/10600 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10600 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/10602 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 04:55:08] [INFO ] Deduced a trap composed of 106 places in 34176 ms of which 59 ms to minimize.
SMT process timed out in 38002ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10604 transition count 50000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10603 transition count 50000
Partial Free-agglomeration rule applied 10101 times.
Drop transitions (Partial Free agglomeration) removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10603 transition count 50000
Applied a total of 10103 rules in 15089 ms. Remains 10603 /10604 variables (removed 1) and now considering 50000/50001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15092 ms. Remains : 10603/10604 places, 50000/50001 transitions.
RANDOM walk for 30543 steps (48 resets) in 1797 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 5188 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2024-05-21 04:55:29] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2024-05-21 04:55:29] [INFO ] Invariant cache hit.
[2024-05-21 04:55:54] [INFO ] Implicit Places using invariants in 25160 ms returned []
Implicit Place search using SMT only with invariants took 25164 ms to find 0 implicit places.
Running 49901 sub problems to find dead transitions.
[2024-05-21 04:55:55] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2024-05-21 04:55:55] [INFO ] Invariant cache hit.
[2024-05-21 04:55:55] [INFO ] State equation strengthened by 29897 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10603/50904 variables, and 100 constraints, problems are : Problem set: 0 solved, 49901 unsolved in 30604 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10604 constraints, ReadFeed: 0/29897 constraints, PredecessorRefiner: 49901/49901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10603/50904 variables, and 100 constraints, problems are : Problem set: 0 solved, 49901 unsolved in 30587 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10604 constraints, ReadFeed: 0/29897 constraints, PredecessorRefiner: 0/49901 constraints, Known Traps: 0/0 constraints]
After SMT, in 334032ms problems are : Problem set: 0 solved, 49901 unsolved
Search for dead transitions found 0 dead transitions in 334570ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 364981 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 35253 steps (67 resets) in 2098 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 199 reset in 4363 ms.
Product exploration explored 100000 steps with 199 reset in 4087 ms.
Built C files in :
/tmp/ltsmin10825772767927456008
[2024-05-21 05:01:39] [INFO ] Too many transitions (50001) to apply POR reductions. Disabling POR matrices.
[2024-05-21 05:01:39] [INFO ] Built C files in 405ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10825772767927456008
Running compilation step : cd /tmp/ltsmin10825772767927456008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin10825772767927456008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin10825772767927456008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4380 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2024-05-21 05:01:47] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2024-05-21 05:01:47] [INFO ] Invariant cache hit.
[2024-05-21 05:02:12] [INFO ] Implicit Places using invariants in 25360 ms returned []
Implicit Place search using SMT only with invariants took 25361 ms to find 0 implicit places.
Running 49901 sub problems to find dead transitions.
[2024-05-21 05:02:12] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2024-05-21 05:02:12] [INFO ] Invariant cache hit.
[2024-05-21 05:02:13] [INFO ] State equation strengthened by 29897 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10603 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 49901 unsolved
SMT process timed out in 275916ms, After SMT, problems are : Problem set: 0 solved, 49901 unsolved
Search for dead transitions found 0 dead transitions in 276316ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 306115 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Built C files in :
/tmp/ltsmin3537703031458353915
[2024-05-21 05:06:48] [INFO ] Too many transitions (50001) to apply POR reductions. Disabling POR matrices.
[2024-05-21 05:06:49] [INFO ] Built C files in 344ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3537703031458353915
Running compilation step : cd /tmp/ltsmin3537703031458353915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin3537703031458353915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin3537703031458353915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 05:06:54] [INFO ] Flatten gal took : 783 ms
[2024-05-21 05:06:54] [INFO ] Flatten gal took : 800 ms
[2024-05-21 05:06:55] [INFO ] Time to serialize gal into /tmp/LTL7213066703590677703.gal : 224 ms
[2024-05-21 05:06:55] [INFO ] Time to serialize properties into /tmp/LTL16393642092436527740.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7213066703590677703.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6623551305977806541.hoa' '-atoms' '/tmp/LTL16393642092436527740.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16393642092436527740.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6623551305977806541.hoa
Detected timeout of ITS tools.
[2024-05-21 05:07:11] [INFO ] Flatten gal took : 763 ms
[2024-05-21 05:07:12] [INFO ] Flatten gal took : 803 ms
[2024-05-21 05:07:12] [INFO ] Time to serialize gal into /tmp/LTL2682347238520704116.gal : 166 ms
[2024-05-21 05:07:12] [INFO ] Time to serialize properties into /tmp/LTL11522020777135419107.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2682347238520704116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11522020777135419107.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(Node31GiveAnswer61<1)"))))
Formula 0 simplified : GF!"(Node31GiveAnswer61<1)"
Detected timeout of ITS tools.
[2024-05-21 05:07:28] [INFO ] Flatten gal took : 746 ms
[2024-05-21 05:07:28] [INFO ] Applying decomposition
[2024-05-21 05:07:29] [INFO ] Flatten gal took : 781 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3477690427939610890.txt' '-o' '/tmp/graph3477690427939610890.bin' '-w' '/tmp/graph3477690427939610890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3477690427939610890.bin' '-l' '-1' '-v' '-w' '/tmp/graph3477690427939610890.weights' '-q' '0' '-e' '0.001'
[2024-05-21 05:07:32] [INFO ] Decomposing Gal with order
[2024-05-21 05:07:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 05:07:41] [INFO ] Removed a total of 39739 redundant transitions.
[2024-05-21 05:07:43] [INFO ] Flatten gal took : 8658 ms
[2024-05-21 05:08:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 29502 labels/synchronizations in 18922 ms.
[2024-05-21 05:08:04] [INFO ] Time to serialize gal into /tmp/LTL6012023076634673061.gal : 446 ms
[2024-05-21 05:08:04] [INFO ] Time to serialize properties into /tmp/LTL12061717250808479128.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6012023076634673061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12061717250808479128.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(u62.Node31GiveAnswer61<1)"))))
Formula 0 simplified : GF!"(u62.Node31GiveAnswer61<1)"
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-01 finished in 1227928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 5 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9897 Post agglomeration using F-continuation condition.Transition count delta: 9897
Deduced a syphon composed of 9897 places in 22 ms
Reduce places removed 9897 places and 0 transitions.
Iterating global reduction 2 with 19794 rules applied. Total rules applied 21194 place count 10606 transition count 50003
Applied a total of 21194 rules in 17048 ms. Remains 10606 /21203 variables (removed 10597) and now considering 50003/60600 (removed 10597) transitions.
[2024-05-21 05:08:36] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
// Phase 1: matrix 40304 rows 10606 cols
[2024-05-21 05:08:46] [INFO ] Computed 102 invariants in 10789 ms
[2024-05-21 05:09:12] [INFO ] Implicit Places using invariants in 36245 ms returned []
Implicit Place search using SMT only with invariants took 36250 ms to find 0 implicit places.
Running 49903 sub problems to find dead transitions.
[2024-05-21 05:09:12] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
[2024-05-21 05:09:12] [INFO ] Invariant cache hit.
[2024-05-21 05:09:13] [INFO ] State equation strengthened by 29895 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10605/50910 variables, and 100 constraints, problems are : Problem set: 0 solved, 49903 unsolved in 30529 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10606 constraints, ReadFeed: 0/29895 constraints, PredecessorRefiner: 49903/49903 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49903 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10605/50910 variables, and 100 constraints, problems are : Problem set: 0 solved, 49903 unsolved in 30532 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10606 constraints, ReadFeed: 0/29895 constraints, PredecessorRefiner: 0/49903 constraints, Known Traps: 0/0 constraints]
After SMT, in 315563ms problems are : Problem set: 0 solved, 49903 unsolved
Search for dead transitions found 0 dead transitions in 315965ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10606/21203 places, 50003/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 369368 ms. Remains : 10606/21203 places, 50003/60600 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-02
Stuttering criterion allowed to conclude after 477 steps with 0 reset in 20 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-02 finished in 369586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 24 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 17487 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2024-05-21 05:14:46] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2024-05-21 05:14:56] [INFO ] Computed 102 invariants in 9938 ms
[2024-05-21 05:15:21] [INFO ] Implicit Places using invariants in 35333 ms returned []
Implicit Place search using SMT only with invariants took 35334 ms to find 0 implicit places.
Running 49902 sub problems to find dead transitions.
[2024-05-21 05:15:22] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2024-05-21 05:15:22] [INFO ] Invariant cache hit.
[2024-05-21 05:15:22] [INFO ] State equation strengthened by 29896 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10604 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 49902 unsolved
SMT process timed out in 261805ms, After SMT, problems are : Problem set: 0 solved, 49902 unsolved
Search for dead transitions found 0 dead transitions in 262285ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10605/21203 places, 50002/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315184 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-03
Product exploration explored 100000 steps with 198 reset in 3760 ms.
Product exploration explored 100000 steps with 198 reset in 3582 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (77 resets) in 1634 ms. (24 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
[2024-05-21 05:19:52] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2024-05-21 05:19:52] [INFO ] Invariant cache hit.
[2024-05-21 05:19:52] [INFO ] State equation strengthened by 29896 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10400/10403 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 05:19:54] [INFO ] Deduced a trap composed of 2 places in 520 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10403 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10403 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 198/10601 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10601 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/10603 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 05:20:32] [INFO ] Deduced a trap composed of 153 places in 34499 ms of which 68 ms to minimize.
SMT process timed out in 39581ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10100 times.
Drop transitions (Partial Free agglomeration) removed 10100 transitions
Iterating global reduction 1 with 10100 rules applied. Total rules applied 10102 place count 10604 transition count 50001
Applied a total of 10102 rules in 15218 ms. Remains 10604 /10605 variables (removed 1) and now considering 50001/50002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15219 ms. Remains : 10604/10605 places, 50001/50002 transitions.
RANDOM walk for 40000 steps (64 resets) in 2843 ms. (14 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 94940 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :0 out of 2
Probabilistic random walk after 94940 steps, saw 92633 distinct states, run finished after 3004 ms. (steps per millisecond=31 ) properties seen :0
[2024-05-21 05:20:51] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
// Phase 1: matrix 50000 rows 10604 cols
[2024-05-21 05:20:59] [INFO ] Computed 102 invariants in 8546 ms
[2024-05-21 05:21:00] [INFO ] State equation strengthened by 49694 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10399/10402 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 05:21:01] [INFO ] Deduced a trap composed of 2 places in 334 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10402 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10402 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 198/10600 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10600 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/10602 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 05:21:41] [INFO ] Deduced a trap composed of 185 places in 36405 ms of which 69 ms to minimize.
[2024-05-21 05:22:16] [INFO ] Deduced a trap composed of 196 places in 35130 ms of which 60 ms to minimize.
SMT process timed out in 85258ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 6234 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6234 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 5966 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2024-05-21 05:22:28] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
[2024-05-21 05:22:28] [INFO ] Invariant cache hit.
[2024-05-21 05:23:00] [INFO ] Performed 4374/10604 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 05:23:04] [INFO ] Implicit Places using invariants in 35379 ms returned []
Implicit Place search using SMT only with invariants took 35379 ms to find 0 implicit places.
Running 49901 sub problems to find dead transitions.
[2024-05-21 05:23:04] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
[2024-05-21 05:23:04] [INFO ] Invariant cache hit.
[2024-05-21 05:23:05] [INFO ] State equation strengthened by 49694 read => feed constraints.

BK_STOP 1716269060864

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-100"
export BK_EXAMINATION="LTLCardinality"
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-5568"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505300171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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