fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r268-smll-171654407200223
Last Updated
July 7, 2024

About the Execution of ITS-Tools for Peterson-COL-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2072.399 64622.00 158247.00 261.70 FTTFTTTTFFFTFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r268-smll-171654407200223.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Peterson-COL-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407200223
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.1K Apr 12 02:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 02:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 02:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:27 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 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 03:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 44K 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 Peterson-COL-4-ReachabilityFireability-2024-00
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-01
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-02
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-03
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-04
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-05
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-06
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-07
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-08
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-09
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-10
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-11
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-12
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-13
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-14
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716737251275

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityFireability COL
Running Version 202405141337
[2024-05-26 15:27:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 15:27:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 15:27:33] [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-26 15:27:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 15:27:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 879 ms
[2024-05-26 15:27:34] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-4-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 15:27:34] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 5 ms.
[2024-05-26 15:27:34] [INFO ] Skeletonized 13 HLPN properties in 1 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 172 steps (0 resets) in 25 ms. (6 steps per ms) remains 0/1 properties
[2024-05-26 15:27:34] [INFO ] Flatten gal took : 19 ms
[2024-05-26 15:27:34] [INFO ] Flatten gal took : 3 ms
[2024-05-26 15:27:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1262072796151945549.gal : 6 ms
[2024-05-26 15:27:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12647944299736264963.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1262072796151945549.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12647944299736264963.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

ITS tools runner thread asked to quit. Dying gracefully.
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-26 15:27:34] [INFO ] Flatten gal took : 4 ms
[2024-05-26 15:27:34] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-26 15:27:34] [INFO ] Flatten gal took : 3 ms
[2024-05-26 15:27:34] [INFO ] Flatten gal took : 3 ms
[2024-05-26 15:27:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3572426618018372420.gal : 2 ms
[2024-05-26 15:27:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9091125465476571419.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3572426618018372420.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9091125465476571419.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality9091125465476571419.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5,0.004334,3512,2,14,5,50,6,0,53,24,0
Total reachable state count : 5

ITS tools runner thread asked to quit. Dying gracefully.
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-26 15:27:34] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 62 ms.
[2024-05-26 15:27:34] [INFO ] Unfolded 13 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 20 places in 8 ms
Reduce places removed 20 places and 40 transitions.
FORMULA Peterson-COL-4-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 15:27:35] [INFO ] Flatten gal took : 301 ms
[2024-05-26 15:27:35] [INFO ] Flatten gal took : 228 ms
[2024-05-26 15:27:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13525214976419837046.gal : 93 ms
[2024-05-26 15:27:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10168403611207566877.prop : 77 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13525214976419837046.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10168403611207566877.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (8 resets) in 3773 ms. (10 steps per ms) remains 4/10 properties
FORMULA Peterson-COL-4-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Loading property file /tmp/ReachabilityCardinality10168403611207566877.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 6058 ms. (6 steps per ms) remains 4/4 properties
Invariant property Peterson-COL-4-ReachabilityFireability-2024-12 does not hold.
SDD proceeding with computation,9 properties remain. new max is 2
SDD size :1 after 4
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :4 after 5
Reachability property Peterson-COL-4-ReachabilityFireability-2024-13 is true.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :5 after 6
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :14 after 30
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :30 after 36
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :36 after 44
BEST_FIRST walk for 40004 steps (8 resets) in 5874 ms. (6 steps per ms) remains 4/4 properties
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :44 after 72
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 4/4 properties
Invariant property Peterson-COL-4-ReachabilityFireability-2024-15 does not hold.
BEST_FIRST walk for 40004 steps (8 resets) in 2326 ms. (17 steps per ms) remains 4/4 properties
[2024-05-26 15:27:40] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-26 15:27:40] [INFO ] Computed 19 invariants in 29 ms
[2024-05-26 15:27:40] [INFO ] State equation strengthened by 116 read => feed constraints.
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :72 after 213
Reachability property Peterson-COL-4-ReachabilityFireability-2024-06 is true.
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :213 after 294
Invariant property Peterson-COL-4-ReachabilityFireability-2024-10 does not hold.
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :294 after 618
Problem Peterson-COL-4-ReachabilityFireability-2024-02 is UNSAT
FORMULA Peterson-COL-4-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :618 after 1147
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1147 after 1484
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 630/1110 variables, 480/499 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1110 variables, 116/615 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 615 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2132 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1484 after 3206
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 40/480 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-26 15:27:45] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 71 ms to minimize.
[2024-05-26 15:27:46] [INFO ] Deduced a trap composed of 44 places in 289 ms of which 5 ms to minimize.
[2024-05-26 15:27:46] [INFO ] Deduced a trap composed of 28 places in 289 ms of which 7 ms to minimize.
[2024-05-26 15:27:46] [INFO ] Deduced a trap composed of 92 places in 319 ms of which 5 ms to minimize.
[2024-05-26 15:27:47] [INFO ] Deduced a trap composed of 21 places in 313 ms of which 4 ms to minimize.
[2024-05-26 15:27:47] [INFO ] Deduced a trap composed of 18 places in 324 ms of which 5 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :3206 after 9176
[2024-05-26 15:27:47] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 4 ms to minimize.
[2024-05-26 15:27:47] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 5 ms to minimize.
[2024-05-26 15:27:48] [INFO ] Deduced a trap composed of 14 places in 269 ms of which 5 ms to minimize.
[2024-05-26 15:27:48] [INFO ] Deduced a trap composed of 114 places in 227 ms of which 4 ms to minimize.
[2024-05-26 15:27:48] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 5 ms to minimize.
[2024-05-26 15:27:49] [INFO ] Deduced a trap composed of 88 places in 230 ms of which 5 ms to minimize.
[2024-05-26 15:27:49] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 5 ms to minimize.
[2024-05-26 15:27:49] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 5 ms to minimize.
[2024-05-26 15:27:49] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 5 ms to minimize.
[2024-05-26 15:27:50] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 4 ms to minimize.
SMT process timed out in 9961ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 440 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 36 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 480/480 places, 690/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 1715 ms. (23 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1896 ms. (21 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2530 ms. (15 steps per ms) remains 3/3 properties
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :9176 after 26492
Interrupted probabilistic random walk after 268440 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :1 out of 3
Probabilistic random walk after 268440 steps, saw 63494 distinct states, run finished after 3010 ms. (steps per millisecond=89 ) properties seen :1
FORMULA Peterson-COL-4-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-26 15:27:55] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 15:27:55] [INFO ] Invariant cache hit.
[2024-05-26 15:27:55] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 40/480 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 630/1110 variables, 480/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 116/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 615 constraints, problems are : Problem set: 0 solved, 2 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 40/480 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:27:57] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 4 ms to minimize.
[2024-05-26 15:27:57] [INFO ] Deduced a trap composed of 60 places in 309 ms of which 5 ms to minimize.
[2024-05-26 15:27:57] [INFO ] Deduced a trap composed of 14 places in 293 ms of which 5 ms to minimize.
[2024-05-26 15:27:58] [INFO ] Deduced a trap composed of 13 places in 278 ms of which 4 ms to minimize.
[2024-05-26 15:27:58] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 4 ms to minimize.
[2024-05-26 15:27:58] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 5 ms to minimize.
[2024-05-26 15:27:59] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 4 ms to minimize.
[2024-05-26 15:27:59] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 4 ms to minimize.
[2024-05-26 15:27:59] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 5 ms to minimize.
[2024-05-26 15:27:59] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 4 ms to minimize.
[2024-05-26 15:27:59] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 4 ms to minimize.
[2024-05-26 15:28:00] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 4 ms to minimize.
[2024-05-26 15:28:00] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 5 ms to minimize.
[2024-05-26 15:28:00] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 5 ms to minimize.
[2024-05-26 15:28:00] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 4 ms to minimize.
[2024-05-26 15:28:01] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 4 ms to minimize.
[2024-05-26 15:28:01] [INFO ] Deduced a trap composed of 10 places in 277 ms of which 4 ms to minimize.
[2024-05-26 15:28:01] [INFO ] Deduced a trap composed of 41 places in 291 ms of which 10 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :26492 after 76810
[2024-05-26 15:28:02] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 4 ms to minimize.
[2024-05-26 15:28:02] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:28:02] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 4 ms to minimize.
[2024-05-26 15:28:03] [INFO ] Deduced a trap composed of 69 places in 223 ms of which 4 ms to minimize.
[2024-05-26 15:28:03] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 4 ms to minimize.
[2024-05-26 15:28:03] [INFO ] Deduced a trap composed of 57 places in 259 ms of which 5 ms to minimize.
[2024-05-26 15:28:03] [INFO ] Deduced a trap composed of 69 places in 225 ms of which 4 ms to minimize.
[2024-05-26 15:28:04] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 4 ms to minimize.
[2024-05-26 15:28:04] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 3 ms to minimize.
[2024-05-26 15:28:04] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 4 ms to minimize.
[2024-05-26 15:28:05] [INFO ] Deduced a trap composed of 61 places in 220 ms of which 3 ms to minimize.
[2024-05-26 15:28:05] [INFO ] Deduced a trap composed of 40 places in 262 ms of which 4 ms to minimize.
[2024-05-26 15:28:05] [INFO ] Deduced a trap composed of 83 places in 220 ms of which 5 ms to minimize.
[2024-05-26 15:28:05] [INFO ] Deduced a trap composed of 88 places in 210 ms of which 4 ms to minimize.
[2024-05-26 15:28:06] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 4 ms to minimize.
[2024-05-26 15:28:06] [INFO ] Deduced a trap composed of 121 places in 227 ms of which 4 ms to minimize.
[2024-05-26 15:28:06] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 5 ms to minimize.
[2024-05-26 15:28:07] [INFO ] Deduced a trap composed of 58 places in 225 ms of which 4 ms to minimize.
[2024-05-26 15:28:07] [INFO ] Deduced a trap composed of 68 places in 199 ms of which 4 ms to minimize.
[2024-05-26 15:28:07] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 4 ms to minimize.
[2024-05-26 15:28:08] [INFO ] Deduced a trap composed of 103 places in 236 ms of which 4 ms to minimize.
[2024-05-26 15:28:08] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:28:09] [INFO ] Deduced a trap composed of 152 places in 248 ms of which 4 ms to minimize.
[2024-05-26 15:28:09] [INFO ] Deduced a trap composed of 84 places in 250 ms of which 4 ms to minimize.
[2024-05-26 15:28:09] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 4 ms to minimize.
[2024-05-26 15:28:09] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 3 ms to minimize.
[2024-05-26 15:28:10] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 4 ms to minimize.
[2024-05-26 15:28:10] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 4 ms to minimize.
[2024-05-26 15:28:11] [INFO ] Deduced a trap composed of 55 places in 211 ms of which 3 ms to minimize.
[2024-05-26 15:28:11] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 4 ms to minimize.
[2024-05-26 15:28:11] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 4 ms to minimize.
[2024-05-26 15:28:11] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 4 ms to minimize.
[2024-05-26 15:28:12] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 4 ms to minimize.
[2024-05-26 15:28:12] [INFO ] Deduced a trap composed of 79 places in 203 ms of which 3 ms to minimize.
[2024-05-26 15:28:12] [INFO ] Deduced a trap composed of 58 places in 190 ms of which 4 ms to minimize.
[2024-05-26 15:28:13] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 3 ms to minimize.
[2024-05-26 15:28:13] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 3 ms to minimize.
[2024-05-26 15:28:13] [INFO ] Deduced a trap composed of 58 places in 199 ms of which 4 ms to minimize.
[2024-05-26 15:28:13] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 3 ms to minimize.
[2024-05-26 15:28:14] [INFO ] Deduced a trap composed of 84 places in 224 ms of which 4 ms to minimize.
[2024-05-26 15:28:14] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 4 ms to minimize.
[2024-05-26 15:28:14] [INFO ] Deduced a trap composed of 104 places in 218 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 15:28:14] [INFO ] Deduced a trap composed of 54 places in 180 ms of which 4 ms to minimize.
[2024-05-26 15:28:15] [INFO ] Deduced a trap composed of 78 places in 209 ms of which 4 ms to minimize.
[2024-05-26 15:28:16] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 4 ms to minimize.
[2024-05-26 15:28:18] [INFO ] Deduced a trap composed of 84 places in 166 ms of which 3 ms to minimize.
[2024-05-26 15:28:18] [INFO ] Deduced a trap composed of 94 places in 313 ms of which 4 ms to minimize.
[2024-05-26 15:28:19] [INFO ] Deduced a trap composed of 98 places in 233 ms of which 10 ms to minimize.
[2024-05-26 15:28:19] [INFO ] Deduced a trap composed of 84 places in 217 ms of which 4 ms to minimize.
[2024-05-26 15:28:19] [INFO ] Deduced a trap composed of 54 places in 214 ms of which 3 ms to minimize.
[2024-05-26 15:28:20] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 4 ms to minimize.
[2024-05-26 15:28:21] [INFO ] Deduced a trap composed of 84 places in 241 ms of which 4 ms to minimize.
[2024-05-26 15:28:22] [INFO ] Deduced a trap composed of 85 places in 178 ms of which 4 ms to minimize.
[2024-05-26 15:28:22] [INFO ] Deduced a trap composed of 58 places in 229 ms of which 3 ms to minimize.
[2024-05-26 15:28:22] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :76810 after 140305
Problem Peterson-COL-4-ReachabilityFireability-2024-00 is UNSAT
FORMULA Peterson-COL-4-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-26 15:28:26] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-05-26 15:28:26] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 4 ms to minimize.
[2024-05-26 15:28:26] [INFO ] Deduced a trap composed of 96 places in 247 ms of which 5 ms to minimize.
[2024-05-26 15:28:27] [INFO ] Deduced a trap composed of 61 places in 195 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 17/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 15:28:27] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 3 ms to minimize.
[2024-05-26 15:28:27] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 2/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 15:28:27] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 15:28:28] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 630/1110 variables, 480/580 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 116/696 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1110 variables, 1/697 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1110 variables, 0/697 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1110 variables, 0/697 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1110 variables, and 697 constraints, problems are : Problem set: 1 solved, 1 unsolved in 38688 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 81/81 constraints]
After SMT, in 40341ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 44404 steps, including 868 resets, run visited all 1 properties in 423 ms. (steps per millisecond=104 )
FORMULA Peterson-COL-4-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 436 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 62754 ms.

BK_STOP 1716737315897

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Peterson-COL-4"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Peterson-COL-4, 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 r268-smll-171654407200223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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