fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r297-tall-167873950800683
Last Updated
May 14, 2023

About the Execution of LTSMin+red for PolyORBNT-COL-S10J30

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
729.703 119130.00 148732.00 718.80 FFTFFFFTTFFTFF?F normal

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-167873950800683.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-S10J30, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950800683
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.9K Feb 26 00:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 00:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:29 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 3.8K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 01:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:07 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 93K 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-S10J30-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679610337164

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J30
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 22:25:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 22:25:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 22:25:39] [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-23 22:25:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 22:25:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 813 ms
[2023-03-23 22:25:40] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-23 22:25:40] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-23 22:25:40] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10004 steps, including 573 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 30) seen :5
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :15
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1007 steps, including 23 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 22:25:40] [INFO ] Computed 13 place invariants in 8 ms
[2023-03-23 22:25:41] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 22:25:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-23 22:25:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 22:25:41] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 22:25:41] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-23 22:25:41] [INFO ] Flatten gal took : 45 ms
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 22:25:41] [INFO ] Flatten gal took : 9 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-23 22:25:41] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 271 ms.
[2023-03-23 22:25:41] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Deduced a syphon composed of 30 places in 26 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 511 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 49 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2023-03-23 22:25:41] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-23 22:25:41] [INFO ] Computed 92 place invariants in 115 ms
[2023-03-23 22:25:43] [INFO ] Dead Transitions using invariants and state equation in 1461 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-23 22:25:43] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 664 cols
[2023-03-23 22:25:43] [INFO ] Computed 92 place invariants in 55 ms
[2023-03-23 22:25:43] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-23 22:25:43] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-23 22:25:43] [INFO ] Invariant cache hit.
[2023-03-23 22:25:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:25:45] [INFO ] Implicit Places using invariants and state equation in 2432 ms returned []
Implicit Place search using SMT with State Equation took 2762 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/664 places, 1325/1940 transitions.
Applied a total of 0 rules in 16 ms. Remains 664 /664 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4295 ms. Remains : 664/664 places, 1325/1940 transitions.
Support contains 511 out of 664 places after structural reductions.
[2023-03-23 22:25:46] [INFO ] Flatten gal took : 162 ms
[2023-03-23 22:25:46] [INFO ] Flatten gal took : 123 ms
[2023-03-23 22:25:46] [INFO ] Input system was already deterministic with 1325 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 518 ms. (steps per millisecond=19 ) properties (out of 18) seen :5
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-23 22:25:47] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-23 22:25:47] [INFO ] Invariant cache hit.
[2023-03-23 22:25:47] [INFO ] [Real]Absence check using 85 positive place invariants in 27 ms returned sat
[2023-03-23 22:25:48] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-23 22:25:49] [INFO ] After 1411ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:3
[2023-03-23 22:25:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:25:49] [INFO ] After 106ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :2 sat :1 real:3
[2023-03-23 22:25:49] [INFO ] After 240ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-23 22:25:49] [INFO ] After 2028ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :1 real:3
[2023-03-23 22:25:49] [INFO ] [Nat]Absence check using 85 positive place invariants in 28 ms returned sat
[2023-03-23 22:25:50] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-23 22:26:00] [INFO ] After 10104ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-23 22:26:00] [INFO ] After 289ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-03-23 22:26:01] [INFO ] Deduced a trap composed of 171 places in 521 ms of which 2 ms to minimize.
[2023-03-23 22:26:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 737 ms
[2023-03-23 22:26:01] [INFO ] After 1344ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-23 22:26:01] [INFO ] After 11867ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 313 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 82 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 82 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 152 place count 583 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 582 transition count 1253
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 582 transition count 1253
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 158 place count 580 transition count 1251
Applied a total of 158 rules in 157 ms. Remains 580 /664 variables (removed 84) and now considering 1251/1325 (removed 74) transitions.
[2023-03-23 22:26:01] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-23 22:26:01] [INFO ] Computed 82 place invariants in 28 ms
[2023-03-23 22:26:02] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 862 ms. Remains : 580/664 places, 1251/1325 transitions.
Finished random walk after 52 steps, including 2 resets, run visited all 4 properties in 2 ms. (steps per millisecond=26 )
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 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(F((F(p1)&&p0))))'
Support contains 12 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 55 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-23 22:26:02] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-23 22:26:02] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-23 22:26:03] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
[2023-03-23 22:26:03] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:03] [INFO ] Invariant cache hit.
[2023-03-23 22:26:04] [INFO ] Implicit Places using invariants in 593 ms returned []
[2023-03-23 22:26:04] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:04] [INFO ] Invariant cache hit.
[2023-03-23 22:26:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:26:07] [INFO ] Implicit Places using invariants and state equation in 3175 ms returned []
Implicit Place search using SMT with State Equation took 3781 ms to find 0 implicit places.
[2023-03-23 22:26:07] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:07] [INFO ] Invariant cache hit.
[2023-03-23 22:26:08] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5581 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT 3 s536), p0:(AND (GT 3 s536) (GT s652 (ADD s570 s571 s572 s573 s574 s575 s576 s577 s578 s579)))], 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][false, false, false]]
Stuttering criterion allowed to conclude after 76 steps with 4 reset in 6 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-03 finished in 5958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Applied a total of 10 rules in 20 ms. Remains 654 /664 variables (removed 10) and now considering 1325/1325 (removed 0) transitions.
[2023-03-23 22:26:08] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 654 cols
[2023-03-23 22:26:08] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-23 22:26:09] [INFO ] Dead Transitions using invariants and state equation in 898 ms found 0 transitions.
[2023-03-23 22:26:09] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-23 22:26:09] [INFO ] Invariant cache hit.
[2023-03-23 22:26:10] [INFO ] Implicit Places using invariants in 594 ms returned []
[2023-03-23 22:26:10] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-23 22:26:10] [INFO ] Invariant cache hit.
[2023-03-23 22:26:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:26:14] [INFO ] Implicit Places using invariants and state equation in 3823 ms returned []
Implicit Place search using SMT with State Equation took 4422 ms to find 0 implicit places.
[2023-03-23 22:26:14] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-23 22:26:14] [INFO ] Invariant cache hit.
[2023-03-23 22:26:15] [INFO ] Dead Transitions using invariants and state equation in 957 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1325/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6308 ms. Remains : 654/664 places, 1325/1325 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s652)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1031 ms.
Product exploration explored 100000 steps with 50000 reset in 893 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-08 finished in 8444 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))))'
Support contains 1 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 34 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-23 22:26:17] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-23 22:26:17] [INFO ] Computed 82 place invariants in 24 ms
[2023-03-23 22:26:18] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
[2023-03-23 22:26:18] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:18] [INFO ] Invariant cache hit.
[2023-03-23 22:26:18] [INFO ] Implicit Places using invariants in 596 ms returned []
[2023-03-23 22:26:18] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:18] [INFO ] Invariant cache hit.
[2023-03-23 22:26:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:26:21] [INFO ] Implicit Places using invariants and state equation in 3109 ms returned []
Implicit Place search using SMT with State Equation took 3707 ms to find 0 implicit places.
[2023-03-23 22:26:21] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:21] [INFO ] Invariant cache hit.
[2023-03-23 22:26:22] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5551 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s164)], 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][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-09 finished in 5710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 14 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 34 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-23 22:26:22] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:22] [INFO ] Invariant cache hit.
[2023-03-23 22:26:23] [INFO ] Dead Transitions using invariants and state equation in 946 ms found 0 transitions.
[2023-03-23 22:26:23] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:23] [INFO ] Invariant cache hit.
[2023-03-23 22:26:24] [INFO ] Implicit Places using invariants in 607 ms returned []
[2023-03-23 22:26:24] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:24] [INFO ] Invariant cache hit.
[2023-03-23 22:26:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:26:27] [INFO ] Implicit Places using invariants and state equation in 3294 ms returned []
Implicit Place search using SMT with State Equation took 3906 ms to find 0 implicit places.
[2023-03-23 22:26:27] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:27] [INFO ] Invariant cache hit.
[2023-03-23 22:26:28] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5746 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (LEQ (ADD s570 s571 s572 s573 s574 s575 s576 s577 s578 s579) s650) (OR (LEQ s201 s163) (LEQ 2 s199))), p0:(LEQ 2 s199)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-10 finished in 5897 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||G(p1)))))'
Support contains 3 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 32 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-23 22:26:28] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:28] [INFO ] Invariant cache hit.
[2023-03-23 22:26:29] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
[2023-03-23 22:26:29] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:29] [INFO ] Invariant cache hit.
[2023-03-23 22:26:30] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-23 22:26:30] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:30] [INFO ] Invariant cache hit.
[2023-03-23 22:26:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:26:34] [INFO ] Implicit Places using invariants and state equation in 4070 ms returned []
Implicit Place search using SMT with State Equation took 4608 ms to find 0 implicit places.
[2023-03-23 22:26:34] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:34] [INFO ] Invariant cache hit.
[2023-03-23 22:26:35] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6471 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ 1 s197), p0:(LEQ s32 s537)], 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 861 ms.
Product exploration explored 100000 steps with 50000 reset in 879 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-11 finished in 8502 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)))'
Support contains 10 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1253
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1253
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 2 with 4 rules applied. Total rules applied 148 place count 580 transition count 1251
Applied a total of 148 rules in 116 ms. Remains 580 /664 variables (removed 84) and now considering 1251/1325 (removed 74) transitions.
[2023-03-23 22:26:37] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-23 22:26:37] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-23 22:26:38] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
[2023-03-23 22:26:38] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:26:38] [INFO ] Invariant cache hit.
[2023-03-23 22:26:38] [INFO ] Implicit Places using invariants in 492 ms returned []
[2023-03-23 22:26:38] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:26:38] [INFO ] Invariant cache hit.
[2023-03-23 22:26:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:26:41] [INFO ] Implicit Places using invariants and state equation in 2807 ms returned []
Implicit Place search using SMT with State Equation took 3304 ms to find 0 implicit places.
[2023-03-23 22:26:41] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-23 22:26:41] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:26:41] [INFO ] Invariant cache hit.
[2023-03-23 22:26:42] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/664 places, 1251/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4856 ms. Remains : 580/664 places, 1251/1325 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s198 s199 s200 s201 s202 s203 s204 s205 s206 s207))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 34 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-12 finished in 4918 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(p0))'
Support contains 63 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 654 transition count 1322
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 651 transition count 1321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 650 transition count 1321
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 650 transition count 1318
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 647 transition count 1318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 646 transition count 1317
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 646 transition count 1317
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 20 place count 644 transition count 1315
Applied a total of 20 rules in 112 ms. Remains 644 /664 variables (removed 20) and now considering 1315/1325 (removed 10) transitions.
[2023-03-23 22:26:42] [INFO ] Flow matrix only has 1306 transitions (discarded 9 similar events)
// Phase 1: matrix 1306 rows 644 cols
[2023-03-23 22:26:42] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-23 22:26:43] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
[2023-03-23 22:26:43] [INFO ] Flow matrix only has 1306 transitions (discarded 9 similar events)
[2023-03-23 22:26:43] [INFO ] Invariant cache hit.
[2023-03-23 22:26:43] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-23 22:26:43] [INFO ] Flow matrix only has 1306 transitions (discarded 9 similar events)
[2023-03-23 22:26:43] [INFO ] Invariant cache hit.
[2023-03-23 22:26:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:26:45] [INFO ] Implicit Places using invariants and state equation in 2114 ms returned []
Implicit Place search using SMT with State Equation took 2699 ms to find 0 implicit places.
[2023-03-23 22:26:45] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-23 22:26:45] [INFO ] Flow matrix only has 1306 transitions (discarded 9 similar events)
[2023-03-23 22:26:45] [INFO ] Invariant cache hit.
[2023-03-23 22:26:46] [INFO ] Dead Transitions using invariants and state equation in 893 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 644/664 places, 1315/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4597 ms. Remains : 644/664 places, 1315/1325 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ (ADD s609 s610 s611 s612 s613 s614 s615 s616 s617 s618 s619 s620 s621 s622 s623 s624 s625 s626 s627 s628 s629 s630 s631 s632 s633 s634 s635 s636 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-13 finished in 4674 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(G(p0))&&F(p1))))'
Support contains 3 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 32 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-23 22:26:46] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-23 22:26:46] [INFO ] Computed 82 place invariants in 15 ms
[2023-03-23 22:26:47] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
[2023-03-23 22:26:47] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:47] [INFO ] Invariant cache hit.
[2023-03-23 22:26:48] [INFO ] Implicit Places using invariants in 520 ms returned []
[2023-03-23 22:26:48] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:48] [INFO ] Invariant cache hit.
[2023-03-23 22:26:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:26:51] [INFO ] Implicit Places using invariants and state equation in 3167 ms returned []
Implicit Place search using SMT with State Equation took 3706 ms to find 0 implicit places.
[2023-03-23 22:26:51] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:51] [INFO ] Invariant cache hit.
[2023-03-23 22:26:52] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5551 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s203 s161), p0:(GT 1 s537)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5606 reset in 695 ms.
Product exploration explored 100000 steps with 5604 reset in 671 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 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 283083 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 283083 steps, saw 80037 distinct states, run finished after 3002 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 22:26:57] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-23 22:26:57] [INFO ] Invariant cache hit.
[2023-03-23 22:26:57] [INFO ] [Real]Absence check using 76 positive place invariants in 21 ms returned sat
[2023-03-23 22:26:57] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 11 ms returned sat
[2023-03-23 22:26:57] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 22:26:57] [INFO ] [Nat]Absence check using 76 positive place invariants in 22 ms returned sat
[2023-03-23 22:26:57] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 12 ms returned sat
[2023-03-23 22:26:58] [INFO ] After 828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 22:26:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:26:58] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 22:26:58] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-23 22:26:58] [INFO ] After 1168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 653 transition count 1289
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 583 transition count 1254
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 580 transition count 1251
Applied a total of 146 rules in 63 ms. Remains 580 /653 variables (removed 73) and now considering 1251/1324 (removed 73) transitions.
[2023-03-23 22:26:58] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-23 22:26:58] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-23 22:26:59] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 708 ms. Remains : 580/653 places, 1251/1324 transitions.
Finished random walk after 159 steps, including 10 resets, run visited all 1 properties in 3 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 1 out of 653 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 653 transition count 1289
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 584 transition count 1255
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 581 transition count 1252
Applied a total of 144 rules in 66 ms. Remains 581 /653 variables (removed 72) and now considering 1252/1324 (removed 72) transitions.
[2023-03-23 22:26:59] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 22:26:59] [INFO ] Computed 82 place invariants in 15 ms
[2023-03-23 22:27:00] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
[2023-03-23 22:27:00] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:27:00] [INFO ] Invariant cache hit.
[2023-03-23 22:27:00] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-23 22:27:00] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:27:00] [INFO ] Invariant cache hit.
[2023-03-23 22:27:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:27:04] [INFO ] Implicit Places using invariants and state equation in 3433 ms returned []
Implicit Place search using SMT with State Equation took 3915 ms to find 0 implicit places.
[2023-03-23 22:27:04] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-23 22:27:04] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:27:04] [INFO ] Invariant cache hit.
[2023-03-23 22:27:05] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/653 places, 1252/1324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5514 ms. Remains : 581/653 places, 1252/1324 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 113 steps, including 8 resets, run visited all 1 properties in 3 ms. (steps per millisecond=37 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6782 reset in 759 ms.
Product exploration explored 100000 steps with 6755 reset in 834 ms.
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 581 transition count 1251
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 580 transition count 1251
Applied a total of 2 rules in 60 ms. Remains 580 /581 variables (removed 1) and now considering 1251/1252 (removed 1) transitions.
[2023-03-23 22:27:07] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-23 22:27:07] [INFO ] Computed 82 place invariants in 14 ms
[2023-03-23 22:27:08] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
[2023-03-23 22:27:08] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:27:08] [INFO ] Invariant cache hit.
[2023-03-23 22:27:08] [INFO ] Implicit Places using invariants in 549 ms returned []
[2023-03-23 22:27:08] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:27:08] [INFO ] Invariant cache hit.
[2023-03-23 22:27:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:27:12] [INFO ] Implicit Places using invariants and state equation in 3198 ms returned []
Implicit Place search using SMT with State Equation took 3767 ms to find 0 implicit places.
[2023-03-23 22:27:12] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-23 22:27:12] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:27:12] [INFO ] Invariant cache hit.
[2023-03-23 22:27:12] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/581 places, 1251/1252 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5669 ms. Remains : 580/581 places, 1251/1252 transitions.
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-14 finished in 26234 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(G(p0))&&F(p1))))'
Found a Shortening insensitive property : PolyORBNT-COL-S10J30-LTLCardinality-14
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 3 out of 664 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
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 2 with 4 rules applied. Total rules applied 146 place count 581 transition count 1252
Applied a total of 146 rules in 84 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-23 22:27:13] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 22:27:13] [INFO ] Computed 82 place invariants in 18 ms
[2023-03-23 22:27:14] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
[2023-03-23 22:27:14] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:27:14] [INFO ] Invariant cache hit.
[2023-03-23 22:27:14] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-23 22:27:14] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:27:14] [INFO ] Invariant cache hit.
[2023-03-23 22:27:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:27:18] [INFO ] Implicit Places using invariants and state equation in 3839 ms returned []
Implicit Place search using SMT with State Equation took 4336 ms to find 0 implicit places.
[2023-03-23 22:27:18] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:27:18] [INFO ] Invariant cache hit.
[2023-03-23 22:27:19] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 581/664 places, 1252/1325 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5844 ms. Remains : 581/664 places, 1252/1325 transitions.
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s198 s161), p0:(GT 1 s532)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6769 reset in 716 ms.
Product exploration explored 100000 steps with 6737 reset in 743 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 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 215 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 184 steps, including 14 resets, run visited all 1 properties in 4 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 1 out of 581 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 23 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-23 22:27:21] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:27:21] [INFO ] Invariant cache hit.
[2023-03-23 22:27:22] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
[2023-03-23 22:27:22] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:27:22] [INFO ] Invariant cache hit.
[2023-03-23 22:27:22] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-23 22:27:22] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:27:22] [INFO ] Invariant cache hit.
[2023-03-23 22:27:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:27:26] [INFO ] Implicit Places using invariants and state equation in 4242 ms returned []
Implicit Place search using SMT with State Equation took 4759 ms to find 0 implicit places.
[2023-03-23 22:27:26] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-23 22:27:26] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 22:27:26] [INFO ] Invariant cache hit.
[2023-03-23 22:27:27] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6121 ms. Remains : 581/581 places, 1252/1252 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 352 steps, including 21 resets, run visited all 1 properties in 6 ms. (steps per millisecond=58 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6790 reset in 715 ms.
Product exploration explored 100000 steps with 6830 reset in 739 ms.
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 581 transition count 1251
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 580 transition count 1251
Applied a total of 2 rules in 29 ms. Remains 580 /581 variables (removed 1) and now considering 1251/1252 (removed 1) transitions.
[2023-03-23 22:27:29] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-23 22:27:29] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-23 22:27:30] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
[2023-03-23 22:27:30] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:27:30] [INFO ] Invariant cache hit.
[2023-03-23 22:27:30] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-23 22:27:30] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:27:30] [INFO ] Invariant cache hit.
[2023-03-23 22:27:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 22:27:33] [INFO ] Implicit Places using invariants and state equation in 3210 ms returned []
Implicit Place search using SMT with State Equation took 3752 ms to find 0 implicit places.
[2023-03-23 22:27:33] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-23 22:27:33] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-23 22:27:33] [INFO ] Invariant cache hit.
[2023-03-23 22:27:34] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/581 places, 1251/1252 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5199 ms. Remains : 580/581 places, 1251/1252 transitions.
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-14 finished in 21660 ms.
[2023-03-23 22:27:34] [INFO ] Flatten gal took : 83 ms
[2023-03-23 22:27:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-23 22:27:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 664 places, 1325 transitions and 8384 arcs took 14 ms.
Total runtime 115734 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1042/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBNT-COL-S10J30-LTLCardinality-14

BK_STOP 1679610456294

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name PolyORBNT-COL-S10J30-LTLCardinality-14
ltl formula formula --ltl=/tmp/1042/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 664 places, 1325 transitions and 8384 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.200 real 0.050 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1042/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1042/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1042/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1042/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J30"
export BK_EXAMINATION="LTLCardinality"
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-S10J30, examination is LTLCardinality"
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-167873950800683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J30.tgz
mv PolyORBNT-COL-S10J30 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;