About the Execution of ITS-Tools for DES-PT-40b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2767.159 | 2354724.00 | 3761880.00 | 6077.20 | FTTFTTTTTTTFFTFT | 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.r092-tall-171624189900727.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 DES-PT-40b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189900727
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 115K May 18 16:42 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 DES-PT-40b-ReachabilityFireability-2024-00
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-01
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-02
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-03
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-04
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-05
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-06
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-07
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-08
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-09
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-10
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-11
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-12
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-13
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-14
FORMULA_NAME DES-PT-40b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716356467133
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-22 05:41:08] [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-22 05:41:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:41:08] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-22 05:41:08] [INFO ] Transformed 439 places.
[2024-05-22 05:41:08] [INFO ] Transformed 390 transitions.
[2024-05-22 05:41:08] [INFO ] Found NUPN structural information;
[2024-05-22 05:41:08] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (339 resets) in 1691 ms. (23 steps per ms) remains 8/16 properties
FORMULA DES-PT-40b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 05:41:09] [INFO ] Flatten gal took : 187 ms
[2024-05-22 05:41:09] [INFO ] Flatten gal took : 90 ms
BEST_FIRST walk for 40004 steps (55 resets) in 943 ms. (42 steps per ms) remains 8/8 properties
[2024-05-22 05:41:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1104417445008417989.gal : 41 ms
[2024-05-22 05:41:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14104445512913064477.prop : 5 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/ReachabilityCardinality1104417445008417989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14104445512913064477.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (41 resets) in 303 ms. (131 steps per ms) remains 8/8 properties
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 ...329
BEST_FIRST walk for 40004 steps (45 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality14104445512913064477.prop.
BEST_FIRST walk for 40003 steps (47 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (46 resets) in 183 ms. (217 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :5 after 13
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :13 after 19
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :19 after 113
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :113 after 132
BEST_FIRST walk for 40003 steps (67 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :132 after 443
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :443 after 69745
BEST_FIRST walk for 40003 steps (45 resets) in 594 ms. (67 steps per ms) remains 7/8 properties
FORMULA DES-PT-40b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :69745 after 395085
BEST_FIRST walk for 40004 steps (43 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
// Phase 1: matrix 390 rows 439 cols
[2024-05-22 05:41:09] [INFO ] Computed 65 invariants in 42 ms
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :395085 after 2.19755e+07
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem DES-PT-40b-ReachabilityFireability-2024-11 is UNSAT
FORMULA DES-PT-40b-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 273/391 variables, 39/157 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 273/430 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 7/437 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/437 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 48/439 variables, 19/456 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 48/504 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/504 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 390/829 variables, 439/943 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/829 variables, 0/943 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/829 variables, 0/943 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 829/829 variables, and 943 constraints, problems are : Problem set: 1 solved, 6 unsolved in 4032 ms.
Refiners :[Domain max(s): 439/439 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 289/391 variables, 39/141 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 289/430 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 7/437 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/437 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 48/439 variables, 19/456 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 48/504 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 05:41:14] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 22 ms to minimize.
[2024-05-22 05:41:14] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:41:14] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-05-22 05:41:15] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 3 ms to minimize.
[2024-05-22 05:41:15] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-05-22 05:41:15] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-05-22 05:41:15] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:41:15] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:41:15] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 9/513 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/513 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 390/829 variables, 439/952 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 829/829 variables, and 958 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5010 ms.
Refiners :[Domain max(s): 439/439 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 9/9 constraints]
After SMT, in 9292ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 102 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 390/390 transitions.
Graph (complete) has 978 edges and 439 vertex of which 428 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 428 transition count 379
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 423 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 421 transition count 377
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 16 place count 421 transition count 371
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 28 place count 415 transition count 371
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 38 place count 405 transition count 361
Iterating global reduction 3 with 10 rules applied. Total rules applied 48 place count 405 transition count 361
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 400 transition count 356
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 400 transition count 356
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 63 place count 400 transition count 351
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 155 place count 354 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 353 transition count 305
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 160 place count 353 transition count 302
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 163 place count 350 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 350 transition count 301
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 350 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 166 place count 349 transition count 300
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 349 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 168 place count 348 transition count 299
Applied a total of 168 rules in 209 ms. Remains 348 /439 variables (removed 91) and now considering 299/390 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 348/439 places, 299/390 transitions.
RANDOM walk for 40000 steps (555 resets) in 514 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (91 resets) in 201 ms. (198 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (71 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (81 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (76 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (83 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 680025 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :0 out of 6
Probabilistic random walk after 680025 steps, saw 109011 distinct states, run finished after 3004 ms. (steps per millisecond=226 ) properties seen :0
// Phase 1: matrix 299 rows 348 cols
[2024-05-22 05:41:22] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 05:41:22] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 76/178 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 132/310 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 299/609 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/609 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 38/647 variables, 38/409 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/647 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/647 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 647/647 variables, and 409 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1666 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 348/348 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 76/178 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 132/310 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 299/609 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/609 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 05:41:25] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 05:41:26] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:41:26] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/609 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/609 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 38/647 variables, 38/416 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/647 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 05:41:35] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-22 05:41:35] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-22 05:41:35] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:41:35] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/647 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/647 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 05:41:47] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 2 ms to minimize.
[2024-05-22 05:41:47] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/647 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/647 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 05:41:55] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/647 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/647 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 05:42:02] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/647 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 05:42:05] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/647 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 05:42:07] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/647 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 647/647 variables, and 428 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 348/348 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 13/13 constraints]
After SMT, in 46729ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 102 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 299/299 transitions.
Applied a total of 0 rules in 35 ms. Remains 348 /348 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 348/348 places, 299/299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 299/299 transitions.
Applied a total of 0 rules in 23 ms. Remains 348 /348 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-05-22 05:42:09] [INFO ] Invariant cache hit.
[2024-05-22 05:42:09] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 05:42:09] [INFO ] Invariant cache hit.
[2024-05-22 05:42:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 05:42:10] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-05-22 05:42:10] [INFO ] Redundant transitions in 13 ms returned []
Running 296 sub problems to find dead transitions.
[2024-05-22 05:42:10] [INFO ] Invariant cache hit.
[2024-05-22 05:42:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 2/347 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-22 05:42:15] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-22 05:42:15] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-22 05:42:15] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-22 05:42:15] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-22 05:42:15] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-22 05:42:15] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-22 05:42:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 1/348 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (OVERLAPS) 299/647 variables, 348/415 constraints. Problems are: Problem set: 0 solved, 296 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/647 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/647 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 11 (OVERLAPS) 0/647 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 647/647 variables, and 416 constraints, problems are : Problem set: 0 solved, 296 unsolved in 21504 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 348/348 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 2/347 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 1/348 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-22 05:42:36] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 4 ms to minimize.
[2024-05-22 05:42:36] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-22 05:42:37] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:42:37] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:42:37] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 5 ms to minimize.
[2024-05-22 05:42:37] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:42:37] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:42:37] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:42:38] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:42:39] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 2 ms to minimize.
[2024-05-22 05:42:39] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 9/78 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-22 05:42:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-22 05:42:40] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:42:40] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-22 05:42:40] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-22 05:42:40] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-22 05:42:41] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:42:41] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-22 05:42:43] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:42:45] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 12 (OVERLAPS) 299/647 variables, 348/435 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/647 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/647 variables, 296/732 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 647/647 variables, and 732 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 348/348 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 27/27 constraints]
After SMT, in 51701ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 51705ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52181 ms. Remains : 348/348 places, 299/299 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 16 ms. Remains 348 /348 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Running SMT prover for 6 properties.
[2024-05-22 05:43:01] [INFO ] Invariant cache hit.
[2024-05-22 05:43:01] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 05:43:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-22 05:43:02] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-22 05:43:02] [INFO ] After 625ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-22 05:43:03] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-22 05:43:03] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:43:03] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:43:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 318 ms
[2024-05-22 05:43:03] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:43:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-05-22 05:43:03] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-22 05:43:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-22 05:43:03] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-22 05:43:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-22 05:43:04] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 8 ms to minimize.
[2024-05-22 05:43:04] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:43:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
TRAPS : Iteration 1
[2024-05-22 05:43:04] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:43:04] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-22 05:43:04] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-22 05:43:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 163 ms
TRAPS : Iteration 2
[2024-05-22 05:43:05] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:43:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
TRAPS : Iteration 3
[2024-05-22 05:43:06] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:43:06] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:43:06] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-22 05:43:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 214 ms
TRAPS : Iteration 4
[2024-05-22 05:43:07] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:43:07] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-22 05:43:07] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:43:07] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-05-22 05:43:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 559 ms
[2024-05-22 05:43:08] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:43:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
TRAPS : Iteration 5
[2024-05-22 05:43:08] [INFO ] After 6808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-22 05:43:09] [INFO ] After 7594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2024-05-22 05:43:09] [INFO ] Flatten gal took : 51 ms
[2024-05-22 05:43:09] [INFO ] Flatten gal took : 20 ms
[2024-05-22 05:43:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7753284412919551238.gal : 4 ms
[2024-05-22 05:43:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16679721881120399170.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/ReachabilityCardinality7753284412919551238.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16679721881120399170.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 ...329
Loading property file /tmp/ReachabilityCardinality16679721881120399170.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :8 after 23
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :23 after 31
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :31 after 660
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :660 after 2872
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :2872 after 43616
Detected timeout of ITS tools.
[2024-05-22 05:43:24] [INFO ] Flatten gal took : 19 ms
[2024-05-22 05:43:24] [INFO ] Applying decomposition
[2024-05-22 05:43:24] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4031562008611750061.txt' '-o' '/tmp/graph4031562008611750061.bin' '-w' '/tmp/graph4031562008611750061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4031562008611750061.bin' '-l' '-1' '-v' '-w' '/tmp/graph4031562008611750061.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:43:24] [INFO ] Decomposing Gal with order
[2024-05-22 05:43:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:43:24] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 05:43:24] [INFO ] Flatten gal took : 57 ms
[2024-05-22 05:43:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 11 ms.
[2024-05-22 05:43:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13745275335645133391.gal : 6 ms
[2024-05-22 05:43:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15586302008036239534.prop : 2 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/ReachabilityCardinality13745275335645133391.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15586302008036239534.prop' '--nowitness'
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 ...309
Loading property file /tmp/ReachabilityCardinality15586302008036239534.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 28
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :28 after 154270
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :724216 after 5.92275e+08
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :7.60095e+09 after 4.0625e+13
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :4.0625e+13 after 1.38659e+14
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1.38659e+14 after 2.80263e+14
Reachability property DES-PT-40b-ReachabilityFireability-2024-15 is true.
Reachability property DES-PT-40b-ReachabilityFireability-2024-05 is true.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 38188 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 05:43:40] [INFO ] Flatten gal took : 20 ms
[2024-05-22 05:43:40] [INFO ] Applying decomposition
[2024-05-22 05:43:40] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1599426673112393238.txt' '-o' '/tmp/graph1599426673112393238.bin' '-w' '/tmp/graph1599426673112393238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1599426673112393238.bin' '-l' '-1' '-v' '-w' '/tmp/graph1599426673112393238.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:43:40] [INFO ] Decomposing Gal with order
[2024-05-22 05:43:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:43:40] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-22 05:43:40] [INFO ] Flatten gal took : 30 ms
[2024-05-22 05:43:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-22 05:43:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2308710775348478996.gal : 6 ms
[2024-05-22 05:43:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18321745479047443403.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/ReachabilityCardinality2308710775348478996.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18321745479047443403.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality18321745479047443403.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :2 after 529
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :529 after 1417
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1417 after 8.36977e+06
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :8.36977e+06 after 1.01866e+14
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1.99163e+17 after 2.58338e+17
Reachability property DES-PT-40b-ReachabilityFireability-2024-05 is true.
FORMULA DES-PT-40b-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1.91404e+20 after 1.92781e+20
Reachability property DES-PT-40b-ReachabilityFireability-2024-15 is true.
FORMULA DES-PT-40b-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :6.02435e+20 after 6.10443e+20
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :8.85977e+20 after 8.85977e+20
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :8.85977e+20 after 8.87465e+20
Reachability property DES-PT-40b-ReachabilityFireability-2024-06 is true.
FORMULA DES-PT-40b-ReachabilityFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Detected timeout of ITS tools.
[2024-05-22 06:13:40] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
[2024-05-22 06:13:40] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin8270923344228287708
[2024-05-22 06:13:40] [INFO ] Flatten gal took : 19 ms
[2024-05-22 06:13:40] [INFO ] Computing symmetric may disable matrix : 299 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1317530502779111133.txt' '-o' '/tmp/graph1317530502779111133.bin' '-w' '/tmp/graph1317530502779111133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1317530502779111133.bin' '-l' '-1' '-v' '-w' '/tmp/graph1317530502779111133.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:13:40] [INFO ] Decomposing Gal with order
[2024-05-22 06:13:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:13:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:13:40] [INFO ] Computing symmetric may enable matrix : 299 transitions.
[2024-05-22 06:13:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:13:40] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 06:13:40] [INFO ] Flatten gal took : 37 ms
[2024-05-22 06:13:40] [INFO ] Computing Do-Not-Accords matrix : 299 transitions.
[2024-05-22 06:13:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2024-05-22 06:13:40] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 06:13:40] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16663938965492346097.gal : 18 ms
[2024-05-22 06:13:40] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2942402473971868219.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/ReachabilityFireability16663938965492346097.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2942402473971868219.prop' '--nowitness'
[2024-05-22 06:13:40] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8270923344228287708
Running compilation step : cd /tmp/ltsmin8270923344228287708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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 ...308
Loading property file /tmp/ReachabilityFireability2942402473971868219.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 23
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :23 after 380
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :380 after 3039
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :3039 after 1.33267e+07
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3.07581e+08 after 6.43927e+09
Compilation finished in 1012 ms.
Running link step : cd /tmp/ltsmin8270923344228287708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8270923344228287708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DESPT40bReachabilityFireability202401==true'
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.2734e+10 after 1.2169e+14
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.2169e+14 after 3.47783e+15
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3.47783e+15 after 9.2431e+15
Reachability property DES-PT-40b-ReachabilityFireability-2024-04 is true.
FORMULA DES-PT-40b-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-40b-ReachabilityFireability-2024-01 is true.
FORMULA DES-PT-40b-ReachabilityFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9.2431e+15 after 1.72468e+16
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.72468e+16 after 2.49636e+16
WARNING : LTSmin timed out (>200 s) on command cd /tmp/ltsmin8270923344228287708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DESPT40bReachabilityFireability202401==true'
Running LTSmin : cd /tmp/ltsmin8270923344228287708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DESPT40bReachabilityFireability202410==true'
Reachability property DES-PT-40b-ReachabilityFireability-2024-10 is true.
FORMULA DES-PT-40b-ReachabilityFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 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\_mod\_flat,1.98753e+18,99.954,225452,6335,5488,408494,15552,589,584703,393,290239,0
Total reachable state count : 1987527357049807328
Verifying 3 reachability properties.
Reachability property DES-PT-40b-ReachabilityFireability-2024-01 is true.
WARNING : LTSmin timed out (>200 s) on command cd /tmp/ltsmin8270923344228287708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DESPT40bReachabilityFireability202410==true'
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2353559 ms.
BK_STOP 1716358821857
--------------------
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="DES-PT-40b"
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 DES-PT-40b, 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 r092-tall-171624189900727"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40b.tgz
mv DES-PT-40b 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 '
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 ;