About the Execution of 2021-gold for HirschbergSinclair-PT-30
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
372.172 | 70366.00 | 99624.00 | 586.10 | FFFTTTFFFFFTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r125-smll-165264482000116.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is HirschbergSinclair-PT-30, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-smll-165264482000116
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 8.7K Apr 29 16:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 16:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 29 16:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 16:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 9 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 29 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 29 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 29 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 357K May 10 09:34 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 HirschbergSinclair-PT-30-ReachabilityCardinality-00
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-01
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-02
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-03
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-04
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-05
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-06
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-07
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-08
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-09
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-10
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-11
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-12
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-13
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-14
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1655073020501
Running Version 0
[2022-06-12 22:30:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 22:30:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:30:23] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2022-06-12 22:30:23] [INFO ] Transformed 670 places.
[2022-06-12 22:30:23] [INFO ] Transformed 605 transitions.
[2022-06-12 22:30:23] [INFO ] Parsed PT model containing 670 places and 605 transitions in 198 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 16 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 16) seen :8
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 605 rows 670 cols
[2022-06-12 22:30:24] [INFO ] Computed 65 place invariants in 30 ms
[2022-06-12 22:30:24] [INFO ] [Real]Absence check using 60 positive place invariants in 50 ms returned sat
[2022-06-12 22:30:24] [INFO ] [Real]Absence check using 60 positive and 5 generalized place invariants in 5 ms returned sat
[2022-06-12 22:30:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:30:25] [INFO ] [Real]Absence check using state equation in 223 ms returned unsat
[2022-06-12 22:30:25] [INFO ] [Real]Absence check using 60 positive place invariants in 37 ms returned unsat
[2022-06-12 22:30:25] [INFO ] [Real]Absence check using 60 positive place invariants in 11 ms returned unsat
[2022-06-12 22:30:25] [INFO ] [Real]Absence check using 60 positive place invariants in 36 ms returned unsat
[2022-06-12 22:30:25] [INFO ] [Real]Absence check using 60 positive place invariants in 52 ms returned sat
[2022-06-12 22:30:25] [INFO ] [Real]Absence check using 60 positive and 5 generalized place invariants in 5 ms returned sat
[2022-06-12 22:30:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:30:27] [INFO ] [Real]Absence check using state equation in 1552 ms returned sat
[2022-06-12 22:30:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:30:27] [INFO ] [Nat]Absence check using 60 positive place invariants in 53 ms returned sat
[2022-06-12 22:30:27] [INFO ] [Nat]Absence check using 60 positive and 5 generalized place invariants in 5 ms returned sat
[2022-06-12 22:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:30:28] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2022-06-12 22:30:28] [INFO ] Deduced a trap composed of 14 places in 426 ms of which 7 ms to minimize.
[2022-06-12 22:30:29] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 3 ms to minimize.
[2022-06-12 22:30:29] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 1 ms to minimize.
[2022-06-12 22:30:29] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 1 ms to minimize.
[2022-06-12 22:30:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1469 ms
[2022-06-12 22:30:29] [INFO ] Computed and/alt/rep : 355/1000/355 causal constraints (skipped 220 transitions) in 69 ms.
[2022-06-12 22:30:30] [INFO ] Added : 55 causal constraints over 11 iterations in 930 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 22:30:30] [INFO ] [Real]Absence check using 60 positive place invariants in 38 ms returned sat
[2022-06-12 22:30:30] [INFO ] [Real]Absence check using 60 positive and 5 generalized place invariants in 4 ms returned sat
[2022-06-12 22:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:30:31] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2022-06-12 22:30:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:30:31] [INFO ] [Nat]Absence check using 60 positive place invariants in 45 ms returned sat
[2022-06-12 22:30:31] [INFO ] [Nat]Absence check using 60 positive and 5 generalized place invariants in 5 ms returned sat
[2022-06-12 22:30:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:30:32] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2022-06-12 22:30:32] [INFO ] Deduced a trap composed of 16 places in 316 ms of which 2 ms to minimize.
[2022-06-12 22:30:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 443 ms
[2022-06-12 22:30:32] [INFO ] Computed and/alt/rep : 355/1000/355 causal constraints (skipped 220 transitions) in 69 ms.
[2022-06-12 22:30:35] [INFO ] Added : 238 causal constraints over 48 iterations in 2638 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-12 22:30:35] [INFO ] [Real]Absence check using 60 positive place invariants in 19 ms returned unsat
[2022-06-12 22:30:35] [INFO ] [Real]Absence check using 60 positive place invariants in 53 ms returned sat
[2022-06-12 22:30:35] [INFO ] [Real]Absence check using 60 positive and 5 generalized place invariants in 22 ms returned sat
[2022-06-12 22:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:30:36] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2022-06-12 22:30:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:30:36] [INFO ] [Nat]Absence check using 60 positive place invariants in 34 ms returned sat
[2022-06-12 22:30:36] [INFO ] [Nat]Absence check using 60 positive and 5 generalized place invariants in 5 ms returned sat
[2022-06-12 22:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:30:36] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2022-06-12 22:30:36] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 1 ms to minimize.
[2022-06-12 22:30:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2022-06-12 22:30:37] [INFO ] Computed and/alt/rep : 355/1000/355 causal constraints (skipped 220 transitions) in 55 ms.
[2022-06-12 22:30:39] [INFO ] Added : 183 causal constraints over 37 iterations in 2531 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 12600 steps, including 207 resets, run finished after 85 ms. (steps per millisecond=148 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 38100 steps, including 318 resets, run finished after 251 ms. (steps per millisecond=151 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 28900 steps, including 287 resets, run finished after 155 ms. (steps per millisecond=186 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 56 out of 670 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 670/670 places, 605/605 transitions.
Graph (complete) has 1278 edges and 670 vertex of which 644 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.6 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 644 transition count 407
Reduce places removed 197 places and 0 transitions.
Graph (complete) has 812 edges and 447 vertex of which 391 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 0 output transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 216 rules applied. Total rules applied 415 place count 391 transition count 389
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 74 rules applied. Total rules applied 489 place count 373 transition count 333
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 492 place count 370 transition count 330
Iterating global reduction 3 with 3 rules applied. Total rules applied 495 place count 370 transition count 330
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 497 place count 368 transition count 328
Iterating global reduction 3 with 2 rules applied. Total rules applied 499 place count 368 transition count 328
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 513 place count 368 transition count 314
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 527 place count 354 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 528 place count 353 transition count 313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 529 place count 352 transition count 312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 530 place count 351 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 531 place count 350 transition count 310
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 532 place count 349 transition count 309
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 533 place count 348 transition count 308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 534 place count 347 transition count 307
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 535 place count 346 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 536 place count 345 transition count 305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 537 place count 344 transition count 304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 538 place count 343 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 539 place count 342 transition count 302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 540 place count 341 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 541 place count 340 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 542 place count 339 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 543 place count 338 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 544 place count 337 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 545 place count 336 transition count 296
Applied a total of 545 rules in 568 ms. Remains 336 /670 variables (removed 334) and now considering 296/605 (removed 309) transitions.
Finished structural reductions, in 1 iterations. Remains : 336/670 places, 296/605 transitions.
[2022-06-12 22:30:41] [INFO ] Flatten gal took : 92 ms
[2022-06-12 22:30:41] [INFO ] Flatten gal took : 36 ms
[2022-06-12 22:30:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5168927116029661517.gal : 22 ms
[2022-06-12 22:30:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16667029880384217424.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5168927116029661517.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16667029880384217424.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality5168927116029661517.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16667029880384217424.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16667029880384217424.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 90
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :90 after 612
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :612 after 1989
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1989 after 1.04346e+06
Detected timeout of ITS tools.
[2022-06-12 22:30:56] [INFO ] Flatten gal took : 30 ms
[2022-06-12 22:30:56] [INFO ] Applying decomposition
[2022-06-12 22:30:56] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15714284106322105762.txt, -o, /tmp/graph15714284106322105762.bin, -w, /tmp/graph15714284106322105762.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15714284106322105762.bin, -l, -1, -v, -w, /tmp/graph15714284106322105762.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:30:56] [INFO ] Decomposing Gal with order
[2022-06-12 22:30:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:30:56] [INFO ] Removed a total of 160 redundant transitions.
[2022-06-12 22:30:56] [INFO ] Flatten gal took : 101 ms
[2022-06-12 22:30:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 33 ms.
[2022-06-12 22:30:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6898649257886224034.gal : 36 ms
[2022-06-12 22:30:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality762220917637639661.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6898649257886224034.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality762220917637639661.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6898649257886224034.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality762220917637639661.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality762220917637639661.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 8
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :8 after 26
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :26 after 117
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :117 after 6138
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :6138 after 47430
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5681152001916091219
[2022-06-12 22:31:11] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5681152001916091219
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5681152001916091219]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5681152001916091219] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5681152001916091219] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 3336 resets, run finished after 2816 ms. (steps per millisecond=355 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 677 resets, run finished after 1747 ms. (steps per millisecond=572 ) properties (out of 3) seen :1
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 597 resets, run finished after 1514 ms. (steps per millisecond=660 ) properties (out of 2) seen :1
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 684 resets, run finished after 1383 ms. (steps per millisecond=723 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 336 cols
[2022-06-12 22:31:20] [INFO ] Computed 40 place invariants in 17 ms
[2022-06-12 22:31:20] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned sat
[2022-06-12 22:31:20] [INFO ] [Real]Absence check using 7 positive and 33 generalized place invariants in 87 ms returned sat
[2022-06-12 22:31:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:31:20] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2022-06-12 22:31:20] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-12 22:31:21] [INFO ] [Real]Added 51 Read/Feed constraints in 39 ms returned sat
[2022-06-12 22:31:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:31:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 90 ms returned sat
[2022-06-12 22:31:21] [INFO ] [Nat]Absence check using 7 positive and 33 generalized place invariants in 81 ms returned sat
[2022-06-12 22:31:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:31:21] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2022-06-12 22:31:21] [INFO ] [Nat]Added 51 Read/Feed constraints in 36 ms returned sat
[2022-06-12 22:31:21] [INFO ] Computed and/alt/rep : 267/442/267 causal constraints (skipped 13 transitions) in 32 ms.
[2022-06-12 22:31:23] [INFO ] Added : 138 causal constraints over 28 iterations in 1351 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 16100 steps, including 306 resets, run finished after 53 ms. (steps per millisecond=303 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 16 out of 336 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 336/336 places, 296/296 transitions.
Graph (complete) has 632 edges and 336 vertex of which 322 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 322 transition count 267
Reduce places removed 20 places and 0 transitions.
Graph (complete) has 563 edges and 302 vertex of which 295 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 53 place count 295 transition count 265
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 62 place count 293 transition count 258
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 62 place count 293 transition count 247
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 84 place count 282 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 281 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 280 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 279 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 278 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 277 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 276 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 275 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 274 transition count 239
Applied a total of 92 rules in 147 ms. Remains 274 /336 variables (removed 62) and now considering 239/296 (removed 57) transitions.
Finished structural reductions, in 1 iterations. Remains : 274/336 places, 239/296 transitions.
[2022-06-12 22:31:23] [INFO ] Flatten gal took : 18 ms
[2022-06-12 22:31:23] [INFO ] Flatten gal took : 15 ms
[2022-06-12 22:31:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5888845521915230602.gal : 3 ms
[2022-06-12 22:31:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11676650141578824891.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5888845521915230602.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11676650141578824891.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality5888845521915230602.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11676650141578824891.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11676650141578824891.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 144
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :144 after 675
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :675 after 28350
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :28350 after 166698
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :166698 after 1.57022e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.57022e+06 after 5.11323e+06
Invariant property HirschbergSinclair-PT-30-ReachabilityCardinality-12 does not hold.
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 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,1.72398e+07,0.307534,10892,2,6885,16,25273,6,0,1305,13089,0
Total reachable state count : 17239842
Verifying 1 reachability properties.
Invariant property HirschbergSinclair-PT-30-ReachabilityCardinality-12 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HirschbergSinclair-PT-30-ReachabilityCardinality-12,23004,6.08177,10892,2,573,16,25273,7,0,1365,13089,0
All properties solved without resorting to model-checking.
BK_STOP 1655073090867
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="HirschbergSinclair-PT-30"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is HirschbergSinclair-PT-30, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r125-smll-165264482000116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-30.tgz
mv HirschbergSinclair-PT-30 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;