Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460700230.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBNT-COL-S05J20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460700230
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 8.0K Apr 12 09:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 09:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 09:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 12 09:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 09:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 09:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 09:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 09:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717125666473

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=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J20
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-31 03:21:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 03:21:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 03:21:08] [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.
[2024-05-31 03:21:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 03:21:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 485 ms
[2024-05-31 03:21:08] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 03:21:08] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-31 03:21:08] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 100000 steps, including 7977 resets, run finished after 179 ms. (steps per millisecond=558 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 48 cols
[2024-05-31 03:21:08] [INFO ] Computed 13 invariants in 8 ms
[2024-05-31 03:21:09] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 03:21:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:21:09] [INFO ] After 31ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 03:21:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:21:09] [INFO ] After 1ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-31 03:21:09] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 5 ms to minimize.
[2024-05-31 03:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-31 03:21:09] [INFO ] After 92ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:21:09] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:21:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:21:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:21:09] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:21:09] [INFO ] After 1ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 03:21:09] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-31 03:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-31 03:21:09] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-31 03:21:09] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-31 03:21:09] [INFO ] Flatten gal took : 21 ms
[2024-05-31 03:21:09] [INFO ] Flatten gal took : 7 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.
[2024-05-31 03:21:09] [INFO ] Unfolded HLPN to a Petri net with 369 places and 1230 transitions 8864 arcs in 47 ms.
[2024-05-31 03:21:09] [INFO ] Unfolded 16 HLPN properties in 0 ms.
[2024-05-31 03:21:09] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-31 03:21:09] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-31 03:21:09] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-31 03:21:09] [INFO ] Reduced 555 identical enabling conditions.
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 678 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 16) seen :10
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 250 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 173 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 156 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :1
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-31 03:21:10] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2024-05-31 03:21:10] [INFO ] Computed 62 invariants in 28 ms
[2024-05-31 03:21:11] [INFO ] [Real]Absence check using 55 positive place invariants in 26 ms returned sat
[2024-05-31 03:21:11] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 03:21:11] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-31 03:21:11] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned sat
[2024-05-31 03:21:11] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 03:21:20] [INFO ] After 9428ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2024-05-31 03:21:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:21:21] [INFO ] After 36ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2024-05-31 03:21:21] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-31 03:21:21] [INFO ] After 9705ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 26 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 344 transition count 530
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 56 place count 319 transition count 529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 57 place count 318 transition count 505
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 105 place count 294 transition count 505
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 293 transition count 504
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 293 transition count 504
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 3 with 4 rules applied. Total rules applied 111 place count 291 transition count 502
Applied a total of 111 rules in 150 ms. Remains 291 /349 variables (removed 58) and now considering 502/555 (removed 53) transitions.
[2024-05-31 03:21:21] [INFO ] Flow matrix only has 498 transitions (discarded 4 similar events)
// Phase 1: matrix 498 rows 291 cols
[2024-05-31 03:21:21] [INFO ] Computed 57 invariants in 16 ms
[2024-05-31 03:21:21] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 291/349 places, 407/555 transitions.
Applied a total of 0 rules in 19 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 291/349 places, 407/555 transitions.
Incomplete random walk after 10000 steps, including 486 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 594400 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 594400 steps, saw 181753 distinct states, run finished after 3002 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 03:21:24] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2024-05-31 03:21:25] [INFO ] Computed 57 invariants in 11 ms
[2024-05-31 03:21:25] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-31 03:21:25] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 03:21:25] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 03:21:25] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-31 03:21:25] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 03:21:26] [INFO ] After 1198ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-31 03:21:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:21:26] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-31 03:21:26] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-31 03:21:26] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 1 ms to minimize.
[2024-05-31 03:21:26] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 1 ms to minimize.
[2024-05-31 03:21:26] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 0 ms to minimize.
[2024-05-31 03:21:27] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 1 ms to minimize.
[2024-05-31 03:21:27] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 0 ms to minimize.
[2024-05-31 03:21:27] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 1 ms to minimize.
[2024-05-31 03:21:27] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 0 ms to minimize.
[2024-05-31 03:21:27] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 1 ms to minimize.
[2024-05-31 03:21:27] [INFO ] Deduced a trap composed of 86 places in 74 ms of which 0 ms to minimize.
[2024-05-31 03:21:27] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 0 ms to minimize.
[2024-05-31 03:21:27] [INFO ] Deduced a trap composed of 92 places in 74 ms of which 0 ms to minimize.
[2024-05-31 03:21:27] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 0 ms to minimize.
[2024-05-31 03:21:27] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 4 ms to minimize.
[2024-05-31 03:21:28] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 0 ms to minimize.
[2024-05-31 03:21:28] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 0 ms to minimize.
[2024-05-31 03:21:28] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 1 ms to minimize.
[2024-05-31 03:21:28] [INFO ] Deduced a trap composed of 101 places in 87 ms of which 1 ms to minimize.
[2024-05-31 03:21:28] [INFO ] Deduced a trap composed of 86 places in 74 ms of which 0 ms to minimize.
[2024-05-31 03:21:28] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 0 ms to minimize.
[2024-05-31 03:21:28] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 0 ms to minimize.
[2024-05-31 03:21:28] [INFO ] Deduced a trap composed of 92 places in 73 ms of which 1 ms to minimize.
[2024-05-31 03:21:28] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 0 ms to minimize.
[2024-05-31 03:21:29] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 1 ms to minimize.
[2024-05-31 03:21:29] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 0 ms to minimize.
[2024-05-31 03:21:29] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 1 ms to minimize.
[2024-05-31 03:21:29] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 0 ms to minimize.
[2024-05-31 03:21:29] [INFO ] Deduced a trap composed of 83 places in 160 ms of which 1 ms to minimize.
[2024-05-31 03:21:29] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 1 ms to minimize.
[2024-05-31 03:21:30] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 1 ms to minimize.
[2024-05-31 03:21:30] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 1 ms to minimize.
[2024-05-31 03:21:30] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 0 ms to minimize.
[2024-05-31 03:21:31] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 0 ms to minimize.
[2024-05-31 03:21:31] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 0 ms to minimize.
[2024-05-31 03:21:31] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 1 ms to minimize.
[2024-05-31 03:21:40] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 14127 ms
[2024-05-31 03:21:40] [INFO ] After 14237ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-31 03:21:40] [INFO ] After 15518ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 407/407 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 291 transition count 406
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 290 transition count 406
Applied a total of 2 rules in 33 ms. Remains 290 /291 variables (removed 1) and now considering 406/407 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 290/291 places, 406/407 transitions.
Incomplete random walk after 10000 steps, including 516 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 862612 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :{}
Probabilistic random walk after 862612 steps, saw 270228 distinct states, run finished after 3001 ms. (steps per millisecond=287 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 03:21:43] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2024-05-31 03:21:43] [INFO ] Computed 57 invariants in 16 ms
[2024-05-31 03:21:43] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2024-05-31 03:21:43] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 03:21:44] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:21:44] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2024-05-31 03:21:44] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 03:21:44] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:21:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:21:44] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 03:21:44] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-31 03:21:44] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 1 ms to minimize.
[2024-05-31 03:21:44] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 1 ms to minimize.
[2024-05-31 03:21:44] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 1 ms to minimize.
[2024-05-31 03:21:45] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 0 ms to minimize.
[2024-05-31 03:21:45] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 1 ms to minimize.
[2024-05-31 03:21:45] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 1 ms to minimize.
[2024-05-31 03:21:45] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 0 ms to minimize.
[2024-05-31 03:21:45] [INFO ] Deduced a trap composed of 101 places in 64 ms of which 1 ms to minimize.
[2024-05-31 03:21:45] [INFO ] Deduced a trap composed of 101 places in 77 ms of which 0 ms to minimize.
[2024-05-31 03:21:45] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 0 ms to minimize.
[2024-05-31 03:21:45] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 1 ms to minimize.
[2024-05-31 03:21:45] [INFO ] Deduced a trap composed of 112 places in 71 ms of which 1 ms to minimize.
[2024-05-31 03:21:45] [INFO ] Deduced a trap composed of 95 places in 66 ms of which 0 ms to minimize.
[2024-05-31 03:21:46] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 1 ms to minimize.
[2024-05-31 03:21:46] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 0 ms to minimize.
[2024-05-31 03:21:46] [INFO ] Deduced a trap composed of 92 places in 68 ms of which 0 ms to minimize.
[2024-05-31 03:21:46] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 6 ms to minimize.
[2024-05-31 03:21:46] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 1 ms to minimize.
[2024-05-31 03:21:46] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 1 ms to minimize.
[2024-05-31 03:21:46] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 0 ms to minimize.
[2024-05-31 03:21:46] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 1 ms to minimize.
[2024-05-31 03:21:47] [INFO ] Deduced a trap composed of 95 places in 74 ms of which 0 ms to minimize.
[2024-05-31 03:21:47] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 1 ms to minimize.
[2024-05-31 03:21:47] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 1 ms to minimize.
[2024-05-31 03:21:47] [INFO ] Deduced a trap composed of 95 places in 76 ms of which 0 ms to minimize.
[2024-05-31 03:21:47] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2024-05-31 03:21:47] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 1 ms to minimize.
[2024-05-31 03:21:47] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 0 ms to minimize.
[2024-05-31 03:21:47] [INFO ] Deduced a trap composed of 102 places in 74 ms of which 10 ms to minimize.
[2024-05-31 03:21:48] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 1 ms to minimize.
[2024-05-31 03:21:48] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 1 ms to minimize.
[2024-05-31 03:21:48] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 1 ms to minimize.
[2024-05-31 03:21:48] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 0 ms to minimize.
[2024-05-31 03:21:48] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 0 ms to minimize.
[2024-05-31 03:21:49] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 1 ms to minimize.
[2024-05-31 03:21:49] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 0 ms to minimize.
[2024-05-31 03:21:50] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 1 ms to minimize.
[2024-05-31 03:21:50] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 0 ms to minimize.
[2024-05-31 03:21:50] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 0 ms to minimize.
[2024-05-31 03:21:59] [INFO ] Trap strengthening (SAT) tested/added 40/40 trap constraints in 15341 ms
[2024-05-31 03:21:59] [INFO ] After 15409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 03:21:59] [INFO ] After 15731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 24 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 9 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2024-05-31 03:21:59] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 03:21:59] [INFO ] Invariant cache hit.
[2024-05-31 03:22:00] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-31 03:22:00] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 03:22:00] [INFO ] Invariant cache hit.
[2024-05-31 03:22:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:22:00] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
[2024-05-31 03:22:00] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-31 03:22:00] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 03:22:00] [INFO ] Invariant cache hit.
[2024-05-31 03:22:01] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1220 ms. Remains : 290/290 places, 406/406 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 34 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 395 rows 283 cols
[2024-05-31 03:22:01] [INFO ] Computed 57 invariants in 3 ms
[2024-05-31 03:22:01] [INFO ] [Real]Absence check using 50 positive place invariants in 52 ms returned sat
[2024-05-31 03:22:01] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-31 03:22:01] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:22:01] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-31 03:22:01] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-31 03:22:01] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:22:01] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-05-31 03:22:01] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 0 ms to minimize.
[2024-05-31 03:22:01] [INFO ] Deduced a trap composed of 87 places in 76 ms of which 1 ms to minimize.
[2024-05-31 03:22:01] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 1 ms to minimize.
[2024-05-31 03:22:01] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 1 ms to minimize.
[2024-05-31 03:22:02] [INFO ] Deduced a trap composed of 90 places in 74 ms of which 0 ms to minimize.
[2024-05-31 03:22:02] [INFO ] Deduced a trap composed of 106 places in 76 ms of which 0 ms to minimize.
[2024-05-31 03:22:02] [INFO ] Deduced a trap composed of 106 places in 86 ms of which 1 ms to minimize.
[2024-05-31 03:22:02] [INFO ] Deduced a trap composed of 108 places in 77 ms of which 0 ms to minimize.
[2024-05-31 03:22:02] [INFO ] Deduced a trap composed of 110 places in 70 ms of which 1 ms to minimize.
[2024-05-31 03:22:02] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 0 ms to minimize.
[2024-05-31 03:22:02] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 0 ms to minimize.
[2024-05-31 03:22:02] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 0 ms to minimize.
[2024-05-31 03:22:02] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 0 ms to minimize.
[2024-05-31 03:22:02] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 0 ms to minimize.
[2024-05-31 03:22:03] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 0 ms to minimize.
[2024-05-31 03:22:03] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 0 ms to minimize.
[2024-05-31 03:22:03] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 0 ms to minimize.
[2024-05-31 03:22:03] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 0 ms to minimize.
[2024-05-31 03:22:03] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 0 ms to minimize.
[2024-05-31 03:22:03] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 0 ms to minimize.
[2024-05-31 03:22:03] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 0 ms to minimize.
[2024-05-31 03:22:03] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 0 ms to minimize.
[2024-05-31 03:22:03] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 0 ms to minimize.
[2024-05-31 03:22:04] [INFO ] Deduced a trap composed of 99 places in 75 ms of which 1 ms to minimize.
[2024-05-31 03:22:04] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2024-05-31 03:22:04] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 0 ms to minimize.
[2024-05-31 03:22:04] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 1 ms to minimize.
[2024-05-31 03:22:04] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 1 ms to minimize.
[2024-05-31 03:22:04] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 0 ms to minimize.
[2024-05-31 03:22:04] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 0 ms to minimize.
[2024-05-31 03:22:04] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 1 ms to minimize.
[2024-05-31 03:22:04] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 0 ms to minimize.
[2024-05-31 03:22:05] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 0 ms to minimize.
[2024-05-31 03:22:05] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 0 ms to minimize.
[2024-05-31 03:22:05] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 1 ms to minimize.
[2024-05-31 03:22:05] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 0 ms to minimize.
[2024-05-31 03:22:05] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 1 ms to minimize.
[2024-05-31 03:22:05] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 0 ms to minimize.
[2024-05-31 03:22:05] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 1 ms to minimize.
[2024-05-31 03:22:06] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 0 ms to minimize.
[2024-05-31 03:22:06] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 0 ms to minimize.
[2024-05-31 03:22:06] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 1 ms to minimize.
[2024-05-31 03:22:06] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 1 ms to minimize.
[2024-05-31 03:22:06] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2024-05-31 03:22:06] [INFO ] Deduced a trap composed of 99 places in 80 ms of which 0 ms to minimize.
[2024-05-31 03:22:06] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 1 ms to minimize.
[2024-05-31 03:22:06] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 0 ms to minimize.
[2024-05-31 03:22:06] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 0 ms to minimize.
[2024-05-31 03:22:06] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 0 ms to minimize.
[2024-05-31 03:22:07] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 1 ms to minimize.
[2024-05-31 03:22:07] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 1 ms to minimize.
[2024-05-31 03:22:07] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 0 ms to minimize.
[2024-05-31 03:22:07] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 1 ms to minimize.
[2024-05-31 03:22:07] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 0 ms to minimize.
[2024-05-31 03:22:07] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 0 ms to minimize.
[2024-05-31 03:22:07] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 1 ms to minimize.
[2024-05-31 03:22:08] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 0 ms to minimize.
[2024-05-31 03:22:08] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 0 ms to minimize.
[2024-05-31 03:22:08] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 0 ms to minimize.
[2024-05-31 03:22:08] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 1 ms to minimize.
[2024-05-31 03:22:08] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 1 ms to minimize.
[2024-05-31 03:22:08] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
[2024-05-31 03:22:08] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 2 ms to minimize.
[2024-05-31 03:22:09] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 0 ms to minimize.
[2024-05-31 03:22:09] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 0 ms to minimize.
[2024-05-31 03:22:09] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 0 ms to minimize.
[2024-05-31 03:22:09] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 0 ms to minimize.
[2024-05-31 03:22:09] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 1 ms to minimize.
[2024-05-31 03:22:09] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
[2024-05-31 03:22:09] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 1 ms to minimize.
[2024-05-31 03:22:09] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 0 ms to minimize.
[2024-05-31 03:22:10] [INFO ] Deduced a trap composed of 102 places in 85 ms of which 0 ms to minimize.
[2024-05-31 03:22:10] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 0 ms to minimize.
[2024-05-31 03:22:10] [INFO ] Deduced a trap composed of 99 places in 73 ms of which 1 ms to minimize.
[2024-05-31 03:22:10] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 1 ms to minimize.
[2024-05-31 03:22:10] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 1 ms to minimize.
[2024-05-31 03:22:10] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 0 ms to minimize.
[2024-05-31 03:22:11] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 0 ms to minimize.
[2024-05-31 03:22:11] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 0 ms to minimize.
[2024-05-31 03:22:11] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 0 ms to minimize.
[2024-05-31 03:22:12] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 0 ms to minimize.
[2024-05-31 03:22:12] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 1 ms to minimize.
[2024-05-31 03:22:12] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 1 ms to minimize.
[2024-05-31 03:22:12] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 0 ms to minimize.
[2024-05-31 03:22:17] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 0 ms to minimize.
[2024-05-31 03:22:23] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 0 ms to minimize.
[2024-05-31 03:22:25] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 1 ms to minimize.
[2024-05-31 03:22:34] [INFO ] Trap strengthening (SAT) tested/added 88/88 trap constraints in 32657 ms
[2024-05-31 03:22:34] [INFO ] After 32864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 03:22:34] [INFO ] After 32922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2024-05-31 03:22:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-31 03:22:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 290 places, 406 transitions and 2109 arcs took 8 ms.
[2024-05-31 03:22:34] [INFO ] Flatten gal took : 86 ms
Total runtime 86170 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBNT-COL-S05J20
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityFireability

FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-2024-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717125754563

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 5 (type SKEL/FNDP) for 0 PolyORBNT-COL-S05J20-ReachabilityFireability-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 6 (type SKEL/EQUN) for 0 PolyORBNT-COL-S05J20-ReachabilityFireability-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type SKEL/SRCH) for 0 PolyORBNT-COL-S05J20-ReachabilityFireability-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type SKEL/SRCH) for 0 PolyORBNT-COL-S05J20-ReachabilityFireability-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 8 (type SKEL/SRCH) for PolyORBNT-COL-S05J20-ReachabilityFireability-2024-07
lola: result : false
lola: markings : 2431
lola: fired transitions : 4871
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 5 (type FNDP) for PolyORBNT-COL-S05J20-ReachabilityFireability-2024-07 (obsolete)
lola: CANCELED task # 6 (type EQUN) for PolyORBNT-COL-S05J20-ReachabilityFireability-2024-07 (obsolete)
lola: CANCELED task # 9 (type SRCH) for PolyORBNT-COL-S05J20-ReachabilityFireability-2024-07 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J20-ReachabilityFireability-2024-07: AG true skeleton: tandem / insertion


Time elapsed: 0 secs. Pages in use: 2

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-S05J20"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBNT-COL-S05J20, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r307-tajo-171654460700230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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