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.r180-tall-171640602900231.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 FunctionPointer-PT-b004, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602900231
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b004-ReachabilityFireability-2024-00
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2024-01
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2024-02
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2024-03
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2024-04
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2024-05
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2024-06
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2024-07
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2024-08
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2024-09
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2024-10
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2024-11
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2024-12
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2024-13
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2023-14
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716459086126

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-23 10:11:27] [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-23 10:11:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 10:11:27] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-23 10:11:27] [INFO ] Transformed 306 places.
[2024-05-23 10:11:27] [INFO ] Transformed 840 transitions.
[2024-05-23 10:11:27] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (68 resets) in 1726 ms. (23 steps per ms) remains 4/11 properties
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
[2024-05-23 10:11:28] [INFO ] Flatten gal took : 261 ms
BEST_FIRST walk for 40004 steps (12 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
[2024-05-23 10:11:28] [INFO ] Flatten gal took : 101 ms
BEST_FIRST walk for 40003 steps (8 resets) in 338 ms. (118 steps per ms) remains 4/4 properties
[2024-05-23 10:11:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8060471843957950103.gal : 40 ms
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
[2024-05-23 10:11:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11103019911671352654.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/ReachabilityCardinality8060471843957950103.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11103019911671352654.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

[2024-05-23 10:11:28] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
/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
// Phase 1: matrix 414 rows 222 cols
[2024-05-23 10:11:28] [INFO ] Computed 4 invariants in 21 ms
Loading property file /tmp/ReachabilityCardinality11103019911671352654.prop.
[2024-05-23 10:11:28] [INFO ] State equation strengthened by 65 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :31 after 990
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem FunctionPointer-PT-b004-ReachabilityFireability-2024-01 is UNSAT
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-b004-ReachabilityFireability-2024-15 is UNSAT
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 71/109 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 314/424 variables, 110/114 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 57/171 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/171 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 184/608 variables, 88/259 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 8/267 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 0/267 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 28/636 variables, 24/291 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/636 variables, 0/291 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/636 variables, 0/291 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 636/636 variables, and 291 constraints, problems are : Problem set: 2 solved, 2 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 222/222 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/99 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 275/375 variables, 100/104 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 56/160 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/160 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/592 variables, 86/246 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/592 variables, 9/255 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/592 variables, 2/257 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/592 variables, 0/257 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 44/636 variables, 36/293 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/636 variables, 0/293 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/636 variables, 0/293 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 636/636 variables, and 293 constraints, problems are : Problem set: 2 solved, 2 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 222/222 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1063ms problems are : Problem set: 2 solved, 2 unsolved
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 500 ms.
Support contains 14 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 212 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 188 transition count 522
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 188 transition count 522
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 89 place count 188 transition count 482
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 103 place count 174 transition count 454
Iterating global reduction 1 with 14 rules applied. Total rules applied 117 place count 174 transition count 454
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 129 place count 174 transition count 442
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 136 place count 167 transition count 428
Iterating global reduction 2 with 7 rules applied. Total rules applied 143 place count 167 transition count 428
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 150 place count 160 transition count 400
Iterating global reduction 2 with 7 rules applied. Total rules applied 157 place count 160 transition count 400
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 153 transition count 386
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 153 transition count 386
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 176 place count 148 transition count 366
Iterating global reduction 2 with 5 rules applied. Total rules applied 181 place count 148 transition count 366
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 186 place count 143 transition count 346
Iterating global reduction 2 with 5 rules applied. Total rules applied 191 place count 143 transition count 346
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 196 place count 138 transition count 336
Iterating global reduction 2 with 5 rules applied. Total rules applied 201 place count 138 transition count 336
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 133 transition count 326
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 133 transition count 326
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 216 place count 128 transition count 316
Iterating global reduction 2 with 5 rules applied. Total rules applied 221 place count 128 transition count 316
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 226 place count 123 transition count 306
Iterating global reduction 2 with 5 rules applied. Total rules applied 231 place count 123 transition count 306
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 235 place count 119 transition count 298
Iterating global reduction 2 with 4 rules applied. Total rules applied 239 place count 119 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 245 place count 119 transition count 292
Applied a total of 245 rules in 132 ms. Remains 119 /222 variables (removed 103) and now considering 292/648 (removed 356) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 119/222 places, 292/648 transitions.
RANDOM walk for 40001 steps (83 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :990 after 173725
Interrupted probabilistic random walk after 1490475 steps, run timeout after 3001 ms. (steps per millisecond=496 ) properties seen :0 out of 1
Probabilistic random walk after 1490475 steps, saw 979845 distinct states, run finished after 3005 ms. (steps per millisecond=495 ) properties seen :0
[2024-05-23 10:11:33] [INFO ] Flow matrix only has 197 transitions (discarded 95 similar events)
// Phase 1: matrix 197 rows 119 cols
[2024-05-23 10:11:33] [INFO ] Computed 2 invariants in 4 ms
[2024-05-23 10:11:33] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/202 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 32/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 94/296 variables, 46/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 13/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 20/316 variables, 16/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/316 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 166 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/202 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 32/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 94/296 variables, 46/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 13/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/316 variables, 16/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/316 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 301ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 14 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 292/292 transitions.
Applied a total of 0 rules in 13 ms. Remains 119 /119 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 119/119 places, 292/292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 292/292 transitions.
Applied a total of 0 rules in 9 ms. Remains 119 /119 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2024-05-23 10:11:33] [INFO ] Flow matrix only has 197 transitions (discarded 95 similar events)
[2024-05-23 10:11:33] [INFO ] Invariant cache hit.
[2024-05-23 10:11:33] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-23 10:11:33] [INFO ] Flow matrix only has 197 transitions (discarded 95 similar events)
[2024-05-23 10:11:33] [INFO ] Invariant cache hit.
[2024-05-23 10:11:33] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-23 10:11:33] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-05-23 10:11:34] [INFO ] Redundant transitions in 12 ms returned []
Running 290 sub problems to find dead transitions.
[2024-05-23 10:11:34] [INFO ] Flow matrix only has 197 transitions (discarded 95 similar events)
[2024-05-23 10:11:34] [INFO ] Invariant cache hit.
[2024-05-23 10:11:34] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 197/316 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 45/166 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 290 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 166 constraints, problems are : Problem set: 0 solved, 290 unsolved in 7590 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 197/316 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 45/166 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 290/456 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/316 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 456 constraints, problems are : Problem set: 0 solved, 290 unsolved in 8987 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 16872ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 16877ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17162 ms. Remains : 119/119 places, 292/292 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 152 edges and 119 vertex of which 24 / 119 are part of one of the 8 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 119 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 103 transition count 169
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 99 transition count 169
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 9 place count 99 transition count 153
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 41 place count 83 transition count 153
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 48 place count 76 transition count 146
Iterating global reduction 2 with 7 rules applied. Total rules applied 55 place count 76 transition count 146
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 69 place count 76 transition count 132
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 97 place count 62 transition count 118
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 102 place count 57 transition count 108
Iterating global reduction 3 with 5 rules applied. Total rules applied 107 place count 57 transition count 108
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 53 transition count 100
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 53 transition count 100
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 51 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 51 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 51 transition count 95
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 128 place count 47 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 138 place count 47 transition count 92
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 47 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 142 place count 45 transition count 90
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 143 place count 45 transition count 89
Applied a total of 143 rules in 35 ms. Remains 45 /119 variables (removed 74) and now considering 89/292 (removed 203) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 89 rows 45 cols
[2024-05-23 10:11:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 10:11:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 10:11:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 10:11:51] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 10:11:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 10:11:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 10:11:51] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 10:11:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 10:11:51] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 10:11:51] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 10:11:51] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 10:11:51] [INFO ] Flatten gal took : 5 ms
[2024-05-23 10:11:51] [INFO ] Flatten gal took : 5 ms
[2024-05-23 10:11:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8542557957299785990.gal : 1 ms
[2024-05-23 10:11:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10657141933974082303.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/ReachabilityCardinality8542557957299785990.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10657141933974082303.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/ReachabilityCardinality10657141933974082303.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 35
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :35 after 182
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :182 after 990
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :990 after 38631
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :38631 after 129281
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129281 after 307172
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :307172 after 661939
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :661939 after 1.36937e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.36937e+06 after 2.78146e+06
Detected timeout of ITS tools.
[2024-05-23 10:12:06] [INFO ] Flatten gal took : 6 ms
[2024-05-23 10:12:06] [INFO ] Applying decomposition
[2024-05-23 10:12:06] [INFO ] Flatten gal took : 6 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/graph2012279211591583042.txt' '-o' '/tmp/graph2012279211591583042.bin' '-w' '/tmp/graph2012279211591583042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2012279211591583042.bin' '-l' '-1' '-v' '-w' '/tmp/graph2012279211591583042.weights' '-q' '0' '-e' '0.001'
[2024-05-23 10:12:06] [INFO ] Decomposing Gal with order
[2024-05-23 10:12:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 10:12:06] [INFO ] Removed a total of 107 redundant transitions.
[2024-05-23 10:12:06] [INFO ] Flatten gal took : 40 ms
[2024-05-23 10:12:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 6 ms.
[2024-05-23 10:12:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10510205093749494345.gal : 3 ms
[2024-05-23 10:12:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5291175318652604265.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/ReachabilityCardinality10510205093749494345.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5291175318652604265.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/ReachabilityCardinality5291175318652604265.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 120
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :120 after 979
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :979 after 62601
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :62601 after 1.10553e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.10553e+06 after 2.98917e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.98917e+06 after 2.26034e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.26034e+07 after 5.80406e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.80406e+07 after 3.79805e+08
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30529 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 10:12:21] [INFO ] Flatten gal took : 58 ms
[2024-05-23 10:12:21] [INFO ] Applying decomposition
[2024-05-23 10:12:21] [INFO ] Flatten gal took : 55 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/graph14837136109060548519.txt' '-o' '/tmp/graph14837136109060548519.bin' '-w' '/tmp/graph14837136109060548519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14837136109060548519.bin' '-l' '-1' '-v' '-w' '/tmp/graph14837136109060548519.weights' '-q' '0' '-e' '0.001'
[2024-05-23 10:12:21] [INFO ] Decomposing Gal with order
[2024-05-23 10:12:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 10:12:21] [INFO ] Removed a total of 914 redundant transitions.
[2024-05-23 10:12:22] [INFO ] Flatten gal took : 136 ms
[2024-05-23 10:12:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 278 labels/synchronizations in 64 ms.
[2024-05-23 10:12:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3770363029026256836.gal : 16 ms
[2024-05-23 10:12:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13758317880296345209.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/ReachabilityCardinality3770363029026256836.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13758317880296345209.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/ReachabilityCardinality13758317880296345209.prop.
ITS-tools command line returned an error code 137
[2024-05-23 10:28:38] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4442339573684110707
[2024-05-23 10:28:38] [INFO ] Applying decomposition
[2024-05-23 10:28:38] [INFO ] Flatten gal took : 11 ms
[2024-05-23 10:28:38] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2024-05-23 10:28:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 10:28:38] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2024-05-23 10:28:38] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph4743687150778327652.txt' '-o' '/tmp/graph4743687150778327652.bin' '-w' '/tmp/graph4743687150778327652.weights'
[2024-05-23 10:28:38] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4743687150778327652.bin' '-l' '-1' '-v' '-w' '/tmp/graph4743687150778327652.weights' '-q' '0' '-e' '0.001'
[2024-05-23 10:28:38] [INFO ] Decomposing Gal with order
[2024-05-23 10:28:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 10:28:38] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 10:28:38] [INFO ] Removed a total of 493 redundant transitions.
[2024-05-23 10:28:38] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4442339573684110707
[2024-05-23 10:28:38] [INFO ] Flatten gal took : 21 ms
Running compilation step : cd /tmp/ltsmin4442339573684110707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
[2024-05-23 10:28:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 8 ms.
[2024-05-23 10:28:38] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5214446620505061747.gal : 2 ms
[2024-05-23 10:28:38] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16955129677309338379.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/ReachabilityFireability5214446620505061747.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16955129677309338379.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/ReachabilityFireability16955129677309338379.prop.
Compilation finished in 808 ms.
Running link step : cd /tmp/ltsmin4442339573684110707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin4442339573684110707;'/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' 'FunctionPointerPTb004ReachabilityFireability202314==true'
Detected timeout of ITS tools.
[2024-05-23 10:54:22] [INFO ] Applying decomposition
[2024-05-23 10:54:22] [INFO ] Flatten gal took : 32 ms
[2024-05-23 10:54:22] [INFO ] Decomposing Gal with order
[2024-05-23 10:54:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 10:54:22] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to l8 in partition [s0, s2, s4, l88],[l109, l113, l137],[s1, s3, s5, l64],[l104, l136],[l0, l24, l35, l36, l43, l44],[l30, l46],[l32, l39, l40],[l92, l100, l276],[l91, l99],[l107, l115, l131],[l168, l176],[l177, l191],[l139, l171, l179],[l195, l207],[l215, l224, l240, l248],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1234)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 10:54:22] [INFO ] Flatten gal took : 58 ms
[2024-05-23 10:54:22] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12071663491337940508.gal : 3 ms
[2024-05-23 10:54:22] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14454115845015632230.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/ReachabilityFireability12071663491337940508.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14454115845015632230.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
Loading property file /tmp/ReachabilityFireability14454115845015632230.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 921
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :921 after 51001
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51001 after 3.20149e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.20149e+06 after 3.42229e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.42229e+08 after 7.3185e+10
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.136: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.157: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.160: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.163: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.173: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.175: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.180: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.188: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.188: Initializing POR dependencies: labels 293, guards 292
pins2lts-mc-linux64( 0/ 8), 0.555: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 1/ 8), 0.580: "FunctionPointerPTb004ReachabilityFireability202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.580: "FunctionPointerPTb004ReachabilityFireability202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.580: "FunctionPointerPTb004ReachabilityFireability202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.581: "FunctionPointerPTb004ReachabilityFireability202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.580: "FunctionPointerPTb004ReachabilityFireability202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.581: "FunctionPointerPTb004ReachabilityFireability202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.583: "FunctionPointerPTb004ReachabilityFireability202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.583: There are 293 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.583: State length is 119, there are 292 groups
pins2lts-mc-linux64( 0/ 8), 0.583: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.583: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.583: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.583: Visible groups: 0 / 292, labels: 1 / 293
pins2lts-mc-linux64( 0/ 8), 0.583: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.583: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.581: "FunctionPointerPTb004ReachabilityFireability202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.662: ~7 levels ~960 states ~4512 transitions
pins2lts-mc-linux64( 0/ 8), 0.730: ~8 levels ~1920 states ~10024 transitions
pins2lts-mc-linux64( 0/ 8), 0.807: ~9 levels ~3840 states ~20408 transitions
pins2lts-mc-linux64( 0/ 8), 0.948: ~11 levels ~7680 states ~39624 transitions
pins2lts-mc-linux64( 5/ 8), 1.248: ~5 levels ~15360 states ~72432 transitions
pins2lts-mc-linux64( 5/ 8), 1.811: ~7 levels ~30720 states ~141560 transitions
pins2lts-mc-linux64( 5/ 8), 2.926: ~9 levels ~61440 states ~286112 transitions
pins2lts-mc-linux64( 4/ 8), 4.988: ~10 levels ~122880 states ~533800 transitions
pins2lts-mc-linux64( 6/ 8), 8.717: ~12 levels ~245760 states ~1073440 transitions
pins2lts-mc-linux64( 4/ 8), 15.592: ~12 levels ~491520 states ~2174208 transitions
pins2lts-mc-linux64( 4/ 8), 29.386: ~13 levels ~983040 states ~4515584 transitions
pins2lts-mc-linux64( 7/ 8), 56.614: ~15 levels ~1966080 states ~9092416 transitions
pins2lts-mc-linux64( 7/ 8), 110.885: ~16 levels ~3932160 states ~18138344 transitions
pins2lts-mc-linux64( 7/ 8), 223.098: ~17 levels ~7864320 states ~36246072 transitions
pins2lts-mc-linux64( 4/ 8), 440.046: ~18 levels ~15728640 states ~72817072 transitions
pins2lts-mc-linux64( 7/ 8), 916.158: ~20 levels ~31457280 states ~145464672 transitions
pins2lts-mc-linux64( 4/ 8), 1922.250: ~21 levels ~62914560 states ~290556672 transitions
pins2lts-mc-linux64( 3/ 8), 2535.695: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2535.733:
pins2lts-mc-linux64( 0/ 8), 2535.733: mean standard work distribution: 1.6% (states) 0.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 2535.734:
pins2lts-mc-linux64( 0/ 8), 2535.734: Explored 82605473 states 396992557 transitions, fanout: 4.806
pins2lts-mc-linux64( 0/ 8), 2535.734: Total exploration time 2535.150 sec (2535.120 sec minimum, 2535.132 sec on average)
pins2lts-mc-linux64( 0/ 8), 2535.734: States per second: 32584, Transitions per second: 156595
pins2lts-mc-linux64( 0/ 8), 2535.734: Ignoring proviso: 512372
pins2lts-mc-linux64( 0/ 8), 2535.734:
pins2lts-mc-linux64( 0/ 8), 2535.734: Queue width: 8B, total height: 51611822, memory: 393.77MB
pins2lts-mc-linux64( 0/ 8), 2535.734: Tree memory: 1190.3MB, 9.3 B/state, compr.: 1.9%
pins2lts-mc-linux64( 0/ 8), 2535.734: Tree fill ratio (roots/leafs): 99.0%/64.0%
pins2lts-mc-linux64( 0/ 8), 2535.734: Stored 294 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2535.734: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2535.734: Est. total memory use: 1584.1MB (~1417.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4442339573684110707;'/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' 'FunctionPointerPTb004ReachabilityFireability202314==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4442339573684110707;'/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' 'FunctionPointerPTb004ReachabilityFireability202314==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="FunctionPointer-PT-b004"
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 FunctionPointer-PT-b004, 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 r180-tall-171640602900231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b004.tgz
mv FunctionPointer-PT-b004 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 ;