fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683761500628
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldPPPt-PT-020A

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
593.432 649880.00 765010.00 1607.20 FTFTFTFFFFFFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683761500628.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 ltsminxred
Input is ShieldPPPt-PT-020A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761500628
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 134K May 18 16:43 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 ShieldPPPt-PT-020A-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-020A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717257196148

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:53:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:53:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:53:17] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-01 15:53:17] [INFO ] Transformed 503 places.
[2024-06-01 15:53:17] [INFO ] Transformed 363 transitions.
[2024-06-01 15:53:17] [INFO ] Found NUPN structural information;
[2024-06-01 15:53:17] [INFO ] Parsed PT model containing 503 places and 363 transitions and 1446 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-020A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 44 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2024-06-01 15:53:17] [INFO ] Computed 221 invariants in 18 ms
[2024-06-01 15:53:18] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-06-01 15:53:18] [INFO ] Invariant cache hit.
[2024-06-01 15:53:18] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 968 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-01 15:53:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 22149 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30033 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 52318ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 52337ms
Finished structural reductions in LTL mode , in 1 iterations and 53375 ms. Remains : 503/503 places, 362/362 transitions.
Support contains 66 out of 503 places after structural reductions.
[2024-06-01 15:54:11] [INFO ] Flatten gal took : 74 ms
[2024-06-01 15:54:11] [INFO ] Flatten gal took : 34 ms
[2024-06-01 15:54:11] [INFO ] Input system was already deterministic with 362 transitions.
Support contains 63 out of 503 places (down from 66) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 34 to 32
RANDOM walk for 40000 steps (8 resets) in 1886 ms. (21 steps per ms) remains 13/32 properties
BEST_FIRST walk for 40003 steps (8 resets) in 286 ms. (139 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 175 ms. (227 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
[2024-06-01 15:54:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 39/66 variables, 27/54 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 39/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 437/503 variables, 194/287 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 437/724 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 13 unsolved in 929 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 39/66 variables, 27/54 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 39/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 437/503 variables, 194/287 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 437/724 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/865 variables, 13/1240 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/865 variables, 0/1240 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/865 variables, 0/1240 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1240 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1534 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 2490ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 10 different solutions.
Finished Parikh walk after 997 steps, including 0 resets, run visited all 13 properties in 29 ms. (steps per millisecond=34 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 37 ms.
FORMULA ShieldPPPt-PT-020A-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 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' '!(F(G(p0)))'
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 500 transition count 360
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 500 transition count 358
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 498 transition count 358
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 497 transition count 357
Applied a total of 9 rules in 74 ms. Remains 497 /503 variables (removed 6) and now considering 357/362 (removed 5) transitions.
// Phase 1: matrix 357 rows 497 cols
[2024-06-01 15:54:15] [INFO ] Computed 220 invariants in 4 ms
[2024-06-01 15:54:16] [INFO ] Implicit Places using invariants in 246 ms returned [480, 484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 248 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 495/503 places, 357/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 493 transition count 355
Applied a total of 4 rules in 46 ms. Remains 493 /495 variables (removed 2) and now considering 355/357 (removed 2) transitions.
// Phase 1: matrix 355 rows 493 cols
[2024-06-01 15:54:16] [INFO ] Computed 218 invariants in 1 ms
[2024-06-01 15:54:16] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-06-01 15:54:16] [INFO ] Invariant cache hit.
[2024-06-01 15:54:16] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 493/503 places, 355/362 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 964 ms. Remains : 493/503 places, 355/362 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020A-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 521 ms.
Stack based approach found an accepted trace after 148 steps with 0 reset with depth 149 and stack size 137 in 1 ms.
FORMULA ShieldPPPt-PT-020A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020A-LTLFireability-00 finished in 1695 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' '!(X((F(p0)||G(p1))))'
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2024-06-01 15:54:17] [INFO ] Computed 221 invariants in 2 ms
[2024-06-01 15:54:17] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-06-01 15:54:17] [INFO ] Invariant cache hit.
[2024-06-01 15:54:18] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-01 15:54:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 22042 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30019 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 52130ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 52134ms
Finished structural reductions in LTL mode , in 1 iterations and 52804 ms. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020A-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 731 ms.
Product exploration explored 100000 steps with 50000 reset in 738 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-020A-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020A-LTLFireability-01 finished in 54454 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' '!(X(F(p0)))'
Support contains 3 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 6 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-06-01 15:55:12] [INFO ] Invariant cache hit.
[2024-06-01 15:55:12] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-06-01 15:55:12] [INFO ] Invariant cache hit.
[2024-06-01 15:55:12] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-01 15:55:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21713 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30012 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51796ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51800ms
Finished structural reductions in LTL mode , in 1 iterations and 52512 ms. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020A-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 680 ms.
Product exploration explored 100000 steps with 50000 reset in 717 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-020A-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020A-LTLFireability-03 finished in 54017 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) U G(p2)))))'
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 7 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-06-01 15:56:06] [INFO ] Invariant cache hit.
[2024-06-01 15:56:06] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-06-01 15:56:06] [INFO ] Invariant cache hit.
[2024-06-01 15:56:06] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-01 15:56:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21036 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30011 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51099ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51103ms
Finished structural reductions in LTL mode , in 1 iterations and 51765 ms. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), p1, (AND p1 (NOT p0) p2)]
Running random walk in product with property : ShieldPPPt-PT-020A-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 427 ms.
Stack based approach found an accepted trace after 102 steps with 0 reset with depth 103 and stack size 103 in 1 ms.
FORMULA ShieldPPPt-PT-020A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020A-LTLFireability-04 finished in 52411 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' '!((X(p0) U (p1||X(p2))))'
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-06-01 15:56:58] [INFO ] Invariant cache hit.
[2024-06-01 15:56:58] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-06-01 15:56:58] [INFO ] Invariant cache hit.
[2024-06-01 15:56:59] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-01 15:56:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21805 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30013 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51880ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51883ms
Finished structural reductions in LTL mode , in 1 iterations and 52565 ms. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-020A-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 686 ms.
Product exploration explored 100000 steps with 50000 reset in 727 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 59 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-020A-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020A-LTLFireability-05 finished in 54144 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 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 360
Applied a total of 4 rules in 24 ms. Remains 501 /503 variables (removed 2) and now considering 360/362 (removed 2) transitions.
// Phase 1: matrix 360 rows 501 cols
[2024-06-01 15:57:52] [INFO ] Computed 221 invariants in 3 ms
[2024-06-01 15:57:52] [INFO ] Implicit Places using invariants in 260 ms returned [494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 262 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/503 places, 360/362 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 500 transition count 358
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 498 transition count 358
Applied a total of 4 rules in 19 ms. Remains 498 /500 variables (removed 2) and now considering 358/360 (removed 2) transitions.
// Phase 1: matrix 358 rows 498 cols
[2024-06-01 15:57:52] [INFO ] Computed 220 invariants in 3 ms
[2024-06-01 15:57:53] [INFO ] Implicit Places using invariants in 235 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 236 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 496/503 places, 358/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 494 transition count 356
Applied a total of 4 rules in 17 ms. Remains 494 /496 variables (removed 2) and now considering 356/358 (removed 2) transitions.
// Phase 1: matrix 356 rows 494 cols
[2024-06-01 15:57:53] [INFO ] Computed 218 invariants in 2 ms
[2024-06-01 15:57:53] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-01 15:57:53] [INFO ] Invariant cache hit.
[2024-06-01 15:57:53] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 494/503 places, 356/362 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1164 ms. Remains : 494/503 places, 356/362 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020A-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 425 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ShieldPPPt-PT-020A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020A-LTLFireability-06 finished in 1635 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' '!(X(G(p0)))'
Support contains 2 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 9 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2024-06-01 15:57:54] [INFO ] Computed 221 invariants in 3 ms
[2024-06-01 15:57:54] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-06-01 15:57:54] [INFO ] Invariant cache hit.
[2024-06-01 15:57:54] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-01 15:57:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21245 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30012 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51316ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51321ms
Finished structural reductions in LTL mode , in 1 iterations and 51964 ms. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020A-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-020A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020A-LTLFireability-07 finished in 52060 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' '!(X((p0||F((G(F(p1))||G(p2))))))'
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-06-01 15:58:46] [INFO ] Invariant cache hit.
[2024-06-01 15:58:46] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-06-01 15:58:46] [INFO ] Invariant cache hit.
[2024-06-01 15:58:46] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-01 15:58:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 20829 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30014 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 50902ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 50906ms
Finished structural reductions in LTL mode , in 1 iterations and 51533 ms. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020A-LTLFireability-08
Product exploration explored 100000 steps with 72 reset in 420 ms.
Stack based approach found an accepted trace after 132 steps with 0 reset with depth 133 and stack size 96 in 1 ms.
FORMULA ShieldPPPt-PT-020A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020A-LTLFireability-08 finished in 52125 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((F(p0)&&X(((X(p2)&&p1) U p3))))&&F(p4)))'
Support contains 8 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 9 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-06-01 15:59:38] [INFO ] Invariant cache hit.
[2024-06-01 15:59:38] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-06-01 15:59:38] [INFO ] Invariant cache hit.
[2024-06-01 15:59:39] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-01 15:59:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21467 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30010 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51525ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51528ms
Finished structural reductions in LTL mode , in 1 iterations and 52138 ms. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p4) (NOT p0) (NOT p3)), (NOT p0), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p4), true, (OR (AND (NOT p2) p3) (AND p1 (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-020A-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 403 ms.
Stack based approach found an accepted trace after 88 steps with 0 reset with depth 89 and stack size 89 in 0 ms.
FORMULA ShieldPPPt-PT-020A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020A-LTLFireability-09 finished in 52844 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' '!(X(((p0 U p1)&&X(G(p2)))))'
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-06-01 16:00:31] [INFO ] Invariant cache hit.
[2024-06-01 16:00:31] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-06-01 16:00:31] [INFO ] Invariant cache hit.
[2024-06-01 16:00:31] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-01 16:00:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 22530 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30019 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 52596ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 52599ms
Finished structural reductions in LTL mode , in 1 iterations and 53242 ms. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-020A-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-020A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020A-LTLFireability-10 finished in 53429 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((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 360
Applied a total of 4 rules in 28 ms. Remains 501 /503 variables (removed 2) and now considering 360/362 (removed 2) transitions.
// Phase 1: matrix 360 rows 501 cols
[2024-06-01 16:01:24] [INFO ] Computed 221 invariants in 1 ms
[2024-06-01 16:01:24] [INFO ] Implicit Places using invariants in 232 ms returned [494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 233 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/503 places, 360/362 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 500 transition count 358
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 498 transition count 358
Applied a total of 4 rules in 14 ms. Remains 498 /500 variables (removed 2) and now considering 358/360 (removed 2) transitions.
// Phase 1: matrix 358 rows 498 cols
[2024-06-01 16:01:24] [INFO ] Computed 220 invariants in 2 ms
[2024-06-01 16:01:25] [INFO ] Implicit Places using invariants in 240 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 241 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 496/503 places, 358/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 494 transition count 356
Applied a total of 4 rules in 27 ms. Remains 494 /496 variables (removed 2) and now considering 356/358 (removed 2) transitions.
// Phase 1: matrix 356 rows 494 cols
[2024-06-01 16:01:25] [INFO ] Computed 218 invariants in 1 ms
[2024-06-01 16:01:25] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-06-01 16:01:25] [INFO ] Invariant cache hit.
[2024-06-01 16:01:25] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 494/503 places, 356/362 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1127 ms. Remains : 494/503 places, 356/362 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-020A-LTLFireability-11
Product exploration explored 100000 steps with 3 reset in 402 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldPPPt-PT-020A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020A-LTLFireability-11 finished in 1650 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' '!((X(G(p0))&&F(p1)))'
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2024-06-01 16:01:26] [INFO ] Computed 221 invariants in 3 ms
[2024-06-01 16:01:26] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-01 16:01:26] [INFO ] Invariant cache hit.
[2024-06-01 16:01:26] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-01 16:01:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21650 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30016 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51715ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51718ms
Finished structural reductions in LTL mode , in 1 iterations and 52346 ms. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020A-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 433 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-020A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020A-LTLFireability-12 finished in 52923 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' '!(X(X((p0 U !p1))))'
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 6 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-06-01 16:02:19] [INFO ] Invariant cache hit.
[2024-06-01 16:02:19] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-01 16:02:19] [INFO ] Invariant cache hit.
[2024-06-01 16:02:19] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-01 16:02:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21704 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30011 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51776ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51779ms
Finished structural reductions in LTL mode , in 1 iterations and 52431 ms. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 112 ms :[p1, p1, true, p1]
Running random walk in product with property : ShieldPPPt-PT-020A-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 583 ms.
Product exploration explored 100000 steps with 33333 reset in 621 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-020A-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020A-LTLFireability-14 finished in 53794 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(F((G(F(p0))||(!p1&&F(p0)))))||(F(p2)&&X(F((G(F(p0))||(!p1&&F(p0))))))))'
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-06-01 16:03:13] [INFO ] Invariant cache hit.
[2024-06-01 16:03:13] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-01 16:03:13] [INFO ] Invariant cache hit.
[2024-06-01 16:03:13] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-01 16:03:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21642 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30017 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51708ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51711ms
Finished structural reductions in LTL mode , in 1 iterations and 52350 ms. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020A-LTLFireability-15
Product exploration explored 100000 steps with 61 reset in 398 ms.
Stack based approach found an accepted trace after 113 steps with 0 reset with depth 114 and stack size 114 in 1 ms.
FORMULA ShieldPPPt-PT-020A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020A-LTLFireability-15 finished in 52957 ms.
All properties solved by simple procedures.
Total runtime 648768 ms.
ITS solved all properties within timeout

BK_STOP 1717257846028

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="ShieldPPPt-PT-020A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPt-PT-020A, 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 r528-tall-171683761500628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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