Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r201-smll-167840347800476.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is HirschbergSinclair-PT-35, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347800476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 12K Feb 26 02:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 02:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 02:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 02:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 02:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 02:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 544K Mar 5 18:22 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 HirschbergSinclair-PT-35-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678728789205

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-35
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 17:33:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 17:33:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:33:12] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-13 17:33:12] [INFO ] Transformed 998 places.
[2023-03-13 17:33:12] [INFO ] Transformed 922 transitions.
[2023-03-13 17:33:12] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA HirschbergSinclair-PT-35-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 922/922 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 963 transition count 922
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 66 place count 932 transition count 891
Iterating global reduction 1 with 31 rules applied. Total rules applied 97 place count 932 transition count 891
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 128 place count 901 transition count 860
Iterating global reduction 1 with 31 rules applied. Total rules applied 159 place count 901 transition count 860
Applied a total of 159 rules in 424 ms. Remains 901 /998 variables (removed 97) and now considering 860/922 (removed 62) transitions.
// Phase 1: matrix 860 rows 901 cols
[2023-03-13 17:33:13] [INFO ] Computed 41 place invariants in 42 ms
[2023-03-13 17:33:14] [INFO ] Implicit Places using invariants in 973 ms returned []
[2023-03-13 17:33:14] [INFO ] Invariant cache hit.
[2023-03-13 17:33:16] [INFO ] Implicit Places using invariants and state equation in 2809 ms returned []
Implicit Place search using SMT with State Equation took 3826 ms to find 0 implicit places.
[2023-03-13 17:33:16] [INFO ] Invariant cache hit.
[2023-03-13 17:33:17] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 901/998 places, 860/922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5111 ms. Remains : 901/998 places, 860/922 transitions.
Support contains 42 out of 901 places after structural reductions.
[2023-03-13 17:33:18] [INFO ] Flatten gal took : 200 ms
[2023-03-13 17:33:18] [INFO ] Flatten gal took : 81 ms
[2023-03-13 17:33:18] [INFO ] Input system was already deterministic with 860 transitions.
Support contains 41 out of 901 places (down from 42) after GAL structural reductions.
Finished random walk after 902 steps, including 0 resets, run visited all 27 properties in 182 ms. (steps per millisecond=4 )
Computed a total of 901 stabilizing places and 860 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 901 transition count 860
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)||p0))))'
Support contains 5 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 897 transition count 856
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 893 transition count 852
Applied a total of 16 rules in 134 ms. Remains 893 /901 variables (removed 8) and now considering 852/860 (removed 8) transitions.
// Phase 1: matrix 852 rows 893 cols
[2023-03-13 17:33:19] [INFO ] Computed 41 place invariants in 11 ms
[2023-03-13 17:33:19] [INFO ] Implicit Places using invariants in 631 ms returned []
[2023-03-13 17:33:19] [INFO ] Invariant cache hit.
[2023-03-13 17:33:23] [INFO ] Implicit Places using invariants and state equation in 3100 ms returned []
Implicit Place search using SMT with State Equation took 3734 ms to find 0 implicit places.
[2023-03-13 17:33:23] [INFO ] Invariant cache hit.
[2023-03-13 17:33:24] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/901 places, 852/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4886 ms. Remains : 893/901 places, 852/860 transitions.
Stuttering acceptance computed with spot in 353 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (GEQ s727 1) (AND (GEQ s3 1) (GEQ s259 1))), p0:(OR (LT s37 1) (LT s873 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 834 ms.
Product exploration explored 100000 steps with 33333 reset in 638 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
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) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p1))))
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-00 finished in 7326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X((p1&&G(p2))))))))'
Support contains 4 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 898 transition count 857
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 898 transition count 857
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 895 transition count 854
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 895 transition count 854
Applied a total of 12 rules in 116 ms. Remains 895 /901 variables (removed 6) and now considering 854/860 (removed 6) transitions.
// Phase 1: matrix 854 rows 895 cols
[2023-03-13 17:33:26] [INFO ] Computed 41 place invariants in 7 ms
[2023-03-13 17:33:27] [INFO ] Implicit Places using invariants in 704 ms returned []
[2023-03-13 17:33:27] [INFO ] Invariant cache hit.
[2023-03-13 17:33:30] [INFO ] Implicit Places using invariants and state equation in 3140 ms returned []
Implicit Place search using SMT with State Equation took 3847 ms to find 0 implicit places.
[2023-03-13 17:33:30] [INFO ] Invariant cache hit.
[2023-03-13 17:33:31] [INFO ] Dead Transitions using invariants and state equation in 911 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 895/901 places, 854/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4893 ms. Remains : 895/901 places, 854/860 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s97 1), p1:(OR (LT s61 1) (LT s340 1)), p2:(GEQ s252 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-01 finished in 5170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions removed 378 transitions
Trivial Post-agglo rules discarded 378 transitions
Performed 378 trivial Post agglomeration. Transition count delta: 378
Iterating post reduction 0 with 378 rules applied. Total rules applied 378 place count 867 transition count 448
Reduce places removed 378 places and 0 transitions.
Iterating post reduction 1 with 378 rules applied. Total rules applied 756 place count 489 transition count 448
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 760 place count 485 transition count 444
Iterating global reduction 2 with 4 rules applied. Total rules applied 764 place count 485 transition count 444
Applied a total of 764 rules in 117 ms. Remains 485 /901 variables (removed 416) and now considering 444/860 (removed 416) transitions.
// Phase 1: matrix 444 rows 485 cols
[2023-03-13 17:33:31] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-13 17:33:32] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-13 17:33:32] [INFO ] Invariant cache hit.
[2023-03-13 17:33:34] [INFO ] Implicit Places using invariants and state equation in 2297 ms returned []
Implicit Place search using SMT with State Equation took 2846 ms to find 0 implicit places.
[2023-03-13 17:33:34] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-13 17:33:34] [INFO ] Invariant cache hit.
[2023-03-13 17:33:35] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 485/901 places, 444/860 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3631 ms. Remains : 485/901 places, 444/860 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s32 1) (GEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 794 reset in 684 ms.
Product exploration explored 100000 steps with 794 reset in 659 ms.
Computed a total of 485 stabilizing places and 444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 485 transition count 444
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 140 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2023-03-13 17:33:37] [INFO ] Invariant cache hit.
[2023-03-13 17:33:38] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 191 ms returned sat
[2023-03-13 17:33:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:33:41] [INFO ] [Real]Absence check using state equation in 3465 ms returned sat
[2023-03-13 17:33:41] [INFO ] Computed and/alt/rep : 364/372/364 causal constraints (skipped 14 transitions) in 42 ms.
[2023-03-13 17:33:42] [INFO ] Added : 25 causal constraints over 5 iterations in 757 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 444/444 transitions.
Applied a total of 0 rules in 36 ms. Remains 485 /485 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-13 17:33:42] [INFO ] Invariant cache hit.
[2023-03-13 17:33:43] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-13 17:33:43] [INFO ] Invariant cache hit.
[2023-03-13 17:33:45] [INFO ] Implicit Places using invariants and state equation in 2233 ms returned []
Implicit Place search using SMT with State Equation took 2817 ms to find 0 implicit places.
[2023-03-13 17:33:45] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-13 17:33:45] [INFO ] Invariant cache hit.
[2023-03-13 17:33:45] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3401 ms. Remains : 485/485 places, 444/444 transitions.
Computed a total of 485 stabilizing places and 444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 485 transition count 444
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 138 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=23 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2023-03-13 17:33:46] [INFO ] Invariant cache hit.
[2023-03-13 17:33:47] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 191 ms returned sat
[2023-03-13 17:33:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:33:50] [INFO ] [Real]Absence check using state equation in 3441 ms returned sat
[2023-03-13 17:33:50] [INFO ] Computed and/alt/rep : 364/372/364 causal constraints (skipped 14 transitions) in 35 ms.
[2023-03-13 17:33:51] [INFO ] Added : 25 causal constraints over 5 iterations in 697 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 795 reset in 510 ms.
Product exploration explored 100000 steps with 795 reset in 542 ms.
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 444/444 transitions.
Applied a total of 0 rules in 36 ms. Remains 485 /485 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-13 17:33:52] [INFO ] Invariant cache hit.
[2023-03-13 17:33:53] [INFO ] Implicit Places using invariants in 704 ms returned []
[2023-03-13 17:33:53] [INFO ] Invariant cache hit.
[2023-03-13 17:33:55] [INFO ] Implicit Places using invariants and state equation in 2192 ms returned []
Implicit Place search using SMT with State Equation took 2899 ms to find 0 implicit places.
[2023-03-13 17:33:55] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-13 17:33:55] [INFO ] Invariant cache hit.
[2023-03-13 17:33:56] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3515 ms. Remains : 485/485 places, 444/444 transitions.
Treatment of property HirschbergSinclair-PT-35-LTLFireability-02 finished in 24848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 866 transition count 434
Reduce places removed 391 places and 0 transitions.
Iterating post reduction 1 with 391 rules applied. Total rules applied 782 place count 475 transition count 434
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 786 place count 471 transition count 430
Iterating global reduction 2 with 4 rules applied. Total rules applied 790 place count 471 transition count 430
Applied a total of 790 rules in 57 ms. Remains 471 /901 variables (removed 430) and now considering 430/860 (removed 430) transitions.
// Phase 1: matrix 430 rows 471 cols
[2023-03-13 17:33:56] [INFO ] Computed 41 place invariants in 4 ms
[2023-03-13 17:33:57] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-13 17:33:57] [INFO ] Invariant cache hit.
[2023-03-13 17:33:59] [INFO ] Implicit Places using invariants and state equation in 2157 ms returned []
Implicit Place search using SMT with State Equation took 2694 ms to find 0 implicit places.
[2023-03-13 17:33:59] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-13 17:33:59] [INFO ] Invariant cache hit.
[2023-03-13 17:33:59] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 471/901 places, 430/860 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3352 ms. Remains : 471/901 places, 430/860 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9065 steps with 207 reset in 62 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-04 finished in 3515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0)&&p1))||(X((F(p3)&&p2)) U p4))))'
Support contains 6 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 897 transition count 856
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 893 transition count 852
Applied a total of 16 rules in 116 ms. Remains 893 /901 variables (removed 8) and now considering 852/860 (removed 8) transitions.
// Phase 1: matrix 852 rows 893 cols
[2023-03-13 17:34:00] [INFO ] Computed 41 place invariants in 6 ms
[2023-03-13 17:34:00] [INFO ] Implicit Places using invariants in 743 ms returned []
[2023-03-13 17:34:00] [INFO ] Invariant cache hit.
[2023-03-13 17:34:04] [INFO ] Implicit Places using invariants and state equation in 3204 ms returned []
Implicit Place search using SMT with State Equation took 3950 ms to find 0 implicit places.
[2023-03-13 17:34:04] [INFO ] Invariant cache hit.
[2023-03-13 17:34:05] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/901 places, 852/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5030 ms. Remains : 893/901 places, 852/860 transitions.
Stuttering acceptance computed with spot in 430 ms :[(OR (AND (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p4))), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (AND (NOT p3) (NOT p0)), true, (OR (AND (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p4))), (NOT p0), (OR (NOT p3) (NOT p2) (NOT p4)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4)))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p4), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND p4 (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p4 p1 (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p4) (NOT p1) p2), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p4) p1 (NOT p0) p2), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND p4 p2 (NOT p3)), acceptance={0} source=7 dest: 1}, { cond=(NOT p2), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p4) p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND p4 (NOT p0) p2 (NOT p3)), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p4) (NOT p0) p2), acceptance={0} source=8 dest: 8}]], initial=5, aps=[p4:(LT s353 1), p3:(GEQ s175 1), p1:(GEQ s387 1), p2:(AND (GEQ s13 1) (GEQ s532 1)), p0:(AND (GEQ s13 1) (GEQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 635 ms.
Product exploration explored 100000 steps with 50000 reset in 600 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
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 p4 (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X p4), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p4) p1 (NOT p0) p2)))), (X (X (NOT (AND p4 p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p1) p2)))), (X (X (NOT (AND p4 (NOT p1) p2 (NOT p3))))), (F (G p4)), (F (G (NOT p3))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p4)
Knowledge based reduction with 13 factoid took 197 ms. Reduced automaton from 9 states, 18 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-05 finished in 7265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 897 transition count 856
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 893 transition count 852
Applied a total of 16 rules in 112 ms. Remains 893 /901 variables (removed 8) and now considering 852/860 (removed 8) transitions.
[2023-03-13 17:34:07] [INFO ] Invariant cache hit.
[2023-03-13 17:34:08] [INFO ] Implicit Places using invariants in 665 ms returned []
[2023-03-13 17:34:08] [INFO ] Invariant cache hit.
[2023-03-13 17:34:11] [INFO ] Implicit Places using invariants and state equation in 3236 ms returned []
Implicit Place search using SMT with State Equation took 3904 ms to find 0 implicit places.
[2023-03-13 17:34:11] [INFO ] Invariant cache hit.
[2023-03-13 17:34:12] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/901 places, 852/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4856 ms. Remains : 893/901 places, 852/860 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s684 1) (AND (GEQ s59 1) (GEQ s286 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 297 reset in 472 ms.
Product exploration explored 100000 steps with 296 reset in 523 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 329 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=65 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-13 17:34:14] [INFO ] Invariant cache hit.
[2023-03-13 17:34:15] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 176 ms returned sat
[2023-03-13 17:34:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:29] [INFO ] [Real]Absence check using state equation in 14014 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 893/893 places, 852/852 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions removed 374 transitions
Trivial Post-agglo rules discarded 374 transitions
Performed 374 trivial Post agglomeration. Transition count delta: 374
Iterating post reduction 0 with 374 rules applied. Total rules applied 374 place count 859 transition count 444
Reduce places removed 374 places and 0 transitions.
Iterating post reduction 1 with 374 rules applied. Total rules applied 748 place count 485 transition count 444
Applied a total of 748 rules in 40 ms. Remains 485 /893 variables (removed 408) and now considering 444/852 (removed 408) transitions.
// Phase 1: matrix 444 rows 485 cols
[2023-03-13 17:34:29] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-13 17:34:29] [INFO ] Implicit Places using invariants in 669 ms returned []
[2023-03-13 17:34:29] [INFO ] Invariant cache hit.
[2023-03-13 17:34:31] [INFO ] Implicit Places using invariants and state equation in 2259 ms returned []
Implicit Place search using SMT with State Equation took 2934 ms to find 0 implicit places.
[2023-03-13 17:34:32] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 17:34:32] [INFO ] Invariant cache hit.
[2023-03-13 17:34:32] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 485/893 places, 444/852 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3507 ms. Remains : 485/893 places, 444/852 transitions.
Computed a total of 485 stabilizing places and 444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 485 transition count 444
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 178 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=89 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-13 17:34:33] [INFO ] Invariant cache hit.
[2023-03-13 17:34:33] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 139 ms returned sat
[2023-03-13 17:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:43] [INFO ] [Real]Absence check using state equation in 9801 ms returned sat
[2023-03-13 17:34:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:34:44] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 254 ms returned sat
[2023-03-13 17:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:34:47] [INFO ] [Nat]Absence check using state equation in 3046 ms returned sat
[2023-03-13 17:34:47] [INFO ] Computed and/alt/rep : 365/373/365 causal constraints (skipped 13 transitions) in 35 ms.
[2023-03-13 17:34:50] [INFO ] Added : 242 causal constraints over 49 iterations in 3427 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 624 reset in 424 ms.
Product exploration explored 100000 steps with 624 reset in 469 ms.
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 444/444 transitions.
Applied a total of 0 rules in 23 ms. Remains 485 /485 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-13 17:34:51] [INFO ] Invariant cache hit.
[2023-03-13 17:34:52] [INFO ] Implicit Places using invariants in 881 ms returned []
[2023-03-13 17:34:52] [INFO ] Invariant cache hit.
[2023-03-13 17:34:54] [INFO ] Implicit Places using invariants and state equation in 2255 ms returned []
Implicit Place search using SMT with State Equation took 3139 ms to find 0 implicit places.
[2023-03-13 17:34:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-13 17:34:54] [INFO ] Invariant cache hit.
[2023-03-13 17:34:55] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3682 ms. Remains : 485/485 places, 444/444 transitions.
Treatment of property HirschbergSinclair-PT-35-LTLFireability-06 finished in 48301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(F((F(p1)&&G(!p2)))))||G((F(p1)&&F(G(!p2)))))))'
Support contains 5 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 897 transition count 856
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 893 transition count 852
Applied a total of 16 rules in 107 ms. Remains 893 /901 variables (removed 8) and now considering 852/860 (removed 8) transitions.
// Phase 1: matrix 852 rows 893 cols
[2023-03-13 17:34:55] [INFO ] Computed 41 place invariants in 6 ms
[2023-03-13 17:34:56] [INFO ] Implicit Places using invariants in 609 ms returned []
[2023-03-13 17:34:56] [INFO ] Invariant cache hit.
[2023-03-13 17:34:59] [INFO ] Implicit Places using invariants and state equation in 3052 ms returned []
Implicit Place search using SMT with State Equation took 3681 ms to find 0 implicit places.
[2023-03-13 17:34:59] [INFO ] Invariant cache hit.
[2023-03-13 17:35:00] [INFO ] Dead Transitions using invariants and state equation in 981 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/901 places, 852/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4773 ms. Remains : 893/901 places, 852/860 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) p2), (NOT p1), p2, (OR (NOT p1) p2), p2]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s39 1) (GEQ s490 1)), p1:(LT s654 1), p2:(AND (GEQ s65 1) (GEQ s854 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 108 reset in 481 ms.
Product exploration explored 100000 steps with 108 reset in 423 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
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) p1 (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p2)))
Knowledge based reduction with 11 factoid took 326 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-08 finished in 6576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 2 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 897 transition count 856
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 893 transition count 852
Applied a total of 16 rules in 112 ms. Remains 893 /901 variables (removed 8) and now considering 852/860 (removed 8) transitions.
[2023-03-13 17:35:02] [INFO ] Invariant cache hit.
[2023-03-13 17:35:03] [INFO ] Implicit Places using invariants in 757 ms returned []
[2023-03-13 17:35:03] [INFO ] Invariant cache hit.
[2023-03-13 17:35:06] [INFO ] Implicit Places using invariants and state equation in 3331 ms returned []
Implicit Place search using SMT with State Equation took 4092 ms to find 0 implicit places.
[2023-03-13 17:35:06] [INFO ] Invariant cache hit.
[2023-03-13 17:35:07] [INFO ] Dead Transitions using invariants and state equation in 982 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/901 places, 852/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5191 ms. Remains : 893/901 places, 852/860 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s616 1), p1:(GEQ s308 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 922 steps with 0 reset in 7 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-09 finished in 5377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)||G(p2)))'
Support contains 4 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 898 transition count 857
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 898 transition count 857
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 895 transition count 854
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 895 transition count 854
Applied a total of 12 rules in 159 ms. Remains 895 /901 variables (removed 6) and now considering 854/860 (removed 6) transitions.
// Phase 1: matrix 854 rows 895 cols
[2023-03-13 17:35:07] [INFO ] Computed 41 place invariants in 18 ms
[2023-03-13 17:35:08] [INFO ] Implicit Places using invariants in 800 ms returned []
[2023-03-13 17:35:08] [INFO ] Invariant cache hit.
[2023-03-13 17:35:11] [INFO ] Implicit Places using invariants and state equation in 3251 ms returned []
Implicit Place search using SMT with State Equation took 4057 ms to find 0 implicit places.
[2023-03-13 17:35:11] [INFO ] Invariant cache hit.
[2023-03-13 17:35:12] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 895/901 places, 854/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5195 ms. Remains : 895/901 places, 854/860 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s181 1), p0:(GEQ s16 1), p2:(AND (GEQ s65 1) (GEQ s270 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 14535 reset in 587 ms.
Product exploration explored 100000 steps with 13772 reset in 626 ms.
Computed a total of 895 stabilizing places and 854 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 895 transition count 854
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) p0 (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
Knowledge based reduction with 8 factoid took 461 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 174 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p1), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 472 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 895 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 854/854 transitions.
Applied a total of 0 rules in 34 ms. Remains 895 /895 variables (removed 0) and now considering 854/854 (removed 0) transitions.
[2023-03-13 17:35:15] [INFO ] Invariant cache hit.
[2023-03-13 17:35:16] [INFO ] Implicit Places using invariants in 740 ms returned []
[2023-03-13 17:35:16] [INFO ] Invariant cache hit.
[2023-03-13 17:35:19] [INFO ] Implicit Places using invariants and state equation in 3300 ms returned []
Implicit Place search using SMT with State Equation took 4046 ms to find 0 implicit places.
[2023-03-13 17:35:19] [INFO ] Invariant cache hit.
[2023-03-13 17:35:20] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5096 ms. Remains : 895/895 places, 854/854 transitions.
Computed a total of 895 stabilizing places and 854 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 895 transition count 854
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) p0), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 190 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 257 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 13927 reset in 583 ms.
Product exploration explored 100000 steps with 14596 reset in 628 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 895 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 895/895 places, 854/854 transitions.
Performed 388 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 895 transition count 854
Deduced a syphon composed of 388 places in 5 ms
Applied a total of 388 rules in 124 ms. Remains 895 /895 variables (removed 0) and now considering 854/854 (removed 0) transitions.
[2023-03-13 17:35:23] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 854 rows 895 cols
[2023-03-13 17:35:23] [INFO ] Computed 41 place invariants in 6 ms
[2023-03-13 17:35:24] [INFO ] Dead Transitions using invariants and state equation in 791 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 895/895 places, 854/854 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 935 ms. Remains : 895/895 places, 854/854 transitions.
Support contains 2 out of 895 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 854/854 transitions.
Applied a total of 0 rules in 40 ms. Remains 895 /895 variables (removed 0) and now considering 854/854 (removed 0) transitions.
// Phase 1: matrix 854 rows 895 cols
[2023-03-13 17:35:24] [INFO ] Computed 41 place invariants in 5 ms
[2023-03-13 17:35:25] [INFO ] Implicit Places using invariants in 760 ms returned []
[2023-03-13 17:35:25] [INFO ] Invariant cache hit.
[2023-03-13 17:35:28] [INFO ] Implicit Places using invariants and state equation in 3355 ms returned []
Implicit Place search using SMT with State Equation took 4119 ms to find 0 implicit places.
[2023-03-13 17:35:28] [INFO ] Invariant cache hit.
[2023-03-13 17:35:29] [INFO ] Dead Transitions using invariants and state equation in 1054 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5215 ms. Remains : 895/895 places, 854/854 transitions.
Treatment of property HirschbergSinclair-PT-35-LTLFireability-11 finished in 22433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 897 transition count 856
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 893 transition count 852
Applied a total of 16 rules in 178 ms. Remains 893 /901 variables (removed 8) and now considering 852/860 (removed 8) transitions.
// Phase 1: matrix 852 rows 893 cols
[2023-03-13 17:35:30] [INFO ] Computed 41 place invariants in 5 ms
[2023-03-13 17:35:30] [INFO ] Implicit Places using invariants in 824 ms returned []
[2023-03-13 17:35:30] [INFO ] Invariant cache hit.
[2023-03-13 17:35:33] [INFO ] Implicit Places using invariants and state equation in 3036 ms returned []
Implicit Place search using SMT with State Equation took 3867 ms to find 0 implicit places.
[2023-03-13 17:35:34] [INFO ] Invariant cache hit.
[2023-03-13 17:35:35] [INFO ] Dead Transitions using invariants and state equation in 1011 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/901 places, 852/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5061 ms. Remains : 893/901 places, 852/860 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s428 1) (AND (GEQ s67 1) (GEQ s294 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-12 finished in 5190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 5 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 898 transition count 857
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 898 transition count 857
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 895 transition count 854
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 895 transition count 854
Applied a total of 12 rules in 108 ms. Remains 895 /901 variables (removed 6) and now considering 854/860 (removed 6) transitions.
// Phase 1: matrix 854 rows 895 cols
[2023-03-13 17:35:35] [INFO ] Computed 41 place invariants in 7 ms
[2023-03-13 17:35:36] [INFO ] Implicit Places using invariants in 765 ms returned []
[2023-03-13 17:35:36] [INFO ] Invariant cache hit.
[2023-03-13 17:35:39] [INFO ] Implicit Places using invariants and state equation in 3333 ms returned []
Implicit Place search using SMT with State Equation took 4101 ms to find 0 implicit places.
[2023-03-13 17:35:39] [INFO ] Invariant cache hit.
[2023-03-13 17:35:40] [INFO ] Dead Transitions using invariants and state equation in 926 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 895/901 places, 854/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5137 ms. Remains : 895/901 places, 854/860 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s17 1) (LT s514 1)), p1:(LT s113 1), p2:(OR (LT s21 1) (LT s439 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 108 reset in 525 ms.
Product exploration explored 100000 steps with 108 reset in 512 ms.
Computed a total of 895 stabilizing places and 854 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 895 transition count 854
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 p0 p1 p2), (X p0), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 10 factoid took 254 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-14 finished in 6951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 2 out of 901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 866 transition count 435
Reduce places removed 390 places and 0 transitions.
Iterating post reduction 1 with 390 rules applied. Total rules applied 780 place count 476 transition count 435
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 783 place count 473 transition count 432
Iterating global reduction 2 with 3 rules applied. Total rules applied 786 place count 473 transition count 432
Applied a total of 786 rules in 45 ms. Remains 473 /901 variables (removed 428) and now considering 432/860 (removed 428) transitions.
// Phase 1: matrix 432 rows 473 cols
[2023-03-13 17:35:42] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-13 17:35:42] [INFO ] Implicit Places using invariants in 693 ms returned []
[2023-03-13 17:35:42] [INFO ] Invariant cache hit.
[2023-03-13 17:35:44] [INFO ] Implicit Places using invariants and state equation in 2130 ms returned []
Implicit Place search using SMT with State Equation took 2838 ms to find 0 implicit places.
[2023-03-13 17:35:44] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-13 17:35:44] [INFO ] Invariant cache hit.
[2023-03-13 17:35:45] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 473/901 places, 432/860 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3420 ms. Remains : 473/901 places, 432/860 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s273 1) (LT s49 1)), p0:(LT s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 318 reset in 317 ms.
Product exploration explored 100000 steps with 318 reset in 360 ms.
Computed a total of 473 stabilizing places and 432 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 473 transition count 432
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) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-15 finished in 4620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : HirschbergSinclair-PT-35-LTLFireability-06
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 901 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions removed 378 transitions
Trivial Post-agglo rules discarded 378 transitions
Performed 378 trivial Post agglomeration. Transition count delta: 378
Iterating post reduction 0 with 378 rules applied. Total rules applied 378 place count 867 transition count 448
Reduce places removed 378 places and 0 transitions.
Iterating post reduction 1 with 378 rules applied. Total rules applied 756 place count 489 transition count 448
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 760 place count 485 transition count 444
Iterating global reduction 2 with 4 rules applied. Total rules applied 764 place count 485 transition count 444
Applied a total of 764 rules in 45 ms. Remains 485 /901 variables (removed 416) and now considering 444/860 (removed 416) transitions.
// Phase 1: matrix 444 rows 485 cols
[2023-03-13 17:35:47] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-13 17:35:47] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-13 17:35:47] [INFO ] Invariant cache hit.
[2023-03-13 17:35:49] [INFO ] Implicit Places using invariants and state equation in 2064 ms returned []
Implicit Place search using SMT with State Equation took 2764 ms to find 0 implicit places.
[2023-03-13 17:35:49] [INFO ] Invariant cache hit.
[2023-03-13 17:35:50] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 485/901 places, 444/860 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3407 ms. Remains : 485/901 places, 444/860 transitions.
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s360 1) (AND (GEQ s30 1) (GEQ s151 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 624 reset in 433 ms.
Product exploration explored 100000 steps with 623 reset in 484 ms.
Computed a total of 485 stabilizing places and 444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 485 transition count 444
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 181 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=60 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-13 17:35:51] [INFO ] Invariant cache hit.
[2023-03-13 17:35:52] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 134 ms returned sat
[2023-03-13 17:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:36:02] [INFO ] [Real]Absence check using state equation in 9778 ms returned sat
[2023-03-13 17:36:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:36:03] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 254 ms returned sat
[2023-03-13 17:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:36:06] [INFO ] [Nat]Absence check using state equation in 3006 ms returned sat
[2023-03-13 17:36:06] [INFO ] Computed and/alt/rep : 365/373/365 causal constraints (skipped 13 transitions) in 55 ms.
[2023-03-13 17:36:09] [INFO ] Added : 242 causal constraints over 49 iterations in 3448 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 444/444 transitions.
Applied a total of 0 rules in 22 ms. Remains 485 /485 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-13 17:36:09] [INFO ] Invariant cache hit.
[2023-03-13 17:36:10] [INFO ] Implicit Places using invariants in 689 ms returned []
[2023-03-13 17:36:10] [INFO ] Invariant cache hit.
[2023-03-13 17:36:12] [INFO ] Implicit Places using invariants and state equation in 2375 ms returned []
Implicit Place search using SMT with State Equation took 3066 ms to find 0 implicit places.
[2023-03-13 17:36:12] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 17:36:12] [INFO ] Invariant cache hit.
[2023-03-13 17:36:13] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3694 ms. Remains : 485/485 places, 444/444 transitions.
Computed a total of 485 stabilizing places and 444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 485 transition count 444
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 180 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=90 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-13 17:36:13] [INFO ] Invariant cache hit.
[2023-03-13 17:36:14] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 135 ms returned sat
[2023-03-13 17:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:36:24] [INFO ] [Real]Absence check using state equation in 9776 ms returned sat
[2023-03-13 17:36:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:36:24] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 259 ms returned sat
[2023-03-13 17:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:36:28] [INFO ] [Nat]Absence check using state equation in 3054 ms returned sat
[2023-03-13 17:36:28] [INFO ] Computed and/alt/rep : 365/373/365 causal constraints (skipped 13 transitions) in 60 ms.
[2023-03-13 17:36:31] [INFO ] Added : 242 causal constraints over 49 iterations in 3367 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 623 reset in 445 ms.
Product exploration explored 100000 steps with 623 reset in 477 ms.
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 444/444 transitions.
Applied a total of 0 rules in 17 ms. Remains 485 /485 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-13 17:36:32] [INFO ] Invariant cache hit.
[2023-03-13 17:36:33] [INFO ] Implicit Places using invariants in 662 ms returned []
[2023-03-13 17:36:33] [INFO ] Invariant cache hit.
[2023-03-13 17:36:35] [INFO ] Implicit Places using invariants and state equation in 2186 ms returned []
Implicit Place search using SMT with State Equation took 2852 ms to find 0 implicit places.
[2023-03-13 17:36:35] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 17:36:35] [INFO ] Invariant cache hit.
[2023-03-13 17:36:35] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3462 ms. Remains : 485/485 places, 444/444 transitions.
Treatment of property HirschbergSinclair-PT-35-LTLFireability-06 finished in 49085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)||G(p2)))'
[2023-03-13 17:36:36] [INFO ] Flatten gal took : 53 ms
[2023-03-13 17:36:36] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-13 17:36:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 901 places, 860 transitions and 2582 arcs took 10 ms.
Total runtime 204081 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1635/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1635/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1635/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : HirschbergSinclair-PT-35-LTLFireability-02
Could not compute solution for formula : HirschbergSinclair-PT-35-LTLFireability-06
Could not compute solution for formula : HirschbergSinclair-PT-35-LTLFireability-11

BK_STOP 1678728998478

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name HirschbergSinclair-PT-35-LTLFireability-02
ltl formula formula --ltl=/tmp/1635/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 901 places, 860 transitions and 2582 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.100 real 0.030 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1635/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1635/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1635/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1635/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name HirschbergSinclair-PT-35-LTLFireability-06
ltl formula formula --ltl=/tmp/1635/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 901 places, 860 transitions and 2582 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.100 real 0.040 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1635/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1635/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1635/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1635/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name HirschbergSinclair-PT-35-LTLFireability-11
ltl formula formula --ltl=/tmp/1635/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 901 places, 860 transitions and 2582 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.110 real 0.030 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1635/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1635/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1635/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1635/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="HirschbergSinclair-PT-35"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is HirschbergSinclair-PT-35, 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 r201-smll-167840347800476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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