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.r297-tall-167873950800708.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 PolyORBNT-COL-S10J80, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950800708
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 9.1K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 00:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 03:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 02:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 95K Mar 5 18:23 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 PolyORBNT-COL-S10J80-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S10J80-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679618207238

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=PolyORBNT-COL-S10J80
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 00:36:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 00:36:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 00:36:49] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 00:36:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 00:36:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 617 ms
[2023-03-24 00:36:49] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-24 00:36:50] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2023-03-24 00:36:50] [INFO ] Skeletonized 16 HLPN properties in 5 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10007 steps, including 570 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 22) seen :3
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :15
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-24 00:36:50] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-24 00:36:50] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-24 00:36:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-24 00:36:50] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 00:36:50] [INFO ] Flatten gal took : 21 ms
[2023-03-24 00:36:51] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-24 00:36:51] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 242 ms.
[2023-03-24 00:36:51] [INFO ] Unfolded 10 HLPN properties in 2 ms.
[2023-03-24 00:36:51] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 80 places in 27 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 1256 out of 1614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1604 transition count 3390
Applied a total of 10 rules in 104 ms. Remains 1604 /1614 variables (removed 10) and now considering 3390/3390 (removed 0) transitions.
[2023-03-24 00:36:51] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1604 cols
[2023-03-24 00:36:51] [INFO ] Computed 182 place invariants in 280 ms
[2023-03-24 00:36:55] [INFO ] Dead Transitions using invariants and state equation in 3412 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-24 00:36:55] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2023-03-24 00:36:55] [INFO ] Computed 182 place invariants in 108 ms
[2023-03-24 00:36:55] [INFO ] Implicit Places using invariants in 555 ms returned []
[2023-03-24 00:36:55] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-24 00:36:55] [INFO ] Invariant cache hit.
[2023-03-24 00:36:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:36:57] [INFO ] Implicit Places using invariants and state equation in 1869 ms returned []
Implicit Place search using SMT with State Equation took 2436 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1604/1614 places, 2775/3390 transitions.
Applied a total of 0 rules in 35 ms. Remains 1604 /1604 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6004 ms. Remains : 1604/1614 places, 2775/3390 transitions.
Support contains 1256 out of 1604 places after structural reductions.
[2023-03-24 00:36:57] [INFO ] Flatten gal took : 295 ms
[2023-03-24 00:36:58] [INFO ] Flatten gal took : 184 ms
[2023-03-24 00:36:58] [INFO ] Input system was already deterministic with 2775 transitions.
Incomplete random walk after 10000 steps, including 558 resets, run finished after 1070 ms. (steps per millisecond=9 ) properties (out of 20) seen :8
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 677 ms. (steps per millisecond=14 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 652 ms. (steps per millisecond=15 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :8
Running SMT prover for 4 properties.
[2023-03-24 00:37:02] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-24 00:37:02] [INFO ] Invariant cache hit.
[2023-03-24 00:37:03] [INFO ] [Real]Absence check using 176 positive place invariants in 75 ms returned sat
[2023-03-24 00:37:03] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 38 ms returned sat
[2023-03-24 00:37:03] [INFO ] After 549ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-24 00:37:03] [INFO ] [Nat]Absence check using 176 positive place invariants in 65 ms returned sat
[2023-03-24 00:37:03] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 47 ms returned sat
[2023-03-24 00:37:05] [INFO ] After 1908ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-24 00:37:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:37:06] [INFO ] After 481ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-24 00:37:07] [INFO ] After 1205ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 396 ms.
[2023-03-24 00:37:07] [INFO ] After 4008ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 1604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1604 transition count 2690
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1519 transition count 2690
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 170 place count 1519 transition count 2606
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 338 place count 1435 transition count 2606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 339 place count 1434 transition count 2605
Iterating global reduction 2 with 1 rules applied. Total rules applied 340 place count 1434 transition count 2605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 344 place count 1432 transition count 2603
Applied a total of 344 rules in 596 ms. Remains 1432 /1604 variables (removed 172) and now considering 2603/2775 (removed 172) transitions.
[2023-03-24 00:37:08] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2023-03-24 00:37:08] [INFO ] Computed 182 place invariants in 108 ms
[2023-03-24 00:37:09] [INFO ] Dead Transitions using invariants and state equation in 1765 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2364 ms. Remains : 1432/1604 places, 2603/2775 transitions.
Finished random walk after 621 steps, including 48 resets, run visited all 3 properties in 34 ms. (steps per millisecond=18 )
FORMULA PolyORBNT-COL-S10J80-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((p1&&F(p2))))||p0)))'
Support contains 982 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 33 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-24 00:37:10] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-24 00:37:10] [INFO ] Computed 182 place invariants in 105 ms
[2023-03-24 00:37:13] [INFO ] Dead Transitions using invariants and state equation in 2893 ms found 0 transitions.
[2023-03-24 00:37:13] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:37:13] [INFO ] Invariant cache hit.
[2023-03-24 00:37:13] [INFO ] Implicit Places using invariants in 769 ms returned []
[2023-03-24 00:37:13] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:37:13] [INFO ] Invariant cache hit.
[2023-03-24 00:37:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:37:16] [INFO ] Implicit Places using invariants and state equation in 2991 ms returned []
Implicit Place search using SMT with State Equation took 3764 ms to find 0 implicit places.
[2023-03-24 00:37:16] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:37:16] [INFO ] Invariant cache hit.
[2023-03-24 00:37:19] [INFO ] Dead Transitions using invariants and state equation in 2839 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9536 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s646 1) (GEQ s1449 1)) (AND (GEQ s917 1) (GEQ s1476 1)) (AND (GEQ s542 1) (GEQ s1438 1)) (AND (GEQ s1320 1) (GEQ s1516 1)) (AND (GEQ s108...], 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 18 ms.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-02 finished in 9972 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 1 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 132 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-24 00:37:20] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:37:20] [INFO ] Invariant cache hit.
[2023-03-24 00:37:23] [INFO ] Dead Transitions using invariants and state equation in 2966 ms found 0 transitions.
[2023-03-24 00:37:23] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:37:23] [INFO ] Invariant cache hit.
[2023-03-24 00:37:24] [INFO ] Implicit Places using invariants in 1778 ms returned []
[2023-03-24 00:37:24] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:37:25] [INFO ] Invariant cache hit.
[2023-03-24 00:37:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:37:41] [INFO ] Implicit Places using invariants and state equation in 16279 ms returned []
Implicit Place search using SMT with State Equation took 18062 ms to find 0 implicit places.
[2023-03-24 00:37:41] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:37:41] [INFO ] Invariant cache hit.
[2023-03-24 00:37:43] [INFO ] Dead Transitions using invariants and state equation in 2668 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23838 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s501 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 50000 reset in 1875 ms.
Product exploration explored 100000 steps with 50000 reset in 1797 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J80-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-03 finished in 27734 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)||X(G(p1))))))'
Support contains 4 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 138 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-24 00:37:47] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:37:47] [INFO ] Invariant cache hit.
[2023-03-24 00:37:50] [INFO ] Dead Transitions using invariants and state equation in 2851 ms found 0 transitions.
[2023-03-24 00:37:50] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:37:50] [INFO ] Invariant cache hit.
[2023-03-24 00:37:52] [INFO ] Implicit Places using invariants in 1750 ms returned []
[2023-03-24 00:37:52] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:37:52] [INFO ] Invariant cache hit.
[2023-03-24 00:37:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:38:06] [INFO ] Implicit Places using invariants and state equation in 14346 ms returned []
Implicit Place search using SMT with State Equation took 16103 ms to find 0 implicit places.
[2023-03-24 00:38:06] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:38:06] [INFO ] Invariant cache hit.
[2023-03-24 00:38:09] [INFO ] Dead Transitions using invariants and state equation in 2800 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21898 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (GEQ s414 1) (GEQ s1338 1)), p1:(AND (GEQ s1433 1) (GEQ s1601 10))], 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]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-04 finished in 22143 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(G((p0&&(G(p2)||p1)))))'
Support contains 84 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1604 transition count 2691
Reduce places removed 84 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 85 rules applied. Total rules applied 169 place count 1520 transition count 2690
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 170 place count 1519 transition count 2690
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 170 place count 1519 transition count 2606
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 338 place count 1435 transition count 2606
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 339 place count 1434 transition count 2605
Iterating global reduction 3 with 1 rules applied. Total rules applied 340 place count 1434 transition count 2605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 344 place count 1432 transition count 2603
Applied a total of 344 rules in 420 ms. Remains 1432 /1604 variables (removed 172) and now considering 2603/2775 (removed 172) transitions.
[2023-03-24 00:38:10] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2023-03-24 00:38:10] [INFO ] Computed 182 place invariants in 63 ms
[2023-03-24 00:38:12] [INFO ] Dead Transitions using invariants and state equation in 1794 ms found 0 transitions.
[2023-03-24 00:38:12] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:38:12] [INFO ] Invariant cache hit.
[2023-03-24 00:38:13] [INFO ] Implicit Places using invariants in 1411 ms returned []
[2023-03-24 00:38:13] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:38:13] [INFO ] Invariant cache hit.
[2023-03-24 00:38:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:38:25] [INFO ] Implicit Places using invariants and state equation in 11848 ms returned []
Implicit Place search using SMT with State Equation took 13265 ms to find 0 implicit places.
[2023-03-24 00:38:25] [INFO ] Redundant transitions in 141 ms returned []
[2023-03-24 00:38:25] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:38:25] [INFO ] Invariant cache hit.
[2023-03-24 00:38:27] [INFO ] Dead Transitions using invariants and state equation in 1736 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1432/1604 places, 2603/2775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17369 ms. Remains : 1432/1604 places, 2603/2775 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s88 1) (GEQ s413 1)) (AND (GEQ s0 1) (GEQ s137 1) (GEQ s413 1)) (AND (GEQ s0 1) (GEQ s147 1) (GEQ s413 1)) (AND (GEQ s0 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 3 ms.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-06 finished in 17488 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||(p1 U (p2||G(p1)))))))'
Support contains 85 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Applied a total of 0 rules in 69 ms. Remains 1604 /1604 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
[2023-03-24 00:38:27] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2023-03-24 00:38:27] [INFO ] Computed 182 place invariants in 66 ms
[2023-03-24 00:38:30] [INFO ] Dead Transitions using invariants and state equation in 2827 ms found 0 transitions.
[2023-03-24 00:38:30] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-24 00:38:30] [INFO ] Invariant cache hit.
[2023-03-24 00:38:32] [INFO ] Implicit Places using invariants in 1792 ms returned []
[2023-03-24 00:38:32] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-24 00:38:32] [INFO ] Invariant cache hit.
[2023-03-24 00:38:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:38:43] [INFO ] Implicit Places using invariants and state equation in 11572 ms returned []
Implicit Place search using SMT with State Equation took 13369 ms to find 0 implicit places.
[2023-03-24 00:38:43] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-24 00:38:43] [INFO ] Invariant cache hit.
[2023-03-24 00:38:46] [INFO ] Dead Transitions using invariants and state equation in 2898 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19169 ms. Remains : 1604/1604 places, 2775/2775 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1598 1), p2:(AND (NOT (OR (AND (GEQ s0 1) (GEQ s88 1) (GEQ s413 1)) (AND (GEQ s0 1) (GEQ s137 1) (GEQ s413 1)) (AND (GEQ s0 1) (GEQ s147 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1660 ms.
Product exploration explored 100000 steps with 50000 reset in 1675 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p2 p1)
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J80-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-07 finished in 22832 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(F(p0))||(F(p0)&&G(F(p1))))))'
Support contains 82 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 130 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-24 00:38:50] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-24 00:38:50] [INFO ] Computed 182 place invariants in 61 ms
[2023-03-24 00:38:53] [INFO ] Dead Transitions using invariants and state equation in 2688 ms found 0 transitions.
[2023-03-24 00:38:53] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:38:53] [INFO ] Invariant cache hit.
[2023-03-24 00:38:54] [INFO ] Implicit Places using invariants in 1710 ms returned []
[2023-03-24 00:38:54] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:38:54] [INFO ] Invariant cache hit.
[2023-03-24 00:38:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:39:08] [INFO ] Implicit Places using invariants and state equation in 13902 ms returned []
Implicit Place search using SMT with State Equation took 15614 ms to find 0 implicit places.
[2023-03-24 00:39:08] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:39:08] [INFO ] Invariant cache hit.
[2023-03-24 00:39:11] [INFO ] Dead Transitions using invariants and state equation in 2731 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21170 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-08 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} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s500 2), p1:(AND (LT s1 1) (LT s64 1) (LT s3 1) (LT s66 1) (LT s5 1) (LT s68 1) (LT s7 1) (LT s70 1) (LT s9 1) (LT s72 1) (LT s11 1) (LT s74 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5598 reset in 941 ms.
Product exploration explored 100000 steps with 5601 reset in 953 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 561 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 154510 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154510 steps, saw 46900 distinct states, run finished after 3003 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 00:39:17] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:39:17] [INFO ] Invariant cache hit.
[2023-03-24 00:39:17] [INFO ] [Real]Absence check using 176 positive place invariants in 79 ms returned sat
[2023-03-24 00:39:17] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 50 ms returned sat
[2023-03-24 00:39:17] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 6 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J80-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-08 finished in 27423 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||(G(p0) U G(p1))))))'
Support contains 2 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1604 transition count 2691
Reduce places removed 84 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 85 rules applied. Total rules applied 169 place count 1520 transition count 2690
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 170 place count 1519 transition count 2690
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 170 place count 1519 transition count 2605
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 340 place count 1434 transition count 2605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 344 place count 1432 transition count 2603
Applied a total of 344 rules in 215 ms. Remains 1432 /1604 variables (removed 172) and now considering 2603/2775 (removed 172) transitions.
[2023-03-24 00:39:17] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2023-03-24 00:39:18] [INFO ] Computed 182 place invariants in 64 ms
[2023-03-24 00:39:19] [INFO ] Dead Transitions using invariants and state equation in 1710 ms found 0 transitions.
[2023-03-24 00:39:19] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:39:19] [INFO ] Invariant cache hit.
[2023-03-24 00:39:21] [INFO ] Implicit Places using invariants in 1600 ms returned []
[2023-03-24 00:39:21] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:39:21] [INFO ] Invariant cache hit.
[2023-03-24 00:39:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:39:33] [INFO ] Implicit Places using invariants and state equation in 12548 ms returned []
Implicit Place search using SMT with State Equation took 14150 ms to find 0 implicit places.
[2023-03-24 00:39:33] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-24 00:39:33] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:39:33] [INFO ] Invariant cache hit.
[2023-03-24 00:39:35] [INFO ] Dead Transitions using invariants and state equation in 1749 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1432/1604 places, 2603/2775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17903 ms. Remains : 1432/1604 places, 2603/2775 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s495 1), p0:(GEQ s498 3)], 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 7229 reset in 1207 ms.
Product exploration explored 100000 steps with 7168 reset in 1291 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 16 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 261 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1432/1432 places, 2603/2603 transitions.
Applied a total of 0 rules in 88 ms. Remains 1432 /1432 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-24 00:39:39] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:39:39] [INFO ] Invariant cache hit.
[2023-03-24 00:39:40] [INFO ] Dead Transitions using invariants and state equation in 1853 ms found 0 transitions.
[2023-03-24 00:39:40] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:39:40] [INFO ] Invariant cache hit.
[2023-03-24 00:39:42] [INFO ] Implicit Places using invariants in 1597 ms returned []
[2023-03-24 00:39:42] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:39:42] [INFO ] Invariant cache hit.
[2023-03-24 00:39:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:39:53] [INFO ] Implicit Places using invariants and state equation in 10702 ms returned []
Implicit Place search using SMT with State Equation took 12302 ms to find 0 implicit places.
[2023-03-24 00:39:53] [INFO ] Redundant transitions in 148 ms returned []
[2023-03-24 00:39:53] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:39:53] [INFO ] Invariant cache hit.
[2023-03-24 00:39:55] [INFO ] Dead Transitions using invariants and state equation in 1827 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16235 ms. Remains : 1432/1432 places, 2603/2603 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 72 steps, including 3 resets, run visited all 2 properties in 3 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7169 reset in 1217 ms.
Product exploration explored 100000 steps with 7219 reset in 1268 ms.
Support contains 2 out of 1432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1432/1432 places, 2603/2603 transitions.
Applied a total of 0 rules in 80 ms. Remains 1432 /1432 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-24 00:39:58] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:39:58] [INFO ] Invariant cache hit.
[2023-03-24 00:40:00] [INFO ] Dead Transitions using invariants and state equation in 1900 ms found 0 transitions.
[2023-03-24 00:40:00] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:40:00] [INFO ] Invariant cache hit.
[2023-03-24 00:40:02] [INFO ] Implicit Places using invariants in 1600 ms returned []
[2023-03-24 00:40:02] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:40:02] [INFO ] Invariant cache hit.
[2023-03-24 00:40:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:40:13] [INFO ] Implicit Places using invariants and state equation in 11081 ms returned []
Implicit Place search using SMT with State Equation took 12683 ms to find 0 implicit places.
[2023-03-24 00:40:13] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-24 00:40:13] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:40:13] [INFO ] Invariant cache hit.
[2023-03-24 00:40:14] [INFO ] Dead Transitions using invariants and state equation in 1788 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16529 ms. Remains : 1432/1432 places, 2603/2603 transitions.
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-10 finished in 57649 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(p1)||p0)))'
Support contains 95 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1604 transition count 2690
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1519 transition count 2690
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 170 place count 1519 transition count 2606
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 338 place count 1435 transition count 2606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 339 place count 1434 transition count 2605
Iterating global reduction 2 with 1 rules applied. Total rules applied 340 place count 1434 transition count 2605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 344 place count 1432 transition count 2603
Applied a total of 344 rules in 250 ms. Remains 1432 /1604 variables (removed 172) and now considering 2603/2775 (removed 172) transitions.
[2023-03-24 00:40:15] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2023-03-24 00:40:15] [INFO ] Computed 182 place invariants in 68 ms
[2023-03-24 00:40:17] [INFO ] Dead Transitions using invariants and state equation in 1797 ms found 0 transitions.
[2023-03-24 00:40:17] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:40:17] [INFO ] Invariant cache hit.
[2023-03-24 00:40:18] [INFO ] Implicit Places using invariants in 1211 ms returned []
[2023-03-24 00:40:18] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:40:18] [INFO ] Invariant cache hit.
[2023-03-24 00:40:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:40:29] [INFO ] Implicit Places using invariants and state equation in 10360 ms returned []
Implicit Place search using SMT with State Equation took 11573 ms to find 0 implicit places.
[2023-03-24 00:40:29] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-24 00:40:29] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-24 00:40:29] [INFO ] Invariant cache hit.
[2023-03-24 00:40:30] [INFO ] Dead Transitions using invariants and state equation in 1688 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1432/1604 places, 2603/2775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15370 ms. Remains : 1432/1604 places, 2603/2775 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s82 1) (GEQ s247 1) (GEQ s297 1)) (AND (GEQ s82 1) (GEQ s247 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s247 1) (GEQ s301 1)) (AND (GEQ s82 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 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-11 finished in 15498 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 2 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 147 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-24 00:40:31] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-24 00:40:31] [INFO ] Computed 182 place invariants in 64 ms
[2023-03-24 00:40:33] [INFO ] Dead Transitions using invariants and state equation in 2870 ms found 0 transitions.
[2023-03-24 00:40:33] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:40:33] [INFO ] Invariant cache hit.
[2023-03-24 00:40:35] [INFO ] Implicit Places using invariants in 1782 ms returned []
[2023-03-24 00:40:35] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:40:35] [INFO ] Invariant cache hit.
[2023-03-24 00:40:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:40:48] [INFO ] Implicit Places using invariants and state equation in 12473 ms returned []
Implicit Place search using SMT with State Equation took 14262 ms to find 0 implicit places.
[2023-03-24 00:40:48] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-24 00:40:48] [INFO ] Invariant cache hit.
[2023-03-24 00:40:50] [INFO ] Dead Transitions using invariants and state equation in 2774 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20058 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLFireability-14 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 (LT s414 1) (LT s1335 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 83727 steps with 4691 reset in 735 ms.
FORMULA PolyORBNT-COL-S10J80-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLFireability-14 finished in 20905 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||(G(p0) U G(p1))))))'
[2023-03-24 00:40:52] [INFO ] Flatten gal took : 127 ms
[2023-03-24 00:40:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-24 00:40:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1604 places, 2775 transitions and 14764 arcs took 14 ms.
Total runtime 242950 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1009/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBNT-COL-S10J80-LTLFireability-10

BK_STOP 1679618454001

--------------------
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 PolyORBNT-COL-S10J80-LTLFireability-10
ltl formula formula --ltl=/tmp/1009/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 1604 places, 2775 transitions and 14764 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.340 real 0.110 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1009/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1009/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1009/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1009/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5647e6b023f4]
1: pnml2lts-mc(+0xa2496) [0x5647e6b02496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f1caebac140]
3: pnml2lts-mc(+0x405be5) [0x5647e6e65be5]
4: pnml2lts-mc(+0x16b3f9) [0x5647e6bcb3f9]
5: pnml2lts-mc(+0x164ac4) [0x5647e6bc4ac4]
6: pnml2lts-mc(+0x272e0a) [0x5647e6cd2e0a]
7: pnml2lts-mc(+0xb61f0) [0x5647e6b161f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f1cae9ff4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f1cae9ff67a]
10: pnml2lts-mc(+0xa1581) [0x5647e6b01581]
11: pnml2lts-mc(+0xa1910) [0x5647e6b01910]
12: pnml2lts-mc(+0xa32a2) [0x5647e6b032a2]
13: pnml2lts-mc(+0xa50f4) [0x5647e6b050f4]
14: pnml2lts-mc(+0xa516b) [0x5647e6b0516b]
15: pnml2lts-mc(+0x3f34b3) [0x5647e6e534b3]
16: pnml2lts-mc(+0x7c63d) [0x5647e6adc63d]
17: pnml2lts-mc(+0x67d86) [0x5647e6ac7d86]
18: pnml2lts-mc(+0x60a8a) [0x5647e6ac0a8a]
19: pnml2lts-mc(+0x5eb15) [0x5647e6abeb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f1cae9e7d0a]
21: pnml2lts-mc(+0x6075e) [0x5647e6ac075e]

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="PolyORBNT-COL-S10J80"
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 PolyORBNT-COL-S10J80, 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 r297-tall-167873950800708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J80.tgz
mv PolyORBNT-COL-S10J80 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 ;