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.r179-tall-165277026700033.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 Peterson-PT-6, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026700033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.7M
-rw-r--r-- 1 mcc users 230K Apr 30 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 935K Apr 30 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K Apr 30 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 857K Apr 30 09:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 96K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 275K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 89K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 293K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 483K Apr 30 10:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.0M Apr 30 10:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 435K Apr 30 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.0M Apr 30 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 19K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 40K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 877K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1655072138857

Running Version 0
[2022-06-12 22:15:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 22:15:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:15:40] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2022-06-12 22:15:40] [INFO ] Transformed 1330 places.
[2022-06-12 22:15:40] [INFO ] Transformed 2030 transitions.
[2022-06-12 22:15:40] [INFO ] Found NUPN structural information;
[2022-06-12 22:15:40] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_0_0_5, BeginLoop_6_0_1, BeginLoop_5_0_1, BeginLoop_4_0_1, BeginLoop_4_2_2, BeginLoop_5_2_2, BeginLoop_6_2_2, BeginLoop_1_4_3, BeginLoop_1_3_3, BeginLoop_0_0_5, BeginLoop_2_5_4, BeginLoop_3_0_6, BeginLoop_1_1_6, TestAlone_2_1_3, TestAlone_2_0_3, TestAlone_6_4_3, TestAlone_6_0_4, TestAlone_5_0_4, TestAlone_5_2_3, TestAlone_4_3_6, TestAlone_4_4_6, TestAlone_0_4_5, TestAlone_3_3_5, TestTurn_3_5, TestTurn_3_4, TestIdentity_1_5_2, TestIdentity_1_2_3, TestIdentity_3_1_3, TestIdentity_0_4_6, TestIdentity_4_2_5, TestIdentity_4_3_5, TestIdentity_5_3_5, TestIdentity_6_3_5, TestIdentity_6_4_5, TestIdentity_5_4_5]
[2022-06-12 22:15:40] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 182 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 53 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-6-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 15) seen :8
FORMULA Peterson-PT-6-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :1
FORMULA Peterson-PT-6-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
[2022-06-12 22:15:41] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-06-12 22:15:41] [INFO ] Computed 27 place invariants in 45 ms
[2022-06-12 22:15:41] [INFO ] [Real]Absence check using 20 positive place invariants in 39 ms returned sat
[2022-06-12 22:15:41] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2022-06-12 22:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:43] [INFO ] [Real]Absence check using state equation in 1081 ms returned sat
[2022-06-12 22:15:43] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 22:15:43] [INFO ] [Real]Added 366 Read/Feed constraints in 79 ms returned sat
[2022-06-12 22:15:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:15:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 35 ms returned sat
[2022-06-12 22:15:43] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2022-06-12 22:15:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:44] [INFO ] [Nat]Absence check using state equation in 955 ms returned sat
[2022-06-12 22:15:44] [INFO ] [Nat]Added 366 Read/Feed constraints in 108 ms returned sat
[2022-06-12 22:15:45] [INFO ] Deduced a trap composed of 12 places in 559 ms of which 4 ms to minimize.
[2022-06-12 22:15:45] [INFO ] Deduced a trap composed of 16 places in 561 ms of which 15 ms to minimize.
[2022-06-12 22:15:46] [INFO ] Deduced a trap composed of 106 places in 495 ms of which 2 ms to minimize.
[2022-06-12 22:15:47] [INFO ] Deduced a trap composed of 84 places in 463 ms of which 1 ms to minimize.
[2022-06-12 22:15:47] [INFO ] Deduced a trap composed of 115 places in 501 ms of which 2 ms to minimize.
[2022-06-12 22:15:48] [INFO ] Deduced a trap composed of 115 places in 539 ms of which 1 ms to minimize.
[2022-06-12 22:15:48] [INFO ] Deduced a trap composed of 115 places in 500 ms of which 2 ms to minimize.
[2022-06-12 22:15:48] [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 0
[2022-06-12 22:15:49] [INFO ] [Real]Absence check using 20 positive place invariants in 52 ms returned sat
[2022-06-12 22:15:49] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 20 ms returned sat
[2022-06-12 22:15:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:53] [INFO ] [Real]Absence check using state equation in 4736 ms returned unknown
[2022-06-12 22:15:54] [INFO ] [Real]Absence check using 20 positive place invariants in 33 ms returned sat
[2022-06-12 22:15:54] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-06-12 22:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:55] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2022-06-12 22:15:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:15:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2022-06-12 22:15:55] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2022-06-12 22:15:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:56] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2022-06-12 22:15:56] [INFO ] [Nat]Added 366 Read/Feed constraints in 104 ms returned sat
[2022-06-12 22:15:56] [INFO ] Deduced a trap composed of 42 places in 434 ms of which 1 ms to minimize.
[2022-06-12 22:15:57] [INFO ] Deduced a trap composed of 214 places in 381 ms of which 1 ms to minimize.
[2022-06-12 22:15:57] [INFO ] Deduced a trap composed of 214 places in 378 ms of which 0 ms to minimize.
[2022-06-12 22:15:58] [INFO ] Deduced a trap composed of 63 places in 399 ms of which 1 ms to minimize.
[2022-06-12 22:15:58] [INFO ] Deduced a trap composed of 24 places in 411 ms of which 1 ms to minimize.
[2022-06-12 22:15:59] [INFO ] Deduced a trap composed of 22 places in 512 ms of which 1 ms to minimize.
[2022-06-12 22:15:59] [INFO ] Deduced a trap composed of 20 places in 475 ms of which 1 ms to minimize.
[2022-06-12 22:16:00] [INFO ] Deduced a trap composed of 101 places in 468 ms of which 2 ms to minimize.
[2022-06-12 22:16:00] [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 2
[2022-06-12 22:16:00] [INFO ] [Real]Absence check using 20 positive place invariants in 31 ms returned sat
[2022-06-12 22:16:00] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2022-06-12 22:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:01] [INFO ] [Real]Absence check using state equation in 1080 ms returned sat
[2022-06-12 22:16:01] [INFO ] [Real]Added 366 Read/Feed constraints in 94 ms returned sat
[2022-06-12 22:16:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:16:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 31 ms returned sat
[2022-06-12 22:16:02] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2022-06-12 22:16:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:03] [INFO ] [Nat]Absence check using state equation in 1002 ms returned sat
[2022-06-12 22:16:03] [INFO ] [Nat]Added 366 Read/Feed constraints in 105 ms returned sat
[2022-06-12 22:16:03] [INFO ] Deduced a trap composed of 320 places in 587 ms of which 1 ms to minimize.
[2022-06-12 22:16:04] [INFO ] Deduced a trap composed of 320 places in 533 ms of which 1 ms to minimize.
[2022-06-12 22:16:05] [INFO ] Deduced a trap composed of 334 places in 535 ms of which 1 ms to minimize.
[2022-06-12 22:16:05] [INFO ] Deduced a trap composed of 224 places in 532 ms of which 1 ms to minimize.
[2022-06-12 22:16:06] [INFO ] Deduced a trap composed of 53 places in 492 ms of which 1 ms to minimize.
[2022-06-12 22:16:06] [INFO ] Deduced a trap composed of 24 places in 557 ms of which 2 ms to minimize.
[2022-06-12 22:16:06] [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-12 22:16:07] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2022-06-12 22:16:07] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-12 22:16:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:07] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2022-06-12 22:16:07] [INFO ] [Real]Added 366 Read/Feed constraints in 84 ms returned sat
[2022-06-12 22:16:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:16:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2022-06-12 22:16:08] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-06-12 22:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:08] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2022-06-12 22:16:08] [INFO ] [Nat]Added 366 Read/Feed constraints in 103 ms returned sat
[2022-06-12 22:16:09] [INFO ] Deduced a trap composed of 99 places in 562 ms of which 7 ms to minimize.
[2022-06-12 22:16:09] [INFO ] Deduced a trap composed of 29 places in 523 ms of which 1 ms to minimize.
[2022-06-12 22:16:10] [INFO ] Deduced a trap composed of 34 places in 491 ms of which 1 ms to minimize.
[2022-06-12 22:16:11] [INFO ] Deduced a trap composed of 12 places in 506 ms of which 1 ms to minimize.
[2022-06-12 22:16:11] [INFO ] Deduced a trap composed of 12 places in 496 ms of which 1 ms to minimize.
[2022-06-12 22:16:12] [INFO ] Deduced a trap composed of 97 places in 511 ms of which 1 ms to minimize.
[2022-06-12 22:16:12] [INFO ] Deduced a trap composed of 12 places in 505 ms of which 1 ms to minimize.
[2022-06-12 22:16:13] [INFO ] Deduced a trap composed of 183 places in 522 ms of which 1 ms to minimize.
[2022-06-12 22:16:13] [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-12 22:16:13] [INFO ] [Real]Absence check using 20 positive place invariants in 30 ms returned sat
[2022-06-12 22:16:13] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2022-06-12 22:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:14] [INFO ] [Real]Absence check using state equation in 1194 ms returned sat
[2022-06-12 22:16:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:16:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 31 ms returned sat
[2022-06-12 22:16:15] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2022-06-12 22:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:15] [INFO ] [Nat]Absence check using state equation in 847 ms returned sat
[2022-06-12 22:16:16] [INFO ] [Nat]Added 366 Read/Feed constraints in 117 ms returned sat
[2022-06-12 22:16:16] [INFO ] Deduced a trap composed of 37 places in 441 ms of which 1 ms to minimize.
[2022-06-12 22:16:17] [INFO ] Deduced a trap composed of 35 places in 459 ms of which 1 ms to minimize.
[2022-06-12 22:16:17] [INFO ] Deduced a trap composed of 45 places in 440 ms of which 1 ms to minimize.
[2022-06-12 22:16:18] [INFO ] Deduced a trap composed of 43 places in 440 ms of which 1 ms to minimize.
[2022-06-12 22:16:18] [INFO ] Deduced a trap composed of 23 places in 459 ms of which 1 ms to minimize.
[2022-06-12 22:16:19] [INFO ] Deduced a trap composed of 131 places in 445 ms of which 5 ms to minimize.
[2022-06-12 22:16:19] [INFO ] Deduced a trap composed of 151 places in 386 ms of which 1 ms to minimize.
[2022-06-12 22:16:20] [INFO ] Deduced a trap composed of 121 places in 384 ms of which 0 ms to minimize.
[2022-06-12 22:16:20] [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
Fused 6 Parikh solutions to 1 different solutions.
Support contains 778 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 1330 transition count 1995
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 1295 transition count 1995
Applied a total of 70 rules in 165 ms. Remains 1295 /1330 variables (removed 35) and now considering 1995/2030 (removed 35) transitions.
Finished structural reductions, in 1 iterations. Remains : 1295/1330 places, 1995/2030 transitions.
[2022-06-12 22:16:20] [INFO ] Flatten gal took : 137 ms
[2022-06-12 22:16:20] [INFO ] Flatten gal took : 83 ms
[2022-06-12 22:16:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5605521661290573366.gal : 34 ms
[2022-06-12 22:16:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9021650500277554922.prop : 3 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/ReachabilityCardinality5605521661290573366.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9021650500277554922.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/ReachabilityCardinality5605521661290573366.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9021650500277554922.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9021650500277554922.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :9 after 11
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :11 after 12
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :12 after 46
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :46 after 74
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :74 after 102
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :102 after 231
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :231 after 1102
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :1102 after 3404
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :3404 after 7428
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :7428 after 26823
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :26823 after 100108
Detected timeout of ITS tools.
[2022-06-12 22:16:35] [INFO ] Flatten gal took : 79 ms
[2022-06-12 22:16:35] [INFO ] Applying decomposition
[2022-06-12 22:16:35] [INFO ] Flatten gal took : 59 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/graph12594247111967249626.txt, -o, /tmp/graph12594247111967249626.bin, -w, /tmp/graph12594247111967249626.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/graph12594247111967249626.bin, -l, -1, -v, -w, /tmp/graph12594247111967249626.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:16:36] [INFO ] Decomposing Gal with order
[2022-06-12 22:16:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:16:36] [INFO ] Removed a total of 1787 redundant transitions.
[2022-06-12 22:16:36] [INFO ] Flatten gal took : 487 ms
[2022-06-12 22:16:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 30 ms.
[2022-06-12 22:16:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3874129854634971378.gal : 30 ms
[2022-06-12 22:16:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9232045216545611795.prop : 41 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/ReachabilityCardinality3874129854634971378.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9232045216545611795.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/ReachabilityCardinality3874129854634971378.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9232045216545611795.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9232045216545611795.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 12
Reachability property Peterson-PT-6-ReachabilityFireability-13 is true.
FORMULA Peterson-PT-6-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :12 after 2.44304e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7680710814689310219
[2022-06-12 22:16:52] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7680710814689310219
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/ltsmin7680710814689310219]
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/ltsmin7680710814689310219] 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/ltsmin7680710814689310219] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4192 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1605 ms. (steps per millisecond=623 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 295408 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1544 ms. (steps per millisecond=647 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1351 ms. (steps per millisecond=740 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2562 ms. (steps per millisecond=390 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 3582728 steps, run timeout after 30001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 3582728 steps, saw 1545158 distinct states, run finished after 30001 ms. (steps per millisecond=119 ) properties seen :{}
Running SMT prover for 5 properties.
[2022-06-12 22:17:39] [INFO ] Flow matrix only has 1785 transitions (discarded 210 similar events)
// Phase 1: matrix 1785 rows 1295 cols
[2022-06-12 22:17:39] [INFO ] Computed 27 place invariants in 9 ms
[2022-06-12 22:17:39] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2022-06-12 22:17:39] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2022-06-12 22:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:17:40] [INFO ] [Real]Absence check using state equation in 919 ms returned sat
[2022-06-12 22:17:40] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 22:17:40] [INFO ] [Real]Added 366 Read/Feed constraints in 70 ms returned sat
[2022-06-12 22:17:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:17:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2022-06-12 22:17:41] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-06-12 22:17:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:17:42] [INFO ] [Nat]Absence check using state equation in 939 ms returned sat
[2022-06-12 22:17:42] [INFO ] [Nat]Added 366 Read/Feed constraints in 94 ms returned sat
[2022-06-12 22:17:42] [INFO ] Deduced a trap composed of 130 places in 481 ms of which 1 ms to minimize.
[2022-06-12 22:17:43] [INFO ] Deduced a trap composed of 346 places in 472 ms of which 2 ms to minimize.
[2022-06-12 22:17:43] [INFO ] Deduced a trap composed of 206 places in 481 ms of which 1 ms to minimize.
[2022-06-12 22:17:44] [INFO ] Deduced a trap composed of 204 places in 435 ms of which 1 ms to minimize.
[2022-06-12 22:17:44] [INFO ] Deduced a trap composed of 204 places in 448 ms of which 1 ms to minimize.
[2022-06-12 22:17:45] [INFO ] Deduced a trap composed of 209 places in 441 ms of which 1 ms to minimize.
[2022-06-12 22:17:45] [INFO ] Deduced a trap composed of 175 places in 437 ms of which 1 ms to minimize.
[2022-06-12 22:17:46] [INFO ] Deduced a trap composed of 253 places in 425 ms of which 1 ms to minimize.
[2022-06-12 22:17:46] [INFO ] Deduced a trap composed of 257 places in 429 ms of which 1 ms to minimize.
[2022-06-12 22:17:47] [INFO ] Deduced a trap composed of 252 places in 428 ms of which 1 ms to minimize.
[2022-06-12 22:17:47] [INFO ] Deduced a trap composed of 252 places in 449 ms of which 1 ms to minimize.
[2022-06-12 22:17:48] [INFO ] Deduced a trap composed of 171 places in 422 ms of which 1 ms to minimize.
[2022-06-12 22:17:48] [INFO ] Deduced a trap composed of 155 places in 431 ms of which 1 ms to minimize.
[2022-06-12 22:17:49] [INFO ] Deduced a trap composed of 306 places in 419 ms of which 1 ms to minimize.
[2022-06-12 22:17:49] [INFO ] Deduced a trap composed of 130 places in 418 ms of which 1 ms to minimize.
[2022-06-12 22:17:50] [INFO ] Deduced a trap composed of 130 places in 417 ms of which 1 ms to minimize.
[2022-06-12 22:17:50] [INFO ] Deduced a trap composed of 130 places in 426 ms of which 1 ms to minimize.
[2022-06-12 22:17:51] [INFO ] Deduced a trap composed of 311 places in 419 ms of which 1 ms to minimize.
[2022-06-12 22:17:51] [INFO ] Deduced a trap composed of 373 places in 445 ms of which 13 ms to minimize.
[2022-06-12 22:17:52] [INFO ] Deduced a trap composed of 373 places in 421 ms of which 1 ms to minimize.
[2022-06-12 22:17:52] [INFO ] Deduced a trap composed of 257 places in 425 ms of which 1 ms to minimize.
[2022-06-12 22:17:53] [INFO ] Deduced a trap composed of 311 places in 441 ms of which 1 ms to minimize.
[2022-06-12 22:17:54] [INFO ] Deduced a trap composed of 316 places in 436 ms of which 1 ms to minimize.
[2022-06-12 22:17:54] [INFO ] Deduced a trap composed of 373 places in 429 ms of which 1 ms to minimize.
[2022-06-12 22:17:55] [INFO ] Deduced a trap composed of 257 places in 425 ms of which 3 ms to minimize.
[2022-06-12 22:17:55] [INFO ] Deduced a trap composed of 305 places in 419 ms of which 1 ms to minimize.
[2022-06-12 22:17:56] [INFO ] Deduced a trap composed of 169 places in 425 ms of which 1 ms to minimize.
[2022-06-12 22:17:56] [INFO ] Deduced a trap composed of 12 places in 406 ms of which 1 ms to minimize.
[2022-06-12 22:17:57] [INFO ] Deduced a trap composed of 12 places in 415 ms of which 1 ms to minimize.
[2022-06-12 22:17:57] [INFO ] Deduced a trap composed of 27 places in 413 ms of which 1 ms to minimize.
[2022-06-12 22:17:58] [INFO ] Deduced a trap composed of 12 places in 428 ms of which 1 ms to minimize.
[2022-06-12 22:17:58] [INFO ] Deduced a trap composed of 12 places in 413 ms of which 1 ms to minimize.
[2022-06-12 22:17:59] [INFO ] Deduced a trap composed of 12 places in 418 ms of which 1 ms to minimize.
[2022-06-12 22:17:59] [INFO ] Deduced a trap composed of 12 places in 413 ms of which 1 ms to minimize.
[2022-06-12 22:18:00] [INFO ] Deduced a trap composed of 126 places in 436 ms of which 1 ms to minimize.
[2022-06-12 22:18:00] [INFO ] Deduced a trap composed of 41 places in 442 ms of which 1 ms to minimize.
[2022-06-12 22:18:01] [INFO ] Deduced a trap composed of 33 places in 440 ms of which 0 ms to minimize.
[2022-06-12 22:18:01] [INFO ] Deduced a trap composed of 96 places in 425 ms of which 0 ms to minimize.
[2022-06-12 22:18:02] [INFO ] Deduced a trap composed of 29 places in 415 ms of which 1 ms to minimize.
[2022-06-12 22:18:02] [INFO ] Deduced a trap composed of 42 places in 411 ms of which 1 ms to minimize.
[2022-06-12 22:18:03] [INFO ] Deduced a trap composed of 42 places in 396 ms of which 1 ms to minimize.
[2022-06-12 22:18:03] [INFO ] Deduced a trap composed of 42 places in 399 ms of which 1 ms to minimize.
[2022-06-12 22:18:04] [INFO ] Deduced a trap composed of 39 places in 403 ms of which 1 ms to minimize.
[2022-06-12 22:18:04] [INFO ] Deduced a trap composed of 163 places in 373 ms of which 0 ms to minimize.
[2022-06-12 22:18:05] [INFO ] Deduced a trap composed of 164 places in 397 ms of which 1 ms to minimize.
[2022-06-12 22:18:05] [INFO ] Deduced a trap composed of 164 places in 400 ms of which 1 ms to minimize.
[2022-06-12 22:18:05] [INFO ] Deduced a trap composed of 214 places in 396 ms of which 1 ms to minimize.
[2022-06-12 22:18:06] [INFO ] Deduced a trap composed of 163 places in 370 ms of which 1 ms to minimize.
[2022-06-12 22:18:06] [INFO ] Deduced a trap composed of 162 places in 393 ms of which 0 ms to minimize.
[2022-06-12 22:18:07] [INFO ] Deduced a trap composed of 52 places in 379 ms of which 1 ms to minimize.
[2022-06-12 22:18:07] [INFO ] Deduced a trap composed of 71 places in 326 ms of which 1 ms to minimize.
[2022-06-12 22:18:08] [INFO ] Deduced a trap composed of 124 places in 329 ms of which 1 ms to minimize.
[2022-06-12 22:18:08] [INFO ] Deduced a trap composed of 71 places in 328 ms of which 0 ms to minimize.
[2022-06-12 22:18:09] [INFO ] Deduced a trap composed of 71 places in 339 ms of which 1 ms to minimize.
[2022-06-12 22:18:09] [INFO ] Deduced a trap composed of 71 places in 322 ms of which 0 ms to minimize.
[2022-06-12 22:18:09] [INFO ] Deduced a trap composed of 71 places in 329 ms of which 1 ms to minimize.
[2022-06-12 22:18:10] [INFO ] Deduced a trap composed of 154 places in 334 ms of which 0 ms to minimize.
[2022-06-12 22:18:10] [INFO ] Deduced a trap composed of 52 places in 404 ms of which 1 ms to minimize.
[2022-06-12 22:18:11] [INFO ] Deduced a trap composed of 51 places in 389 ms of which 1 ms to minimize.
[2022-06-12 22:18:11] [INFO ] Deduced a trap composed of 42 places in 403 ms of which 1 ms to minimize.
[2022-06-12 22:18:12] [INFO ] Deduced a trap composed of 130 places in 312 ms of which 1 ms to minimize.
[2022-06-12 22:18:12] [INFO ] Deduced a trap composed of 85 places in 377 ms of which 1 ms to minimize.
[2022-06-12 22:18:13] [INFO ] Deduced a trap composed of 80 places in 380 ms of which 1 ms to minimize.
[2022-06-12 22:18:13] [INFO ] Deduced a trap composed of 115 places in 321 ms of which 1 ms to minimize.
[2022-06-12 22:18:14] [INFO ] Deduced a trap composed of 113 places in 319 ms of which 1 ms to minimize.
[2022-06-12 22:18:14] [INFO ] Deduced a trap composed of 113 places in 318 ms of which 0 ms to minimize.
[2022-06-12 22:18:14] [INFO ] Deduced a trap composed of 115 places in 316 ms of which 0 ms to minimize.
[2022-06-12 22:18:15] [INFO ] Deduced a trap composed of 67 places in 313 ms of which 0 ms to minimize.
[2022-06-12 22:18:15] [INFO ] Deduced a trap composed of 124 places in 285 ms of which 1 ms to minimize.
[2022-06-12 22:18:16] [INFO ] Deduced a trap composed of 211 places in 297 ms of which 0 ms to minimize.
[2022-06-12 22:18:17] [INFO ] Deduced a trap composed of 47 places in 406 ms of which 1 ms to minimize.
[2022-06-12 22:18:17] [INFO ] Deduced a trap composed of 241 places in 412 ms of which 1 ms to minimize.
[2022-06-12 22:18:18] [INFO ] Deduced a trap composed of 245 places in 406 ms of which 1 ms to minimize.
[2022-06-12 22:18:18] [INFO ] Deduced a trap composed of 241 places in 379 ms of which 1 ms to minimize.
[2022-06-12 22:18:19] [INFO ] Deduced a trap composed of 40 places in 390 ms of which 1 ms to minimize.
[2022-06-12 22:18:19] [INFO ] Deduced a trap composed of 130 places in 251 ms of which 1 ms to minimize.
[2022-06-12 22:18:20] [INFO ] Deduced a trap composed of 133 places in 271 ms of which 1 ms to minimize.
[2022-06-12 22:18:20] [INFO ] Deduced a trap composed of 103 places in 260 ms of which 1 ms to minimize.
[2022-06-12 22:18:20] [INFO ] Deduced a trap composed of 43 places in 268 ms of which 1 ms to minimize.
[2022-06-12 22:18:21] [INFO ] Deduced a trap composed of 103 places in 256 ms of which 0 ms to minimize.
[2022-06-12 22:18:21] [INFO ] Deduced a trap composed of 158 places in 263 ms of which 1 ms to minimize.
[2022-06-12 22:18:21] [INFO ] Deduced a trap composed of 158 places in 252 ms of which 1 ms to minimize.
[2022-06-12 22:18:22] [INFO ] Deduced a trap composed of 57 places in 265 ms of which 1 ms to minimize.
[2022-06-12 22:18:22] [INFO ] Deduced a trap composed of 163 places in 246 ms of which 1 ms to minimize.
[2022-06-12 22:18:22] [INFO ] Deduced a trap composed of 206 places in 250 ms of which 1 ms to minimize.
[2022-06-12 22:18:23] [INFO ] Deduced a trap composed of 206 places in 254 ms of which 1 ms to minimize.
[2022-06-12 22:18:23] [INFO ] Deduced a trap composed of 57 places in 261 ms of which 0 ms to minimize.
[2022-06-12 22:18:24] [INFO ] Deduced a trap composed of 15 places in 450 ms of which 1 ms to minimize.
[2022-06-12 22:18:24] [INFO ] Deduced a trap composed of 100 places in 407 ms of which 1 ms to minimize.
[2022-06-12 22:18:25] [INFO ] Deduced a trap composed of 131 places in 356 ms of which 1 ms to minimize.
[2022-06-12 22:18:25] [INFO ] Deduced a trap composed of 114 places in 322 ms of which 0 ms to minimize.
[2022-06-12 22:18:26] [INFO ] Deduced a trap composed of 154 places in 376 ms of which 1 ms to minimize.
[2022-06-12 22:18:26] [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 0
[2022-06-12 22:18:26] [INFO ] [Real]Absence check using 20 positive place invariants in 47 ms returned sat
[2022-06-12 22:18:26] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2022-06-12 22:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:33] [INFO ] [Real]Absence check using state equation in 6779 ms returned sat
[2022-06-12 22:18:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:18:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 71 ms returned sat
[2022-06-12 22:18:33] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 29 ms returned sat
[2022-06-12 22:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:41] [INFO ] [Nat]Absence check using state equation in 7606 ms returned sat
[2022-06-12 22:18:41] [INFO ] [Nat]Added 366 Read/Feed constraints in 137 ms returned sat
[2022-06-12 22:18:42] [INFO ] Deduced a trap composed of 49 places in 511 ms of which 1 ms to minimize.
[2022-06-12 22:18:42] [INFO ] Deduced a trap composed of 49 places in 514 ms of which 1 ms to minimize.
[2022-06-12 22:18:43] [INFO ] Deduced a trap composed of 73 places in 452 ms of which 0 ms to minimize.
[2022-06-12 22:18:43] [INFO ] Deduced a trap composed of 213 places in 444 ms of which 1 ms to minimize.
[2022-06-12 22:18:44] [INFO ] Deduced a trap composed of 225 places in 443 ms of which 1 ms to minimize.
[2022-06-12 22:18:44] [INFO ] Deduced a trap composed of 78 places in 444 ms of which 1 ms to minimize.
[2022-06-12 22:18:45] [INFO ] Deduced a trap composed of 84 places in 401 ms of which 1 ms to minimize.
[2022-06-12 22:18:45] [INFO ] Deduced a trap composed of 85 places in 353 ms of which 1 ms to minimize.
[2022-06-12 22:18:46] [INFO ] Deduced a trap composed of 85 places in 417 ms of which 1 ms to minimize.
[2022-06-12 22:18:46] [INFO ] Deduced a trap composed of 85 places in 346 ms of which 0 ms to minimize.
[2022-06-12 22:18:47] [INFO ] Deduced a trap composed of 87 places in 356 ms of which 1 ms to minimize.
[2022-06-12 22:18:47] [INFO ] Deduced a trap composed of 87 places in 350 ms of which 1 ms to minimize.
[2022-06-12 22:18:48] [INFO ] Deduced a trap composed of 75 places in 350 ms of which 1 ms to minimize.
[2022-06-12 22:18:48] [INFO ] Deduced a trap composed of 185 places in 340 ms of which 1 ms to minimize.
[2022-06-12 22:18:49] [INFO ] Deduced a trap composed of 113 places in 332 ms of which 0 ms to minimize.
[2022-06-12 22:18:49] [INFO ] Deduced a trap composed of 131 places in 458 ms of which 1 ms to minimize.
[2022-06-12 22:18:50] [INFO ] Deduced a trap composed of 45 places in 441 ms of which 1 ms to minimize.
[2022-06-12 22:18:50] [INFO ] Deduced a trap composed of 162 places in 388 ms of which 1 ms to minimize.
[2022-06-12 22:18:51] [INFO ] Deduced a trap composed of 142 places in 389 ms of which 1 ms to minimize.
[2022-06-12 22:18:51] [INFO ] Deduced a trap composed of 108 places in 384 ms of which 1 ms to minimize.
[2022-06-12 22:18:52] [INFO ] Deduced a trap composed of 74 places in 394 ms of which 1 ms to minimize.
[2022-06-12 22:18:52] [INFO ] Deduced a trap composed of 37 places in 377 ms of which 0 ms to minimize.
[2022-06-12 22:18:53] [INFO ] Deduced a trap composed of 59 places in 404 ms of which 1 ms to minimize.
[2022-06-12 22:18:53] [INFO ] Deduced a trap composed of 104 places in 392 ms of which 1 ms to minimize.
[2022-06-12 22:18:54] [INFO ] Deduced a trap composed of 71 places in 343 ms of which 1 ms to minimize.
[2022-06-12 22:18:54] [INFO ] Deduced a trap composed of 123 places in 229 ms of which 1 ms to minimize.
[2022-06-12 22:18:55] [INFO ] Deduced a trap composed of 125 places in 235 ms of which 0 ms to minimize.
[2022-06-12 22:18:55] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 13771 ms
[2022-06-12 22:18:55] [INFO ] Computed and/alt/rep : 1694/3507/1694 causal constraints (skipped 84 transitions) in 90 ms.
[2022-06-12 22:19:15] [INFO ] Added : 835 causal constraints over 167 iterations in 20111 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-06-12 22:19:15] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2022-06-12 22:19:15] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-06-12 22:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:16] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2022-06-12 22:19:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:19:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2022-06-12 22:19:16] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-06-12 22:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:17] [INFO ] [Nat]Absence check using state equation in 812 ms returned sat
[2022-06-12 22:19:17] [INFO ] [Nat]Added 366 Read/Feed constraints in 116 ms returned sat
[2022-06-12 22:19:18] [INFO ] Deduced a trap composed of 78 places in 450 ms of which 1 ms to minimize.
[2022-06-12 22:19:18] [INFO ] Deduced a trap composed of 80 places in 431 ms of which 1 ms to minimize.
[2022-06-12 22:19:19] [INFO ] Deduced a trap composed of 118 places in 441 ms of which 1 ms to minimize.
[2022-06-12 22:19:19] [INFO ] Deduced a trap composed of 118 places in 436 ms of which 1 ms to minimize.
[2022-06-12 22:19:20] [INFO ] Deduced a trap composed of 120 places in 438 ms of which 1 ms to minimize.
[2022-06-12 22:19:20] [INFO ] Deduced a trap composed of 336 places in 436 ms of which 0 ms to minimize.
[2022-06-12 22:19:21] [INFO ] Deduced a trap composed of 118 places in 434 ms of which 1 ms to minimize.
[2022-06-12 22:19:21] [INFO ] Deduced a trap composed of 289 places in 441 ms of which 0 ms to minimize.
[2022-06-12 22:19:22] [INFO ] Deduced a trap composed of 313 places in 435 ms of which 0 ms to minimize.
[2022-06-12 22:19:22] [INFO ] Deduced a trap composed of 12 places in 443 ms of which 1 ms to minimize.
[2022-06-12 22:19:23] [INFO ] Deduced a trap composed of 24 places in 428 ms of which 1 ms to minimize.
[2022-06-12 22:19:23] [INFO ] Deduced a trap composed of 52 places in 420 ms of which 1 ms to minimize.
[2022-06-12 22:19:24] [INFO ] Deduced a trap composed of 158 places in 417 ms of which 1 ms to minimize.
[2022-06-12 22:19:24] [INFO ] Deduced a trap composed of 55 places in 392 ms of which 1 ms to minimize.
[2022-06-12 22:19:25] [INFO ] Deduced a trap composed of 57 places in 386 ms of which 1 ms to minimize.
[2022-06-12 22:19:25] [INFO ] Deduced a trap composed of 88 places in 385 ms of which 1 ms to minimize.
[2022-06-12 22:19:26] [INFO ] Deduced a trap composed of 88 places in 392 ms of which 1 ms to minimize.
[2022-06-12 22:19:26] [INFO ] Deduced a trap composed of 59 places in 393 ms of which 1 ms to minimize.
[2022-06-12 22:19:26] [INFO ] Deduced a trap composed of 138 places in 393 ms of which 1 ms to minimize.
[2022-06-12 22:19:27] [INFO ] Deduced a trap composed of 87 places in 387 ms of which 1 ms to minimize.
[2022-06-12 22:19:27] [INFO ] Deduced a trap composed of 79 places in 387 ms of which 1 ms to minimize.
[2022-06-12 22:19:28] [INFO ] Deduced a trap composed of 237 places in 341 ms of which 1 ms to minimize.
[2022-06-12 22:19:28] [INFO ] Deduced a trap composed of 90 places in 348 ms of which 1 ms to minimize.
[2022-06-12 22:19:29] [INFO ] Deduced a trap composed of 84 places in 374 ms of which 8 ms to minimize.
[2022-06-12 22:19:29] [INFO ] Deduced a trap composed of 106 places in 276 ms of which 1 ms to minimize.
[2022-06-12 22:19:29] [INFO ] Deduced a trap composed of 148 places in 337 ms of which 1 ms to minimize.
[2022-06-12 22:19:30] [INFO ] Deduced a trap composed of 148 places in 337 ms of which 1 ms to minimize.
[2022-06-12 22:19:30] [INFO ] Deduced a trap composed of 150 places in 331 ms of which 1 ms to minimize.
[2022-06-12 22:19:31] [INFO ] Deduced a trap composed of 116 places in 339 ms of which 1 ms to minimize.
[2022-06-12 22:19:31] [INFO ] Deduced a trap composed of 148 places in 330 ms of which 1 ms to minimize.
[2022-06-12 22:19:31] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 14178 ms
[2022-06-12 22:19:31] [INFO ] Computed and/alt/rep : 1694/3507/1694 causal constraints (skipped 84 transitions) in 80 ms.
[2022-06-12 22:19:51] [INFO ] Added : 970 causal constraints over 194 iterations in 20050 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-06-12 22:19:52] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2022-06-12 22:19:52] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-06-12 22:19:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:52] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2022-06-12 22:19:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:19:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2022-06-12 22:19:53] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-12 22:19:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:53] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2022-06-12 22:19:54] [INFO ] [Nat]Added 366 Read/Feed constraints in 112 ms returned sat
[2022-06-12 22:19:54] [INFO ] Deduced a trap composed of 51 places in 384 ms of which 1 ms to minimize.
[2022-06-12 22:19:54] [INFO ] Deduced a trap composed of 12 places in 377 ms of which 0 ms to minimize.
[2022-06-12 22:19:55] [INFO ] Deduced a trap composed of 277 places in 381 ms of which 1 ms to minimize.
[2022-06-12 22:19:55] [INFO ] Deduced a trap composed of 313 places in 372 ms of which 1 ms to minimize.
[2022-06-12 22:19:56] [INFO ] Deduced a trap composed of 265 places in 375 ms of which 0 ms to minimize.
[2022-06-12 22:19:56] [INFO ] Deduced a trap composed of 12 places in 398 ms of which 0 ms to minimize.
[2022-06-12 22:19:57] [INFO ] Deduced a trap composed of 12 places in 375 ms of which 1 ms to minimize.
[2022-06-12 22:19:57] [INFO ] Deduced a trap composed of 67 places in 426 ms of which 1 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Deduced a trap composed of 107 places in 404 ms of which 1 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Deduced a trap composed of 336 places in 464 ms of which 1 ms to minimize.
[2022-06-12 22:19:59] [INFO ] Deduced a trap composed of 333 places in 479 ms of which 1 ms to minimize.
[2022-06-12 22:19:59] [INFO ] Deduced a trap composed of 16 places in 446 ms of which 1 ms to minimize.
[2022-06-12 22:20:00] [INFO ] Deduced a trap composed of 12 places in 451 ms of which 0 ms to minimize.
[2022-06-12 22:20:00] [INFO ] Deduced a trap composed of 34 places in 449 ms of which 1 ms to minimize.
[2022-06-12 22:20:01] [INFO ] Deduced a trap composed of 103 places in 395 ms of which 1 ms to minimize.
[2022-06-12 22:20:01] [INFO ] Deduced a trap composed of 73 places in 466 ms of which 1 ms to minimize.
[2022-06-12 22:20:02] [INFO ] Deduced a trap composed of 131 places in 458 ms of which 1 ms to minimize.
[2022-06-12 22:20:02] [INFO ] Deduced a trap composed of 131 places in 463 ms of which 1 ms to minimize.
[2022-06-12 22:20:03] [INFO ] Deduced a trap composed of 100 places in 460 ms of which 1 ms to minimize.
[2022-06-12 22:20:04] [INFO ] Deduced a trap composed of 116 places in 464 ms of which 1 ms to minimize.
[2022-06-12 22:20:04] [INFO ] Deduced a trap composed of 116 places in 453 ms of which 1 ms to minimize.
[2022-06-12 22:20:05] [INFO ] Deduced a trap composed of 49 places in 482 ms of which 1 ms to minimize.
[2022-06-12 22:20:05] [INFO ] Deduced a trap composed of 16 places in 487 ms of which 0 ms to minimize.
[2022-06-12 22:20:06] [INFO ] Deduced a trap composed of 18 places in 454 ms of which 1 ms to minimize.
[2022-06-12 22:20:06] [INFO ] Deduced a trap composed of 16 places in 470 ms of which 0 ms to minimize.
[2022-06-12 22:20:07] [INFO ] Deduced a trap composed of 40 places in 481 ms of which 1 ms to minimize.
[2022-06-12 22:20:07] [INFO ] Deduced a trap composed of 78 places in 492 ms of which 1 ms to minimize.
[2022-06-12 22:20:08] [INFO ] Deduced a trap composed of 45 places in 438 ms of which 0 ms to minimize.
[2022-06-12 22:20:08] [INFO ] Deduced a trap composed of 45 places in 433 ms of which 1 ms to minimize.
[2022-06-12 22:20:09] [INFO ] Deduced a trap composed of 117 places in 466 ms of which 1 ms to minimize.
[2022-06-12 22:20:10] [INFO ] Deduced a trap composed of 74 places in 478 ms of which 1 ms to minimize.
[2022-06-12 22:20:10] [INFO ] Deduced a trap composed of 64 places in 471 ms of which 1 ms to minimize.
[2022-06-12 22:20:11] [INFO ] Deduced a trap composed of 94 places in 501 ms of which 1 ms to minimize.
[2022-06-12 22:20:11] [INFO ] Deduced a trap composed of 144 places in 479 ms of which 1 ms to minimize.
[2022-06-12 22:20:12] [INFO ] Deduced a trap composed of 94 places in 493 ms of which 1 ms to minimize.
[2022-06-12 22:20:12] [INFO ] Deduced a trap composed of 76 places in 484 ms of which 1 ms to minimize.
[2022-06-12 22:20:13] [INFO ] Deduced a trap composed of 62 places in 455 ms of which 1 ms to minimize.
[2022-06-12 22:20:13] [INFO ] Deduced a trap composed of 187 places in 453 ms of which 0 ms to minimize.
[2022-06-12 22:20:14] [INFO ] Deduced a trap composed of 105 places in 393 ms of which 1 ms to minimize.
[2022-06-12 22:20:15] [INFO ] Deduced a trap composed of 20 places in 396 ms of which 1 ms to minimize.
[2022-06-12 22:20:15] [INFO ] Deduced a trap composed of 174 places in 388 ms of which 0 ms to minimize.
[2022-06-12 22:20:15] [INFO ] Deduced a trap composed of 104 places in 391 ms of which 1 ms to minimize.
[2022-06-12 22:20:16] [INFO ] Deduced a trap composed of 19 places in 384 ms of which 1 ms to minimize.
[2022-06-12 22:20:17] [INFO ] Deduced a trap composed of 116 places in 437 ms of which 1 ms to minimize.
[2022-06-12 22:20:17] [INFO ] Deduced a trap composed of 134 places in 403 ms of which 1 ms to minimize.
[2022-06-12 22:20:18] [INFO ] Deduced a trap composed of 105 places in 446 ms of which 1 ms to minimize.
[2022-06-12 22:20:18] [INFO ] Deduced a trap composed of 70 places in 419 ms of which 1 ms to minimize.
[2022-06-12 22:20:19] [INFO ] Deduced a trap composed of 70 places in 409 ms of which 1 ms to minimize.
[2022-06-12 22:20:19] [INFO ] Deduced a trap composed of 24 places in 369 ms of which 1 ms to minimize.
[2022-06-12 22:20:20] [INFO ] Deduced a trap composed of 22 places in 369 ms of which 1 ms to minimize.
[2022-06-12 22:20:20] [INFO ] Deduced a trap composed of 24 places in 376 ms of which 1 ms to minimize.
[2022-06-12 22:20:21] [INFO ] Deduced a trap composed of 59 places in 339 ms of which 0 ms to minimize.
[2022-06-12 22:20:21] [INFO ] Deduced a trap composed of 94 places in 358 ms of which 1 ms to minimize.
[2022-06-12 22:20:22] [INFO ] Deduced a trap composed of 130 places in 354 ms of which 1 ms to minimize.
[2022-06-12 22:20:22] [INFO ] Deduced a trap composed of 132 places in 351 ms of which 0 ms to minimize.
[2022-06-12 22:20:23] [INFO ] Deduced a trap composed of 175 places in 352 ms of which 1 ms to minimize.
[2022-06-12 22:20:23] [INFO ] Deduced a trap composed of 166 places in 414 ms of which 1 ms to minimize.
[2022-06-12 22:20:23] [INFO ] Deduced a trap composed of 107 places in 374 ms of which 1 ms to minimize.
[2022-06-12 22:20:24] [INFO ] Deduced a trap composed of 80 places in 401 ms of which 1 ms to minimize.
[2022-06-12 22:20:25] [INFO ] Deduced a trap composed of 50 places in 416 ms of which 2 ms to minimize.
[2022-06-12 22:20:25] [INFO ] Deduced a trap composed of 111 places in 446 ms of which 1 ms to minimize.
[2022-06-12 22:20:26] [INFO ] Deduced a trap composed of 20 places in 424 ms of which 1 ms to minimize.
[2022-06-12 22:20:26] [INFO ] Deduced a trap composed of 44 places in 394 ms of which 1 ms to minimize.
[2022-06-12 22:20:27] [INFO ] Deduced a trap composed of 105 places in 391 ms of which 1 ms to minimize.
[2022-06-12 22:20:27] [INFO ] Deduced a trap composed of 47 places in 355 ms of which 1 ms to minimize.
[2022-06-12 22:20:27] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 33775 ms
[2022-06-12 22:20:27] [INFO ] Computed and/alt/rep : 1694/3507/1694 causal constraints (skipped 84 transitions) in 78 ms.
[2022-06-12 22:20:37] [INFO ] Added : 515 causal constraints over 103 iterations in 10128 ms. Result :unknown
[2022-06-12 22:20:38] [INFO ] [Real]Absence check using 20 positive place invariants in 29 ms returned sat
[2022-06-12 22:20:38] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2022-06-12 22:20:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:39] [INFO ] [Real]Absence check using state equation in 1050 ms returned sat
[2022-06-12 22:20:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2022-06-12 22:20:39] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-06-12 22:20:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:40] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2022-06-12 22:20:40] [INFO ] [Nat]Added 366 Read/Feed constraints in 103 ms returned sat
[2022-06-12 22:20:40] [INFO ] Deduced a trap composed of 49 places in 427 ms of which 1 ms to minimize.
[2022-06-12 22:20:41] [INFO ] Deduced a trap composed of 36 places in 445 ms of which 13 ms to minimize.
[2022-06-12 22:20:41] [INFO ] Deduced a trap composed of 18 places in 456 ms of which 11 ms to minimize.
[2022-06-12 22:20:42] [INFO ] Deduced a trap composed of 34 places in 422 ms of which 1 ms to minimize.
[2022-06-12 22:20:42] [INFO ] Deduced a trap composed of 34 places in 436 ms of which 1 ms to minimize.
[2022-06-12 22:20:43] [INFO ] Deduced a trap composed of 58 places in 424 ms of which 1 ms to minimize.
[2022-06-12 22:20:43] [INFO ] Deduced a trap composed of 20 places in 443 ms of which 1 ms to minimize.
[2022-06-12 22:20:44] [INFO ] Deduced a trap composed of 20 places in 423 ms of which 1 ms to minimize.
[2022-06-12 22:20:44] [INFO ] Deduced a trap composed of 19 places in 424 ms of which 1 ms to minimize.
[2022-06-12 22:20:45] [INFO ] Deduced a trap composed of 110 places in 382 ms of which 1 ms to minimize.
[2022-06-12 22:20:45] [INFO ] Deduced a trap composed of 244 places in 375 ms of which 1 ms to minimize.
[2022-06-12 22:20:46] [INFO ] Deduced a trap composed of 84 places in 394 ms of which 1 ms to minimize.
[2022-06-12 22:20:46] [INFO ] Deduced a trap composed of 149 places in 387 ms of which 1 ms to minimize.
[2022-06-12 22:20:47] [INFO ] Deduced a trap composed of 110 places in 374 ms of which 1 ms to minimize.
[2022-06-12 22:20:47] [INFO ] Deduced a trap composed of 245 places in 384 ms of which 0 ms to minimize.
[2022-06-12 22:20:48] [INFO ] Deduced a trap composed of 108 places in 386 ms of which 1 ms to minimize.
[2022-06-12 22:20:48] [INFO ] Deduced a trap composed of 84 places in 394 ms of which 0 ms to minimize.
[2022-06-12 22:20:49] [INFO ] Deduced a trap composed of 244 places in 389 ms of which 1 ms to minimize.
[2022-06-12 22:20:49] [INFO ] Deduced a trap composed of 147 places in 381 ms of which 1 ms to minimize.
[2022-06-12 22:20:49] [INFO ] Deduced a trap composed of 50 places in 411 ms of which 6 ms to minimize.
[2022-06-12 22:20:50] [INFO ] Deduced a trap composed of 63 places in 378 ms of which 1 ms to minimize.
[2022-06-12 22:20:50] [INFO ] Deduced a trap composed of 244 places in 381 ms of which 1 ms to minimize.
[2022-06-12 22:20:51] [INFO ] Deduced a trap composed of 134 places in 380 ms of which 0 ms to minimize.
[2022-06-12 22:20:51] [INFO ] Deduced a trap composed of 69 places in 400 ms of which 1 ms to minimize.
[2022-06-12 22:20:52] [INFO ] Deduced a trap composed of 100 places in 316 ms of which 1 ms to minimize.
[2022-06-12 22:20:52] [INFO ] Deduced a trap composed of 116 places in 320 ms of which 1 ms to minimize.
[2022-06-12 22:20:52] [INFO ] Deduced a trap composed of 116 places in 325 ms of which 0 ms to minimize.
[2022-06-12 22:20:53] [INFO ] Deduced a trap composed of 117 places in 312 ms of which 1 ms to minimize.
[2022-06-12 22:20:53] [INFO ] Deduced a trap composed of 146 places in 336 ms of which 0 ms to minimize.
[2022-06-12 22:20:54] [INFO ] Deduced a trap composed of 76 places in 338 ms of which 1 ms to minimize.
[2022-06-12 22:20:54] [INFO ] Deduced a trap composed of 74 places in 360 ms of which 1 ms to minimize.
[2022-06-12 22:20:55] [INFO ] Deduced a trap composed of 115 places in 367 ms of which 1 ms to minimize.
[2022-06-12 22:20:55] [INFO ] Deduced a trap composed of 118 places in 335 ms of which 1 ms to minimize.
[2022-06-12 22:20:55] [INFO ] Deduced a trap composed of 118 places in 329 ms of which 1 ms to minimize.
[2022-06-12 22:20:56] [INFO ] Deduced a trap composed of 134 places in 305 ms of which 1 ms to minimize.
[2022-06-12 22:20:57] [INFO ] Deduced a trap composed of 42 places in 314 ms of which 0 ms to minimize.
[2022-06-12 22:20:58] [INFO ] Deduced a trap composed of 24 places in 394 ms of which 1 ms to minimize.
[2022-06-12 22:20:58] [INFO ] Deduced a trap composed of 80 places in 385 ms of which 1 ms to minimize.
[2022-06-12 22:20:59] [INFO ] Deduced a trap composed of 153 places in 397 ms of which 1 ms to minimize.
[2022-06-12 22:20:59] [INFO ] Deduced a trap composed of 153 places in 394 ms of which 1 ms to minimize.
[2022-06-12 22:21:00] [INFO ] Deduced a trap composed of 88 places in 411 ms of which 1 ms to minimize.
[2022-06-12 22:21:00] [INFO ] Deduced a trap composed of 16 places in 394 ms of which 1 ms to minimize.
[2022-06-12 22:21:01] [INFO ] Deduced a trap composed of 134 places in 309 ms of which 1 ms to minimize.
[2022-06-12 22:21:01] [INFO ] Deduced a trap composed of 148 places in 307 ms of which 0 ms to minimize.
[2022-06-12 22:21:01] [INFO ] Deduced a trap composed of 186 places in 301 ms of which 1 ms to minimize.
[2022-06-12 22:21:02] [INFO ] Deduced a trap composed of 74 places in 311 ms of which 0 ms to minimize.
[2022-06-12 22:21:02] [INFO ] Deduced a trap composed of 147 places in 213 ms of which 1 ms to minimize.
[2022-06-12 22:21:02] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 22476 ms
[2022-06-12 22:21:02] [INFO ] Computed and/alt/rep : 1694/3507/1694 causal constraints (skipped 84 transitions) in 88 ms.
[2022-06-12 22:21:22] [INFO ] Added : 995 causal constraints over 199 iterations in 20026 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 764600 steps, including 1000 resets, run finished after 2156 ms. (steps per millisecond=354 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA Peterson-PT-6-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 805900 steps, including 1000 resets, run finished after 2184 ms. (steps per millisecond=369 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 831500 steps, including 1000 resets, run finished after 2457 ms. (steps per millisecond=338 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 739100 steps, including 1000 resets, run finished after 2048 ms. (steps per millisecond=360 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 146 out of 1295 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1295/1295 places, 1995/1995 transitions.
Drop transitions removed 481 transitions
Trivial Post-agglo rules discarded 481 transitions
Performed 481 trivial Post agglomeration. Transition count delta: 481
Iterating post reduction 0 with 481 rules applied. Total rules applied 481 place count 1295 transition count 1514
Reduce places removed 481 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 500 rules applied. Total rules applied 981 place count 814 transition count 1495
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 1000 place count 795 transition count 1495
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 240 Pre rules applied. Total rules applied 1000 place count 795 transition count 1255
Deduced a syphon composed of 240 places in 1 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 1480 place count 555 transition count 1255
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1492 place count 549 transition count 1249
Applied a total of 1492 rules in 102 ms. Remains 549 /1295 variables (removed 746) and now considering 1249/1995 (removed 746) transitions.
Finished structural reductions, in 1 iterations. Remains : 549/1295 places, 1249/1995 transitions.
[2022-06-12 22:21:31] [INFO ] Flatten gal took : 39 ms
[2022-06-12 22:21:31] [INFO ] Flatten gal took : 38 ms
[2022-06-12 22:21:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9053634876506199771.gal : 4 ms
[2022-06-12 22:21:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14788573351516706015.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality9053634876506199771.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14788573351516706015.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/ReachabilityCardinality9053634876506199771.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14788573351516706015.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14788573351516706015.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :13 after 14
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :14 after 15
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :15 after 27
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :27 after 54
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :54 after 183
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :183 after 415
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :415 after 648
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :648 after 1131
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1131 after 4196
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :4196 after 12210
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :12210 after 25792
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :25792 after 120372
Detected timeout of ITS tools.
[2022-06-12 22:21:47] [INFO ] Flatten gal took : 33 ms
[2022-06-12 22:21:47] [INFO ] Applying decomposition
[2022-06-12 22:21:47] [INFO ] Flatten gal took : 33 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/graph7287466649239112504.txt, -o, /tmp/graph7287466649239112504.bin, -w, /tmp/graph7287466649239112504.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/graph7287466649239112504.bin, -l, -1, -v, -w, /tmp/graph7287466649239112504.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:21:47] [INFO ] Decomposing Gal with order
[2022-06-12 22:21:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:21:47] [INFO ] Removed a total of 1418 redundant transitions.
[2022-06-12 22:21:47] [INFO ] Flatten gal took : 62 ms
[2022-06-12 22:21:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 355 labels/synchronizations in 28 ms.
[2022-06-12 22:21:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11353758395494798103.gal : 6 ms
[2022-06-12 22:21:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14305924051401457420.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11353758395494798103.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14305924051401457420.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/ReachabilityCardinality11353758395494798103.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14305924051401457420.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14305924051401457420.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 15
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :15 after 482
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :482 after 482
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :482 after 3.69575e+06
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :3.69575e+06 after 4.15007e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin417531318347302418
[2022-06-12 22:22:02] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin417531318347302418
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/ltsmin417531318347302418]
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/ltsmin417531318347302418] 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/ltsmin417531318347302418] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2822 ms. (steps per millisecond=354 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1425 ms. (steps per millisecond=701 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1367 ms. (steps per millisecond=731 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1189 ms. (steps per millisecond=841 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2340 ms. (steps per millisecond=427 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 6800824 steps, run timeout after 30001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 6800824 steps, saw 863522 distinct states, run finished after 30001 ms. (steps per millisecond=226 ) properties seen :{}
Running SMT prover for 4 properties.
[2022-06-12 22:22:42] [INFO ] Flow matrix only has 1039 transitions (discarded 210 similar events)
// Phase 1: matrix 1039 rows 549 cols
[2022-06-12 22:22:42] [INFO ] Computed 27 place invariants in 8 ms
[2022-06-12 22:22:42] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-06-12 22:22:42] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-12 22:22:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:42] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2022-06-12 22:22:42] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 22:22:42] [INFO ] [Real]Added 366 Read/Feed constraints in 39 ms returned sat
[2022-06-12 22:22:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:22:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-06-12 22:22:43] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-06-12 22:22:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:43] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2022-06-12 22:22:43] [INFO ] [Nat]Added 366 Read/Feed constraints in 46 ms returned sat
[2022-06-12 22:22:43] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 0 ms to minimize.
[2022-06-12 22:22:43] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 0 ms to minimize.
[2022-06-12 22:22:43] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2022-06-12 22:22:44] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2022-06-12 22:22:44] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 1 ms to minimize.
[2022-06-12 22:22:44] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 0 ms to minimize.
[2022-06-12 22:22:44] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 1 ms to minimize.
[2022-06-12 22:22:44] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
[2022-06-12 22:22:45] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2022-06-12 22:22:45] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 0 ms to minimize.
[2022-06-12 22:22:45] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 0 ms to minimize.
[2022-06-12 22:22:45] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 1 ms to minimize.
[2022-06-12 22:22:45] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 4 ms to minimize.
[2022-06-12 22:22:46] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:22:46] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 0 ms to minimize.
[2022-06-12 22:22:46] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 0 ms to minimize.
[2022-06-12 22:22:46] [INFO ] Deduced a trap composed of 117 places in 146 ms of which 0 ms to minimize.
[2022-06-12 22:22:46] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 0 ms to minimize.
[2022-06-12 22:22:47] [INFO ] Deduced a trap composed of 103 places in 151 ms of which 1 ms to minimize.
[2022-06-12 22:22:47] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2022-06-12 22:22:47] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 1 ms to minimize.
[2022-06-12 22:22:47] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 0 ms to minimize.
[2022-06-12 22:22:47] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 1 ms to minimize.
[2022-06-12 22:22:48] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 0 ms to minimize.
[2022-06-12 22:22:48] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:22:48] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 1 ms to minimize.
[2022-06-12 22:22:48] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 0 ms to minimize.
[2022-06-12 22:22:48] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 0 ms to minimize.
[2022-06-12 22:22:48] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 0 ms to minimize.
[2022-06-12 22:22:49] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 0 ms to minimize.
[2022-06-12 22:22:49] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2022-06-12 22:22:49] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 0 ms to minimize.
[2022-06-12 22:22:49] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 0 ms to minimize.
[2022-06-12 22:22:49] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 0 ms to minimize.
[2022-06-12 22:22:49] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 0 ms to minimize.
[2022-06-12 22:22:50] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 1 ms to minimize.
[2022-06-12 22:22:50] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:22:50] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 1 ms to minimize.
[2022-06-12 22:22:50] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 0 ms to minimize.
[2022-06-12 22:22:50] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 1 ms to minimize.
[2022-06-12 22:22:50] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 0 ms to minimize.
[2022-06-12 22:22:50] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 1 ms to minimize.
[2022-06-12 22:22:51] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 1 ms to minimize.
[2022-06-12 22:22:51] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 0 ms to minimize.
[2022-06-12 22:22:51] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 0 ms to minimize.
[2022-06-12 22:22:51] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:22:51] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 1 ms to minimize.
[2022-06-12 22:22:52] [INFO ] Deduced a trap composed of 113 places in 113 ms of which 0 ms to minimize.
[2022-06-12 22:22:52] [INFO ] Deduced a trap composed of 114 places in 111 ms of which 1 ms to minimize.
[2022-06-12 22:22:52] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 0 ms to minimize.
[2022-06-12 22:22:52] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 1 ms to minimize.
[2022-06-12 22:22:52] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2022-06-12 22:22:52] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 0 ms to minimize.
[2022-06-12 22:22:53] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2022-06-12 22:22:53] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 1 ms to minimize.
[2022-06-12 22:22:53] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2022-06-12 22:22:53] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 0 ms to minimize.
[2022-06-12 22:22:53] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 0 ms to minimize.
[2022-06-12 22:22:54] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:22:54] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 0 ms to minimize.
[2022-06-12 22:22:54] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 0 ms to minimize.
[2022-06-12 22:22:54] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 0 ms to minimize.
[2022-06-12 22:22:54] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 0 ms to minimize.
[2022-06-12 22:22:54] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
[2022-06-12 22:22:55] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-06-12 22:22:55] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2022-06-12 22:22:55] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 0 ms to minimize.
[2022-06-12 22:22:55] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 0 ms to minimize.
[2022-06-12 22:22:55] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 0 ms to minimize.
[2022-06-12 22:22:55] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2022-06-12 22:22:55] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 0 ms to minimize.
[2022-06-12 22:22:55] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 0 ms to minimize.
[2022-06-12 22:22:56] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 1 ms to minimize.
[2022-06-12 22:22:56] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 0 ms to minimize.
[2022-06-12 22:22:56] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 0 ms to minimize.
[2022-06-12 22:22:56] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 0 ms to minimize.
[2022-06-12 22:22:56] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 13019 ms
[2022-06-12 22:22:56] [INFO ] Computed and/alt/rep : 948/2761/948 causal constraints (skipped 84 transitions) in 51 ms.
[2022-06-12 22:23:10] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 1 ms to minimize.
[2022-06-12 22:23:10] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 1 ms to minimize.
[2022-06-12 22:23:10] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 0 ms to minimize.
[2022-06-12 22:23:11] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2022-06-12 22:23:11] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 0 ms to minimize.
[2022-06-12 22:23:11] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 0 ms to minimize.
[2022-06-12 22:23:11] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 0 ms to minimize.
[2022-06-12 22:23:11] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 0 ms to minimize.
[2022-06-12 22:23:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1751 ms
[2022-06-12 22:23:11] [INFO ] Added : 918 causal constraints over 184 iterations in 15472 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-06-12 22:23:12] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-06-12 22:23:12] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-12 22:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:12] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2022-06-12 22:23:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:23:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-06-12 22:23:12] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-12 22:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:12] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2022-06-12 22:23:12] [INFO ] [Nat]Added 366 Read/Feed constraints in 43 ms returned sat
[2022-06-12 22:23:12] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 1 ms to minimize.
[2022-06-12 22:23:13] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 0 ms to minimize.
[2022-06-12 22:23:13] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 0 ms to minimize.
[2022-06-12 22:23:13] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 0 ms to minimize.
[2022-06-12 22:23:13] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 1 ms to minimize.
[2022-06-12 22:23:13] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 0 ms to minimize.
[2022-06-12 22:23:13] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 1 ms to minimize.
[2022-06-12 22:23:14] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 0 ms to minimize.
[2022-06-12 22:23:14] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 0 ms to minimize.
[2022-06-12 22:23:14] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:23:14] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 0 ms to minimize.
[2022-06-12 22:23:14] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:23:14] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2022-06-12 22:23:15] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 1 ms to minimize.
[2022-06-12 22:23:15] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 1 ms to minimize.
[2022-06-12 22:23:15] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 1 ms to minimize.
[2022-06-12 22:23:15] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:23:15] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 1 ms to minimize.
[2022-06-12 22:23:15] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2022-06-12 22:23:16] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 1 ms to minimize.
[2022-06-12 22:23:16] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 0 ms to minimize.
[2022-06-12 22:23:16] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2022-06-12 22:23:16] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 0 ms to minimize.
[2022-06-12 22:23:16] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2022-06-12 22:23:16] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 1 ms to minimize.
[2022-06-12 22:23:17] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 0 ms to minimize.
[2022-06-12 22:23:17] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2022-06-12 22:23:17] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:23:17] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2022-06-12 22:23:17] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 1 ms to minimize.
[2022-06-12 22:23:17] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 1 ms to minimize.
[2022-06-12 22:23:18] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 1 ms to minimize.
[2022-06-12 22:23:18] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5410 ms
[2022-06-12 22:23:18] [INFO ] Computed and/alt/rep : 948/2761/948 causal constraints (skipped 84 transitions) in 48 ms.
[2022-06-12 22:23:27] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 0 ms to minimize.
[2022-06-12 22:23:27] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 0 ms to minimize.
[2022-06-12 22:23:27] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 1 ms to minimize.
[2022-06-12 22:23:28] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 0 ms to minimize.
[2022-06-12 22:23:28] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 1 ms to minimize.
[2022-06-12 22:23:28] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 0 ms to minimize.
[2022-06-12 22:23:28] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 0 ms to minimize.
[2022-06-12 22:23:28] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:23:29] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2022-06-12 22:23:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2070 ms
[2022-06-12 22:23:29] [INFO ] Added : 665 causal constraints over 133 iterations in 11074 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-06-12 22:23:29] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-06-12 22:23:29] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-12 22:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:29] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2022-06-12 22:23:29] [INFO ] [Real]Added 366 Read/Feed constraints in 35 ms returned sat
[2022-06-12 22:23:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:23:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2022-06-12 22:23:29] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-06-12 22:23:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:30] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2022-06-12 22:23:30] [INFO ] [Nat]Added 366 Read/Feed constraints in 46 ms returned sat
[2022-06-12 22:23:30] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 0 ms to minimize.
[2022-06-12 22:23:30] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 0 ms to minimize.
[2022-06-12 22:23:30] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 0 ms to minimize.
[2022-06-12 22:23:30] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 1 ms to minimize.
[2022-06-12 22:23:31] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 0 ms to minimize.
[2022-06-12 22:23:31] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 0 ms to minimize.
[2022-06-12 22:23:31] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 0 ms to minimize.
[2022-06-12 22:23:31] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2022-06-12 22:23:31] [INFO ] Deduced a trap composed of 143 places in 150 ms of which 1 ms to minimize.
[2022-06-12 22:23:32] [INFO ] Deduced a trap composed of 127 places in 152 ms of which 0 ms to minimize.
[2022-06-12 22:23:32] [INFO ] Deduced a trap composed of 113 places in 154 ms of which 0 ms to minimize.
[2022-06-12 22:23:32] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2022-06-12 22:23:32] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
[2022-06-12 22:23:32] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 0 ms to minimize.
[2022-06-12 22:23:33] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 0 ms to minimize.
[2022-06-12 22:23:33] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2022-06-12 22:23:33] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 1 ms to minimize.
[2022-06-12 22:23:33] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 0 ms to minimize.
[2022-06-12 22:23:33] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 0 ms to minimize.
[2022-06-12 22:23:34] [INFO ] Deduced a trap composed of 95 places in 155 ms of which 1 ms to minimize.
[2022-06-12 22:23:34] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 0 ms to minimize.
[2022-06-12 22:23:34] [INFO ] Deduced a trap composed of 105 places in 149 ms of which 0 ms to minimize.
[2022-06-12 22:23:34] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2022-06-12 22:23:34] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:23:34] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 0 ms to minimize.
[2022-06-12 22:23:35] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2022-06-12 22:23:35] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 0 ms to minimize.
[2022-06-12 22:23:35] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2022-06-12 22:23:35] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 0 ms to minimize.
[2022-06-12 22:23:35] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 1 ms to minimize.
[2022-06-12 22:23:36] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 0 ms to minimize.
[2022-06-12 22:23:36] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 0 ms to minimize.
[2022-06-12 22:23:36] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 0 ms to minimize.
[2022-06-12 22:23:36] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 0 ms to minimize.
[2022-06-12 22:23:36] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 1 ms to minimize.
[2022-06-12 22:23:37] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 0 ms to minimize.
[2022-06-12 22:23:37] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:23:37] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 1 ms to minimize.
[2022-06-12 22:23:37] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 0 ms to minimize.
[2022-06-12 22:23:37] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 0 ms to minimize.
[2022-06-12 22:23:37] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 1 ms to minimize.
[2022-06-12 22:23:38] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 1 ms to minimize.
[2022-06-12 22:23:38] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 1 ms to minimize.
[2022-06-12 22:23:38] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 1 ms to minimize.
[2022-06-12 22:23:38] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2022-06-12 22:23:38] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 1 ms to minimize.
[2022-06-12 22:23:38] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 0 ms to minimize.
[2022-06-12 22:23:39] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 0 ms to minimize.
[2022-06-12 22:23:39] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 0 ms to minimize.
[2022-06-12 22:23:39] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 0 ms to minimize.
[2022-06-12 22:23:39] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2022-06-12 22:23:39] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:23:39] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 0 ms to minimize.
[2022-06-12 22:23:40] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2022-06-12 22:23:40] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 0 ms to minimize.
[2022-06-12 22:23:40] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2022-06-12 22:23:40] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 0 ms to minimize.
[2022-06-12 22:23:40] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 0 ms to minimize.
[2022-06-12 22:23:40] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 0 ms to minimize.
[2022-06-12 22:23:40] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2022-06-12 22:23:40] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:23:41] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2022-06-12 22:23:41] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-06-12 22:23:41] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 1 ms to minimize.
[2022-06-12 22:23:41] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 1 ms to minimize.
[2022-06-12 22:23:41] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2022-06-12 22:23:41] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 1 ms to minimize.
[2022-06-12 22:23:42] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
[2022-06-12 22:23:42] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 0 ms to minimize.
[2022-06-12 22:23:43] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 0 ms to minimize.
[2022-06-12 22:23:43] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 0 ms to minimize.
[2022-06-12 22:23:43] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 0 ms to minimize.
[2022-06-12 22:23:43] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 1 ms to minimize.
[2022-06-12 22:23:43] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 0 ms to minimize.
[2022-06-12 22:23:44] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2022-06-12 22:23:44] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 0 ms to minimize.
[2022-06-12 22:23:44] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 14223 ms
[2022-06-12 22:23:44] [INFO ] Computed and/alt/rep : 948/2761/948 causal constraints (skipped 84 transitions) in 63 ms.
[2022-06-12 22:23:53] [INFO ] Added : 647 causal constraints over 130 iterations in 9523 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-06-12 22:23:54] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2022-06-12 22:23:54] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-06-12 22:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:54] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2022-06-12 22:23:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:23:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2022-06-12 22:23:54] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-06-12 22:23:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:54] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-06-12 22:23:54] [INFO ] [Nat]Added 366 Read/Feed constraints in 44 ms returned sat
[2022-06-12 22:23:55] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2022-06-12 22:23:55] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 0 ms to minimize.
[2022-06-12 22:23:55] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 1 ms to minimize.
[2022-06-12 22:23:55] [INFO ] Deduced a trap composed of 81 places in 169 ms of which 0 ms to minimize.
[2022-06-12 22:23:55] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 0 ms to minimize.
[2022-06-12 22:23:56] [INFO ] Deduced a trap composed of 63 places in 170 ms of which 0 ms to minimize.
[2022-06-12 22:23:56] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 2 ms to minimize.
[2022-06-12 22:23:56] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 1 ms to minimize.
[2022-06-12 22:23:56] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 0 ms to minimize.
[2022-06-12 22:23:56] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 0 ms to minimize.
[2022-06-12 22:23:57] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:23:57] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2022-06-12 22:23:57] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:23:57] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2022-06-12 22:23:57] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:23:58] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 0 ms to minimize.
[2022-06-12 22:23:58] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2022-06-12 22:23:58] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 1 ms to minimize.
[2022-06-12 22:23:58] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 1 ms to minimize.
[2022-06-12 22:23:58] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 0 ms to minimize.
[2022-06-12 22:23:58] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 0 ms to minimize.
[2022-06-12 22:23:59] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 1 ms to minimize.
[2022-06-12 22:23:59] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 1 ms to minimize.
[2022-06-12 22:23:59] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 0 ms to minimize.
[2022-06-12 22:23:59] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4632 ms
[2022-06-12 22:23:59] [INFO ] Computed and/alt/rep : 948/2761/948 causal constraints (skipped 84 transitions) in 47 ms.
[2022-06-12 22:24:12] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 0 ms to minimize.
[2022-06-12 22:24:12] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 1 ms to minimize.
[2022-06-12 22:24:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 400 ms
[2022-06-12 22:24:13] [INFO ] Added : 904 causal constraints over 182 iterations in 13775 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
Incomplete Parikh walk after 367200 steps, including 1000 resets, run finished after 1022 ms. (steps per millisecond=359 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 208900 steps, including 1000 resets, run finished after 606 ms. (steps per millisecond=344 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 212000 steps, including 1000 resets, run finished after 596 ms. (steps per millisecond=355 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 353400 steps, including 1000 resets, run finished after 977 ms. (steps per millisecond=361 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 146 out of 549 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 549/549 places, 1249/1249 transitions.
Applied a total of 0 rules in 28 ms. Remains 549 /549 variables (removed 0) and now considering 1249/1249 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 549/549 places, 1249/1249 transitions.
Starting structural reductions, iteration 0 : 549/549 places, 1249/1249 transitions.
Applied a total of 0 rules in 27 ms. Remains 549 /549 variables (removed 0) and now considering 1249/1249 (removed 0) transitions.
[2022-06-12 22:24:16] [INFO ] Flow matrix only has 1039 transitions (discarded 210 similar events)
// Phase 1: matrix 1039 rows 549 cols
[2022-06-12 22:24:16] [INFO ] Computed 27 place invariants in 11 ms
[2022-06-12 22:24:16] [INFO ] Implicit Places using invariants in 235 ms returned [486, 487, 489, 520, 521, 523]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 238 ms to find 6 implicit places.
[2022-06-12 22:24:16] [INFO ] Redundant transitions in 95 ms returned []
[2022-06-12 22:24:16] [INFO ] Flow matrix only has 1039 transitions (discarded 210 similar events)
// Phase 1: matrix 1039 rows 543 cols
[2022-06-12 22:24:16] [INFO ] Computed 21 place invariants in 8 ms
[2022-06-12 22:24:17] [INFO ] Dead Transitions using invariants and state equation in 477 ms returned []
Starting structural reductions, iteration 1 : 543/549 places, 1249/1249 transitions.
Applied a total of 0 rules in 23 ms. Remains 543 /543 variables (removed 0) and now considering 1249/1249 (removed 0) transitions.
[2022-06-12 22:24:17] [INFO ] Redundant transitions in 12 ms returned []
[2022-06-12 22:24:17] [INFO ] Flow matrix only has 1039 transitions (discarded 210 similar events)
// Phase 1: matrix 1039 rows 543 cols
[2022-06-12 22:24:17] [INFO ] Computed 21 place invariants in 6 ms
[2022-06-12 22:24:17] [INFO ] Dead Transitions using invariants and state equation in 441 ms returned []
Finished structural reductions, in 2 iterations. Remains : 543/549 places, 1249/1249 transitions.
[2022-06-12 22:24:17] [INFO ] Flatten gal took : 33 ms
[2022-06-12 22:24:17] [INFO ] Flatten gal took : 31 ms
[2022-06-12 22:24:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5140043134625187030.gal : 4 ms
[2022-06-12 22:24:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7119085176802686409.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/ReachabilityCardinality5140043134625187030.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7119085176802686409.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/ReachabilityCardinality5140043134625187030.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7119085176802686409.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7119085176802686409.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :13 after 14
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :14 after 15
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :15 after 27
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :27 after 54
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :54 after 179
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :179 after 371
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :371 after 648
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :648 after 1137
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1137 after 4244
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :4244 after 12214
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :12214 after 25800
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :25800 after 120272
Detected timeout of ITS tools.
[2022-06-12 22:24:33] [INFO ] Flatten gal took : 51 ms
[2022-06-12 22:24:33] [INFO ] Applying decomposition
[2022-06-12 22:24:33] [INFO ] Flatten gal took : 33 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/graph521039862300184819.txt, -o, /tmp/graph521039862300184819.bin, -w, /tmp/graph521039862300184819.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/graph521039862300184819.bin, -l, -1, -v, -w, /tmp/graph521039862300184819.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:24:33] [INFO ] Decomposing Gal with order
[2022-06-12 22:24:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:24:33] [INFO ] Removed a total of 1424 redundant transitions.
[2022-06-12 22:24:33] [INFO ] Flatten gal took : 63 ms
[2022-06-12 22:24:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 405 labels/synchronizations in 23 ms.
[2022-06-12 22:24:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4958819863809903667.gal : 7 ms
[2022-06-12 22:24:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2819417366444746157.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4958819863809903667.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2819417366444746157.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/ReachabilityCardinality4958819863809903667.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2819417366444746157.prop --nowitness
Loading property file /tmp/ReachabilityCardinality2819417366444746157.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 303
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :303 after 9720
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :9720 after 321236
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :321236 after 597818
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :597818 after 753158
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :753158 after 1.34189e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8961536602389641204
[2022-06-12 22:24:48] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8961536602389641204
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/ltsmin8961536602389641204]
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/ltsmin8961536602389641204] 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/ltsmin8961536602389641204] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2878 ms. (steps per millisecond=347 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1461 ms. (steps per millisecond=684 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1393 ms. (steps per millisecond=717 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1195 ms. (steps per millisecond=836 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2328 ms. (steps per millisecond=429 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 6781688 steps, run timeout after 30003 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 6781688 steps, saw 861229 distinct states, run finished after 30004 ms. (steps per millisecond=226 ) properties seen :{}
Running SMT prover for 4 properties.
[2022-06-12 22:25:28] [INFO ] Flow matrix only has 1039 transitions (discarded 210 similar events)
// Phase 1: matrix 1039 rows 543 cols
[2022-06-12 22:25:28] [INFO ] Computed 21 place invariants in 7 ms
[2022-06-12 22:25:28] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2022-06-12 22:25:28] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:25:28] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2022-06-12 22:25:29] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 22:25:29] [INFO ] [Real]Added 366 Read/Feed constraints in 41 ms returned sat
[2022-06-12 22:25:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:25:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-06-12 22:25:29] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 22:25:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:25:29] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2022-06-12 22:25:29] [INFO ] [Nat]Added 366 Read/Feed constraints in 44 ms returned sat
[2022-06-12 22:25:29] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 0 ms to minimize.
[2022-06-12 22:25:29] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 1 ms to minimize.
[2022-06-12 22:25:30] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 1 ms to minimize.
[2022-06-12 22:25:30] [INFO ] Deduced a trap composed of 75 places in 150 ms of which 1 ms to minimize.
[2022-06-12 22:25:30] [INFO ] Deduced a trap composed of 99 places in 167 ms of which 1 ms to minimize.
[2022-06-12 22:25:30] [INFO ] Deduced a trap composed of 78 places in 155 ms of which 1 ms to minimize.
[2022-06-12 22:25:30] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 1 ms to minimize.
[2022-06-12 22:25:31] [INFO ] Deduced a trap composed of 108 places in 152 ms of which 0 ms to minimize.
[2022-06-12 22:25:31] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 1 ms to minimize.
[2022-06-12 22:25:31] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2022-06-12 22:25:31] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 1 ms to minimize.
[2022-06-12 22:25:31] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2022-06-12 22:25:31] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2022-06-12 22:25:32] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2022-06-12 22:25:32] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 0 ms to minimize.
[2022-06-12 22:25:32] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 0 ms to minimize.
[2022-06-12 22:25:32] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 1 ms to minimize.
[2022-06-12 22:25:32] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2022-06-12 22:25:33] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 0 ms to minimize.
[2022-06-12 22:25:33] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:25:33] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:25:33] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:25:33] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 0 ms to minimize.
[2022-06-12 22:25:34] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 0 ms to minimize.
[2022-06-12 22:25:34] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 0 ms to minimize.
[2022-06-12 22:25:34] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:25:34] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:25:34] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 1 ms to minimize.
[2022-06-12 22:25:34] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 1 ms to minimize.
[2022-06-12 22:25:35] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 1 ms to minimize.
[2022-06-12 22:25:35] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 0 ms to minimize.
[2022-06-12 22:25:35] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 1 ms to minimize.
[2022-06-12 22:25:35] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 1 ms to minimize.
[2022-06-12 22:25:35] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 0 ms to minimize.
[2022-06-12 22:25:36] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2022-06-12 22:25:36] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2022-06-12 22:25:36] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 1 ms to minimize.
[2022-06-12 22:25:36] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 0 ms to minimize.
[2022-06-12 22:25:36] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 0 ms to minimize.
[2022-06-12 22:25:36] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:25:37] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:25:37] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 1 ms to minimize.
[2022-06-12 22:25:37] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 1 ms to minimize.
[2022-06-12 22:25:37] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2022-06-12 22:25:37] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 0 ms to minimize.
[2022-06-12 22:25:38] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 0 ms to minimize.
[2022-06-12 22:25:38] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 0 ms to minimize.
[2022-06-12 22:25:38] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 0 ms to minimize.
[2022-06-12 22:25:38] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 0 ms to minimize.
[2022-06-12 22:25:38] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:25:38] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 0 ms to minimize.
[2022-06-12 22:25:38] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 0 ms to minimize.
[2022-06-12 22:25:39] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2022-06-12 22:25:39] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 1 ms to minimize.
[2022-06-12 22:25:39] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:25:39] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 1 ms to minimize.
[2022-06-12 22:25:39] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 0 ms to minimize.
[2022-06-12 22:25:39] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 0 ms to minimize.
[2022-06-12 22:25:39] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 1 ms to minimize.
[2022-06-12 22:25:40] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:25:40] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 1 ms to minimize.
[2022-06-12 22:25:40] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 0 ms to minimize.
[2022-06-12 22:25:40] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 0 ms to minimize.
[2022-06-12 22:25:40] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 1 ms to minimize.
[2022-06-12 22:25:40] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:25:41] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 0 ms to minimize.
[2022-06-12 22:25:41] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 1 ms to minimize.
[2022-06-12 22:25:41] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:25:41] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 0 ms to minimize.
[2022-06-12 22:25:41] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 0 ms to minimize.
[2022-06-12 22:25:41] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 0 ms to minimize.
[2022-06-12 22:25:42] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 0 ms to minimize.
[2022-06-12 22:25:42] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2022-06-12 22:25:42] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 0 ms to minimize.
[2022-06-12 22:25:42] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2022-06-12 22:25:42] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 0 ms to minimize.
[2022-06-12 22:25:42] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 0 ms to minimize.
[2022-06-12 22:25:43] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 1 ms to minimize.
[2022-06-12 22:25:43] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 0 ms to minimize.
[2022-06-12 22:25:43] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2022-06-12 22:25:43] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2022-06-12 22:25:44] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 1 ms to minimize.
[2022-06-12 22:25:44] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:25:44] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:25:44] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 1 ms to minimize.
[2022-06-12 22:25:44] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:25:44] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:25:45] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 1 ms to minimize.
[2022-06-12 22:25:45] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 0 ms to minimize.
[2022-06-12 22:25:45] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:25:46] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 0 ms to minimize.
[2022-06-12 22:25:46] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 1 ms to minimize.
[2022-06-12 22:25:47] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 1 ms to minimize.
[2022-06-12 22:25:47] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 1 ms to minimize.
[2022-06-12 22:25:47] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 0 ms to minimize.
[2022-06-12 22:25:47] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 1 ms to minimize.
[2022-06-12 22:25:47] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 1 ms to minimize.
[2022-06-12 22:25:48] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 1 ms to minimize.
[2022-06-12 22:25:48] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 0 ms to minimize.
[2022-06-12 22:25:48] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 1 ms to minimize.
[2022-06-12 22:25:48] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 0 ms to minimize.
[2022-06-12 22:25:48] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 0 ms to minimize.
[2022-06-12 22:25:48] [INFO ] Trap strengthening (SAT) tested/added 103/102 trap constraints in 19134 ms
[2022-06-12 22:25:48] [INFO ] Computed and/alt/rep : 948/2761/948 causal constraints (skipped 84 transitions) in 46 ms.
[2022-06-12 22:25:58] [INFO ] Added : 750 causal constraints over 150 iterations in 10144 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-06-12 22:25:58] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2022-06-12 22:25:58] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:25:59] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2022-06-12 22:25:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:25:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2022-06-12 22:25:59] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:25:59] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2022-06-12 22:25:59] [INFO ] [Nat]Added 366 Read/Feed constraints in 49 ms returned sat
[2022-06-12 22:25:59] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 1 ms to minimize.
[2022-06-12 22:25:59] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 1 ms to minimize.
[2022-06-12 22:26:00] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 0 ms to minimize.
[2022-06-12 22:26:00] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2022-06-12 22:26:00] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 0 ms to minimize.
[2022-06-12 22:26:00] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 1 ms to minimize.
[2022-06-12 22:26:00] [INFO ] Deduced a trap composed of 103 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:26:01] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 0 ms to minimize.
[2022-06-12 22:26:01] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 0 ms to minimize.
[2022-06-12 22:26:01] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 1 ms to minimize.
[2022-06-12 22:26:01] [INFO ] Deduced a trap composed of 77 places in 165 ms of which 1 ms to minimize.
[2022-06-12 22:26:01] [INFO ] Deduced a trap composed of 109 places in 167 ms of which 1 ms to minimize.
[2022-06-12 22:26:02] [INFO ] Deduced a trap composed of 71 places in 169 ms of which 1 ms to minimize.
[2022-06-12 22:26:02] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 1 ms to minimize.
[2022-06-12 22:26:02] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 0 ms to minimize.
[2022-06-12 22:26:02] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 0 ms to minimize.
[2022-06-12 22:26:02] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 0 ms to minimize.
[2022-06-12 22:26:02] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 4 ms to minimize.
[2022-06-12 22:26:03] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 0 ms to minimize.
[2022-06-12 22:26:03] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 0 ms to minimize.
[2022-06-12 22:26:03] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 0 ms to minimize.
[2022-06-12 22:26:03] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 0 ms to minimize.
[2022-06-12 22:26:03] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 0 ms to minimize.
[2022-06-12 22:26:03] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 1 ms to minimize.
[2022-06-12 22:26:04] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 1 ms to minimize.
[2022-06-12 22:26:04] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2022-06-12 22:26:04] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 0 ms to minimize.
[2022-06-12 22:26:04] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2022-06-12 22:26:04] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 1 ms to minimize.
[2022-06-12 22:26:04] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 0 ms to minimize.
[2022-06-12 22:26:05] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
[2022-06-12 22:26:05] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2022-06-12 22:26:05] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 0 ms to minimize.
[2022-06-12 22:26:05] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:26:05] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2022-06-12 22:26:06] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 0 ms to minimize.
[2022-06-12 22:26:06] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
[2022-06-12 22:26:06] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 1 ms to minimize.
[2022-06-12 22:26:06] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 0 ms to minimize.
[2022-06-12 22:26:06] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 0 ms to minimize.
[2022-06-12 22:26:06] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:26:07] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:26:07] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 0 ms to minimize.
[2022-06-12 22:26:07] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 1 ms to minimize.
[2022-06-12 22:26:07] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:26:07] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2022-06-12 22:26:08] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2022-06-12 22:26:08] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 0 ms to minimize.
[2022-06-12 22:26:08] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 0 ms to minimize.
[2022-06-12 22:26:08] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 8771 ms
[2022-06-12 22:26:08] [INFO ] Computed and/alt/rep : 948/2761/948 causal constraints (skipped 84 transitions) in 46 ms.
[2022-06-12 22:26:22] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 1 ms to minimize.
[2022-06-12 22:26:22] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 1 ms to minimize.
[2022-06-12 22:26:22] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2022-06-12 22:26:23] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2022-06-12 22:26:23] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 1 ms to minimize.
[2022-06-12 22:26:23] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 1 ms to minimize.
[2022-06-12 22:26:23] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 1 ms to minimize.
[2022-06-12 22:26:23] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 1 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 0 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 0 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2827 ms
[2022-06-12 22:26:25] [INFO ] Added : 911 causal constraints over 183 iterations in 16718 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-06-12 22:26:25] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-06-12 22:26:25] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:25] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2022-06-12 22:26:25] [INFO ] [Real]Added 366 Read/Feed constraints in 41 ms returned sat
[2022-06-12 22:26:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:26:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-06-12 22:26:25] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:26:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:26] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-06-12 22:26:26] [INFO ] [Nat]Added 366 Read/Feed constraints in 42 ms returned sat
[2022-06-12 22:26:26] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 0 ms to minimize.
[2022-06-12 22:26:26] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 1 ms to minimize.
[2022-06-12 22:26:26] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 0 ms to minimize.
[2022-06-12 22:26:26] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 1 ms to minimize.
[2022-06-12 22:26:27] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 1 ms to minimize.
[2022-06-12 22:26:27] [INFO ] Deduced a trap composed of 61 places in 160 ms of which 0 ms to minimize.
[2022-06-12 22:26:27] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 0 ms to minimize.
[2022-06-12 22:26:27] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2022-06-12 22:26:27] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 1 ms to minimize.
[2022-06-12 22:26:28] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 1 ms to minimize.
[2022-06-12 22:26:28] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 0 ms to minimize.
[2022-06-12 22:26:28] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 0 ms to minimize.
[2022-06-12 22:26:28] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 0 ms to minimize.
[2022-06-12 22:26:28] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 1 ms to minimize.
[2022-06-12 22:26:29] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 1 ms to minimize.
[2022-06-12 22:26:29] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 0 ms to minimize.
[2022-06-12 22:26:29] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 1 ms to minimize.
[2022-06-12 22:26:29] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:26:29] [INFO ] Deduced a trap composed of 64 places in 148 ms of which 0 ms to minimize.
[2022-06-12 22:26:29] [INFO ] Deduced a trap composed of 69 places in 141 ms of which 0 ms to minimize.
[2022-06-12 22:26:30] [INFO ] Deduced a trap composed of 68 places in 140 ms of which 0 ms to minimize.
[2022-06-12 22:26:30] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 0 ms to minimize.
[2022-06-12 22:26:30] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:26:30] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 0 ms to minimize.
[2022-06-12 22:26:30] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:26:31] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:26:31] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 0 ms to minimize.
[2022-06-12 22:26:31] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:26:31] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:26:31] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2022-06-12 22:26:31] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2022-06-12 22:26:32] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2022-06-12 22:26:32] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 0 ms to minimize.
[2022-06-12 22:26:32] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2022-06-12 22:26:32] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 0 ms to minimize.
[2022-06-12 22:26:32] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:26:33] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 1 ms to minimize.
[2022-06-12 22:26:33] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 0 ms to minimize.
[2022-06-12 22:26:33] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 1 ms to minimize.
[2022-06-12 22:26:33] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2022-06-12 22:26:34] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:26:34] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 1 ms to minimize.
[2022-06-12 22:26:34] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 0 ms to minimize.
[2022-06-12 22:26:34] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2022-06-12 22:26:34] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 1 ms to minimize.
[2022-06-12 22:26:35] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 1 ms to minimize.
[2022-06-12 22:26:35] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 0 ms to minimize.
[2022-06-12 22:26:35] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 1 ms to minimize.
[2022-06-12 22:26:35] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 0 ms to minimize.
[2022-06-12 22:26:35] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 0 ms to minimize.
[2022-06-12 22:26:35] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:26:36] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:26:36] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:26:36] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 0 ms to minimize.
[2022-06-12 22:26:36] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 1 ms to minimize.
[2022-06-12 22:26:37] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 0 ms to minimize.
[2022-06-12 22:26:37] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 1 ms to minimize.
[2022-06-12 22:26:37] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 0 ms to minimize.
[2022-06-12 22:26:37] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 1 ms to minimize.
[2022-06-12 22:26:37] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2022-06-12 22:26:37] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 0 ms to minimize.
[2022-06-12 22:26:38] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 1 ms to minimize.
[2022-06-12 22:26:38] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2022-06-12 22:26:38] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 0 ms to minimize.
[2022-06-12 22:26:38] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 0 ms to minimize.
[2022-06-12 22:26:38] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 0 ms to minimize.
[2022-06-12 22:26:39] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 0 ms to minimize.
[2022-06-12 22:26:39] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 1 ms to minimize.
[2022-06-12 22:26:39] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2022-06-12 22:26:39] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 0 ms to minimize.
[2022-06-12 22:26:39] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 0 ms to minimize.
[2022-06-12 22:26:39] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 0 ms to minimize.
[2022-06-12 22:26:40] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:26:40] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 0 ms to minimize.
[2022-06-12 22:26:40] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 1 ms to minimize.
[2022-06-12 22:26:40] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 0 ms to minimize.
[2022-06-12 22:26:40] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 0 ms to minimize.
[2022-06-12 22:26:41] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 1 ms to minimize.
[2022-06-12 22:26:41] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 0 ms to minimize.
[2022-06-12 22:26:41] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:26:41] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 0 ms to minimize.
[2022-06-12 22:26:41] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 0 ms to minimize.
[2022-06-12 22:26:42] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 0 ms to minimize.
[2022-06-12 22:26:42] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 0 ms to minimize.
[2022-06-12 22:26:42] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 16163 ms
[2022-06-12 22:26:42] [INFO ] Computed and/alt/rep : 948/2761/948 causal constraints (skipped 84 transitions) in 45 ms.
[2022-06-12 22:26:54] [INFO ] Added : 811 causal constraints over 163 iterations in 11861 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-06-12 22:26:54] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-06-12 22:26:54] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-12 22:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:54] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2022-06-12 22:26:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:26:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-06-12 22:26:54] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:26:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:54] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2022-06-12 22:26:54] [INFO ] [Nat]Added 366 Read/Feed constraints in 41 ms returned sat
[2022-06-12 22:26:55] [INFO ] Deduced a trap composed of 68 places in 156 ms of which 0 ms to minimize.
[2022-06-12 22:26:55] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 0 ms to minimize.
[2022-06-12 22:26:55] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2022-06-12 22:26:55] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 0 ms to minimize.
[2022-06-12 22:26:55] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:26:56] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 0 ms to minimize.
[2022-06-12 22:26:56] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 1 ms to minimize.
[2022-06-12 22:26:56] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 1 ms to minimize.
[2022-06-12 22:26:56] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:26:56] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2022-06-12 22:26:57] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2022-06-12 22:26:57] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:26:57] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 0 ms to minimize.
[2022-06-12 22:26:57] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:26:57] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:26:58] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 0 ms to minimize.
[2022-06-12 22:26:58] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:26:58] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 0 ms to minimize.
[2022-06-12 22:26:58] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 1 ms to minimize.
[2022-06-12 22:26:58] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:26:58] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:26:59] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 1 ms to minimize.
[2022-06-12 22:26:59] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 1 ms to minimize.
[2022-06-12 22:26:59] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:26:59] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 1 ms to minimize.
[2022-06-12 22:26:59] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:26:59] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:27:00] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2022-06-12 22:27:00] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2022-06-12 22:27:00] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:27:00] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2022-06-12 22:27:00] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 5670 ms
[2022-06-12 22:27:00] [INFO ] Computed and/alt/rep : 948/2761/948 causal constraints (skipped 84 transitions) in 47 ms.
[2022-06-12 22:27:13] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 1 ms to minimize.
[2022-06-12 22:27:13] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 1 ms to minimize.
[2022-06-12 22:27:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
[2022-06-12 22:27:14] [INFO ] Added : 917 causal constraints over 184 iterations in 13445 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 293900 steps, including 1000 resets, run finished after 718 ms. (steps per millisecond=409 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 422500 steps, including 1000 resets, run finished after 1042 ms. (steps per millisecond=405 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 269800 steps, including 1000 resets, run finished after 693 ms. (steps per millisecond=389 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 361400 steps, including 1000 resets, run finished after 955 ms. (steps per millisecond=378 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 146 out of 543 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 543/543 places, 1249/1249 transitions.
Applied a total of 0 rules in 18 ms. Remains 543 /543 variables (removed 0) and now considering 1249/1249 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 543/543 places, 1249/1249 transitions.
Starting structural reductions, iteration 0 : 543/543 places, 1249/1249 transitions.
Applied a total of 0 rules in 17 ms. Remains 543 /543 variables (removed 0) and now considering 1249/1249 (removed 0) transitions.
[2022-06-12 22:27:17] [INFO ] Flow matrix only has 1039 transitions (discarded 210 similar events)
// Phase 1: matrix 1039 rows 543 cols
[2022-06-12 22:27:17] [INFO ] Computed 21 place invariants in 3 ms
[2022-06-12 22:27:17] [INFO ] Implicit Places using invariants in 240 ms returned []
[2022-06-12 22:27:17] [INFO ] Flow matrix only has 1039 transitions (discarded 210 similar events)
// Phase 1: matrix 1039 rows 543 cols
[2022-06-12 22:27:17] [INFO ] Computed 21 place invariants in 3 ms
[2022-06-12 22:27:18] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 22:27:19] [INFO ] Implicit Places using invariants and state equation in 1814 ms returned []
Implicit Place search using SMT with State Equation took 2056 ms to find 0 implicit places.
[2022-06-12 22:27:19] [INFO ] Redundant transitions in 68 ms returned []
[2022-06-12 22:27:19] [INFO ] Flow matrix only has 1039 transitions (discarded 210 similar events)
// Phase 1: matrix 1039 rows 543 cols
[2022-06-12 22:27:19] [INFO ] Computed 21 place invariants in 5 ms
[2022-06-12 22:27:20] [INFO ] Dead Transitions using invariants and state equation in 426 ms returned []
Finished structural reductions, in 1 iterations. Remains : 543/543 places, 1249/1249 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=271 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-12 22:27:20] [INFO ] Flow matrix only has 1039 transitions (discarded 210 similar events)
// Phase 1: matrix 1039 rows 543 cols
[2022-06-12 22:27:20] [INFO ] Computed 21 place invariants in 4 ms
[2022-06-12 22:27:20] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-06-12 22:27:20] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:27:20] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2022-06-12 22:27:20] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 22:27:20] [INFO ] [Real]Added 366 Read/Feed constraints in 41 ms returned sat
[2022-06-12 22:27:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:27:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-06-12 22:27:21] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:27:21] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2022-06-12 22:27:21] [INFO ] [Nat]Added 366 Read/Feed constraints in 49 ms returned sat
[2022-06-12 22:27:21] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:27:21] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 1 ms to minimize.
[2022-06-12 22:27:22] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 1 ms to minimize.
[2022-06-12 22:27:22] [INFO ] Deduced a trap composed of 75 places in 150 ms of which 0 ms to minimize.
[2022-06-12 22:27:22] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:27:22] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:27:22] [INFO ] Deduced a trap composed of 79 places in 175 ms of which 1 ms to minimize.
[2022-06-12 22:27:22] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 1 ms to minimize.
[2022-06-12 22:27:23] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 1 ms to minimize.
[2022-06-12 22:27:23] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
[2022-06-12 22:27:23] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:27:23] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2022-06-12 22:27:23] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2022-06-12 22:27:24] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 0 ms to minimize.
[2022-06-12 22:27:24] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 0 ms to minimize.
[2022-06-12 22:27:24] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 0 ms to minimize.
[2022-06-12 22:27:24] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 1 ms to minimize.
[2022-06-12 22:27:24] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 2 ms to minimize.
[2022-06-12 22:27:25] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 0 ms to minimize.
[2022-06-12 22:27:25] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2022-06-12 22:27:25] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:27:25] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2022-06-12 22:27:25] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:27:26] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 0 ms to minimize.
[2022-06-12 22:27:26] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 1 ms to minimize.
[2022-06-12 22:27:26] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 1 ms to minimize.
[2022-06-12 22:27:26] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:27:26] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 1 ms to minimize.
[2022-06-12 22:27:27] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 1 ms to minimize.
[2022-06-12 22:27:27] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:27:27] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:27:27] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 0 ms to minimize.
[2022-06-12 22:27:27] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 1 ms to minimize.
[2022-06-12 22:27:28] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 0 ms to minimize.
[2022-06-12 22:27:28] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:27:28] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:27:28] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2022-06-12 22:27:28] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2022-06-12 22:27:28] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:27:29] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 0 ms to minimize.
[2022-06-12 22:27:29] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2022-06-12 22:27:29] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 0 ms to minimize.
[2022-06-12 22:27:29] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 0 ms to minimize.
[2022-06-12 22:27:29] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:27:30] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:27:30] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 0 ms to minimize.
[2022-06-12 22:27:30] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 0 ms to minimize.
[2022-06-12 22:27:30] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:27:30] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 0 ms to minimize.
[2022-06-12 22:27:30] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:27:31] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 0 ms to minimize.
[2022-06-12 22:27:31] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 1 ms to minimize.
[2022-06-12 22:27:31] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 0 ms to minimize.
[2022-06-12 22:27:31] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:27:31] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 0 ms to minimize.
[2022-06-12 22:27:31] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 0 ms to minimize.
[2022-06-12 22:27:31] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 1 ms to minimize.
[2022-06-12 22:27:32] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:27:32] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 1 ms to minimize.
[2022-06-12 22:27:32] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 1 ms to minimize.
[2022-06-12 22:27:32] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:27:32] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:27:32] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 0 ms to minimize.
[2022-06-12 22:27:33] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2022-06-12 22:27:33] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 0 ms to minimize.
[2022-06-12 22:27:33] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 0 ms to minimize.
[2022-06-12 22:27:33] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 0 ms to minimize.
[2022-06-12 22:27:33] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 0 ms to minimize.
[2022-06-12 22:27:34] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 0 ms to minimize.
[2022-06-12 22:27:34] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 0 ms to minimize.
[2022-06-12 22:27:34] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 0 ms to minimize.
[2022-06-12 22:27:34] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:27:34] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 0 ms to minimize.
[2022-06-12 22:27:34] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 0 ms to minimize.
[2022-06-12 22:27:35] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:27:35] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 1 ms to minimize.
[2022-06-12 22:27:35] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 1 ms to minimize.
[2022-06-12 22:27:35] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 0 ms to minimize.
[2022-06-12 22:27:36] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2022-06-12 22:27:36] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2022-06-12 22:27:36] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2022-06-12 22:27:36] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 0 ms to minimize.
[2022-06-12 22:27:36] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 0 ms to minimize.
[2022-06-12 22:27:36] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 0 ms to minimize.
[2022-06-12 22:27:37] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:27:37] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 0 ms to minimize.
[2022-06-12 22:27:37] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 0 ms to minimize.
[2022-06-12 22:27:37] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 0 ms to minimize.
[2022-06-12 22:27:37] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:27:38] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2022-06-12 22:27:38] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:27:38] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 1 ms to minimize.
[2022-06-12 22:27:39] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 1 ms to minimize.
[2022-06-12 22:27:39] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2022-06-12 22:27:40] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 0 ms to minimize.
[2022-06-12 22:27:40] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:27:40] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:27:40] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 1 ms to minimize.
[2022-06-12 22:27:40] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 0 ms to minimize.
[2022-06-12 22:27:41] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 0 ms to minimize.
[2022-06-12 22:27:41] [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 0
[2022-06-12 22:27:41] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2022-06-12 22:27:41] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:27:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:27:41] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2022-06-12 22:27:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:27:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-06-12 22:27:41] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:27:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:27:41] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2022-06-12 22:27:41] [INFO ] [Nat]Added 366 Read/Feed constraints in 54 ms returned sat
[2022-06-12 22:27:42] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 0 ms to minimize.
[2022-06-12 22:27:42] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 0 ms to minimize.
[2022-06-12 22:27:42] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 1 ms to minimize.
[2022-06-12 22:27:42] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 0 ms to minimize.
[2022-06-12 22:27:42] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2022-06-12 22:27:43] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 0 ms to minimize.
[2022-06-12 22:27:43] [INFO ] Deduced a trap composed of 103 places in 153 ms of which 1 ms to minimize.
[2022-06-12 22:27:43] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 0 ms to minimize.
[2022-06-12 22:27:43] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 1 ms to minimize.
[2022-06-12 22:27:43] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 1 ms to minimize.
[2022-06-12 22:27:44] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 1 ms to minimize.
[2022-06-12 22:27:44] [INFO ] Deduced a trap composed of 109 places in 151 ms of which 1 ms to minimize.
[2022-06-12 22:27:44] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 0 ms to minimize.
[2022-06-12 22:27:44] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 1 ms to minimize.
[2022-06-12 22:27:44] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2022-06-12 22:27:44] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2022-06-12 22:27:45] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2022-06-12 22:27:45] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 0 ms to minimize.
[2022-06-12 22:27:45] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 1 ms to minimize.
[2022-06-12 22:27:45] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:27:45] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 0 ms to minimize.
[2022-06-12 22:27:45] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 0 ms to minimize.
[2022-06-12 22:27:46] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:27:46] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 1 ms to minimize.
[2022-06-12 22:27:46] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:27:46] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2022-06-12 22:27:46] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2022-06-12 22:27:46] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 0 ms to minimize.
[2022-06-12 22:27:46] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 1 ms to minimize.
[2022-06-12 22:27:47] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:27:47] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2022-06-12 22:27:47] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2022-06-12 22:27:47] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 1 ms to minimize.
[2022-06-12 22:27:47] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 0 ms to minimize.
[2022-06-12 22:27:47] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2022-06-12 22:27:48] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 0 ms to minimize.
[2022-06-12 22:27:48] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:27:48] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 0 ms to minimize.
[2022-06-12 22:27:48] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:27:48] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 1 ms to minimize.
[2022-06-12 22:27:48] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 0 ms to minimize.
[2022-06-12 22:27:49] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 1 ms to minimize.
[2022-06-12 22:27:49] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 0 ms to minimize.
[2022-06-12 22:27:49] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 1 ms to minimize.
[2022-06-12 22:27:49] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 0 ms to minimize.
[2022-06-12 22:27:49] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2022-06-12 22:27:50] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 0 ms to minimize.
[2022-06-12 22:27:50] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:27:50] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 1 ms to minimize.
[2022-06-12 22:27:50] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 8493 ms
[2022-06-12 22:27:50] [INFO ] Computed and/alt/rep : 948/2761/948 causal constraints (skipped 84 transitions) in 58 ms.
[2022-06-12 22:28:01] [INFO ] Added : 710 causal constraints over 142 iterations in 11098 ms. Result :unknown
[2022-06-12 22:28:01] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-06-12 22:28:01] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:28:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:28:01] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2022-06-12 22:28:01] [INFO ] [Real]Added 366 Read/Feed constraints in 41 ms returned sat
[2022-06-12 22:28:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:28:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-06-12 22:28:02] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:28:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:28:02] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2022-06-12 22:28:02] [INFO ] [Nat]Added 366 Read/Feed constraints in 43 ms returned sat
[2022-06-12 22:28:02] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 0 ms to minimize.
[2022-06-12 22:28:02] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 1 ms to minimize.
[2022-06-12 22:28:02] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 1 ms to minimize.
[2022-06-12 22:28:03] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 0 ms to minimize.
[2022-06-12 22:28:03] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 1 ms to minimize.
[2022-06-12 22:28:03] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 0 ms to minimize.
[2022-06-12 22:28:03] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 0 ms to minimize.
[2022-06-12 22:28:03] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2022-06-12 22:28:04] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 1 ms to minimize.
[2022-06-12 22:28:04] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 1 ms to minimize.
[2022-06-12 22:28:04] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2022-06-12 22:28:04] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 1 ms to minimize.
[2022-06-12 22:28:04] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 1 ms to minimize.
[2022-06-12 22:28:05] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 1 ms to minimize.
[2022-06-12 22:28:05] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 1 ms to minimize.
[2022-06-12 22:28:05] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:28:05] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 1 ms to minimize.
[2022-06-12 22:28:05] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 1 ms to minimize.
[2022-06-12 22:28:05] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 1 ms to minimize.
[2022-06-12 22:28:06] [INFO ] Deduced a trap composed of 69 places in 143 ms of which 1 ms to minimize.
[2022-06-12 22:28:06] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 0 ms to minimize.
[2022-06-12 22:28:06] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 0 ms to minimize.
[2022-06-12 22:28:06] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 1 ms to minimize.
[2022-06-12 22:28:06] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:28:07] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 1 ms to minimize.
[2022-06-12 22:28:07] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 1 ms to minimize.
[2022-06-12 22:28:07] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:28:07] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 0 ms to minimize.
[2022-06-12 22:28:07] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 1 ms to minimize.
[2022-06-12 22:28:08] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2022-06-12 22:28:08] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:28:08] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:28:08] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 1 ms to minimize.
[2022-06-12 22:28:08] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2022-06-12 22:28:09] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 1 ms to minimize.
[2022-06-12 22:28:09] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:28:09] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 0 ms to minimize.
[2022-06-12 22:28:09] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 0 ms to minimize.
[2022-06-12 22:28:09] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:28:10] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2022-06-12 22:28:10] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 0 ms to minimize.
[2022-06-12 22:28:10] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 0 ms to minimize.
[2022-06-12 22:28:10] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:28:10] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2022-06-12 22:28:11] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 1 ms to minimize.
[2022-06-12 22:28:11] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 1 ms to minimize.
[2022-06-12 22:28:11] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 0 ms to minimize.
[2022-06-12 22:28:11] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 0 ms to minimize.
[2022-06-12 22:28:11] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 1 ms to minimize.
[2022-06-12 22:28:12] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 0 ms to minimize.
[2022-06-12 22:28:12] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 1 ms to minimize.
[2022-06-12 22:28:12] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 1 ms to minimize.
[2022-06-12 22:28:12] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 1 ms to minimize.
[2022-06-12 22:28:12] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 1 ms to minimize.
[2022-06-12 22:28:12] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 0 ms to minimize.
[2022-06-12 22:28:13] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 0 ms to minimize.
[2022-06-12 22:28:13] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 1 ms to minimize.
[2022-06-12 22:28:13] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 1 ms to minimize.
[2022-06-12 22:28:13] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 0 ms to minimize.
[2022-06-12 22:28:14] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 0 ms to minimize.
[2022-06-12 22:28:14] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2022-06-12 22:28:14] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 1 ms to minimize.
[2022-06-12 22:28:14] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:28:14] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 1 ms to minimize.
[2022-06-12 22:28:14] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 0 ms to minimize.
[2022-06-12 22:28:15] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:28:15] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 0 ms to minimize.
[2022-06-12 22:28:15] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 0 ms to minimize.
[2022-06-12 22:28:15] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2022-06-12 22:28:15] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 0 ms to minimize.
[2022-06-12 22:28:16] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2022-06-12 22:28:16] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 0 ms to minimize.
[2022-06-12 22:28:16] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 0 ms to minimize.
[2022-06-12 22:28:16] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 1 ms to minimize.
[2022-06-12 22:28:16] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 1 ms to minimize.
[2022-06-12 22:28:17] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 0 ms to minimize.
[2022-06-12 22:28:17] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 0 ms to minimize.
[2022-06-12 22:28:17] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 0 ms to minimize.
[2022-06-12 22:28:17] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 0 ms to minimize.
[2022-06-12 22:28:17] [INFO ] Deduced a trap composed of 68 places in 146 ms of which 1 ms to minimize.
[2022-06-12 22:28:18] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2022-06-12 22:28:18] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 0 ms to minimize.
[2022-06-12 22:28:18] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 0 ms to minimize.
[2022-06-12 22:28:18] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 0 ms to minimize.
[2022-06-12 22:28:18] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 16354 ms
[2022-06-12 22:28:18] [INFO ] Computed and/alt/rep : 948/2761/948 causal constraints (skipped 84 transitions) in 48 ms.
[2022-06-12 22:28:21] [INFO ] Added : 260 causal constraints over 52 iterations in 3265 ms. Result :unknown
[2022-06-12 22:28:22] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-06-12 22:28:22] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 22:28:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:28:22] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2022-06-12 22:28:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:28:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-06-12 22:28:22] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:28:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:28:22] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2022-06-12 22:28:22] [INFO ] [Nat]Added 366 Read/Feed constraints in 43 ms returned sat
[2022-06-12 22:28:22] [INFO ] Deduced a trap composed of 68 places in 152 ms of which 1 ms to minimize.
[2022-06-12 22:28:23] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2022-06-12 22:28:23] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 0 ms to minimize.
[2022-06-12 22:28:23] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 0 ms to minimize.
[2022-06-12 22:28:23] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 0 ms to minimize.
[2022-06-12 22:28:23] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:28:24] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 0 ms to minimize.
[2022-06-12 22:28:24] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 1 ms to minimize.
[2022-06-12 22:28:24] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2022-06-12 22:28:24] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2022-06-12 22:28:24] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 0 ms to minimize.
[2022-06-12 22:28:25] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
[2022-06-12 22:28:25] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2022-06-12 22:28:25] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 1 ms to minimize.
[2022-06-12 22:28:25] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2022-06-12 22:28:25] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2022-06-12 22:28:26] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 1 ms to minimize.
[2022-06-12 22:28:26] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:28:26] [INFO ] Deduced a trap composed of 74 places in 151 ms of which 1 ms to minimize.
[2022-06-12 22:28:26] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 0 ms to minimize.
[2022-06-12 22:28:26] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2022-06-12 22:28:27] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 1 ms to minimize.
[2022-06-12 22:28:27] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 1 ms to minimize.
[2022-06-12 22:28:27] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 1 ms to minimize.
[2022-06-12 22:28:27] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 1 ms to minimize.
[2022-06-12 22:28:27] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2022-06-12 22:28:27] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2022-06-12 22:28:28] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2022-06-12 22:28:28] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:28:28] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 0 ms to minimize.
[2022-06-12 22:28:28] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2022-06-12 22:28:28] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 5868 ms
[2022-06-12 22:28:28] [INFO ] Computed and/alt/rep : 948/2761/948 causal constraints (skipped 84 transitions) in 48 ms.
[2022-06-12 22:28:41] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 0 ms to minimize.
[2022-06-12 22:28:42] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 0 ms to minimize.
[2022-06-12 22:28:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2022-06-12 22:28:42] [INFO ] Added : 917 causal constraints over 184 iterations in 13666 ms. Result :sat
[2022-06-12 22:28:42] [INFO ] Flatten gal took : 36 ms
[2022-06-12 22:28:42] [INFO ] Flatten gal took : 35 ms
[2022-06-12 22:28:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9014878145083902165.gal : 4 ms
[2022-06-12 22:28:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3794094209621758985.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/ReachabilityCardinality9014878145083902165.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3794094209621758985.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/ReachabilityCardinality9014878145083902165.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3794094209621758985.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3794094209621758985.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :13 after 14
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :14 after 15
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :15 after 27
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :27 after 54
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :54 after 179
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :179 after 371
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :371 after 648
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :648 after 1137
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1137 after 4244
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :4244 after 12214
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :12214 after 25800
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :25800 after 120272
Detected timeout of ITS tools.
[2022-06-12 22:29:02] [INFO ] Flatten gal took : 32 ms
[2022-06-12 22:29:02] [INFO ] Applying decomposition
[2022-06-12 22:29:02] [INFO ] Flatten gal took : 31 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/graph8498861014942384786.txt, -o, /tmp/graph8498861014942384786.bin, -w, /tmp/graph8498861014942384786.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/graph8498861014942384786.bin, -l, -1, -v, -w, /tmp/graph8498861014942384786.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:29:02] [INFO ] Decomposing Gal with order
[2022-06-12 22:29:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:29:02] [INFO ] Removed a total of 1422 redundant transitions.
[2022-06-12 22:29:02] [INFO ] Flatten gal took : 65 ms
[2022-06-12 22:29:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 460 labels/synchronizations in 20 ms.
[2022-06-12 22:29:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1436598725318479886.gal : 7 ms
[2022-06-12 22:29:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7438038481205444548.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1436598725318479886.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7438038481205444548.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/ReachabilityCardinality1436598725318479886.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7438038481205444548.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7438038481205444548.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :4 after 32
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :32 after 428
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :428 after 20293
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :20293 after 819141
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10927027424728598969
[2022-06-12 22:29:22] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10927027424728598969
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/ltsmin10927027424728598969]
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/ltsmin10927027424728598969] killed by timeout after 2 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/ltsmin10927027424728598969] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Graph (trivial) has 484 edges and 543 vertex of which 115 / 543 are part of one of the 22 SCC in 3 ms
Free SCC test removed 93 places
Drop transitions removed 186 transitions
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 397 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 450 transition count 851
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 449 transition count 851
Performed 80 Post agglomeration using F-continuation condition with reduction of 29 identical transitions.
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 0 with 160 rules applied. Total rules applied 163 place count 369 transition count 742
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 196 place count 369 transition count 709
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 202 place count 366 transition count 729
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 205 place count 366 transition count 726
Drop transitions removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 2 with 47 rules applied. Total rules applied 252 place count 366 transition count 679
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 2 with 19 rules applied. Total rules applied 271 place count 366 transition count 660
Reduce places removed 19 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 3 with 30 rules applied. Total rules applied 301 place count 347 transition count 649
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 312 place count 336 transition count 649
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 312 place count 336 transition count 640
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 330 place count 327 transition count 640
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 338 place count 327 transition count 632
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 340 place count 327 transition count 630
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 6 with 8 rules applied. Total rules applied 348 place count 325 transition count 624
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 354 place count 319 transition count 624
Free-agglomeration rule applied 31 times.
Iterating global reduction 8 with 31 rules applied. Total rules applied 385 place count 319 transition count 593
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 416 place count 288 transition count 593
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 425 place count 288 transition count 584
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 436 place count 288 transition count 584
Applied a total of 436 rules in 149 ms. Remains 288 /543 variables (removed 255) and now considering 584/1249 (removed 665) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 584 rows 288 cols
[2022-06-12 22:29:24] [INFO ] Computed 21 place invariants in 2 ms
[2022-06-12 22:29:24] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2022-06-12 22:29:24] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 22:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:29:25] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2022-06-12 22:29:25] [INFO ] Computed and/alt/rep : 547/2311/547 causal constraints (skipped 30 transitions) in 26 ms.
[2022-06-12 22:29:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:29:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2022-06-12 22:29:25] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:29:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:29:25] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2022-06-12 22:29:25] [INFO ] Computed and/alt/rep : 547/2311/547 causal constraints (skipped 30 transitions) in 41 ms.
[2022-06-12 22:29:30] [INFO ] Added : 498 causal constraints over 100 iterations in 5089 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-06-12 22:29:30] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2022-06-12 22:29:30] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:29:30] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-06-12 22:29:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:29:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2022-06-12 22:29:30] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 22:29:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:29:31] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2022-06-12 22:29:31] [INFO ] Computed and/alt/rep : 547/2311/547 causal constraints (skipped 30 transitions) in 28 ms.
[2022-06-12 22:29:35] [INFO ] Added : 477 causal constraints over 96 iterations in 4749 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-06-12 22:29:35] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2022-06-12 22:29:35] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:29:36] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2022-06-12 22:29:36] [INFO ] Computed and/alt/rep : 547/2311/547 causal constraints (skipped 30 transitions) in 27 ms.
[2022-06-12 22:29:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:29:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2022-06-12 22:29:36] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:29:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:29:36] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2022-06-12 22:29:36] [INFO ] Computed and/alt/rep : 547/2311/547 causal constraints (skipped 30 transitions) in 30 ms.
[2022-06-12 22:29:41] [INFO ] Added : 497 causal constraints over 100 iterations in 5054 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-06-12 22:29:41] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2022-06-12 22:29:41] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 22:29:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:29:41] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-06-12 22:29:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:29:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2022-06-12 22:29:41] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 22:29:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:29:41] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2022-06-12 22:29:41] [INFO ] Computed and/alt/rep : 547/2311/547 causal constraints (skipped 30 transitions) in 26 ms.
[2022-06-12 22:29:46] [INFO ] Added : 498 causal constraints over 100 iterations in 4994 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-06-12 22:29:47] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5318865266186197247
[2022-06-12 22:29:47] [INFO ] Computing symmetric may disable matrix : 1249 transitions.
[2022-06-12 22:29:47] [INFO ] Applying decomposition
[2022-06-12 22:29:47] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:29:47] [INFO ] Computing symmetric may enable matrix : 1249 transitions.
[2022-06-12 22:29:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:29:47] [INFO ] Flatten gal took : 75 ms
[2022-06-12 22:29:47] [INFO ] Flatten gal took : 63 ms
[2022-06-12 22:29:47] [INFO ] Input system was already deterministic with 1249 transitions.
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/graph4901899927571620348.txt, -o, /tmp/graph4901899927571620348.bin, -w, /tmp/graph4901899927571620348.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/graph4901899927571620348.bin, -l, -1, -v, -w, /tmp/graph4901899927571620348.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:29:47] [INFO ] Decomposing Gal with order
[2022-06-12 22:29:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:29:47] [INFO ] Computing Do-Not-Accords matrix : 1249 transitions.
[2022-06-12 22:29:47] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:29:47] [INFO ] Built C files in 318ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5318865266186197247
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/ltsmin5318865266186197247]
[2022-06-12 22:29:47] [INFO ] Removed a total of 1423 redundant transitions.
[2022-06-12 22:29:47] [INFO ] Flatten gal took : 100 ms
[2022-06-12 22:29:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 328 labels/synchronizations in 12 ms.
[2022-06-12 22:29:47] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability124837263369135382.gal : 7 ms
[2022-06-12 22:29:47] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5151354372791042377.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability124837263369135382.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability5151354372791042377.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/ReachabilityFireability124837263369135382.gal -t CGAL -reachable-file /tmp/ReachabilityFireability5151354372791042377.prop --nowitness
[2022-06-12 22:29:47] [INFO ] Ran tautology test, simplified 0 / 4 in 520 ms.
[2022-06-12 22:29:47] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-06(UNSAT) depth K=0 took 10 ms
Loading property file /tmp/ReachabilityFireability5151354372791042377.prop.
[2022-06-12 22:29:47] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-09(UNSAT) depth K=0 took 9 ms
[2022-06-12 22:29:47] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-12(UNSAT) depth K=0 took 2 ms
[2022-06-12 22:29:47] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=0 took 1 ms
[2022-06-12 22:29:47] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-06(UNSAT) depth K=1 took 15 ms
[2022-06-12 22:29:47] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-09(UNSAT) depth K=1 took 2 ms
[2022-06-12 22:29:47] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-12(UNSAT) depth K=1 took 10 ms
[2022-06-12 22:29:47] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=1 took 3 ms
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 264
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :264 after 402
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 1039 out of 1249 initially.
// Phase 1: matrix 1039 rows 543 cols
[2022-06-12 22:29:48] [INFO ] Computed 21 place invariants in 3 ms
inv : WantSection_0_T + WantSection_0_F = 1
inv : WantSection_6_T + WantSection_6_F = 1
inv : Turn_5_1 + Turn_5_0 + Turn_5_2 + Turn_5_3 + Turn_5_5 + Turn_5_4 + Turn_5_6 = 1
inv : WantSection_5_T + WantSection_5_F = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_5_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_3_1 + IsEndLoop_5_2_1 + IsEndLoop_5_4_1 + IsEndLoop_5_5_1 + IsEndLoop_5_0_2 + IsEndLoop_5_1_2 + IsEndLoop_5_2_2 + IsEndLoop_5_3_2 + IsEndLoop_5_5_2 + IsEndLoop_5_4_2 + IsEndLoop_5_1_3 + IsEndLoop_5_0_3 + IsEndLoop_5_3_3 + IsEndLoop_5_2_3 + IsEndLoop_5_5_3 + IsEndLoop_5_4_3 + IsEndLoop_5_2_4 + IsEndLoop_5_0_4 + IsEndLoop_5_1_4 + IsEndLoop_5_4_4 + IsEndLoop_5_3_4 + IsEndLoop_5_5_4 + IsEndLoop_5_2_6 + IsEndLoop_5_3_6 + IsEndLoop_5_0_6 + IsEndLoop_5_1_6 + EndTurn_5_1 + EndTurn_5_2 + IsEndLoop_5_4_6 + EndTurn_5_0 + EndTurn_5_5 + BeginLoop_5_1_0 + BeginLoop_5_0_0 + EndTurn_5_3 + EndTurn_5_4 + BeginLoop_5_4_0 + BeginLoop_5_5_0 + BeginLoop_5_2_0 + BeginLoop_5_3_0 + TestAlone_5_5_0 + TestAlone_5_0_0 + WantSection_5_F + TestAlone_5_1_2 + TestAlone_5_2_2 + TestTurn_5_5 + TestTurn_5_4 + TestTurn_5_3 + TestTurn_5_2 + TestTurn_5_1 + TestTurn_5_0 + AskForSection_5_3 + AskForSection_5_1 + AskForSection_5_2 + AskForSection_5_0 + CS_5 + AskForSection_5_5 + AskForSection_5_4 = 1
inv : Turn_3_0 + Turn_3_1 + Turn_3_2 + Turn_3_4 + Turn_3_3 + Turn_3_5 + Turn_3_6 = 1
inv : WantSection_2_T + WantSection_2_F = 1
inv : WantSection_4_T + WantSection_4_F = 1
inv : IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_4_1 + IsEndLoop_0_0_2 + IsEndLoop_0_5_1 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_3_2 + IsEndLoop_0_4_2 + IsEndLoop_0_5_2 + IsEndLoop_0_1_3 + IsEndLoop_0_2_3 + IsEndLoop_0_0_3 + IsEndLoop_0_4_3 + IsEndLoop_0_3_3 + IsEndLoop_0_0_4 + IsEndLoop_0_5_3 + IsEndLoop_0_2_4 + IsEndLoop_0_1_4 + IsEndLoop_0_5_4 + IsEndLoop_0_4_4 + IsEndLoop_0_3_4 + IsEndLoop_0_1_5 + IsEndLoop_0_0_5 + IsEndLoop_0_3_5 + IsEndLoop_0_2_5 + IsEndLoop_0_0_6 + IsEndLoop_0_5_5 + IsEndLoop_0_4_5 + IsEndLoop_0_3_6 + IsEndLoop_0_4_6 + IsEndLoop_0_1_6 + IsEndLoop_0_2_6 + EndTurn_0_1 + EndTurn_0_2 + EndTurn_0_3 + EndTurn_0_0 + BeginLoop_0_0_0 + BeginLoop_0_1_0 + EndTurn_0_4 + EndTurn_0_5 + BeginLoop_0_5_0 + BeginLoop_0_2_0 + BeginLoop_0_4_0 + BeginLoop_0_3_0 + BeginLoop_0_2_1 + TestAlone_0_0_1 + TestAlone_0_2_1 + WantSection_0_F + TestAlone_0_2_2 + TestAlone_0_1_5 + TestIdentity_0_0_0 + TestTurn_0_5 + TestTurn_0_4 + TestTurn_0_3 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_0 + TestIdentity_0_1_5 + AskForSection_0_3 + AskForSection_0_2 + AskForSection_0_1 + AskForSection_0_0 + CS_0 + AskForSection_0_4 + AskForSection_0_5 = 1
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_5_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_5_1 + IsEndLoop_4_0_2 + IsEndLoop_4_1_2 + IsEndLoop_4_2_2 + IsEndLoop_4_4_2 + IsEndLoop_4_3_2 + IsEndLoop_4_5_2 + IsEndLoop_4_1_3 + IsEndLoop_4_0_3 + IsEndLoop_4_3_3 + IsEndLoop_4_2_3 + IsEndLoop_4_5_3 + IsEndLoop_4_4_3 + IsEndLoop_4_0_5 + IsEndLoop_4_3_5 + IsEndLoop_4_2_5 + IsEndLoop_4_1_5 + IsEndLoop_4_5_5 + IsEndLoop_4_4_5 + IsEndLoop_4_2_6 + IsEndLoop_4_3_6 + IsEndLoop_4_4_6 + IsEndLoop_4_0_6 + IsEndLoop_4_1_6 + EndTurn_4_1 + EndTurn_4_2 + EndTurn_4_0 + BeginLoop_4_0_0 + EndTurn_4_5 + BeginLoop_4_1_0 + EndTurn_4_3 + EndTurn_4_4 + BeginLoop_4_4_0 + BeginLoop_4_5_0 + BeginLoop_4_2_0 + BeginLoop_4_3_0 + WantSection_4_F + TestAlone_4_2_0 + TestAlone_4_4_2 + TestAlone_4_5_1 + TestAlone_4_4_1 + TestAlone_4_3_3 + TestAlone_4_3_6 + TestAlone_4_4_6 + TestAlone_4_1_6 + TestAlone_4_2_6 + TestTurn_4_5 + TestTurn_4_4 + TestTurn_4_3 + TestTurn_4_2 + TestTurn_4_1 + TestTurn_4_0 + TestIdentity_4_5_1 + AskForSection_4_3 + AskForSection_4_2 + AskForSection_4_0 + AskForSection_4_1 + CS_4 + AskForSection_4_5 + AskForSection_4_4 = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_5_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_5_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_2_2 + IsEndLoop_3_4_2 + IsEndLoop_3_5_2 + IsEndLoop_3_0_4 + IsEndLoop_3_2_4 + IsEndLoop_3_1_4 + IsEndLoop_3_4_4 + IsEndLoop_3_3_4 + IsEndLoop_3_1_5 + IsEndLoop_3_0_5 + IsEndLoop_3_5_4 + IsEndLoop_3_3_5 + IsEndLoop_3_2_5 + IsEndLoop_3_5_5 + IsEndLoop_3_4_5 + IsEndLoop_3_2_6 + IsEndLoop_3_3_6 + IsEndLoop_3_4_6 + IsEndLoop_3_0_6 + IsEndLoop_3_1_6 + EndTurn_3_1 + EndTurn_3_2 + EndTurn_3_0 + BeginLoop_3_0_0 + BeginLoop_3_1_0 + EndTurn_3_3 + EndTurn_3_5 + EndTurn_3_4 + BeginLoop_3_4_0 + BeginLoop_3_5_0 + BeginLoop_3_2_0 + BeginLoop_3_3_0 + BeginLoop_3_1_2 + TestAlone_3_0_1 + TestAlone_3_5_0 + TestAlone_3_5_2 + TestAlone_3_1_2 + TestAlone_3_1_4 + TestAlone_3_1_6 + TestAlone_3_2_5 + TestTurn_3_5 + TestTurn_3_4 + TestTurn_3_3 + TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_0 + TestIdentity_3_2_5 + AskForSection_3_3 + AskForSection_3_2 + AskForSection_3_1 + Idle_3 + AskForSection_3_0 + CS_3 + AskForSection_3_5 + AskForSection_3_4 = 1
inv : Turn_0_0 + Turn_0_2 + Turn_0_1 + Turn_0_3 + Turn_0_4 + Turn_0_6 + Turn_0_5 = 1
inv : Turn_4_0 + Turn_4_1 + Turn_4_2 + Turn_4_4 + Turn_4_3 + Turn_4_5 + Turn_4_6 = 1
inv : WantSection_3_F - Idle_3 = 0
inv : Turn_2_0 + Turn_2_1 + Turn_2_3 + Turn_2_2 + Turn_2_4 + Turn_2_5 + Turn_2_6 = 1
inv : WantSection_3_T + Idle_3 = 1
inv : WantSection_1_T + WantSection_1_F = 1
inv : Turn_1_0 + Turn_1_1 + Turn_1_3 + Turn_1_2 + Turn_1_4 + Turn_1_5 + Turn_1_6 = 1
inv : IsEndLoop_6_0_0 + IsEndLoop_6_1_0 + IsEndLoop_6_2_0 + IsEndLoop_6_3_0 + IsEndLoop_6_4_0 + IsEndLoop_6_5_0 + IsEndLoop_6_0_1 + IsEndLoop_6_1_1 + IsEndLoop_6_2_1 + IsEndLoop_6_4_1 + IsEndLoop_6_3_1 + IsEndLoop_6_5_1 + IsEndLoop_6_0_2 + IsEndLoop_6_1_2 + IsEndLoop_6_2_2 + IsEndLoop_6_3_2 + IsEndLoop_6_4_2 + IsEndLoop_6_1_3 + IsEndLoop_6_5_2 + IsEndLoop_6_0_3 + IsEndLoop_6_3_3 + IsEndLoop_6_2_3 + IsEndLoop_6_5_3 + IsEndLoop_6_4_3 + IsEndLoop_6_1_4 + IsEndLoop_6_2_4 + IsEndLoop_6_0_4 + IsEndLoop_6_4_4 + IsEndLoop_6_3_4 + IsEndLoop_6_0_5 + IsEndLoop_6_5_4 + IsEndLoop_6_2_5 + IsEndLoop_6_1_5 + IsEndLoop_6_4_5 + IsEndLoop_6_3_5 + IsEndLoop_6_2_6 + EndTurn_6_1 + EndTurn_6_2 + IsEndLoop_6_4_6 + EndTurn_6_0 + EndTurn_6_5 + BeginLoop_6_0_0 + EndTurn_6_3 + EndTurn_6_4 + BeginLoop_6_4_0 + BeginLoop_6_5_0 + BeginLoop_6_2_0 + BeginLoop_6_1_0 + BeginLoop_6_3_0 + BeginLoop_6_4_4 + BeginLoop_6_2_6 + TestAlone_6_4_0 + WantSection_6_F + TestAlone_6_4_2 + TestAlone_6_0_2 + TestAlone_6_4_4 + TestAlone_6_1_4 + TestAlone_6_3_3 + TestAlone_6_3_5 + TestTurn_6_5 + TestTurn_6_4 + TestTurn_6_3 + TestTurn_6_2 + TestTurn_6_1 + TestTurn_6_0 + TestIdentity_6_3_3 + TestIdentity_6_4_6 + AskForSection_6_2 + AskForSection_6_3 + AskForSection_6_1 + AskForSection_6_0 + CS_6 + AskForSection_6_5 + AskForSection_6_4 = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_5_0 + IsEndLoop_1_1_2 + IsEndLoop_1_0_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_4_2 + IsEndLoop_1_5_2 + IsEndLoop_1_1_3 + IsEndLoop_1_0_3 + IsEndLoop_1_4_3 + IsEndLoop_1_2_3 + IsEndLoop_1_3_3 + IsEndLoop_1_0_4 + IsEndLoop_1_5_3 + IsEndLoop_1_2_4 + IsEndLoop_1_1_4 + IsEndLoop_1_5_4 + IsEndLoop_1_4_4 + IsEndLoop_1_3_4 + IsEndLoop_1_1_5 + IsEndLoop_1_0_5 + IsEndLoop_1_3_5 + IsEndLoop_1_2_5 + IsEndLoop_1_5_5 + IsEndLoop_1_4_5 + IsEndLoop_1_3_6 + IsEndLoop_1_4_6 + IsEndLoop_1_0_6 + IsEndLoop_1_1_6 + IsEndLoop_1_2_6 + EndTurn_1_1 + EndTurn_1_2 + EndTurn_1_3 + IsEndLoop_1_5_6 + EndTurn_1_0 + BeginLoop_1_0_0 + BeginLoop_1_1_0 + EndTurn_1_4 + EndTurn_1_5 + BeginLoop_1_5_0 + BeginLoop_1_4_0 + BeginLoop_1_2_0 + BeginLoop_1_3_0 + BeginLoop_1_4_1 + BeginLoop_1_5_2 + BeginLoop_1_4_2 + WantSection_1_F + TestAlone_1_4_2 + TestAlone_1_5_2 + TestAlone_1_4_6 + TestTurn_1_5 + TestTurn_1_4 + TestTurn_1_3 + TestTurn_1_2 + TestTurn_1_1 + TestTurn_1_0 + TestIdentity_1_4_2 + TestIdentity_1_4_6 + AskForSection_1_3 + AskForSection_1_2 + AskForSection_1_1 + AskForSection_1_0 + AskForSection_1_5 + CS_1 + AskForSection_1_4 = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_5_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_5_1 + IsEndLoop_2_1_3 + IsEndLoop_2_0_3 + IsEndLoop_2_3_3 + IsEndLoop_2_4_3 + IsEndLoop_2_2_3 + IsEndLoop_2_0_4 + IsEndLoop_2_5_3 + IsEndLoop_2_2_4 + IsEndLoop_2_1_4 + IsEndLoop_2_4_4 + IsEndLoop_2_3_4 + IsEndLoop_2_1_5 + IsEndLoop_2_0_5 + IsEndLoop_2_5_4 + IsEndLoop_2_3_5 + IsEndLoop_2_2_5 + IsEndLoop_2_5_5 + IsEndLoop_2_4_5 + IsEndLoop_2_3_6 + IsEndLoop_2_4_6 + IsEndLoop_2_0_6 + IsEndLoop_2_1_6 + IsEndLoop_2_2_6 + EndTurn_2_1 + EndTurn_2_2 + EndTurn_2_0 + BeginLoop_2_0_0 + BeginLoop_2_1_0 + EndTurn_2_4 + EndTurn_2_3 + EndTurn_2_5 + BeginLoop_2_4_0 + BeginLoop_2_5_0 + BeginLoop_2_2_0 + BeginLoop_2_3_0 + BeginLoop_2_2_2 + BeginLoop_2_2_4 + BeginLoop_2_5_6 + BeginLoop_2_1_6 + TestAlone_2_5_0 + TestAlone_2_4_0 + TestAlone_2_1_0 + WantSection_2_F + TestAlone_2_3_0 + TestAlone_2_2_4 + TestAlone_2_2_3 + TestAlone_2_5_6 + TestAlone_2_1_6 + TestAlone_2_4_5 + TestAlone_2_5_5 + TestTurn_2_5 + TestTurn_2_4 + TestTurn_2_3 + TestTurn_2_2 + TestTurn_2_1 + TestTurn_2_0 + AskForSection_2_3 + AskForSection_2_2 + AskForSection_2_1 + AskForSection_2_0 + CS_2 + AskForSection_2_5 + AskForSection_2_4 = 1
Total of 21 invariants.
[2022-06-12 22:29:48] [INFO ] Computed 21 place invariants in 4 ms
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :402 after 557104
[2022-06-12 22:29:49] [INFO ] Proved 543 variables to be positive in 1082 ms
[2022-06-12 22:29:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-06
[2022-06-12 22:29:49] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-06(SAT) depth K=0 took 134 ms
[2022-06-12 22:29:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-09
[2022-06-12 22:29:49] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-09(SAT) depth K=0 took 114 ms
[2022-06-12 22:29:49] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-06(UNSAT) depth K=2 took 1755 ms
[2022-06-12 22:29:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-12
[2022-06-12 22:29:49] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-12(SAT) depth K=0 took 108 ms
[2022-06-12 22:29:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-15
[2022-06-12 22:29:49] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-15(SAT) depth K=0 took 81 ms
[2022-06-12 22:29:49] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-09(UNSAT) depth K=2 took 360 ms
[2022-06-12 22:29:50] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-12(UNSAT) depth K=2 took 509 ms
[2022-06-12 22:29:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-06
[2022-06-12 22:29:50] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-06(SAT) depth K=1 took 965 ms
[2022-06-12 22:29:50] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=2 took 321 ms
[2022-06-12 22:29:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-09
[2022-06-12 22:29:51] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-09(SAT) depth K=1 took 791 ms
[2022-06-12 22:29:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-12
[2022-06-12 22:29:52] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-12(SAT) depth K=1 took 633 ms
[2022-06-12 22:29:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-15
[2022-06-12 22:29:52] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-15(SAT) depth K=1 took 815 ms
Compilation finished in 9013 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5318865266186197247]
Link finished in 79 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability06==true], workingDir=/tmp/ltsmin5318865266186197247]
[2022-06-12 22:30:25] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-06(UNSAT) depth K=3 took 34527 ms
[2022-06-12 22:31:34] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-09(UNSAT) depth K=3 took 69213 ms
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :557104 after 2.07667e+08
[2022-06-12 22:32:21] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-12(UNSAT) depth K=3 took 46833 ms
[2022-06-12 22:32:56] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=3 took 35509 ms
[2022-06-12 22:34:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-06
[2022-06-12 22:34:03] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-06(SAT) depth K=2 took 251108 ms
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2.07667e+08 after 5.5389e+08
[2022-06-12 22:37:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-09
[2022-06-12 22:37:22] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-09(SAT) depth K=2 took 198877 ms
[2022-06-12 22:38:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-12
[2022-06-12 22:38:16] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-12(SAT) depth K=2 took 53447 ms
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :5.5389e+08 after 5.57856e+08
[2022-06-12 22:42:39] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-06(UNSAT) depth K=4 took 582632 ms
[2022-06-12 22:43:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-15
[2022-06-12 22:43:01] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-15(SAT) depth K=2 took 285302 ms
[2022-06-12 22:43:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-6-ReachabilityFireability-06
[2022-06-12 22:43:12] [INFO ] KInduction solution for property Peterson-PT-6-ReachabilityFireability-06(SAT) depth K=3 took 11032 ms
WARNING : LTSmin timed out (>900 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability06==true], workingDir=/tmp/ltsmin5318865266186197247]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability09==true], workingDir=/tmp/ltsmin5318865266186197247]
[2022-06-12 22:47:58] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-09(UNSAT) depth K=4 took 319274 ms
Detected timeout of ITS tools.
[2022-06-12 22:54:30] [INFO ] Applying decomposition
[2022-06-12 22:54:30] [INFO ] Flatten gal took : 141 ms
[2022-06-12 22:54:30] [INFO ] Decomposing Gal with order
[2022-06-12 22:54:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:54:30] [INFO ] Removed a total of 1422 redundant transitions.
[2022-06-12 22:54:30] [INFO ] Flatten gal took : 265 ms
[2022-06-12 22:54:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 460 labels/synchronizations in 52 ms.
[2022-06-12 22:54:30] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14417233093746295273.gal : 35 ms
[2022-06-12 22:54:30] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17791078410219846078.prop : 9 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/ReachabilityFireability14417233093746295273.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability17791078410219846078.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/ReachabilityFireability14417233093746295273.gal -t CGAL -reachable-file /tmp/ReachabilityFireability17791078410219846078.prop --nowitness
Loading property file /tmp/ReachabilityFireability17791078410219846078.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :4 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :36 after 428
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :428 after 17438
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :17438 after 5.30826e+06
[2022-06-12 22:57:49] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-12(UNSAT) depth K=4 took 590643 ms
WARNING : LTSmin timed out (>900 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability09==true], workingDir=/tmp/ltsmin5318865266186197247]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability12==true], workingDir=/tmp/ltsmin5318865266186197247]
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :5.30826e+06 after 2.97995e+07
[2022-06-12 23:04:45] [INFO ] BMC solution for property Peterson-PT-6-ReachabilityFireability-15(UNSAT) depth K=4 took 415954 ms
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.30372e+08 after 1.30525e+08
WARNING : LTSmin timed out (>900 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability12==true], workingDir=/tmp/ltsmin5318865266186197247]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT6ReachabilityFireability15==true], workingDir=/tmp/ltsmin5318865266186197247]

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="Peterson-PT-6"
export BK_EXAMINATION="ReachabilityFireability"
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 Peterson-PT-6, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277026700033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;