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.r267-smll-171654405800164.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 greatspnxred
Input is PermAdmissibility-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405800164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 11K Apr 12 09:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 09:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 12 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 268K Apr 12 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 12 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 12 09:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 575K Apr 12 09:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 336K 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 PermAdmissibility-PT-02-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716686182008

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 01:16:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 01:16:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 01:16:25] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2024-05-26 01:16:25] [INFO ] Transformed 168 places.
[2024-05-26 01:16:25] [INFO ] Transformed 592 transitions.
[2024-05-26 01:16:25] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 500 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA PermAdmissibility-PT-02-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 101 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 592
Applied a total of 64 rules in 57 ms. Remains 104 /168 variables (removed 64) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 104 cols
[2024-05-26 01:16:25] [INFO ] Computed 16 invariants in 59 ms
[2024-05-26 01:16:26] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-26 01:16:26] [INFO ] Invariant cache hit.
[2024-05-26 01:16:26] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2024-05-26 01:16:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/696 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 696/696 variables, and 120 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30062 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/696 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 588/708 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/696 variables, and 708 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints]
After SMT, in 62512ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 62570ms
Starting structural reductions in LTL mode, iteration 1 : 104/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63808 ms. Remains : 104/168 places, 592/592 transitions.
Support contains 101 out of 104 places after structural reductions.
[2024-05-26 01:17:30] [INFO ] Flatten gal took : 175 ms
[2024-05-26 01:17:30] [INFO ] Flatten gal took : 140 ms
[2024-05-26 01:17:30] [INFO ] Input system was already deterministic with 592 transitions.
Reduction of identical properties reduced properties to check from 30 to 28
RANDOM walk for 40002 steps (851 resets) in 1113 ms. (35 steps per ms) remains 1/28 properties
BEST_FIRST walk for 1366 steps (4 resets) in 14 ms. (91 steps per ms) remains 0/1 properties
Computed a total of 104 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 34 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 27 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2024-05-26 01:17:31] [INFO ] Computed 16 invariants in 13 ms
[2024-05-26 01:17:31] [INFO ] Implicit Places using invariants in 209 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 215 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 250 ms. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 353 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-00 finished in 715 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((!p0&&G(((F(p2)&&X(X(F(p0))))||p1)))))'
Support contains 26 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 86 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.8 ms
Discarding 18 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Applied a total of 1 rules in 76 ms. Remains 86 /104 variables (removed 18) and now considering 464/592 (removed 128) transitions.
// Phase 1: matrix 464 rows 86 cols
[2024-05-26 01:17:32] [INFO ] Computed 14 invariants in 10 ms
[2024-05-26 01:17:32] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-26 01:17:32] [INFO ] Invariant cache hit.
[2024-05-26 01:17:33] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
[2024-05-26 01:17:33] [INFO ] Redundant transitions in 50 ms returned []
Running 460 sub problems to find dead transitions.
[2024-05-26 01:17:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 100 constraints, problems are : Problem set: 0 solved, 460 unsolved in 17844 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 460/560 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 560 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 49360ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 49371ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/104 places, 464/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50681 ms. Remains : 86/104 places, 464/592 transitions.
Stuttering acceptance computed with spot in 507 ms :[(OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-01
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 6 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-01 finished in 51241 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&&(X(G(p2))||p1)))))'
Support contains 31 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 66 place count 64 transition count 218
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 64 transition count 218
Applied a total of 80 rules in 20 ms. Remains 64 /104 variables (removed 40) and now considering 218/592 (removed 374) transitions.
// Phase 1: matrix 218 rows 64 cols
[2024-05-26 01:18:23] [INFO ] Computed 16 invariants in 5 ms
[2024-05-26 01:18:23] [INFO ] Implicit Places using invariants in 136 ms returned [0, 5, 19, 30]
[2024-05-26 01:18:23] [INFO ] Actually due to overlaps returned [0, 5, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 142 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/104 places, 218/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 61/104 places, 218/592 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-02
Stuttering criterion allowed to conclude after 39 steps with 1 reset in 4 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-02 finished in 387 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(p1)||p0)))'
Support contains 26 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 60 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2024-05-26 01:18:23] [INFO ] Computed 16 invariants in 9 ms
[2024-05-26 01:18:24] [INFO ] Implicit Places using invariants in 211 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 215 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 24 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 300 ms. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-03
Product exploration explored 100000 steps with 4418 reset in 1437 ms.
Product exploration explored 100000 steps with 4416 reset in 1116 ms.
Computed a total of 90 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 250 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 160 steps (0 resets) in 21 ms. (7 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 628 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 468 rows 90 cols
[2024-05-26 01:18:28] [INFO ] Computed 15 invariants in 5 ms
[2024-05-26 01:18:29] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 16 ms returned sat
[2024-05-26 01:18:29] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2024-05-26 01:18:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 01:18:31] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 45 ms returned sat
[2024-05-26 01:18:31] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2024-05-26 01:18:32] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 436 transitions) in 144 ms.
[2024-05-26 01:18:32] [INFO ] Added : 5 causal constraints over 2 iterations in 339 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 26 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Applied a total of 0 rules in 28 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2024-05-26 01:18:32] [INFO ] Invariant cache hit.
[2024-05-26 01:18:32] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-26 01:18:32] [INFO ] Invariant cache hit.
[2024-05-26 01:18:33] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
[2024-05-26 01:18:33] [INFO ] Redundant transitions in 17 ms returned []
Running 464 sub problems to find dead transitions.
[2024-05-26 01:18:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 468/558 variables, 90/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (OVERLAPS) 0/558 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 105 constraints, problems are : Problem set: 0 solved, 464 unsolved in 25743 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 468/558 variables, 90/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 464/569 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 569 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
After SMT, in 57243ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 57253ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58466 ms. Remains : 90/90 places, 468/468 transitions.
Computed a total of 90 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 305 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 160 steps (0 resets) in 9 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 643 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-26 01:19:32] [INFO ] Invariant cache hit.
[2024-05-26 01:19:33] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 15 ms returned sat
[2024-05-26 01:19:33] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2024-05-26 01:19:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 01:19:35] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 26 ms returned sat
[2024-05-26 01:19:35] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2024-05-26 01:19:35] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 436 transitions) in 75 ms.
[2024-05-26 01:19:35] [INFO ] Added : 5 causal constraints over 1 iterations in 190 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4431 reset in 1438 ms.
Product exploration explored 100000 steps with 4403 reset in 1190 ms.
Support contains 26 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Applied a total of 0 rules in 14 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2024-05-26 01:19:38] [INFO ] Invariant cache hit.
[2024-05-26 01:19:38] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-26 01:19:38] [INFO ] Invariant cache hit.
[2024-05-26 01:19:39] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
[2024-05-26 01:19:39] [INFO ] Redundant transitions in 8 ms returned []
Running 464 sub problems to find dead transitions.
[2024-05-26 01:19:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 468/558 variables, 90/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (OVERLAPS) 0/558 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 105 constraints, problems are : Problem set: 0 solved, 464 unsolved in 25252 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 468/558 variables, 90/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 464/569 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 569 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
After SMT, in 56834ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 56844ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57993 ms. Remains : 90/90 places, 468/468 transitions.
Treatment of property PermAdmissibility-PT-02-LTLFireability-03 finished in 132927 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 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 76 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 100 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 51 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 51 transition count 84
Applied a total of 106 rules in 19 ms. Remains 51 /104 variables (removed 53) and now considering 84/592 (removed 508) transitions.
// Phase 1: matrix 84 rows 51 cols
[2024-05-26 01:20:36] [INFO ] Computed 16 invariants in 1 ms
[2024-05-26 01:20:36] [INFO ] Implicit Places using invariants in 108 ms returned [0, 5, 18, 25]
[2024-05-26 01:20:36] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 112 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/104 places, 84/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 48/104 places, 84/592 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-04 finished in 274 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) U (!p1&&X(!p2)))))'
Support contains 31 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 8 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2024-05-26 01:20:37] [INFO ] Computed 16 invariants in 7 ms
[2024-05-26 01:20:37] [INFO ] Implicit Places using invariants in 183 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 187 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR p1 p2), p0, (OR p1 p2), p2, (AND p0 (NOT p1) p2)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-05
Product exploration explored 100000 steps with 5489 reset in 1019 ms.
Product exploration explored 100000 steps with 5467 reset in 793 ms.
Computed a total of 90 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p2))), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (F (G p1)), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 244 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 341 ms :[(OR p2 p1), p0, (OR p2 p1), p2, false, false]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40003 steps (851 resets) in 1759 ms. (22 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (201 resets) in 1982 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (235 resets) in 1337 ms. (29 steps per ms) remains 2/2 properties
// Phase 1: matrix 468 rows 90 cols
[2024-05-26 01:20:41] [INFO ] Computed 15 invariants in 20 ms
Problem apf3 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 31/558 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 38 ms.
Refiners :[Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p2))), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (F (G p1)), (F (G p0)), (F (G (NOT p2))), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (NOT p1)), (F (NOT (OR (NOT p2) p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p2) (NOT p1))))
Knowledge based reduction with 24 factoid took 287 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLFireability-05 finished in 5407 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((X(F(p0))&&G((p1&&F(p2))))))'
Support contains 43 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 7 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2024-05-26 01:20:42] [INFO ] Computed 16 invariants in 7 ms
[2024-05-26 01:20:42] [INFO ] Implicit Places using invariants in 171 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-07
Stuttering criterion allowed to conclude after 1064 steps with 76 reset in 11 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-07 finished in 433 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)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 68 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 88 place count 60 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 59 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 59 transition count 128
Applied a total of 90 rules in 22 ms. Remains 59 /104 variables (removed 45) and now considering 128/592 (removed 464) transitions.
// Phase 1: matrix 128 rows 59 cols
[2024-05-26 01:20:42] [INFO ] Computed 16 invariants in 1 ms
[2024-05-26 01:20:42] [INFO ] Implicit Places using invariants in 115 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/104 places, 128/592 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 58/104 places, 128/592 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-08
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-08 finished in 261 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((X(p1)&&p0))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 74 place count 56 transition count 114
Iterating global reduction 0 with 22 rules applied. Total rules applied 96 place count 56 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 55 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 55 transition count 106
Applied a total of 98 rules in 4 ms. Remains 55 /104 variables (removed 49) and now considering 106/592 (removed 486) transitions.
// Phase 1: matrix 106 rows 55 cols
[2024-05-26 01:20:43] [INFO ] Computed 16 invariants in 2 ms
[2024-05-26 01:20:43] [INFO ] Implicit Places using invariants in 105 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 110 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/104 places, 106/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 53/104 places, 106/592 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-09
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-09 finished in 259 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(p0) U p1)||G(!p0)))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 50 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 384 output transitions
Drop transitions (Output transitions of discarded places.) removed 384 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 38 transition count 88
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 38 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 29 place count 34 transition count 58
Iterating global reduction 0 with 4 rules applied. Total rules applied 33 place count 34 transition count 58
Applied a total of 33 rules in 8 ms. Remains 34 /104 variables (removed 70) and now considering 58/592 (removed 534) transitions.
// Phase 1: matrix 58 rows 34 cols
[2024-05-26 01:20:43] [INFO ] Computed 10 invariants in 1 ms
[2024-05-26 01:20:43] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-26 01:20:43] [INFO ] Invariant cache hit.
[2024-05-26 01:20:43] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-26 01:20:43] [INFO ] Redundant transitions in 0 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-26 01:20:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 58/92 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/92 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 44 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1286 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 58/92 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 54/98 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 98 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1550 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 2878ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2879ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/104 places, 58/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3068 ms. Remains : 34/104 places, 58/592 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND p0 (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-10
Stuttering criterion allowed to conclude after 429 steps with 33 reset in 2 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-10 finished in 3226 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' '!(((p0||(!p1&&G(!p2))) U X(X(p2))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 76 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 100 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 52 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 52 transition count 92
Applied a total of 104 rules in 5 ms. Remains 52 /104 variables (removed 52) and now considering 92/592 (removed 500) transitions.
// Phase 1: matrix 92 rows 52 cols
[2024-05-26 01:20:46] [INFO ] Computed 16 invariants in 1 ms
[2024-05-26 01:20:46] [INFO ] Implicit Places using invariants in 107 ms returned [0, 5, 18, 25]
[2024-05-26 01:20:46] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 113 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/104 places, 92/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 119 ms. Remains : 49/104 places, 92/592 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-11 finished in 390 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((X(p1)&&p0)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 76 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 100 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 52 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 52 transition count 92
Applied a total of 104 rules in 6 ms. Remains 52 /104 variables (removed 52) and now considering 92/592 (removed 500) transitions.
[2024-05-26 01:20:46] [INFO ] Invariant cache hit.
[2024-05-26 01:20:47] [INFO ] Implicit Places using invariants in 146 ms returned [0, 5, 18, 25]
[2024-05-26 01:20:47] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 148 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/104 places, 92/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 156 ms. Remains : 49/104 places, 92/592 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-12
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-12 finished in 393 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 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 68 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 88 place count 60 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 58 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 58 transition count 120
Applied a total of 92 rules in 23 ms. Remains 58 /104 variables (removed 46) and now considering 120/592 (removed 472) transitions.
// Phase 1: matrix 120 rows 58 cols
[2024-05-26 01:20:47] [INFO ] Computed 16 invariants in 2 ms
[2024-05-26 01:20:47] [INFO ] Implicit Places using invariants in 158 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 159 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/104 places, 120/592 transitions.
Applied a total of 0 rules in 6 ms. Remains 57 /57 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 57/104 places, 120/592 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-13
Product exploration explored 100000 steps with 3030 reset in 469 ms.
Product exploration explored 100000 steps with 3030 reset in 347 ms.
Computed a total of 57 stabilizing places and 120 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 57 transition count 120
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLFireability-13 finished in 1146 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 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 75 place count 55 transition count 114
Iterating global reduction 0 with 23 rules applied. Total rules applied 98 place count 55 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 53 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 53 transition count 98
Applied a total of 102 rules in 5 ms. Remains 53 /104 variables (removed 51) and now considering 98/592 (removed 494) transitions.
// Phase 1: matrix 98 rows 53 cols
[2024-05-26 01:20:48] [INFO ] Computed 16 invariants in 1 ms
[2024-05-26 01:20:48] [INFO ] Implicit Places using invariants in 115 ms returned [0, 5, 18, 25]
[2024-05-26 01:20:48] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 117 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/104 places, 98/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 50/104 places, 98/592 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-14 finished in 265 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)) U (G(p2) U p3)))'
Support contains 12 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 66 place count 62 transition count 146
Iterating global reduction 0 with 18 rules applied. Total rules applied 84 place count 62 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 61 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 61 transition count 138
Applied a total of 86 rules in 7 ms. Remains 61 /104 variables (removed 43) and now considering 138/592 (removed 454) transitions.
// Phase 1: matrix 138 rows 61 cols
[2024-05-26 01:20:48] [INFO ] Computed 16 invariants in 1 ms
[2024-05-26 01:20:48] [INFO ] Implicit Places using invariants in 75 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/104 places, 138/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 60/104 places, 138/592 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p3), (NOT p1), (AND (NOT p1) (NOT p2)), false, true, (NOT p2), (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-15 finished in 394 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(p1)||p0)))'
[2024-05-26 01:20:49] [INFO ] Flatten gal took : 129 ms
[2024-05-26 01:20:49] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2024-05-26 01:20:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 592 transitions and 2944 arcs took 15 ms.
Total runtime 265063 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PermAdmissibility-PT-02

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 104
TRANSITIONS: 592
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.028s, Sys 0.005s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1090
MODEL NAME: /home/mcc/execution/411/model
104 places, 592 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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="PermAdmissibility-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PermAdmissibility-PT-02, 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 r267-smll-171654405800164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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