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.r520-tall-171662339400836.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 ResAllocation-PT-R003C100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662339400836
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 11 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 23:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 11 23:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 721K 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 ResAllocation-PT-R003C100-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717264957143

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:02:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 18:02:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:02:38] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-06-01 18:02:38] [INFO ] Transformed 600 places.
[2024-06-01 18:02:38] [INFO ] Transformed 400 transitions.
[2024-06-01 18:02:38] [INFO ] Found NUPN structural information;
[2024-06-01 18:02:38] [INFO ] Parsed PT model containing 600 places and 400 transitions and 1794 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ResAllocation-PT-R003C100-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 51 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 600 cols
[2024-06-01 18:02:38] [INFO ] Computed 300 invariants in 21 ms
[2024-06-01 18:02:39] [INFO ] Implicit Places using invariants in 573 ms returned [597, 599]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 609 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 598/600 places, 400/400 transitions.
Applied a total of 0 rules in 19 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 702 ms. Remains : 598/600 places, 400/400 transitions.
Support contains 65 out of 598 places after structural reductions.
[2024-06-01 18:02:39] [INFO ] Flatten gal took : 74 ms
[2024-06-01 18:02:39] [INFO ] Flatten gal took : 34 ms
[2024-06-01 18:02:39] [INFO ] Input system was already deterministic with 400 transitions.
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 37479 steps (177 resets) in 2216 ms. (16 steps per ms) remains 0/27 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 10 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 0 with 190 rules applied. Total rules applied 190 place count 503 transition count 305
Applied a total of 190 rules in 61 ms. Remains 503 /598 variables (removed 95) and now considering 305/400 (removed 95) transitions.
// Phase 1: matrix 305 rows 503 cols
[2024-06-01 18:02:40] [INFO ] Computed 298 invariants in 5 ms
[2024-06-01 18:02:41] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-06-01 18:02:41] [INFO ] Invariant cache hit.
[2024-06-01 18:02:41] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2024-06-01 18:02:41] [INFO ] Redundant transitions in 21 ms returned []
Running 205 sub problems to find dead transitions.
[2024-06-01 18:02:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 503/503 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 298/801 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-01 18:02:43] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 8 ms to minimize.
[2024-06-01 18:02:43] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 18:02:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
[2024-06-01 18:02:44] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 4/805 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 305/808 variables, 503/1308 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 0/1308 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 0/808 variables, 0/1308 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 1308 constraints, problems are : Problem set: 0 solved, 205 unsolved in 14770 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 298/298 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 503/503 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 298/801 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 4/805 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 305/808 variables, 503/1308 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 205/1513 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/808 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 808/808 variables, and 1513 constraints, problems are : Problem set: 0 solved, 205 unsolved in 17350 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 298/298 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 4/4 constraints]
After SMT, in 32209ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 32221ms
Starting structural reductions in SI_LTL mode, iteration 1 : 503/598 places, 305/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33117 ms. Remains : 503/598 places, 305/400 transitions.
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-00
Entered a terminal (fully accepting) state of product in 171 steps with 0 reset in 8 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-00 finished in 33514 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 X(p1))&&(F(G(!p2)) U G(p0)))))'
Support contains 6 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 598 cols
[2024-06-01 18:03:14] [INFO ] Computed 298 invariants in 3 ms
[2024-06-01 18:03:14] [INFO ] Implicit Places using invariants in 315 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 317 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 10 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 334 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0), (NOT p1), (AND (NOT p0) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-02
Product exploration explored 100000 steps with 482 reset in 1033 ms.
Product exploration explored 100000 steps with 481 reset in 1115 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 1103 ms. Reduced automaton from 8 states, 33 edges and 3 AP (stutter sensitive) to 8 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0), (NOT p1), (AND (NOT p0) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
RANDOM walk for 11745 steps (54 resets) in 199 ms. (58 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 4 factoid took 1719 ms. Reduced automaton from 8 states, 32 edges and 3 AP (stutter sensitive) to 8 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0), (NOT p1), (AND (NOT p0) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0), (NOT p1), (AND (NOT p0) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
// Phase 1: matrix 400 rows 597 cols
[2024-06-01 18:03:21] [INFO ] Computed 297 invariants in 4 ms
[2024-06-01 18:03:21] [INFO ] [Real]Absence check using 297 positive place invariants in 22 ms returned unsat
Proved EG (NOT p1)
[2024-06-01 18:03:21] [INFO ] Invariant cache hit.
[2024-06-01 18:03:22] [INFO ] [Real]Absence check using 297 positive place invariants in 259 ms returned sat
[2024-06-01 18:03:28] [INFO ] [Real]Absence check using state equation in 6306 ms returned sat
[2024-06-01 18:03:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:03:28] [INFO ] [Nat]Absence check using 297 positive place invariants in 121 ms returned sat
[2024-06-01 18:03:29] [INFO ] [Nat]Absence check using state equation in 1049 ms returned sat
[2024-06-01 18:03:29] [INFO ] Computed and/alt/rep : 300/300/300 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 18:03:30] [INFO ] Added : 42 causal constraints over 9 iterations in 421 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p1))), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 1691 ms. Reduced automaton from 8 states, 32 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R003C100-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R003C100-LTLFireability-02 finished in 17804 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||X((F((p2||G(p3)))||p1))))))'
Support contains 11 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 598 cols
[2024-06-01 18:03:32] [INFO ] Computed 298 invariants in 3 ms
[2024-06-01 18:03:32] [INFO ] Implicit Places using invariants in 324 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 325 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 341 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-03
Stuttering criterion allowed to conclude after 477 steps with 40 reset in 14 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-03 finished in 538 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))||(G(F(p2))&&F(p1)))))'
Support contains 4 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-06-01 18:03:32] [INFO ] Invariant cache hit.
[2024-06-01 18:03:32] [INFO ] Implicit Places using invariants in 330 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 331 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 347 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-04
Stuttering criterion allowed to conclude after 239 steps with 9 reset in 4 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-04 finished in 667 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 U !p1))))'
Support contains 6 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 498 transition count 301
Applied a total of 199 rules in 41 ms. Remains 498 /598 variables (removed 100) and now considering 301/400 (removed 99) transitions.
// Phase 1: matrix 301 rows 498 cols
[2024-06-01 18:03:33] [INFO ] Computed 297 invariants in 1 ms
[2024-06-01 18:03:33] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-06-01 18:03:33] [INFO ] Invariant cache hit.
[2024-06-01 18:03:34] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2024-06-01 18:03:34] [INFO ] Redundant transitions in 4 ms returned []
Running 201 sub problems to find dead transitions.
[2024-06-01 18:03:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 498/498 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 297/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 301/799 variables, 498/1293 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/799 variables, 0/1293 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 0/799 variables, 0/1293 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 1293 constraints, problems are : Problem set: 0 solved, 201 unsolved in 10925 ms.
Refiners :[Domain max(s): 498/498 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 498/498 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 297/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 301/799 variables, 498/1293 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/799 variables, 201/1494 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/799 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 799/799 variables, and 1494 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16881 ms.
Refiners :[Domain max(s): 498/498 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 27849ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 27856ms
Starting structural reductions in SI_LTL mode, iteration 1 : 498/598 places, 301/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28647 ms. Remains : 498/598 places, 301/400 transitions.
Stuttering acceptance computed with spot in 84 ms :[p1, p1]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-05
Product exploration explored 100000 steps with 504 reset in 961 ms.
Product exploration explored 100000 steps with 506 reset in 1018 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT (OR (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 373 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[p1, p1]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 13625 steps (66 resets) in 202 ms. (67 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT (OR (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 516 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[p1, p1]
Stuttering acceptance computed with spot in 74 ms :[p1, p1]
Support contains 6 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 301/301 transitions.
Applied a total of 0 rules in 16 ms. Remains 498 /498 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2024-06-01 18:04:05] [INFO ] Invariant cache hit.
[2024-06-01 18:04:05] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-06-01 18:04:05] [INFO ] Invariant cache hit.
[2024-06-01 18:04:06] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2024-06-01 18:04:06] [INFO ] Redundant transitions in 4 ms returned []
Running 201 sub problems to find dead transitions.
[2024-06-01 18:04:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 498/498 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 297/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 301/799 variables, 498/1293 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/799 variables, 0/1293 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 0/799 variables, 0/1293 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 1293 constraints, problems are : Problem set: 0 solved, 201 unsolved in 10726 ms.
Refiners :[Domain max(s): 498/498 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 498/498 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 297/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 301/799 variables, 498/1293 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/799 variables, 201/1494 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/799 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 799/799 variables, and 1494 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16675 ms.
Refiners :[Domain max(s): 498/498 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 27443ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 27446ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28232 ms. Remains : 498/498 places, 301/301 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (OR p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (OR p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 376 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[p1, p1]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 33420 steps (164 resets) in 405 ms. (82 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (OR p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (OR p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 436 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[p1, p1]
Stuttering acceptance computed with spot in 73 ms :[p1, p1]
Stuttering acceptance computed with spot in 69 ms :[p1, p1]
Product exploration explored 100000 steps with 506 reset in 945 ms.
Product exploration explored 100000 steps with 505 reset in 1043 ms.
Support contains 6 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 301/301 transitions.
Applied a total of 0 rules in 10 ms. Remains 498 /498 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2024-06-01 18:04:36] [INFO ] Invariant cache hit.
[2024-06-01 18:04:37] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-01 18:04:37] [INFO ] Invariant cache hit.
[2024-06-01 18:04:37] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2024-06-01 18:04:37] [INFO ] Redundant transitions in 2 ms returned []
Running 201 sub problems to find dead transitions.
[2024-06-01 18:04:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 498/498 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 297/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 301/799 variables, 498/1293 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/799 variables, 0/1293 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 0/799 variables, 0/1293 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 1293 constraints, problems are : Problem set: 0 solved, 201 unsolved in 10781 ms.
Refiners :[Domain max(s): 498/498 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 498/498 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 297/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 301/799 variables, 498/1293 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/799 variables, 201/1494 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/799 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 799/799 variables, and 1494 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16681 ms.
Refiners :[Domain max(s): 498/498 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 27495ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 27498ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28272 ms. Remains : 498/498 places, 301/301 transitions.
Treatment of property ResAllocation-PT-R003C100-LTLFireability-05 finished in 92004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 498 transition count 301
Applied a total of 199 rules in 20 ms. Remains 498 /598 variables (removed 100) and now considering 301/400 (removed 99) transitions.
// Phase 1: matrix 301 rows 498 cols
[2024-06-01 18:05:05] [INFO ] Computed 297 invariants in 2 ms
[2024-06-01 18:05:05] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-06-01 18:05:05] [INFO ] Invariant cache hit.
[2024-06-01 18:05:06] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2024-06-01 18:05:06] [INFO ] Redundant transitions in 1 ms returned []
Running 201 sub problems to find dead transitions.
[2024-06-01 18:05:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 498/498 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 297/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 18:05:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 3 ms to minimize.
[2024-06-01 18:05:07] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 301/799 variables, 498/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/799 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 1295 constraints, problems are : Problem set: 0 solved, 201 unsolved in 14512 ms.
Refiners :[Domain max(s): 498/498 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 498/498 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 297/795 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 301/799 variables, 498/1295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 201/1496 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/799 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 799/799 variables, and 1496 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16706 ms.
Refiners :[Domain max(s): 498/498 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 2/2 constraints]
After SMT, in 31260ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 31263ms
Starting structural reductions in SI_LTL mode, iteration 1 : 498/598 places, 301/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32028 ms. Remains : 498/598 places, 301/400 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-06
Stuttering criterion allowed to conclude after 203 steps with 0 reset in 5 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-06 finished in 32102 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(p1)))))'
Support contains 4 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 598 cols
[2024-06-01 18:05:37] [INFO ] Computed 298 invariants in 2 ms
[2024-06-01 18:05:37] [INFO ] Implicit Places using invariants in 323 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 324 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 338 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 822 ms.
Product exploration explored 100000 steps with 50000 reset in 893 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R003C100-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R003C100-LTLFireability-08 finished in 2260 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(G(p1))&&p0))))'
Support contains 5 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-06-01 18:05:39] [INFO ] Invariant cache hit.
[2024-06-01 18:05:39] [INFO ] Implicit Places using invariants in 311 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 312 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 323 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-10
Stuttering criterion allowed to conclude after 188 steps with 0 reset in 4 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-10 finished in 458 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||G(p1)))&&(p2||F(p0)))))'
Support contains 5 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-06-01 18:05:40] [INFO ] Invariant cache hit.
[2024-06-01 18:05:40] [INFO ] Implicit Places using invariants in 303 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 304 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 318 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-11
Entered a terminal (fully accepting) state of product in 58 steps with 8 reset in 2 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-11 finished in 549 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)&&X((G(!p1) U p2))))'
Support contains 7 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-06-01 18:05:40] [INFO ] Invariant cache hit.
[2024-06-01 18:05:40] [INFO ] Implicit Places using invariants in 313 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 313 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 325 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), true, p1]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-12
Entered a terminal (fully accepting) state of product in 156 steps with 48 reset in 2 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-12 finished in 505 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(G(p0))))))'
Support contains 1 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-06-01 18:05:41] [INFO ] Invariant cache hit.
[2024-06-01 18:05:41] [INFO ] Implicit Places using invariants in 309 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 310 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 322 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-13
Entered a terminal (fully accepting) state of product in 10469 steps with 51 reset in 103 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-13 finished in 531 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))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 497 transition count 300
Applied a total of 201 rules in 25 ms. Remains 497 /598 variables (removed 101) and now considering 300/400 (removed 100) transitions.
// Phase 1: matrix 300 rows 497 cols
[2024-06-01 18:05:41] [INFO ] Computed 297 invariants in 3 ms
[2024-06-01 18:05:42] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-06-01 18:05:42] [INFO ] Invariant cache hit.
[2024-06-01 18:05:42] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2024-06-01 18:05:42] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2024-06-01 18:05:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 497/497 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/497 variables, 297/794 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 300/797 variables, 497/1291 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/797 variables, 0/1291 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 0/797 variables, 0/1291 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 797/797 variables, and 1291 constraints, problems are : Problem set: 0 solved, 200 unsolved in 11024 ms.
Refiners :[Domain max(s): 497/497 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 497/497 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/497 variables, 297/794 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 300/797 variables, 497/1291 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/797 variables, 200/1491 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/797 variables, 0/1491 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/797 variables, 0/1491 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 797/797 variables, and 1491 constraints, problems are : Problem set: 0 solved, 200 unsolved in 18230 ms.
Refiners :[Domain max(s): 497/497 constraints, Positive P Invariants (semi-flows): 297/297 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 29290ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 29291ms
Starting structural reductions in SI_LTL mode, iteration 1 : 497/598 places, 300/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30056 ms. Remains : 497/598 places, 300/400 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-14
Stuttering criterion allowed to conclude after 233 steps with 2 reset in 4 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-14 finished in 30116 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 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 598 /598 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 598 cols
[2024-06-01 18:06:11] [INFO ] Computed 298 invariants in 6 ms
[2024-06-01 18:06:12] [INFO ] Implicit Places using invariants in 327 ms returned [595]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 328 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 337 ms. Remains : 597/598 places, 400/400 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLFireability-15
Stuttering criterion allowed to conclude after 214 steps with 0 reset in 7 ms.
FORMULA ResAllocation-PT-R003C100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLFireability-15 finished in 431 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 U !p1))))'
[2024-06-01 18:06:12] [INFO ] Flatten gal took : 32 ms
[2024-06-01 18:06:12] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 18:06:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 598 places, 400 transitions and 1790 arcs took 9 ms.
Total runtime 214229 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ResAllocation-PT-R003C100-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717265430712

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2024
ltl formula name ResAllocation-PT-R003C100-LTLFireability-05
ltl formula formula --ltl=/tmp/1493/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 598 places, 400 transitions and 1790 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1493/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1493/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1493/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1493/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 599 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 599, there are 435 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~1049764 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~1562180 transitions
pnml2lts-mc( 3/ 4): ~5859 levels ~40000 states ~1911528 transitions
pnml2lts-mc( 3/ 4): ~5941 levels ~80000 states ~2664888 transitions
pnml2lts-mc( 1/ 4): ~5151 levels ~160000 states ~3504560 transitions
pnml2lts-mc( 1/ 4): ~5151 levels ~320000 states ~5395696 transitions
pnml2lts-mc( 1/ 4): ~5151 levels ~640000 states ~8771640 transitions
pnml2lts-mc( 1/ 4): ~5151 levels ~1280000 states ~16628952 transitions
pnml2lts-mc( 1/ 4): ~5567 levels ~2560000 states ~35854820 transitions
pnml2lts-mc( 1/ 4): ~5567 levels ~5120000 states ~66582676 transitions
pnml2lts-mc( 1/ 4): ~5638 levels ~10240000 states ~138504268 transitions
pnml2lts-mc( 1/ 4): ~7531 levels ~20480000 states ~300892592 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6911028
pnml2lts-mc( 0/ 4): unique states count: 18594934
pnml2lts-mc( 0/ 4): unique transitions count: 468990195
pnml2lts-mc( 0/ 4): - self-loop count: 34
pnml2lts-mc( 0/ 4): - claim dead count: 354180616
pnml2lts-mc( 0/ 4): - claim found count: 48248508
pnml2lts-mc( 0/ 4): - claim success count: 18594937
pnml2lts-mc( 0/ 4): - cum. max stack depth: 358593
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 18594937 states 468990494 transitions, fanout: 25.221
pnml2lts-mc( 0/ 4): Total exploration time 257.620 sec (257.540 sec minimum, 257.568 sec on average)
pnml2lts-mc( 0/ 4): States per second: 72180, Transitions per second: 1820474
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 261.6MB, 8.2 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/8.0%
pnml2lts-mc( 0/ 4): Stored 403 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 261.6MB (~256.0MB paged-in)

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="ResAllocation-PT-R003C100"
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 ResAllocation-PT-R003C100, 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 r520-tall-171662339400836"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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