fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r024-tall-165251918100150
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for BridgeAndVehicles-COL-V80P50N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6030.107 3600000.00 13629583.00 743.10 FTFFFFTTFF?TFFFT 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.r024-tall-165251918100150.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 itstools
Input is BridgeAndVehicles-COL-V80P50N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918100150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.5K Apr 29 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 29 22:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 22:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 29 23:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 29 23:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 29 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 29 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 45K May 10 09:33 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 BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654190807653

Running Version 202205111006
[2022-06-02 17:26:48] [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-02 17:26:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 17:26:49] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-06-02 17:26:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-06-02 17:26:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 662 ms
[2022-06-02 17:26:49] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 198 PT places and 551698.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
[2022-06-02 17:26:49] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 6 ms.
[2022-06-02 17:26:49] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
[2022-06-02 17:26:49] [INFO ] Flatten gal took : 20 ms
[2022-06-02 17:26:49] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2022-06-02 17:26:49] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions 28830 arcs in 137 ms.
[2022-06-02 17:26:49] [INFO ] Unfolded 16 HLPN properties in 1 ms.
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 609 ms. (steps per millisecond=16 ) properties (out of 9) seen :5
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-02 17:26:51] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2022-06-02 17:26:51] [INFO ] Computed 7 place invariants in 31 ms
[2022-06-02 17:26:51] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 17:26:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-06-02 17:26:52] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2022-06-02 17:26:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 17:26:52] [INFO ] After 209ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2022-06-02 17:26:52] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 175 ms.
[2022-06-02 17:26:52] [INFO ] After 1081ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 254 ms.
Support contains 13 out of 198 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Applied a total of 0 rules in 829 ms. Remains 198 /198 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-06-02 17:26:54] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2022-06-02 17:26:54] [INFO ] Computed 7 place invariants in 22 ms
[2022-06-02 17:26:55] [INFO ] Dead Transitions using invariants and state equation in 1417 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 3728/3728 transitions.
Incomplete random walk after 1000000 steps, including 1454 resets, run finished after 12746 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 893303 steps, including 538 resets, run timeout after 5001 ms. (steps per millisecond=178 ) properties seen 0
Interrupted probabilistic random walk after 2528851 steps, run timeout after 51001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 2528851 steps, saw 661829 distinct states, run finished after 51004 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 17:28:04] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2022-06-02 17:28:04] [INFO ] Computed 7 place invariants in 14 ms
[2022-06-02 17:28:04] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 17:28:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-06-02 17:28:04] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 17:28:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 17:28:04] [INFO ] After 198ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 17:28:05] [INFO ] Deduced a trap composed of 5 places in 436 ms of which 1 ms to minimize.
[2022-06-02 17:28:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 527 ms
[2022-06-02 17:28:05] [INFO ] After 920ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 206 ms.
[2022-06-02 17:28:05] [INFO ] After 1486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 739 ms.
Support contains 13 out of 198 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Applied a total of 0 rules in 498 ms. Remains 198 /198 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 3728/3728 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Applied a total of 0 rules in 486 ms. Remains 198 /198 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-06-02 17:28:07] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2022-06-02 17:28:07] [INFO ] Computed 7 place invariants in 15 ms
[2022-06-02 17:28:08] [INFO ] Implicit Places using invariants in 470 ms returned []
[2022-06-02 17:28:08] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2022-06-02 17:28:08] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-02 17:28:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 17:28:09] [INFO ] Implicit Places using invariants and state equation in 979 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1473 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 197/198 places, 3728/3728 transitions.
Applied a total of 0 rules in 537 ms. Remains 197 /197 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 197/198 places, 3728/3728 transitions.
Incomplete random walk after 1000000 steps, including 1455 resets, run finished after 12370 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 913117 steps, including 550 resets, run timeout after 5001 ms. (steps per millisecond=182 ) properties seen 0
Interrupted probabilistic random walk after 2550548 steps, run timeout after 51001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 2550548 steps, saw 667297 distinct states, run finished after 51001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 17:29:18] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 197 cols
[2022-06-02 17:29:18] [INFO ] Computed 6 place invariants in 4 ms
[2022-06-02 17:29:18] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 17:29:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-02 17:29:18] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 17:29:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 17:29:18] [INFO ] After 201ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 17:29:18] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 209 ms.
[2022-06-02 17:29:19] [INFO ] After 1009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 335 ms.
Support contains 13 out of 197 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Applied a total of 0 rules in 467 ms. Remains 197 /197 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 3728/3728 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Applied a total of 0 rules in 465 ms. Remains 197 /197 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-06-02 17:29:20] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 197 cols
[2022-06-02 17:29:20] [INFO ] Computed 6 place invariants in 12 ms
[2022-06-02 17:29:20] [INFO ] Implicit Places using invariants in 442 ms returned []
[2022-06-02 17:29:20] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 197 cols
[2022-06-02 17:29:20] [INFO ] Computed 6 place invariants in 7 ms
[2022-06-02 17:29:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 17:29:22] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
[2022-06-02 17:29:22] [INFO ] Redundant transitions in 246 ms returned []
[2022-06-02 17:29:22] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 197 cols
[2022-06-02 17:29:22] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-02 17:29:23] [INFO ] Dead Transitions using invariants and state equation in 1137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 3728/3728 transitions.
Incomplete random walk after 1000000 steps, including 1454 resets, run finished after 12165 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 918186 steps, including 553 resets, run timeout after 5001 ms. (steps per millisecond=183 ) properties seen 0
Interrupted probabilistic random walk after 2599317 steps, run timeout after 51001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 2599317 steps, saw 679724 distinct states, run finished after 51001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 17:30:31] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 197 cols
[2022-06-02 17:30:31] [INFO ] Computed 6 place invariants in 6 ms
[2022-06-02 17:30:31] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 17:30:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-02 17:30:32] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 17:30:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 17:30:32] [INFO ] After 190ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 17:30:32] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 209 ms.
[2022-06-02 17:30:32] [INFO ] After 943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 366 ms.
Support contains 13 out of 197 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Applied a total of 0 rules in 452 ms. Remains 197 /197 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 3728/3728 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Applied a total of 0 rules in 448 ms. Remains 197 /197 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2022-06-02 17:30:34] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 197 cols
[2022-06-02 17:30:34] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-02 17:30:34] [INFO ] Implicit Places using invariants in 426 ms returned []
[2022-06-02 17:30:34] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 197 cols
[2022-06-02 17:30:34] [INFO ] Computed 6 place invariants in 4 ms
[2022-06-02 17:30:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 17:30:35] [INFO ] Implicit Places using invariants and state equation in 1241 ms returned []
Implicit Place search using SMT with State Equation took 1671 ms to find 0 implicit places.
[2022-06-02 17:30:35] [INFO ] Redundant transitions in 217 ms returned []
[2022-06-02 17:30:35] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 197 cols
[2022-06-02 17:30:35] [INFO ] Computed 6 place invariants in 7 ms
[2022-06-02 17:30:36] [INFO ] Dead Transitions using invariants and state equation in 1030 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 3728/3728 transitions.
Ensure Unique test removed 3318 transitions
Reduce isomorphic transitions removed 3318 transitions.
Iterating post reduction 0 with 3318 rules applied. Total rules applied 3318 place count 197 transition count 410
Applied a total of 3318 rules in 11 ms. Remains 197 /197 variables (removed 0) and now considering 410/3728 (removed 3318) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 410 rows 197 cols
[2022-06-02 17:30:36] [INFO ] Computed 6 place invariants in 3 ms
[2022-06-02 17:30:37] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 17:30:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-02 17:30:37] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 17:30:37] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2022-06-02 17:30:37] [INFO ] After 475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 17:30:37] [INFO ] Flatten gal took : 58 ms
[2022-06-02 17:30:37] [INFO ] Flatten gal took : 44 ms
[2022-06-02 17:30:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12703080734533674216.gal : 15 ms
[2022-06-02 17:30:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6587336881616750208.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12703080734533674216.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6587336881616750208.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality6587336881616750208.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 23
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :23 after 41
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :41 after 75
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :75 after 124
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :124 after 1240
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1240 after 10416
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10416 after 84320
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :84320 after 676544
Detected timeout of ITS tools.
[2022-06-02 17:30:52] [INFO ] Flatten gal took : 36 ms
[2022-06-02 17:30:52] [INFO ] Applying decomposition
[2022-06-02 17:30:52] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17728720452282352329.txt' '-o' '/tmp/graph17728720452282352329.bin' '-w' '/tmp/graph17728720452282352329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17728720452282352329.bin' '-l' '-1' '-v' '-w' '/tmp/graph17728720452282352329.weights' '-q' '0' '-e' '0.001'
[2022-06-02 17:30:52] [INFO ] Decomposing Gal with order
[2022-06-02 17:30:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 17:30:53] [INFO ] Removed a total of 621 redundant transitions.
[2022-06-02 17:30:53] [INFO ] Flatten gal took : 102 ms
[2022-06-02 17:30:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 20 ms.
[2022-06-02 17:30:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9721506506460710576.gal : 7 ms
[2022-06-02 17:30:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13091811235189336853.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9721506506460710576.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13091811235189336853.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality13091811235189336853.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 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 67
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :67 after 891
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :891 after 1863
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1863 after 2835
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2835 after 3807
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3807 after 5751
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5751 after 8667
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8667 after 34545
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :34545 after 233955
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6573875722883631467
[2022-06-02 17:31:08] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6573875722883631467
Running compilation step : cd /tmp/ltsmin6573875722883631467;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 803 ms.
Running link step : cd /tmp/ltsmin6573875722883631467;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6573875722883631467;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'BridgeAndVehiclesCOLV80P50N20ReachabilityCardinality10==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-02 17:31:23] [INFO ] Flatten gal took : 193 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3741520622821550152
[2022-06-02 17:31:23] [INFO ] Too many transitions (3728) to apply POR reductions. Disabling POR matrices.
[2022-06-02 17:31:23] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3741520622821550152
Running compilation step : cd /tmp/ltsmin3741520622821550152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-02 17:31:23] [INFO ] Applying decomposition
[2022-06-02 17:31:24] [INFO ] Flatten gal took : 245 ms
[2022-06-02 17:31:24] [INFO ] Flatten gal took : 217 ms
Compilation finished in 11638 ms.
Running link step : cd /tmp/ltsmin3741520622821550152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin3741520622821550152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesCOLV80P50N20ReachabilityCardinality10==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="BridgeAndVehicles-COL-V80P50N20"
export BK_EXAMINATION="ReachabilityCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V80P50N20, 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 r024-tall-165251918100150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N20.tgz
mv BridgeAndVehicles-COL-V80P50N20 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;