Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r114-smll-171624276100508.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 DNAwalker-PT-18lozangeBlock, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-171624276100508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 15 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 DNAwalker-PT-18lozangeBlock-LTLFireability-00
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-01
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-02
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-03
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-04
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-05
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-06
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-07
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-08
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-09
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-10
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-11
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-12
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-13
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-14
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716536987496

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-18lozangeBlock
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 07:49:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 07:49:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 07:49:50] [INFO ] Load time of PNML (sax parser for PT used): 683 ms
[2024-05-24 07:49:50] [INFO ] Transformed 164 places.
[2024-05-24 07:49:51] [INFO ] Transformed 3697 transitions.
[2024-05-24 07:49:51] [INFO ] Parsed PT model containing 164 places and 3697 transitions and 10898 arcs in 932 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 148 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
Running 3563 sub problems to find dead transitions.
// Phase 1: matrix 3697 rows 164 cols
[2024-05-24 07:49:51] [INFO ] Computed 0 invariants in 85 ms
[2024-05-24 07:49:52] [INFO ] State equation strengthened by 2651 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3563 unsolved
SMT process timed out in 32417ms, After SMT, problems are : Problem set: 0 solved, 3563 unsolved
Search for dead transitions found 0 dead transitions in 32569ms
[2024-05-24 07:50:24] [INFO ] Invariant cache hit.
[2024-05-24 07:50:24] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-24 07:50:24] [INFO ] Invariant cache hit.
[2024-05-24 07:50:25] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2024-05-24 07:50:58] [INFO ] Performed 2/164 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-05-24 07:51:31] [INFO ] Performed 45/164 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-24 07:52:05] [INFO ] Performed 71/164 implicitness test of which 0 returned IMPLICIT in 98 seconds.
[2024-05-24 07:52:38] [INFO ] Performed 93/164 implicitness test of which 0 returned IMPLICIT in 132 seconds.
[2024-05-24 07:52:38] [INFO ] Timeout of Implicit test with SMT after 132 seconds.
[2024-05-24 07:52:38] [INFO ] Implicit Places using invariants and state equation in 134441 ms returned []
Implicit Place search using SMT with State Equation took 134779 ms to find 0 implicit places.
Running 3563 sub problems to find dead transitions.
[2024-05-24 07:52:38] [INFO ] Invariant cache hit.
[2024-05-24 07:52:39] [INFO ] State equation strengthened by 2651 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3563 unsolved
SMT process timed out in 41196ms, After SMT, problems are : Problem set: 0 solved, 3563 unsolved
Search for dead transitions found 0 dead transitions in 41259ms
Finished structural reductions in LTL mode , in 1 iterations and 208899 ms. Remains : 164/164 places, 3697/3697 transitions.
Support contains 42 out of 164 places after structural reductions.
[2024-05-24 07:53:21] [INFO ] Flatten gal took : 392 ms
[2024-05-24 07:53:21] [INFO ] Flatten gal took : 205 ms
[2024-05-24 07:53:21] [INFO ] Input system was already deterministic with 3697 transitions.
Support contains 39 out of 164 places (down from 42) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (381 resets) in 4026 ms. (9 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
[2024-05-24 07:53:22] [INFO ] Invariant cache hit.
[2024-05-24 07:53:23] [INFO ] State equation strengthened by 2651 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 653/661 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/661 variables, 278/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/661 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2979/3640 variables, 87/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3640/3861 variables, and 2664 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3582 ms.
Refiners :[State Equation: 95/164 constraints, ReadFeed: 2569/2651 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 653/661 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/661 variables, 278/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/661 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2979/3640 variables, 87/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3640/3861 variables, and 2664 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3961 ms.
Refiners :[State Equation: 95/164 constraints, ReadFeed: 2569/2651 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 7673ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 164 transition count 3632
Reduce places removed 58 places and 58 transitions.
Iterating global reduction 1 with 58 rules applied. Total rules applied 123 place count 106 transition count 3574
Applied a total of 123 rules in 258 ms. Remains 106 /164 variables (removed 58) and now considering 3574/3697 (removed 123) transitions.
Running 3549 sub problems to find dead transitions.
// Phase 1: matrix 3574 rows 106 cols
[2024-05-24 07:53:31] [INFO ] Computed 0 invariants in 36 ms
[2024-05-24 07:53:31] [INFO ] State equation strengthened by 278 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3549 unsolved
SMT process timed out in 31170ms, After SMT, problems are : Problem set: 0 solved, 3549 unsolved
Search for dead transitions found 0 dead transitions in 31233ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31506 ms. Remains : 106/164 places, 3574/3697 transitions.
RANDOM walk for 40000 steps (605 resets) in 1491 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (22 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (20 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 128108 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 2
Probabilistic random walk after 128108 steps, saw 34528 distinct states, run finished after 3006 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-24 07:54:05] [INFO ] Invariant cache hit.
[2024-05-24 07:54:05] [INFO ] State equation strengthened by 278 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 653/661 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/661 variables, 278/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/661 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2918/3579 variables, 87/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3579 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 101/3680 variables, 11/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3680 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3680 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3680/3680 variables, and 384 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3305 ms.
Refiners :[State Equation: 106/106 constraints, ReadFeed: 278/278 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 653/661 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/661 variables, 278/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/661 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2918/3579 variables, 87/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3579 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3579 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3680/3680 variables, and 386 constraints, problems are : Problem set: 0 solved, 2 unsolved in 20353 ms.
Refiners :[State Equation: 106/106 constraints, ReadFeed: 278/278 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 23698ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 3574/3574 transitions.
Applied a total of 0 rules in 62 ms. Remains 106 /106 variables (removed 0) and now considering 3574/3574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 106/106 places, 3574/3574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 3574/3574 transitions.
Applied a total of 0 rules in 91 ms. Remains 106 /106 variables (removed 0) and now considering 3574/3574 (removed 0) transitions.
[2024-05-24 07:54:29] [INFO ] Invariant cache hit.
[2024-05-24 07:54:30] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-24 07:54:30] [INFO ] Invariant cache hit.
[2024-05-24 07:54:31] [INFO ] State equation strengthened by 278 read => feed constraints.
[2024-05-24 07:55:01] [INFO ] Performed 49/106 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2024-05-24 07:55:24] [INFO ] Implicit Places using invariants and state equation in 54625 ms returned [0]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Implicit Place search using SMT with State Equation took 54975 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/106 places, 3555/3574 transitions.
Applied a total of 0 rules in 90 ms. Remains 105 /105 variables (removed 0) and now considering 3555/3555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 55157 ms. Remains : 105/106 places, 3555/3574 transitions.
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 164 stabilizing places and 3696 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' '!(X((F(p1)||p0)))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 41 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
Running 3563 sub problems to find dead transitions.
// Phase 1: matrix 3697 rows 164 cols
[2024-05-24 07:55:25] [INFO ] Computed 0 invariants in 14 ms
[2024-05-24 07:55:25] [INFO ] State equation strengthened by 2651 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3563 unsolved
SMT process timed out in 30625ms, After SMT, problems are : Problem set: 0 solved, 3563 unsolved
Search for dead transitions found 0 dead transitions in 30691ms
[2024-05-24 07:55:55] [INFO ] Invariant cache hit.
[2024-05-24 07:55:56] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-24 07:55:56] [INFO ] Invariant cache hit.
[2024-05-24 07:55:57] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2024-05-24 07:56:29] [INFO ] Performed 4/164 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 07:57:00] [INFO ] Performed 21/164 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-05-24 07:57:35] [INFO ] Performed 49/164 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-24 07:58:06] [INFO ] Performed 69/164 implicitness test of which 0 returned IMPLICIT in 127 seconds.
[2024-05-24 07:58:06] [INFO ] Timeout of Implicit test with SMT after 127 seconds.
[2024-05-24 07:58:06] [INFO ] Implicit Places using invariants and state equation in 130010 ms returned []
Implicit Place search using SMT with State Equation took 130490 ms to find 0 implicit places.
Running 3563 sub problems to find dead transitions.
[2024-05-24 07:58:06] [INFO ] Invariant cache hit.
[2024-05-24 07:58:06] [INFO ] State equation strengthened by 2651 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3563 unsolved
SMT process timed out in 40282ms, After SMT, problems are : Problem set: 0 solved, 3563 unsolved
Search for dead transitions found 0 dead transitions in 40336ms
Finished structural reductions in LTL mode , in 1 iterations and 201589 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 434 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 1512 ms.
Product exploration explored 100000 steps with 50000 reset in 1253 ms.
Computed a total of 164 stabilizing places and 3696 stable transitions
Computed a total of 164 stabilizing places and 3696 stable transitions
Detected a total of 164/164 stabilizing places and 3696/3697 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 56 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DNAwalker-PT-18lozangeBlock-LTLFireability-00 finished in 205048 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' '!((G(p0)&&X(F(p1))))'
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 10 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
Running 3563 sub problems to find dead transitions.
[2024-05-24 07:58:50] [INFO ] Invariant cache hit.
[2024-05-24 07:58:50] [INFO ] State equation strengthened by 2651 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3563 unsolved
SMT process timed out in 29736ms, After SMT, problems are : Problem set: 0 solved, 3563 unsolved
Search for dead transitions found 0 dead transitions in 29777ms
[2024-05-24 07:59:19] [INFO ] Invariant cache hit.
[2024-05-24 07:59:20] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-24 07:59:20] [INFO ] Invariant cache hit.
[2024-05-24 07:59:21] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2024-05-24 07:59:53] [INFO ] Performed 6/164 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-05-24 08:00:25] [INFO ] Performed 29/164 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-05-24 08:00:57] [INFO ] Performed 51/164 implicitness test of which 0 returned IMPLICIT in 94 seconds.
[2024-05-24 08:01:31] [INFO ] Performed 77/164 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-05-24 08:01:31] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-05-24 08:01:31] [INFO ] Implicit Places using invariants and state equation in 131120 ms returned []
Implicit Place search using SMT with State Equation took 131574 ms to find 0 implicit places.
Running 3563 sub problems to find dead transitions.
[2024-05-24 08:01:31] [INFO ] Invariant cache hit.
[2024-05-24 08:01:31] [INFO ] State equation strengthened by 2651 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3563 unsolved
SMT process timed out in 40340ms, After SMT, problems are : Problem set: 0 solved, 3563 unsolved
Search for dead transitions found 0 dead transitions in 40390ms
Finished structural reductions in LTL mode , in 1 iterations and 201778 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 470 ms.
Product exploration explored 100000 steps with 0 reset in 432 ms.
Computed a total of 164 stabilizing places and 3696 stable transitions
Computed a total of 164 stabilizing places and 3696 stable transitions
Detected a total of 164/164 stabilizing places and 3696/3697 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 634 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (388 resets) in 1377 ms. (29 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 239669 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 239669 steps, saw 45810 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-24 08:02:17] [INFO ] Invariant cache hit.
[2024-05-24 08:02:17] [INFO ] State equation strengthened by 2651 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 139/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3248/3583 variables, 84/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3583/3861 variables, and 2622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2592 ms.
Refiners :[State Equation: 88/164 constraints, ReadFeed: 2534/2651 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 139/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3248/3583 variables, 84/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3583/3861 variables, and 2622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2605 ms.
Refiners :[State Equation: 88/164 constraints, ReadFeed: 2534/2651 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5315ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 164 transition count 3632
Reduce places removed 61 places and 61 transitions.
Iterating global reduction 1 with 61 rules applied. Total rules applied 126 place count 103 transition count 3571
Applied a total of 126 rules in 190 ms. Remains 103 /164 variables (removed 61) and now considering 3571/3697 (removed 126) transitions.
Running 3547 sub problems to find dead transitions.
// Phase 1: matrix 3571 rows 103 cols
[2024-05-24 08:02:23] [INFO ] Computed 0 invariants in 22 ms
[2024-05-24 08:02:23] [INFO ] State equation strengthened by 139 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3547 unsolved
SMT process timed out in 30494ms, After SMT, problems are : Problem set: 0 solved, 3547 unsolved
Search for dead transitions found 0 dead transitions in 30565ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30767 ms. Remains : 103/164 places, 3571/3697 transitions.
RANDOM walk for 40000 steps (635 resets) in 1034 ms. (38 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (23 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 124223 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 1
Probabilistic random walk after 124223 steps, saw 34620 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-24 08:02:56] [INFO ] Invariant cache hit.
[2024-05-24 08:02:56] [INFO ] State equation strengthened by 139 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 139/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3188/3523 variables, 84/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3523 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 151/3674 variables, 15/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3674 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3674 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3674/3674 variables, and 242 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2495 ms.
Refiners :[State Equation: 103/103 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 139/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3188/3523 variables, 84/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3523 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3523 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3674/3674 variables, and 243 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10071 ms.
Refiners :[State Equation: 103/103 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 12586ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 3571/3571 transitions.
Applied a total of 0 rules in 51 ms. Remains 103 /103 variables (removed 0) and now considering 3571/3571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 103/103 places, 3571/3571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 3571/3571 transitions.
Applied a total of 0 rules in 49 ms. Remains 103 /103 variables (removed 0) and now considering 3571/3571 (removed 0) transitions.
[2024-05-24 08:03:09] [INFO ] Invariant cache hit.
[2024-05-24 08:03:09] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-24 08:03:09] [INFO ] Invariant cache hit.
[2024-05-24 08:03:10] [INFO ] State equation strengthened by 139 read => feed constraints.
[2024-05-24 08:03:42] [INFO ] Performed 56/103 implicitness test of which 1 returned IMPLICIT in 31 seconds.
[2024-05-24 08:04:04] [INFO ] Implicit Places using invariants and state equation in 54930 ms returned [0]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Implicit Place search using SMT with State Equation took 55228 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 102/103 places, 3551/3571 transitions.
Applied a total of 0 rules in 44 ms. Remains 102 /102 variables (removed 0) and now considering 3551/3551 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 55321 ms. Remains : 102/103 places, 3551/3571 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 721 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Support contains 4 out of 164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 317 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
Running 3563 sub problems to find dead transitions.
// Phase 1: matrix 3697 rows 164 cols
[2024-05-24 08:04:06] [INFO ] Computed 0 invariants in 18 ms
[2024-05-24 08:04:06] [INFO ] State equation strengthened by 2651 read => feed constraints.

BK_STOP 1716537858571

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-18lozangeBlock"
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-5568"
echo " Executing tool itstools"
echo " Input is DNAwalker-PT-18lozangeBlock, 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 r114-smll-171624276100508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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