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.r323-tall-165472292800194.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 FunctionPointer-PT-c064, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292800194
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.0K Jun 7 17:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 7 17:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 7 17:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 7 17:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 7 17:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 7 17:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Jun 7 17:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 4.2M Jun 6 12:11 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654771215921

Running Version 0
[2022-06-09 10:40:17] [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-09 10:40:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 10:40:18] [INFO ] Load time of PNML (sax parser for PT used): 392 ms
[2022-06-09 10:40:18] [INFO ] Transformed 2826 places.
[2022-06-09 10:40:18] [INFO ] Transformed 8960 transitions.
[2022-06-09 10:40:18] [INFO ] Parsed PT model containing 2826 places and 8960 transitions in 488 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 32 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 9) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2022-06-09 10:40:18] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2022-06-09 10:40:18] [INFO ] Computed 4 place invariants in 105 ms
[2022-06-09 10:40:19] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:40:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 10:40:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:40:20] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2022-06-09 10:40:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:40:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:40:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:40:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:40:21] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2022-06-09 10:40:21] [INFO ] State equation strengthened by 2822 read => feed constraints.
[2022-06-09 10:40:24] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2642 ms returned sat
[2022-06-09 10:40:25] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 752 ms.
[2022-06-09 10:40:25] [INFO ] Added : 0 causal constraints over 0 iterations in 755 ms. Result :unknown
[2022-06-09 10:40:25] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 10:40:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-09 10:40:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:40:26] [INFO ] [Real]Absence check using state equation in 792 ms returned sat
[2022-06-09 10:40:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:40:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:40:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:40:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:40:27] [INFO ] [Nat]Absence check using state equation in 849 ms returned sat
[2022-06-09 10:40:30] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2753 ms returned sat
[2022-06-09 10:40:30] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 425 ms.
[2022-06-09 10:40:31] [INFO ] Added : 20 causal constraints over 4 iterations in 1116 ms. Result :unknown
[2022-06-09 10:40:31] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:40:31] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 10:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:40:32] [INFO ] [Real]Absence check using state equation in 789 ms returned sat
[2022-06-09 10:40:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:40:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:40:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:40:33] [INFO ] [Nat]Absence check using state equation in 833 ms returned sat
[2022-06-09 10:40:36] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2681 ms returned sat
[2022-06-09 10:40:36] [INFO ] Deduced a trap composed of 131 places in 164 ms of which 14 ms to minimize.
[2022-06-09 10:40:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 417 ms
[2022-06-09 10:40:37] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 459 ms.
[2022-06-09 10:40:37] [INFO ] Added : 15 causal constraints over 3 iterations in 910 ms. Result :unknown
[2022-06-09 10:40:37] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:40:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:40:38] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2022-06-09 10:40:40] [INFO ] [Real]Added 2822 Read/Feed constraints in 2007 ms returned sat
[2022-06-09 10:40:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:40:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:40:40] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:40:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:40:41] [INFO ] [Nat]Absence check using state equation in 822 ms returned sat
[2022-06-09 10:40:44] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2701 ms returned sat
[2022-06-09 10:40:44] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 411 ms.
[2022-06-09 10:40:46] [INFO ] Deduced a trap composed of 17 places in 1152 ms of which 6 ms to minimize.
[2022-06-09 10:40:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-09 10:40:47] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:40:47] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:40:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:40:47] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2022-06-09 10:40:49] [INFO ] [Real]Added 2822 Read/Feed constraints in 2028 ms returned sat
[2022-06-09 10:40:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:40:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 10:40:50] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:40:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:40:51] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2022-06-09 10:40:53] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2005 ms returned sat
[2022-06-09 10:40:53] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 430 ms.
[2022-06-09 10:40:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-09 10:40:55] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 10:40:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:40:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:40:56] [INFO ] [Real]Absence check using state equation in 766 ms returned sat
[2022-06-09 10:40:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:40:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:40:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 10:40:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:40:57] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2022-06-09 10:40:59] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2610 ms returned sat
[2022-06-09 10:41:00] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 434 ms.
[2022-06-09 10:41:02] [INFO ] Deduced a trap composed of 17 places in 1165 ms of which 3 ms to minimize.
[2022-06-09 10:41:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2022-06-09 10:41:02] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 10:41:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:41:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:41:03] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2022-06-09 10:41:05] [INFO ] [Real]Added 2822 Read/Feed constraints in 1984 ms returned sat
[2022-06-09 10:41:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:41:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:41:05] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:41:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:41:06] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2022-06-09 10:41:09] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2614 ms returned sat
[2022-06-09 10:41:09] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 431 ms.
[2022-06-09 10:41:11] [INFO ] Deduced a trap composed of 17 places in 1127 ms of which 13 ms to minimize.
[2022-06-09 10:41:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
Fused 7 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 1468900 steps, including 1002 resets, run finished after 24053 ms. (steps per millisecond=61 ) properties (out of 7) seen :4 could not realise parikh vector
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1440000 steps, including 1002 resets, run finished after 25804 ms. (steps per millisecond=55 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1446700 steps, including 1002 resets, run finished after 26151 ms. (steps per millisecond=55 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 14 out of 1628 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1419 are kept as prefixes of interest. Removing 209 places using SCC suffix rule.17 ms
Discarding 209 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 1419 transition count 5578
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 684 place count 1120 transition count 3286
Iterating global reduction 1 with 299 rules applied. Total rules applied 983 place count 1120 transition count 3286
Ensure Unique test removed 348 transitions
Reduce isomorphic transitions removed 348 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 1331 place count 1120 transition count 2938
Discarding 156 places :
Symmetric choice reduction at 2 with 156 rule applications. Total rules 1487 place count 964 transition count 2626
Iterating global reduction 2 with 156 rules applied. Total rules applied 1643 place count 964 transition count 2626
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1707 place count 964 transition count 2562
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1721 place count 950 transition count 2534
Iterating global reduction 3 with 14 rules applied. Total rules applied 1735 place count 950 transition count 2534
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1749 place count 936 transition count 2506
Iterating global reduction 3 with 14 rules applied. Total rules applied 1763 place count 936 transition count 2506
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1776 place count 923 transition count 2480
Iterating global reduction 3 with 13 rules applied. Total rules applied 1789 place count 923 transition count 2480
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1802 place count 910 transition count 2454
Iterating global reduction 3 with 13 rules applied. Total rules applied 1815 place count 910 transition count 2454
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1828 place count 897 transition count 2428
Iterating global reduction 3 with 13 rules applied. Total rules applied 1841 place count 897 transition count 2428
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1852 place count 886 transition count 2406
Iterating global reduction 3 with 11 rules applied. Total rules applied 1863 place count 886 transition count 2406
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1874 place count 875 transition count 2384
Iterating global reduction 3 with 11 rules applied. Total rules applied 1885 place count 875 transition count 2384
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1922 place count 838 transition count 2250
Iterating global reduction 3 with 37 rules applied. Total rules applied 1959 place count 838 transition count 2250
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2015 place count 782 transition count 2026
Iterating global reduction 3 with 56 rules applied. Total rules applied 2071 place count 782 transition count 2026
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2126 place count 727 transition count 1862
Iterating global reduction 3 with 55 rules applied. Total rules applied 2181 place count 727 transition count 1862
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2235 place count 673 transition count 1754
Iterating global reduction 3 with 54 rules applied. Total rules applied 2289 place count 673 transition count 1754
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2343 place count 619 transition count 1646
Iterating global reduction 3 with 54 rules applied. Total rules applied 2397 place count 619 transition count 1646
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2451 place count 565 transition count 1538
Iterating global reduction 3 with 54 rules applied. Total rules applied 2505 place count 565 transition count 1538
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2559 place count 511 transition count 1430
Iterating global reduction 3 with 54 rules applied. Total rules applied 2613 place count 511 transition count 1430
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2638 place count 486 transition count 1380
Iterating global reduction 3 with 25 rules applied. Total rules applied 2663 place count 486 transition count 1380
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 2679 place count 486 transition count 1364
Applied a total of 2679 rules in 1372 ms. Remains 486 /1628 variables (removed 1142) and now considering 1364/5962 (removed 4598) transitions.
Finished structural reductions, in 1 iterations. Remains : 486/1628 places, 1364/5962 transitions.
[2022-06-09 10:42:29] [INFO ] Flatten gal took : 162 ms
[2022-06-09 10:42:29] [INFO ] Flatten gal took : 79 ms
[2022-06-09 10:42:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality372048501928516381.gal : 32 ms
[2022-06-09 10:42:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17148525066524966244.prop : 1 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/ReachabilityCardinality372048501928516381.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17148525066524966244.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/ReachabilityCardinality372048501928516381.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17148525066524966244.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17148525066524966244.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1995 after 1.24464e+06
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1.24464e+06 after 3.74714e+10
Detected timeout of ITS tools.
[2022-06-09 10:42:44] [INFO ] Flatten gal took : 82 ms
[2022-06-09 10:42:44] [INFO ] Applying decomposition
[2022-06-09 10:42:44] [INFO ] Flatten gal took : 63 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/graph10770749338850836937.txt, -o, /tmp/graph10770749338850836937.bin, -w, /tmp/graph10770749338850836937.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/graph10770749338850836937.bin, -l, -1, -v, -w, /tmp/graph10770749338850836937.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 10:42:45] [INFO ] Decomposing Gal with order
[2022-06-09 10:42:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:42:45] [INFO ] Removed a total of 18 redundant transitions.
[2022-06-09 10:42:45] [INFO ] Flatten gal took : 128 ms
[2022-06-09 10:42:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 7 ms.
[2022-06-09 10:42:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9102207062930064801.gal : 25 ms
[2022-06-09 10:42:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18237831266661150237.prop : 1 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/ReachabilityCardinality9102207062930064801.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18237831266661150237.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/ReachabilityCardinality9102207062930064801.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18237831266661150237.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18237831266661150237.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :31 after 1988
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1988 after 1.23134e+06
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1.23134e+06 after 3.64475e+10
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13845595182743404887
[2022-06-09 10:43:00] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13845595182743404887
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/ltsmin13845595182743404887]
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/ltsmin13845595182743404887] 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/ltsmin13845595182743404887] 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 1000002 steps, including 2 resets, run finished after 2693 ms. (steps per millisecond=371 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1997 ms. (steps per millisecond=500 ) properties (out of 3) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1719 ms. (steps per millisecond=581 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1619 ms. (steps per millisecond=617 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-09 10:43:09] [INFO ] Flow matrix only has 796 transitions (discarded 568 similar events)
// Phase 1: matrix 796 rows 486 cols
[2022-06-09 10:43:09] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 10:43:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 10:43:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:43:09] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2022-06-09 10:43:10] [INFO ] State equation strengthened by 430 read => feed constraints.
[2022-06-09 10:43:10] [INFO ] [Real]Added 430 Read/Feed constraints in 268 ms returned sat
[2022-06-09 10:43:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:43:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 10:43:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:43:10] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2022-06-09 10:43:10] [INFO ] [Nat]Added 430 Read/Feed constraints in 248 ms returned sat
[2022-06-09 10:43:10] [INFO ] Computed and/alt/rep : 106/110/88 causal constraints (skipped 706 transitions) in 96 ms.
[2022-06-09 10:43:11] [INFO ] Added : 24 causal constraints over 5 iterations in 397 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-09 10:43:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 10:43:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:43:11] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2022-06-09 10:43:11] [INFO ] [Real]Added 430 Read/Feed constraints in 240 ms returned sat
[2022-06-09 10:43:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:43:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 10:43:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:43:12] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2022-06-09 10:43:12] [INFO ] [Nat]Added 430 Read/Feed constraints in 277 ms returned sat
[2022-06-09 10:43:12] [INFO ] Deduced a trap composed of 131 places in 59 ms of which 0 ms to minimize.
[2022-06-09 10:43:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-06-09 10:43:12] [INFO ] Computed and/alt/rep : 106/110/88 causal constraints (skipped 706 transitions) in 69 ms.
[2022-06-09 10:43:12] [INFO ] Added : 24 causal constraints over 5 iterations in 364 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 143500 steps, including 467 resets, run finished after 669 ms. (steps per millisecond=214 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 154400 steps, including 573 resets, run finished after 547 ms. (steps per millisecond=282 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 486/486 places, 1364/1364 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 476 transition count 1342
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 476 transition count 1342
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 476 transition count 1336
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 469 transition count 1320
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 469 transition count 1320
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 462 transition count 1306
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 462 transition count 1306
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 455 transition count 1288
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 455 transition count 1288
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 449 transition count 1276
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 449 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 444 transition count 1264
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 444 transition count 1264
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 439 transition count 1254
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 439 transition count 1254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 104 place count 435 transition count 1246
Iterating global reduction 1 with 4 rules applied. Total rules applied 108 place count 435 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 432 transition count 1240
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 432 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 429 transition count 1234
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 429 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 428 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 428 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 427 transition count 1230
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 427 transition count 1230
Applied a total of 124 rules in 176 ms. Remains 427 /486 variables (removed 59) and now considering 1230/1364 (removed 134) transitions.
Finished structural reductions, in 1 iterations. Remains : 427/486 places, 1230/1364 transitions.
[2022-06-09 10:43:14] [INFO ] Flatten gal took : 47 ms
[2022-06-09 10:43:14] [INFO ] Flatten gal took : 45 ms
[2022-06-09 10:43:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality691195198689981877.gal : 5 ms
[2022-06-09 10:43:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1403702137340544013.prop : 63 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/ReachabilityCardinality691195198689981877.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1403702137340544013.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/ReachabilityCardinality691195198689981877.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1403702137340544013.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1403702137340544013.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :31 after 1975
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1975 after 1.20219e+06
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1.20219e+06 after 3.3929e+10
Detected timeout of ITS tools.
[2022-06-09 10:43:29] [INFO ] Flatten gal took : 40 ms
[2022-06-09 10:43:29] [INFO ] Applying decomposition
[2022-06-09 10:43:29] [INFO ] Flatten gal took : 42 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/graph16010513634380264056.txt, -o, /tmp/graph16010513634380264056.bin, -w, /tmp/graph16010513634380264056.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/graph16010513634380264056.bin, -l, -1, -v, -w, /tmp/graph16010513634380264056.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 10:43:29] [INFO ] Decomposing Gal with order
[2022-06-09 10:43:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:43:29] [INFO ] Removed a total of 2104 redundant transitions.
[2022-06-09 10:43:29] [INFO ] Flatten gal took : 103 ms
[2022-06-09 10:43:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 871 labels/synchronizations in 57 ms.
[2022-06-09 10:43:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4713901484909681874.gal : 9 ms
[2022-06-09 10:43:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3361267154090496502.prop : 1 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/ReachabilityCardinality4713901484909681874.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3361267154090496502.prop, --nowitness], 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/ReachabilityCardinality4713901484909681874.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3361267154090496502.prop --nowitness
Loading property file /tmp/ReachabilityCardinality3361267154090496502.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17012288179854113949
[2022-06-09 10:43:44] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17012288179854113949
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/ltsmin17012288179854113949]
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/ltsmin17012288179854113949] 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/ltsmin17012288179854113949] 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 1000001 steps, including 2 resets, run finished after 2327 ms. (steps per millisecond=429 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1341 ms. (steps per millisecond=745 ) properties (out of 2) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 789754 steps, including 2 resets, run visited all 1 properties in 1020 ms. (steps per millisecond=774 )
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1654771431775

--------------------
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="FunctionPointer-PT-c064"
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 FunctionPointer-PT-c064, 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 r323-tall-165472292800194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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