fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r227-tall-162098231300432
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ShieldPPPt-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4312.760 3600000.00 3688368.00 8216.10 TTTTTFTTTFTTFTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r227-tall-162098231300432.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ShieldPPPt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231300432
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 18:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 18:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 1.9M May 5 16:52 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 ShieldPPPt-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621188203076

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 18:03:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-16 18:03:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 18:03:25] [INFO ] Load time of PNML (sax parser for PT used): 256 ms
[2021-05-16 18:03:25] [INFO ] Transformed 7803 places.
[2021-05-16 18:03:25] [INFO ] Transformed 7103 transitions.
[2021-05-16 18:03:25] [INFO ] Found NUPN structural information;
[2021-05-16 18:03:25] [INFO ] Parsed PT model containing 7803 places and 7103 transitions in 657 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 310 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 254 ms. (steps per millisecond=39 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0]
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 7103 rows 7803 cols
[2021-05-16 18:03:26] [INFO ] Computed 1101 place invariants in 150 ms
[2021-05-16 18:03:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 3720 ms returned (error "Solver has unexpectedly terminated")
[2021-05-16 18:03:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:03:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
[2021-05-16 18:03:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 18:03:36] [INFO ] [Real]Absence check using 1101 positive place invariants in 3877 ms returned (error "Failed to check-sat")
[2021-05-16 18:03:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:03:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 1
[2021-05-16 18:03:41] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 18:03:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 4063 ms returned (error "Failed to check-sat")
[2021-05-16 18:03:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:03:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 2
[2021-05-16 18:03:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 18:03:46] [INFO ] [Real]Absence check using 1101 positive place invariants in 3874 ms returned (error "Failed to check-sat")
[2021-05-16 18:03:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:03:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 3
[2021-05-16 18:03:51] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 18:03:51] [INFO ] [Real]Absence check using 1101 positive place invariants in 3963 ms returned (error "Failed to check-sat")
[2021-05-16 18:03:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:03:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 4
[2021-05-16 18:03:56] [INFO ] [Real]Absence check using 1101 positive place invariants in 4013 ms returned (error "Failed to check-sat")
[2021-05-16 18:03:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:03:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 5
[2021-05-16 18:04:01] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 18:04:01] [INFO ] [Real]Absence check using 1101 positive place invariants in 4053 ms returned (error "Failed to check-sat")
[2021-05-16 18:04:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:04:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 6
[2021-05-16 18:04:06] [INFO ] [Real]Absence check using 1101 positive place invariants in 3892 ms returned (error "Failed to check-sat")
[2021-05-16 18:04:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:04:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 7
[2021-05-16 18:04:11] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 18:04:11] [INFO ] [Real]Absence check using 1101 positive place invariants in 4063 ms returned (error "Failed to check-sat")
[2021-05-16 18:04:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:04:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 8
[2021-05-16 18:04:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 18:04:16] [INFO ] [Real]Absence check using 1101 positive place invariants in 4076 ms returned (error "Failed to check-sat")
[2021-05-16 18:04:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:04:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 9
[2021-05-16 18:04:21] [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: Broken pipe (= 1 (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s5878 s5879 s5880 s5881 s5882 s5883 s5903 s5904 s5905 s5908 s5909))") while checking expression at index 10
[2021-05-16 18:04:26] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 18:04:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 4075 ms returned (error "Failed to check-sat")
[2021-05-16 18:04:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:04:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 11
Support contains 78 out of 7803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Performed 1862 Post agglomeration using F-continuation condition.Transition count delta: 1862
Iterating post reduction 0 with 1862 rules applied. Total rules applied 1862 place count 7803 transition count 5241
Reduce places removed 1862 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1864 rules applied. Total rules applied 3726 place count 5941 transition count 5239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3727 place count 5940 transition count 5239
Performed 406 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 406 Pre rules applied. Total rules applied 3727 place count 5940 transition count 4833
Deduced a syphon composed of 406 places in 57 ms
Reduce places removed 406 places and 0 transitions.
Iterating global reduction 3 with 812 rules applied. Total rules applied 4539 place count 5534 transition count 4833
Symmetric choice reduction at 3 with 684 rule applications. Total rules 5223 place count 5534 transition count 4833
Deduced a syphon composed of 684 places in 71 ms
Reduce places removed 684 places and 684 transitions.
Iterating global reduction 3 with 1368 rules applied. Total rules applied 6591 place count 4850 transition count 4149
Performed 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 283 Pre rules applied. Total rules applied 6591 place count 4850 transition count 3866
Deduced a syphon composed of 283 places in 19 ms
Reduce places removed 283 places and 0 transitions.
Iterating global reduction 3 with 566 rules applied. Total rules applied 7157 place count 4567 transition count 3866
Performed 1684 Post agglomeration using F-continuation condition.Transition count delta: 1684
Deduced a syphon composed of 1684 places in 10 ms
Reduce places removed 1684 places and 0 transitions.
Iterating global reduction 3 with 3368 rules applied. Total rules applied 10525 place count 2883 transition count 2182
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 14 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10727 place count 2782 transition count 2182
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10929 place count 2681 transition count 2182
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 5 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 11095 place count 2598 transition count 2182
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 11098 place count 2598 transition count 2179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 11101 place count 2595 transition count 2179
Partial Free-agglomeration rule applied 283 times.
Drop transitions removed 283 transitions
Iterating global reduction 4 with 283 rules applied. Total rules applied 11384 place count 2595 transition count 2179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 11385 place count 2594 transition count 2178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 11386 place count 2593 transition count 2178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 11386 place count 2593 transition count 2176
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 11390 place count 2591 transition count 2176
Applied a total of 11390 rules in 3308 ms. Remains 2591 /7803 variables (removed 5212) and now considering 2176/7103 (removed 4927) transitions.
Finished structural reductions, in 1 iterations. Remains : 2591/7803 places, 2176/7103 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 15856 ms. (steps per millisecond=63 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 477603 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 496350 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 485455 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 471243 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 470801 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 497770 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 464084 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 473946 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 463807 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 459973 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2176 rows 2591 cols
[2021-05-16 18:05:36] [INFO ] Computed 1100 place invariants in 14 ms
[2021-05-16 18:05:37] [INFO ] [Real]Absence check using 1100 positive place invariants in 1241 ms returned sat
[2021-05-16 18:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:05:49] [INFO ] [Real]Absence check using state equation in 12301 ms returned sat
[2021-05-16 18:05:50] [INFO ] State equation strengthened by 399 read => feed constraints.
[2021-05-16 18:05:50] [INFO ] [Real]Added 399 Read/Feed constraints in 74 ms returned sat
[2021-05-16 18:05:50] [INFO ] Deduced a trap composed of 7 places in 389 ms
[2021-05-16 18:05:51] [INFO ] Deduced a trap composed of 7 places in 357 ms
[2021-05-16 18:05:51] [INFO ] Deduced a trap composed of 6 places in 370 ms
[2021-05-16 18:05:51] [INFO ] Deduced a trap composed of 3 places in 364 ms
[2021-05-16 18:05:52] [INFO ] Deduced a trap composed of 5 places in 363 ms
[2021-05-16 18:05:52] [INFO ] Deduced a trap composed of 5 places in 337 ms
[2021-05-16 18:05:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2823 ms
[2021-05-16 18:05:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:05:54] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1266 ms returned sat
[2021-05-16 18:05:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:06:07] [INFO ] [Nat]Absence check using state equation in 12326 ms returned sat
[2021-05-16 18:06:07] [INFO ] [Nat]Added 399 Read/Feed constraints in 198 ms returned sat
[2021-05-16 18:06:07] [INFO ] Deduced a trap composed of 4 places in 204 ms
[2021-05-16 18:06:07] [INFO ] Deduced a trap composed of 6 places in 132 ms
[2021-05-16 18:06:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 621 ms
[2021-05-16 18:06:07] [INFO ] Computed and/alt/rep : 2158/7483/2158 causal constraints in 138 ms.
[2021-05-16 18:06:28] [INFO ] Added : 720 causal constraints over 144 iterations in 20185 ms.(timeout) Result :sat
[2021-05-16 18:06:28] [INFO ] Deduced a trap composed of 5 places in 175 ms
[2021-05-16 18:06:28] [INFO ] Deduced a trap composed of 6 places in 166 ms
[2021-05-16 18:06:28] [INFO ] Deduced a trap composed of 5 places in 163 ms
[2021-05-16 18:06:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1044 ms
Attempting to minimize the solution found.
Minimization took 66 ms.
[2021-05-16 18:06:30] [INFO ] [Real]Absence check using 1100 positive place invariants in 1192 ms returned sat
[2021-05-16 18:06:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:06:43] [INFO ] [Real]Absence check using state equation in 12595 ms returned sat
[2021-05-16 18:06:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:06:44] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1196 ms returned sat
[2021-05-16 18:06:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:06:57] [INFO ] [Nat]Absence check using state equation in 12389 ms returned sat
[2021-05-16 18:06:57] [INFO ] [Nat]Added 399 Read/Feed constraints in 115 ms returned sat
[2021-05-16 18:06:57] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2021-05-16 18:06:57] [INFO ] Deduced a trap composed of 6 places in 133 ms
[2021-05-16 18:06:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 499 ms
[2021-05-16 18:06:58] [INFO ] Computed and/alt/rep : 2158/7483/2158 causal constraints in 135 ms.
[2021-05-16 18:07:18] [INFO ] Added : 730 causal constraints over 146 iterations in 20221 ms.(timeout) Result :sat
[2021-05-16 18:07:18] [INFO ] Deduced a trap composed of 7 places in 194 ms
[2021-05-16 18:07:18] [INFO ] Deduced a trap composed of 7 places in 205 ms
[2021-05-16 18:07:19] [INFO ] Deduced a trap composed of 7 places in 206 ms
[2021-05-16 18:07:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1098 ms
Attempting to minimize the solution found.
Minimization took 55 ms.
[2021-05-16 18:07:20] [INFO ] [Real]Absence check using 1100 positive place invariants in 1206 ms returned sat
[2021-05-16 18:07:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:07:33] [INFO ] [Real]Absence check using state equation in 12645 ms returned sat
[2021-05-16 18:07:33] [INFO ] [Real]Added 399 Read/Feed constraints in 61 ms returned sat
[2021-05-16 18:07:34] [INFO ] Deduced a trap composed of 4 places in 283 ms
[2021-05-16 18:07:34] [INFO ] Deduced a trap composed of 4 places in 289 ms
[2021-05-16 18:07:34] [INFO ] Deduced a trap composed of 3 places in 291 ms
[2021-05-16 18:07:35] [INFO ] Deduced a trap composed of 6 places in 274 ms
[2021-05-16 18:07:35] [INFO ] Deduced a trap composed of 5 places in 272 ms
[2021-05-16 18:07:35] [INFO ] Deduced a trap composed of 3 places in 270 ms
[2021-05-16 18:07:36] [INFO ] Deduced a trap composed of 8 places in 265 ms
[2021-05-16 18:07:36] [INFO ] Deduced a trap composed of 3 places in 272 ms
[2021-05-16 18:07:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3010 ms
[2021-05-16 18:07:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:07:38] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1225 ms returned sat
[2021-05-16 18:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:07:51] [INFO ] [Nat]Absence check using state equation in 12638 ms returned sat
[2021-05-16 18:07:51] [INFO ] [Nat]Added 399 Read/Feed constraints in 252 ms returned sat
[2021-05-16 18:07:51] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2021-05-16 18:07:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2021-05-16 18:07:51] [INFO ] Computed and/alt/rep : 2158/7483/2158 causal constraints in 113 ms.
[2021-05-16 18:08:11] [INFO ] Added : 730 causal constraints over 146 iterations in 20071 ms.(timeout) Result :sat
[2021-05-16 18:08:11] [INFO ] Deduced a trap composed of 9 places in 163 ms
[2021-05-16 18:08:12] [INFO ] Deduced a trap composed of 6 places in 154 ms
[2021-05-16 18:08:12] [INFO ] Deduced a trap composed of 6 places in 161 ms
[2021-05-16 18:08:12] [INFO ] Deduced a trap composed of 6 places in 156 ms
[2021-05-16 18:08:13] [INFO ] Deduced a trap composed of 7 places in 159 ms
[2021-05-16 18:08:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1605 ms
Attempting to minimize the solution found.
Minimization took 70 ms.
[2021-05-16 18:08:15] [INFO ] [Real]Absence check using 1100 positive place invariants in 1195 ms returned sat
[2021-05-16 18:08:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:08:27] [INFO ] [Real]Absence check using state equation in 12462 ms returned sat
[2021-05-16 18:08:27] [INFO ] [Real]Added 399 Read/Feed constraints in 58 ms returned sat
[2021-05-16 18:08:28] [INFO ] Deduced a trap composed of 3 places in 341 ms
[2021-05-16 18:08:28] [INFO ] Deduced a trap composed of 5 places in 346 ms
[2021-05-16 18:08:28] [INFO ] Deduced a trap composed of 3 places in 353 ms
[2021-05-16 18:08:29] [INFO ] Deduced a trap composed of 5 places in 354 ms
[2021-05-16 18:08:29] [INFO ] Deduced a trap composed of 11 places in 345 ms
[2021-05-16 18:08:30] [INFO ] Deduced a trap composed of 7 places in 339 ms
[2021-05-16 18:08:30] [INFO ] Deduced a trap composed of 3 places in 362 ms
[2021-05-16 18:08:31] [INFO ] Deduced a trap composed of 7 places in 359 ms
[2021-05-16 18:08:31] [INFO ] Deduced a trap composed of 5 places in 322 ms
[2021-05-16 18:08:31] [INFO ] Deduced a trap composed of 5 places in 355 ms
[2021-05-16 18:08:32] [INFO ] Deduced a trap composed of 6 places in 320 ms
[2021-05-16 18:08:32] [INFO ] Deduced a trap composed of 14 places in 342 ms
[2021-05-16 18:08:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5254 ms
[2021-05-16 18:08:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:08:34] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1200 ms returned sat
[2021-05-16 18:08:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:08:47] [INFO ] [Nat]Absence check using state equation in 13055 ms returned sat
[2021-05-16 18:08:47] [INFO ] [Nat]Added 399 Read/Feed constraints in 165 ms returned sat
[2021-05-16 18:08:47] [INFO ] Deduced a trap composed of 6 places in 131 ms
[2021-05-16 18:08:48] [INFO ] Deduced a trap composed of 6 places in 143 ms
[2021-05-16 18:08:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 639 ms
[2021-05-16 18:08:48] [INFO ] Computed and/alt/rep : 2158/7483/2158 causal constraints in 108 ms.
[2021-05-16 18:09:08] [INFO ] Added : 750 causal constraints over 150 iterations in 20083 ms.(timeout) Result :sat
[2021-05-16 18:09:08] [INFO ] Deduced a trap composed of 3 places in 154 ms
[2021-05-16 18:09:08] [INFO ] Deduced a trap composed of 6 places in 152 ms
[2021-05-16 18:09:09] [INFO ] Deduced a trap composed of 7 places in 149 ms
[2021-05-16 18:09:09] [INFO ] Deduced a trap composed of 8 places in 148 ms
[2021-05-16 18:09:09] [INFO ] Deduced a trap composed of 7 places in 154 ms
[2021-05-16 18:09:10] [INFO ] Deduced a trap composed of 6 places in 147 ms
[2021-05-16 18:09:10] [INFO ] Deduced a trap composed of 5 places in 158 ms
[2021-05-16 18:09:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2180 ms
Attempting to minimize the solution found.
Minimization took 62 ms.
[2021-05-16 18:09:12] [INFO ] [Real]Absence check using 1100 positive place invariants in 1192 ms returned sat
[2021-05-16 18:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:09:24] [INFO ] [Real]Absence check using state equation in 12068 ms returned sat
[2021-05-16 18:09:24] [INFO ] [Real]Added 399 Read/Feed constraints in 57 ms returned sat
[2021-05-16 18:09:24] [INFO ] Deduced a trap composed of 5 places in 287 ms
[2021-05-16 18:09:25] [INFO ] Deduced a trap composed of 7 places in 310 ms
[2021-05-16 18:09:25] [INFO ] Deduced a trap composed of 3 places in 297 ms
[2021-05-16 18:09:26] [INFO ] Deduced a trap composed of 3 places in 293 ms
[2021-05-16 18:09:26] [INFO ] Deduced a trap composed of 3 places in 280 ms
[2021-05-16 18:09:26] [INFO ] Deduced a trap composed of 7 places in 284 ms
[2021-05-16 18:09:27] [INFO ] Deduced a trap composed of 5 places in 321 ms
[2021-05-16 18:09:27] [INFO ] Deduced a trap composed of 6 places in 271 ms
[2021-05-16 18:09:27] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2021-05-16 18:09:28] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2021-05-16 18:09:28] [INFO ] Deduced a trap composed of 4 places in 283 ms
[2021-05-16 18:09:29] [INFO ] Deduced a trap composed of 6 places in 282 ms
[2021-05-16 18:09:29] [INFO ] Deduced a trap composed of 8 places in 299 ms
[2021-05-16 18:09:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5016 ms
[2021-05-16 18:09:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:09:31] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1211 ms returned sat
[2021-05-16 18:09:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:09:43] [INFO ] [Nat]Absence check using state equation in 12342 ms returned sat
[2021-05-16 18:09:43] [INFO ] [Nat]Added 399 Read/Feed constraints in 252 ms returned sat
[2021-05-16 18:09:43] [INFO ] Deduced a trap composed of 6 places in 134 ms
[2021-05-16 18:09:44] [INFO ] Deduced a trap composed of 5 places in 153 ms
[2021-05-16 18:09:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 534 ms
[2021-05-16 18:09:44] [INFO ] Computed and/alt/rep : 2158/7483/2158 causal constraints in 114 ms.
[2021-05-16 18:10:04] [INFO ] Added : 745 causal constraints over 149 iterations in 20086 ms.(timeout) Result :sat
[2021-05-16 18:10:04] [INFO ] Deduced a trap composed of 6 places in 179 ms
[2021-05-16 18:10:04] [INFO ] Deduced a trap composed of 5 places in 174 ms
[2021-05-16 18:10:05] [INFO ] Deduced a trap composed of 3 places in 162 ms
[2021-05-16 18:10:05] [INFO ] Deduced a trap composed of 3 places in 162 ms
[2021-05-16 18:10:05] [INFO ] Deduced a trap composed of 5 places in 164 ms
[2021-05-16 18:10:06] [INFO ] Deduced a trap composed of 5 places in 161 ms
[2021-05-16 18:10:06] [INFO ] Deduced a trap composed of 6 places in 158 ms
[2021-05-16 18:10:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2202 ms
Attempting to minimize the solution found.
Minimization took 52 ms.
[2021-05-16 18:10:08] [INFO ] [Real]Absence check using 1100 positive place invariants in 1190 ms returned sat
[2021-05-16 18:10:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:10:20] [INFO ] [Real]Absence check using state equation in 12167 ms returned sat
[2021-05-16 18:10:20] [INFO ] [Real]Added 399 Read/Feed constraints in 63 ms returned sat
[2021-05-16 18:10:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:10:22] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1168 ms returned sat
[2021-05-16 18:10:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:10:34] [INFO ] [Nat]Absence check using state equation in 12076 ms returned sat
[2021-05-16 18:10:34] [INFO ] [Nat]Added 399 Read/Feed constraints in 119 ms returned sat
[2021-05-16 18:10:34] [INFO ] Deduced a trap composed of 6 places in 117 ms
[2021-05-16 18:10:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2021-05-16 18:10:34] [INFO ] Computed and/alt/rep : 2158/7483/2158 causal constraints in 112 ms.
[2021-05-16 18:10:54] [INFO ] Added : 725 causal constraints over 145 iterations in 20180 ms.(timeout) Result :sat
[2021-05-16 18:10:54] [INFO ] Deduced a trap composed of 7 places in 151 ms
[2021-05-16 18:10:55] [INFO ] Deduced a trap composed of 6 places in 148 ms
[2021-05-16 18:10:55] [INFO ] Deduced a trap composed of 7 places in 144 ms
[2021-05-16 18:10:55] [INFO ] Deduced a trap composed of 8 places in 146 ms
[2021-05-16 18:10:56] [INFO ] Deduced a trap composed of 8 places in 152 ms
[2021-05-16 18:10:56] [INFO ] Deduced a trap composed of 8 places in 138 ms
[2021-05-16 18:10:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1914 ms
Attempting to minimize the solution found.
Minimization took 64 ms.
[2021-05-16 18:10:58] [INFO ] [Real]Absence check using 1100 positive place invariants in 1214 ms returned sat
[2021-05-16 18:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:11:10] [INFO ] [Real]Absence check using state equation in 11886 ms returned sat
[2021-05-16 18:11:10] [INFO ] [Real]Added 399 Read/Feed constraints in 56 ms returned sat
[2021-05-16 18:11:10] [INFO ] Deduced a trap composed of 7 places in 341 ms
[2021-05-16 18:11:11] [INFO ] Deduced a trap composed of 5 places in 334 ms
[2021-05-16 18:11:11] [INFO ] Deduced a trap composed of 5 places in 328 ms
[2021-05-16 18:11:12] [INFO ] Deduced a trap composed of 5 places in 341 ms
[2021-05-16 18:11:12] [INFO ] Deduced a trap composed of 4 places in 340 ms
[2021-05-16 18:11:12] [INFO ] Deduced a trap composed of 7 places in 305 ms
[2021-05-16 18:11:13] [INFO ] Deduced a trap composed of 6 places in 302 ms
[2021-05-16 18:11:13] [INFO ] Deduced a trap composed of 7 places in 340 ms
[2021-05-16 18:11:14] [INFO ] Deduced a trap composed of 5 places in 312 ms
[2021-05-16 18:11:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3863 ms
[2021-05-16 18:11:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:11:15] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1194 ms returned sat
[2021-05-16 18:11:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:11:27] [INFO ] [Nat]Absence check using state equation in 12088 ms returned sat
[2021-05-16 18:11:28] [INFO ] [Nat]Added 399 Read/Feed constraints in 202 ms returned sat
[2021-05-16 18:11:28] [INFO ] Deduced a trap composed of 5 places in 147 ms
[2021-05-16 18:11:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2021-05-16 18:11:28] [INFO ] Computed and/alt/rep : 2158/7483/2158 causal constraints in 125 ms.
[2021-05-16 18:11:48] [INFO ] Added : 730 causal constraints over 146 iterations in 20144 ms.(timeout) Result :sat
[2021-05-16 18:11:48] [INFO ] Deduced a trap composed of 7 places in 170 ms
[2021-05-16 18:11:49] [INFO ] Deduced a trap composed of 6 places in 167 ms
[2021-05-16 18:11:49] [INFO ] Deduced a trap composed of 5 places in 172 ms
[2021-05-16 18:11:49] [INFO ] Deduced a trap composed of 5 places in 156 ms
[2021-05-16 18:11:50] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2021-05-16 18:11:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1649 ms
Attempting to minimize the solution found.
Minimization took 59 ms.
[2021-05-16 18:11:51] [INFO ] [Real]Absence check using 1100 positive place invariants in 1207 ms returned sat
[2021-05-16 18:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:12:03] [INFO ] [Real]Absence check using state equation in 11972 ms returned sat
[2021-05-16 18:12:03] [INFO ] [Real]Added 399 Read/Feed constraints in 60 ms returned sat
[2021-05-16 18:12:04] [INFO ] Deduced a trap composed of 6 places in 293 ms
[2021-05-16 18:12:04] [INFO ] Deduced a trap composed of 6 places in 300 ms
[2021-05-16 18:12:05] [INFO ] Deduced a trap composed of 6 places in 290 ms
[2021-05-16 18:12:05] [INFO ] Deduced a trap composed of 3 places in 281 ms
[2021-05-16 18:12:05] [INFO ] Deduced a trap composed of 6 places in 293 ms
[2021-05-16 18:12:06] [INFO ] Deduced a trap composed of 5 places in 290 ms
[2021-05-16 18:12:06] [INFO ] Deduced a trap composed of 5 places in 285 ms
[2021-05-16 18:12:07] [INFO ] Deduced a trap composed of 6 places in 286 ms
[2021-05-16 18:12:07] [INFO ] Deduced a trap composed of 8 places in 299 ms
[2021-05-16 18:12:07] [INFO ] Deduced a trap composed of 5 places in 272 ms
[2021-05-16 18:12:08] [INFO ] Deduced a trap composed of 8 places in 275 ms
[2021-05-16 18:12:08] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4220 ms
[2021-05-16 18:12:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:12:09] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1190 ms returned sat
[2021-05-16 18:12:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:12:21] [INFO ] [Nat]Absence check using state equation in 12111 ms returned sat
[2021-05-16 18:12:22] [INFO ] [Nat]Added 399 Read/Feed constraints in 148 ms returned sat
[2021-05-16 18:12:22] [INFO ] Deduced a trap composed of 7 places in 147 ms
[2021-05-16 18:12:22] [INFO ] Deduced a trap composed of 6 places in 147 ms
[2021-05-16 18:12:22] [INFO ] Deduced a trap composed of 5 places in 145 ms
[2021-05-16 18:12:22] [INFO ] Deduced a trap composed of 6 places in 143 ms
[2021-05-16 18:12:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 988 ms
[2021-05-16 18:12:23] [INFO ] Computed and/alt/rep : 2158/7483/2158 causal constraints in 126 ms.
[2021-05-16 18:12:43] [INFO ] Added : 755 causal constraints over 151 iterations in 20108 ms.(timeout) Result :sat
[2021-05-16 18:12:43] [INFO ] Deduced a trap composed of 5 places in 174 ms
[2021-05-16 18:12:43] [INFO ] Deduced a trap composed of 6 places in 175 ms
[2021-05-16 18:12:44] [INFO ] Deduced a trap composed of 6 places in 186 ms
[2021-05-16 18:12:44] [INFO ] Deduced a trap composed of 6 places in 181 ms
[2021-05-16 18:12:44] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2021-05-16 18:12:45] [INFO ] Deduced a trap composed of 7 places in 165 ms
[2021-05-16 18:12:45] [INFO ] Deduced a trap composed of 5 places in 161 ms
[2021-05-16 18:12:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2321 ms
Attempting to minimize the solution found.
Minimization took 63 ms.
[2021-05-16 18:12:47] [INFO ] [Real]Absence check using 1100 positive place invariants in 1193 ms returned sat
[2021-05-16 18:12:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:12:59] [INFO ] [Real]Absence check using state equation in 11954 ms returned sat
[2021-05-16 18:12:59] [INFO ] [Real]Added 399 Read/Feed constraints in 57 ms returned sat
[2021-05-16 18:12:59] [INFO ] Deduced a trap composed of 3 places in 301 ms
[2021-05-16 18:12:59] [INFO ] Deduced a trap composed of 3 places in 291 ms
[2021-05-16 18:13:00] [INFO ] Deduced a trap composed of 5 places in 276 ms
[2021-05-16 18:13:00] [INFO ] Deduced a trap composed of 5 places in 266 ms
[2021-05-16 18:13:01] [INFO ] Deduced a trap composed of 7 places in 272 ms
[2021-05-16 18:13:01] [INFO ] Deduced a trap composed of 8 places in 291 ms
[2021-05-16 18:13:01] [INFO ] Deduced a trap composed of 5 places in 253 ms
[2021-05-16 18:13:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2665 ms
[2021-05-16 18:13:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:13:03] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1199 ms returned sat
[2021-05-16 18:13:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:13:15] [INFO ] [Nat]Absence check using state equation in 12165 ms returned sat
[2021-05-16 18:13:15] [INFO ] [Nat]Added 399 Read/Feed constraints in 110 ms returned sat
[2021-05-16 18:13:15] [INFO ] Deduced a trap composed of 5 places in 131 ms
[2021-05-16 18:13:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2021-05-16 18:13:16] [INFO ] Computed and/alt/rep : 2158/7483/2158 causal constraints in 107 ms.
[2021-05-16 18:13:36] [INFO ] Added : 755 causal constraints over 151 iterations in 20170 ms.(timeout) Result :sat
[2021-05-16 18:13:36] [INFO ] Deduced a trap composed of 6 places in 180 ms
[2021-05-16 18:13:36] [INFO ] Deduced a trap composed of 5 places in 160 ms
[2021-05-16 18:13:37] [INFO ] Deduced a trap composed of 5 places in 172 ms
[2021-05-16 18:13:37] [INFO ] Deduced a trap composed of 5 places in 170 ms
[2021-05-16 18:13:37] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2021-05-16 18:13:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1649 ms
Attempting to minimize the solution found.
Minimization took 59 ms.
[2021-05-16 18:13:39] [INFO ] [Real]Absence check using 1100 positive place invariants in 1199 ms returned sat
[2021-05-16 18:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:13:51] [INFO ] [Real]Absence check using state equation in 12072 ms returned sat
[2021-05-16 18:13:51] [INFO ] [Real]Added 399 Read/Feed constraints in 62 ms returned sat
[2021-05-16 18:13:52] [INFO ] Deduced a trap composed of 5 places in 313 ms
[2021-05-16 18:13:52] [INFO ] Deduced a trap composed of 6 places in 304 ms
[2021-05-16 18:13:52] [INFO ] Deduced a trap composed of 3 places in 298 ms
[2021-05-16 18:13:53] [INFO ] Deduced a trap composed of 6 places in 281 ms
[2021-05-16 18:13:53] [INFO ] Deduced a trap composed of 5 places in 282 ms
[2021-05-16 18:13:54] [INFO ] Deduced a trap composed of 6 places in 277 ms
[2021-05-16 18:13:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2338 ms
[2021-05-16 18:13:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:13:55] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1194 ms returned sat
[2021-05-16 18:13:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:14:08] [INFO ] [Nat]Absence check using state equation in 12413 ms returned sat
[2021-05-16 18:14:08] [INFO ] [Nat]Added 399 Read/Feed constraints in 146 ms returned sat
[2021-05-16 18:14:08] [INFO ] Computed and/alt/rep : 2158/7483/2158 causal constraints in 109 ms.
[2021-05-16 18:14:28] [INFO ] Added : 750 causal constraints over 150 iterations in 20148 ms.(timeout) Result :sat
[2021-05-16 18:14:28] [INFO ] Deduced a trap composed of 5 places in 162 ms
[2021-05-16 18:14:29] [INFO ] Deduced a trap composed of 7 places in 157 ms
[2021-05-16 18:14:29] [INFO ] Deduced a trap composed of 6 places in 145 ms
[2021-05-16 18:14:29] [INFO ] Deduced a trap composed of 7 places in 149 ms
[2021-05-16 18:14:30] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2021-05-16 18:14:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1657 ms
Attempting to minimize the solution found.
Minimization took 66 ms.
Incomplete Parikh walk after 324400 steps, including 1000 resets, run finished after 3229 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0] could not realise parikh vector
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 315400 steps, including 1000 resets, run finished after 3043 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 372900 steps, including 1000 resets, run finished after 3574 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 428200 steps, including 1000 resets, run finished after 3953 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 310500 steps, including 1000 resets, run finished after 3026 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 306800 steps, including 1000 resets, run finished after 3058 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 319300 steps, including 1000 resets, run finished after 3189 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 277200 steps, including 1000 resets, run finished after 2756 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 376800 steps, including 1000 resets, run finished after 3687 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 301100 steps, including 1000 resets, run finished after 3023 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 62 out of 2591 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2591/2591 places, 2176/2176 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 2591 transition count 2171
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 2586 transition count 2171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 2586 transition count 2170
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 2585 transition count 2170
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 2579 transition count 2164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 2578 transition count 2164
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 2578 transition count 2164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 2577 transition count 2163
Applied a total of 31 rules in 483 ms. Remains 2577 /2591 variables (removed 14) and now considering 2163/2176 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 2577/2591 places, 2163/2176 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 15277 ms. (steps per millisecond=65 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 476546 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 501559 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 487333 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 471507 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 480662 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 502069 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 492187 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 484419 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 488238 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 789751 steps, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 789751 steps, saw 120220 distinct states, run finished after 30001 ms. (steps per millisecond=26 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2163 rows 2577 cols
[2021-05-16 18:16:33] [INFO ] Computed 1100 place invariants in 9 ms
[2021-05-16 18:16:35] [INFO ] [Real]Absence check using 1100 positive place invariants in 1243 ms returned sat
[2021-05-16 18:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:16:46] [INFO ] [Real]Absence check using state equation in 11742 ms returned sat
[2021-05-16 18:16:47] [INFO ] State equation strengthened by 400 read => feed constraints.
[2021-05-16 18:16:47] [INFO ] [Real]Added 400 Read/Feed constraints in 61 ms returned sat
[2021-05-16 18:16:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:16:48] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1224 ms returned sat
[2021-05-16 18:16:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:17:00] [INFO ] [Nat]Absence check using state equation in 12061 ms returned sat
[2021-05-16 18:17:00] [INFO ] [Nat]Added 400 Read/Feed constraints in 173 ms returned sat
[2021-05-16 18:17:01] [INFO ] Deduced a trap composed of 5 places in 156 ms
[2021-05-16 18:17:01] [INFO ] Deduced a trap composed of 5 places in 140 ms
[2021-05-16 18:17:01] [INFO ] Deduced a trap composed of 6 places in 142 ms
[2021-05-16 18:17:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 742 ms
[2021-05-16 18:17:01] [INFO ] Computed and/alt/rep : 2146/7500/2146 causal constraints in 125 ms.
[2021-05-16 18:17:21] [INFO ] Added : 735 causal constraints over 147 iterations in 20265 ms.(timeout) Result :sat
[2021-05-16 18:17:22] [INFO ] Deduced a trap composed of 6 places in 176 ms
[2021-05-16 18:17:22] [INFO ] Deduced a trap composed of 8 places in 173 ms
[2021-05-16 18:17:22] [INFO ] Deduced a trap composed of 6 places in 172 ms
[2021-05-16 18:17:23] [INFO ] Deduced a trap composed of 6 places in 162 ms
[2021-05-16 18:17:23] [INFO ] Deduced a trap composed of 6 places in 156 ms
[2021-05-16 18:17:23] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2021-05-16 18:17:24] [INFO ] Deduced a trap composed of 6 places in 158 ms
[2021-05-16 18:17:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2300 ms
Attempting to minimize the solution found.
Minimization took 62 ms.
[2021-05-16 18:17:25] [INFO ] [Real]Absence check using 1100 positive place invariants in 1175 ms returned sat
[2021-05-16 18:17:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:17:37] [INFO ] [Real]Absence check using state equation in 11573 ms returned sat
[2021-05-16 18:17:37] [INFO ] [Real]Added 400 Read/Feed constraints in 64 ms returned sat
[2021-05-16 18:17:38] [INFO ] Deduced a trap composed of 3 places in 370 ms
[2021-05-16 18:17:38] [INFO ] Deduced a trap composed of 4 places in 399 ms
[2021-05-16 18:17:39] [INFO ] Deduced a trap composed of 5 places in 360 ms
[2021-05-16 18:17:39] [INFO ] Deduced a trap composed of 3 places in 353 ms
[2021-05-16 18:17:39] [INFO ] Deduced a trap composed of 3 places in 356 ms
[2021-05-16 18:17:40] [INFO ] Deduced a trap composed of 5 places in 327 ms
[2021-05-16 18:17:40] [INFO ] Deduced a trap composed of 4 places in 333 ms
[2021-05-16 18:17:41] [INFO ] Deduced a trap composed of 6 places in 329 ms
[2021-05-16 18:17:41] [INFO ] Deduced a trap composed of 6 places in 338 ms
[2021-05-16 18:17:42] [INFO ] Deduced a trap composed of 5 places in 315 ms
[2021-05-16 18:17:42] [INFO ] Deduced a trap composed of 5 places in 313 ms
[2021-05-16 18:17:42] [INFO ] Deduced a trap composed of 7 places in 301 ms
[2021-05-16 18:17:43] [INFO ] Deduced a trap composed of 6 places in 298 ms
[2021-05-16 18:17:43] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5722 ms
[2021-05-16 18:17:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:17:44] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1184 ms returned sat
[2021-05-16 18:17:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:17:56] [INFO ] [Nat]Absence check using state equation in 11794 ms returned sat
[2021-05-16 18:17:56] [INFO ] [Nat]Added 400 Read/Feed constraints in 184 ms returned sat
[2021-05-16 18:17:57] [INFO ] Deduced a trap composed of 5 places in 153 ms
[2021-05-16 18:17:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2021-05-16 18:17:57] [INFO ] Computed and/alt/rep : 2146/7500/2146 causal constraints in 83 ms.
[2021-05-16 18:18:17] [INFO ] Added : 735 causal constraints over 147 iterations in 20165 ms.(timeout) Result :sat
[2021-05-16 18:18:17] [INFO ] Deduced a trap composed of 5 places in 185 ms
[2021-05-16 18:18:17] [INFO ] Deduced a trap composed of 6 places in 175 ms
[2021-05-16 18:18:18] [INFO ] Deduced a trap composed of 6 places in 167 ms
[2021-05-16 18:18:18] [INFO ] Deduced a trap composed of 6 places in 178 ms
[2021-05-16 18:18:18] [INFO ] Deduced a trap composed of 6 places in 163 ms
[2021-05-16 18:18:19] [INFO ] Deduced a trap composed of 7 places in 160 ms
[2021-05-16 18:18:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2078 ms
Attempting to minimize the solution found.
Minimization took 62 ms.
[2021-05-16 18:18:21] [INFO ] [Real]Absence check using 1100 positive place invariants in 1207 ms returned sat
[2021-05-16 18:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:18:33] [INFO ] [Real]Absence check using state equation in 11917 ms returned sat
[2021-05-16 18:18:33] [INFO ] [Real]Added 400 Read/Feed constraints in 59 ms returned sat
[2021-05-16 18:18:33] [INFO ] Deduced a trap composed of 5 places in 438 ms
[2021-05-16 18:18:34] [INFO ] Deduced a trap composed of 5 places in 460 ms
[2021-05-16 18:18:34] [INFO ] Deduced a trap composed of 5 places in 445 ms
[2021-05-16 18:18:35] [INFO ] Deduced a trap composed of 6 places in 437 ms
[2021-05-16 18:18:35] [INFO ] Deduced a trap composed of 4 places in 435 ms
[2021-05-16 18:18:36] [INFO ] Deduced a trap composed of 4 places in 418 ms
[2021-05-16 18:18:36] [INFO ] Deduced a trap composed of 7 places in 414 ms
[2021-05-16 18:18:37] [INFO ] Deduced a trap composed of 3 places in 423 ms
[2021-05-16 18:18:37] [INFO ] Deduced a trap composed of 5 places in 412 ms
[2021-05-16 18:18:38] [INFO ] Deduced a trap composed of 3 places in 410 ms
[2021-05-16 18:18:38] [INFO ] Deduced a trap composed of 5 places in 412 ms
[2021-05-16 18:18:39] [INFO ] Deduced a trap composed of 8 places in 416 ms
[2021-05-16 18:18:39] [INFO ] Deduced a trap composed of 7 places in 401 ms
[2021-05-16 18:18:40] [INFO ] Deduced a trap composed of 7 places in 416 ms
[2021-05-16 18:18:40] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7230 ms
[2021-05-16 18:18:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:18:41] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1190 ms returned sat
[2021-05-16 18:18:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:18:53] [INFO ] [Nat]Absence check using state equation in 12029 ms returned sat
[2021-05-16 18:18:54] [INFO ] [Nat]Added 400 Read/Feed constraints in 136 ms returned sat
[2021-05-16 18:18:54] [INFO ] Deduced a trap composed of 5 places in 175 ms
[2021-05-16 18:18:54] [INFO ] Deduced a trap composed of 5 places in 154 ms
[2021-05-16 18:18:54] [INFO ] Deduced a trap composed of 5 places in 161 ms
[2021-05-16 18:18:55] [INFO ] Deduced a trap composed of 5 places in 163 ms
[2021-05-16 18:18:55] [INFO ] Deduced a trap composed of 5 places in 161 ms
[2021-05-16 18:18:55] [INFO ] Deduced a trap composed of 7 places in 162 ms
[2021-05-16 18:18:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1572 ms
[2021-05-16 18:18:55] [INFO ] Computed and/alt/rep : 2146/7500/2146 causal constraints in 106 ms.
[2021-05-16 18:19:15] [INFO ] Added : 720 causal constraints over 144 iterations in 20144 ms.(timeout) Result :sat
[2021-05-16 18:19:16] [INFO ] Deduced a trap composed of 7 places in 182 ms
[2021-05-16 18:19:16] [INFO ] Deduced a trap composed of 6 places in 179 ms
[2021-05-16 18:19:16] [INFO ] Deduced a trap composed of 5 places in 177 ms
[2021-05-16 18:19:17] [INFO ] Deduced a trap composed of 9 places in 171 ms
[2021-05-16 18:19:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1459 ms
Attempting to minimize the solution found.
Minimization took 62 ms.
[2021-05-16 18:19:18] [INFO ] [Real]Absence check using 1100 positive place invariants in 1202 ms returned sat
[2021-05-16 18:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:19:30] [INFO ] [Real]Absence check using state equation in 11872 ms returned sat
[2021-05-16 18:19:30] [INFO ] [Real]Added 400 Read/Feed constraints in 68 ms returned sat
[2021-05-16 18:19:31] [INFO ] Deduced a trap composed of 3 places in 324 ms
[2021-05-16 18:19:31] [INFO ] Deduced a trap composed of 5 places in 336 ms
[2021-05-16 18:19:32] [INFO ] Deduced a trap composed of 6 places in 329 ms
[2021-05-16 18:19:32] [INFO ] Deduced a trap composed of 3 places in 323 ms
[2021-05-16 18:19:33] [INFO ] Deduced a trap composed of 6 places in 306 ms
[2021-05-16 18:19:33] [INFO ] Deduced a trap composed of 7 places in 306 ms
[2021-05-16 18:19:33] [INFO ] Deduced a trap composed of 8 places in 303 ms
[2021-05-16 18:19:34] [INFO ] Deduced a trap composed of 5 places in 308 ms
[2021-05-16 18:19:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3255 ms
[2021-05-16 18:19:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:19:35] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1199 ms returned sat
[2021-05-16 18:19:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:19:47] [INFO ] [Nat]Absence check using state equation in 12028 ms returned sat
[2021-05-16 18:19:48] [INFO ] [Nat]Added 400 Read/Feed constraints in 169 ms returned sat
[2021-05-16 18:19:48] [INFO ] Deduced a trap composed of 6 places in 138 ms
[2021-05-16 18:19:48] [INFO ] Deduced a trap composed of 5 places in 137 ms
[2021-05-16 18:19:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 512 ms
[2021-05-16 18:19:48] [INFO ] Computed and/alt/rep : 2146/7500/2146 causal constraints in 103 ms.
[2021-05-16 18:20:08] [INFO ] Added : 670 causal constraints over 134 iterations in 20102 ms.(timeout) Result :sat
[2021-05-16 18:20:09] [INFO ] Deduced a trap composed of 5 places in 1010 ms
[2021-05-16 18:20:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1246 ms
Attempting to minimize the solution found.
Minimization took 74 ms.
[2021-05-16 18:20:11] [INFO ] [Real]Absence check using 1100 positive place invariants in 1215 ms returned sat
[2021-05-16 18:20:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:20:23] [INFO ] [Real]Absence check using state equation in 12096 ms returned sat
[2021-05-16 18:20:23] [INFO ] [Real]Added 400 Read/Feed constraints in 68 ms returned sat
[2021-05-16 18:20:24] [INFO ] Deduced a trap composed of 5 places in 379 ms
[2021-05-16 18:20:24] [INFO ] Deduced a trap composed of 3 places in 346 ms
[2021-05-16 18:20:25] [INFO ] Deduced a trap composed of 7 places in 344 ms
[2021-05-16 18:20:25] [INFO ] Deduced a trap composed of 3 places in 352 ms
[2021-05-16 18:20:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1832 ms
[2021-05-16 18:20:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:20:27] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1208 ms returned sat
[2021-05-16 18:20:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:20:39] [INFO ] [Nat]Absence check using state equation in 11949 ms returned sat
[2021-05-16 18:20:39] [INFO ] [Nat]Added 400 Read/Feed constraints in 126 ms returned sat
[2021-05-16 18:20:39] [INFO ] Deduced a trap composed of 5 places in 145 ms
[2021-05-16 18:20:39] [INFO ] Deduced a trap composed of 5 places in 143 ms
[2021-05-16 18:20:40] [INFO ] Deduced a trap composed of 4 places in 132 ms
[2021-05-16 18:20:40] [INFO ] Deduced a trap composed of 5 places in 149 ms
[2021-05-16 18:20:40] [INFO ] Deduced a trap composed of 3 places in 141 ms
[2021-05-16 18:20:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1219 ms
[2021-05-16 18:20:40] [INFO ] Computed and/alt/rep : 2146/7500/2146 causal constraints in 106 ms.
[2021-05-16 18:21:00] [INFO ] Added : 755 causal constraints over 151 iterations in 20180 ms.(timeout) Result :sat
[2021-05-16 18:21:01] [INFO ] Deduced a trap composed of 5 places in 186 ms
[2021-05-16 18:21:01] [INFO ] Deduced a trap composed of 6 places in 189 ms
[2021-05-16 18:21:01] [INFO ] Deduced a trap composed of 7 places in 176 ms
[2021-05-16 18:21:02] [INFO ] Deduced a trap composed of 5 places in 183 ms
[2021-05-16 18:21:02] [INFO ] Deduced a trap composed of 5 places in 192 ms
[2021-05-16 18:21:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1770 ms
Attempting to minimize the solution found.
Minimization took 62 ms.
[2021-05-16 18:21:04] [INFO ] [Real]Absence check using 1100 positive place invariants in 1183 ms returned sat
[2021-05-16 18:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:21:15] [INFO ] [Real]Absence check using state equation in 11645 ms returned sat
[2021-05-16 18:21:15] [INFO ] [Real]Added 400 Read/Feed constraints in 63 ms returned sat
[2021-05-16 18:21:16] [INFO ] Deduced a trap composed of 6 places in 380 ms
[2021-05-16 18:21:16] [INFO ] Deduced a trap composed of 7 places in 374 ms
[2021-05-16 18:21:17] [INFO ] Deduced a trap composed of 3 places in 370 ms
[2021-05-16 18:21:17] [INFO ] Deduced a trap composed of 6 places in 355 ms
[2021-05-16 18:21:18] [INFO ] Deduced a trap composed of 9 places in 385 ms
[2021-05-16 18:21:18] [INFO ] Deduced a trap composed of 3 places in 364 ms
[2021-05-16 18:21:19] [INFO ] Deduced a trap composed of 3 places in 352 ms
[2021-05-16 18:21:19] [INFO ] Deduced a trap composed of 5 places in 338 ms
[2021-05-16 18:21:20] [INFO ] Deduced a trap composed of 5 places in 360 ms
[2021-05-16 18:21:20] [INFO ] Deduced a trap composed of 4 places in 347 ms
[2021-05-16 18:21:20] [INFO ] Deduced a trap composed of 5 places in 338 ms
[2021-05-16 18:21:21] [INFO ] Deduced a trap composed of 5 places in 347 ms
[2021-05-16 18:21:21] [INFO ] Deduced a trap composed of 7 places in 324 ms
[2021-05-16 18:21:22] [INFO ] Deduced a trap composed of 9 places in 341 ms
[2021-05-16 18:21:22] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6365 ms
[2021-05-16 18:21:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:21:23] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1174 ms returned sat
[2021-05-16 18:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:21:35] [INFO ] [Nat]Absence check using state equation in 11667 ms returned sat
[2021-05-16 18:21:35] [INFO ] [Nat]Added 400 Read/Feed constraints in 195 ms returned sat
[2021-05-16 18:21:35] [INFO ] Deduced a trap composed of 7 places in 144 ms
[2021-05-16 18:21:36] [INFO ] Deduced a trap composed of 7 places in 133 ms
[2021-05-16 18:21:36] [INFO ] Deduced a trap composed of 6 places in 142 ms
[2021-05-16 18:21:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 755 ms
[2021-05-16 18:21:36] [INFO ] Computed and/alt/rep : 2146/7500/2146 causal constraints in 106 ms.
[2021-05-16 18:21:56] [INFO ] Added : 750 causal constraints over 150 iterations in 20153 ms.(timeout) Result :sat
[2021-05-16 18:21:56] [INFO ] Deduced a trap composed of 5 places in 233 ms
[2021-05-16 18:21:57] [INFO ] Deduced a trap composed of 7 places in 218 ms
[2021-05-16 18:21:57] [INFO ] Deduced a trap composed of 7 places in 242 ms
[2021-05-16 18:21:58] [INFO ] Deduced a trap composed of 6 places in 204 ms
[2021-05-16 18:21:58] [INFO ] Deduced a trap composed of 5 places in 200 ms
[2021-05-16 18:21:58] [INFO ] Deduced a trap composed of 5 places in 204 ms
[2021-05-16 18:21:59] [INFO ] Deduced a trap composed of 5 places in 183 ms
[2021-05-16 18:21:59] [INFO ] Deduced a trap composed of 6 places in 179 ms
[2021-05-16 18:21:59] [INFO ] Deduced a trap composed of 6 places in 185 ms
[2021-05-16 18:22:00] [INFO ] Deduced a trap composed of 9 places in 174 ms
[2021-05-16 18:22:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3808 ms
Attempting to minimize the solution found.
Minimization took 63 ms.
[2021-05-16 18:22:02] [INFO ] [Real]Absence check using 1100 positive place invariants in 1334 ms returned sat
[2021-05-16 18:22:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:22:14] [INFO ] [Real]Absence check using state equation in 12393 ms returned sat
[2021-05-16 18:22:14] [INFO ] [Real]Added 400 Read/Feed constraints in 62 ms returned sat
[2021-05-16 18:22:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:22:16] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1205 ms returned sat
[2021-05-16 18:22:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:22:28] [INFO ] [Nat]Absence check using state equation in 12006 ms returned sat
[2021-05-16 18:22:28] [INFO ] [Nat]Added 400 Read/Feed constraints in 175 ms returned sat
[2021-05-16 18:22:28] [INFO ] Computed and/alt/rep : 2146/7500/2146 causal constraints in 105 ms.
[2021-05-16 18:22:48] [INFO ] Added : 725 causal constraints over 145 iterations in 20178 ms.(timeout) Result :sat
[2021-05-16 18:22:49] [INFO ] Deduced a trap composed of 5 places in 176 ms
[2021-05-16 18:22:49] [INFO ] Deduced a trap composed of 5 places in 163 ms
[2021-05-16 18:22:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 700 ms
Attempting to minimize the solution found.
Minimization took 62 ms.
[2021-05-16 18:22:51] [INFO ] [Real]Absence check using 1100 positive place invariants in 1217 ms returned sat
[2021-05-16 18:22:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:23:03] [INFO ] [Real]Absence check using state equation in 11950 ms returned sat
[2021-05-16 18:23:03] [INFO ] [Real]Added 400 Read/Feed constraints in 61 ms returned sat
[2021-05-16 18:23:03] [INFO ] Deduced a trap composed of 8 places in 346 ms
[2021-05-16 18:23:04] [INFO ] Deduced a trap composed of 3 places in 340 ms
[2021-05-16 18:23:04] [INFO ] Deduced a trap composed of 5 places in 365 ms
[2021-05-16 18:23:04] [INFO ] Deduced a trap composed of 5 places in 341 ms
[2021-05-16 18:23:05] [INFO ] Deduced a trap composed of 5 places in 337 ms
[2021-05-16 18:23:05] [INFO ] Deduced a trap composed of 10 places in 334 ms
[2021-05-16 18:23:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2691 ms
[2021-05-16 18:23:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:23:07] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1203 ms returned sat
[2021-05-16 18:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:23:19] [INFO ] [Nat]Absence check using state equation in 12016 ms returned sat
[2021-05-16 18:23:19] [INFO ] [Nat]Added 400 Read/Feed constraints in 231 ms returned sat
[2021-05-16 18:23:19] [INFO ] Deduced a trap composed of 7 places in 150 ms
[2021-05-16 18:23:20] [INFO ] Deduced a trap composed of 5 places in 146 ms
[2021-05-16 18:23:20] [INFO ] Deduced a trap composed of 5 places in 141 ms
[2021-05-16 18:23:20] [INFO ] Deduced a trap composed of 6 places in 149 ms
[2021-05-16 18:23:20] [INFO ] Deduced a trap composed of 7 places in 147 ms
[2021-05-16 18:23:21] [INFO ] Deduced a trap composed of 5 places in 144 ms
[2021-05-16 18:23:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1481 ms
[2021-05-16 18:23:21] [INFO ] Computed and/alt/rep : 2146/7500/2146 causal constraints in 106 ms.
[2021-05-16 18:23:41] [INFO ] Added : 750 causal constraints over 150 iterations in 20127 ms.(timeout) Result :sat
[2021-05-16 18:23:41] [INFO ] Deduced a trap composed of 5 places in 177 ms
[2021-05-16 18:23:41] [INFO ] Deduced a trap composed of 7 places in 173 ms
[2021-05-16 18:23:42] [INFO ] Deduced a trap composed of 6 places in 171 ms
[2021-05-16 18:23:42] [INFO ] Deduced a trap composed of 7 places in 168 ms
[2021-05-16 18:23:42] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2021-05-16 18:23:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1729 ms
Attempting to minimize the solution found.
Minimization took 62 ms.
[2021-05-16 18:23:44] [INFO ] [Real]Absence check using 1100 positive place invariants in 1199 ms returned sat
[2021-05-16 18:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:23:56] [INFO ] [Real]Absence check using state equation in 11768 ms returned sat
[2021-05-16 18:23:56] [INFO ] [Real]Added 400 Read/Feed constraints in 59 ms returned sat
[2021-05-16 18:23:57] [INFO ] Deduced a trap composed of 3 places in 360 ms
[2021-05-16 18:23:57] [INFO ] Deduced a trap composed of 3 places in 362 ms
[2021-05-16 18:23:58] [INFO ] Deduced a trap composed of 4 places in 349 ms
[2021-05-16 18:23:58] [INFO ] Deduced a trap composed of 7 places in 357 ms
[2021-05-16 18:23:58] [INFO ] Deduced a trap composed of 7 places in 341 ms
[2021-05-16 18:23:59] [INFO ] Deduced a trap composed of 6 places in 332 ms
[2021-05-16 18:23:59] [INFO ] Deduced a trap composed of 5 places in 331 ms
[2021-05-16 18:24:00] [INFO ] Deduced a trap composed of 8 places in 351 ms
[2021-05-16 18:24:00] [INFO ] Deduced a trap composed of 7 places in 329 ms
[2021-05-16 18:24:01] [INFO ] Deduced a trap composed of 6 places in 309 ms
[2021-05-16 18:24:01] [INFO ] Deduced a trap composed of 5 places in 300 ms
[2021-05-16 18:24:01] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4825 ms
[2021-05-16 18:24:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:24:03] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1197 ms returned sat
[2021-05-16 18:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:24:14] [INFO ] [Nat]Absence check using state equation in 11783 ms returned sat
[2021-05-16 18:24:14] [INFO ] [Nat]Added 400 Read/Feed constraints in 119 ms returned sat
[2021-05-16 18:24:15] [INFO ] Deduced a trap composed of 7 places in 172 ms
[2021-05-16 18:24:15] [INFO ] Deduced a trap composed of 7 places in 166 ms
[2021-05-16 18:24:15] [INFO ] Deduced a trap composed of 7 places in 169 ms
[2021-05-16 18:24:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 879 ms
[2021-05-16 18:24:15] [INFO ] Computed and/alt/rep : 2146/7500/2146 causal constraints in 99 ms.
[2021-05-16 18:24:35] [INFO ] Added : 715 causal constraints over 143 iterations in 20143 ms.(timeout) Result :sat
[2021-05-16 18:24:37] [INFO ] Deduced a trap composed of 3 places in 1052 ms
[2021-05-16 18:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1285 ms
Attempting to minimize the solution found.
Minimization took 72 ms.
Incomplete Parikh walk after 128100 steps, including 1000 resets, run finished after 1316 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 1, 0, 1, 1, 0, 1] could not realise parikh vector
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 314100 steps, including 1000 resets, run finished after 2842 ms. (steps per millisecond=110 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 318500 steps, including 1000 resets, run finished after 2931 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 298800 steps, including 1000 resets, run finished after 2713 ms. (steps per millisecond=110 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 289600 steps, including 1000 resets, run finished after 2494 ms. (steps per millisecond=116 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 99400 steps, including 232 resets, run finished after 1035 ms. (steps per millisecond=96 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 303200 steps, including 1000 resets, run finished after 2617 ms. (steps per millisecond=115 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 277600 steps, including 1000 resets, run finished after 2531 ms. (steps per millisecond=109 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 317400 steps, including 1000 resets, run finished after 2767 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 40 out of 2577 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2577/2577 places, 2163/2163 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 2577 transition count 2158
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 2572 transition count 2158
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 2572 transition count 2152
Deduced a syphon composed of 6 places in 13 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 2566 transition count 2152
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 2556 transition count 2142
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 2551 transition count 2142
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 2551 transition count 2142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 2550 transition count 2141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 2549 transition count 2140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 2548 transition count 2139
Applied a total of 58 rules in 781 ms. Remains 2548 /2577 variables (removed 29) and now considering 2139/2163 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 2548/2577 places, 2139/2163 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 14158 ms. (steps per millisecond=70 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 495297 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 514977 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 495802 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 481077 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 487677 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 753743 steps, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 753743 steps, saw 113362 distinct states, run finished after 30001 ms. (steps per millisecond=25 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 2139 rows 2548 cols
[2021-05-16 18:26:08] [INFO ] Computed 1100 place invariants in 8 ms
[2021-05-16 18:26:10] [INFO ] [Real]Absence check using 1100 positive place invariants in 1235 ms returned sat
[2021-05-16 18:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:26:21] [INFO ] [Real]Absence check using state equation in 11599 ms returned sat
[2021-05-16 18:26:21] [INFO ] State equation strengthened by 401 read => feed constraints.
[2021-05-16 18:26:21] [INFO ] [Real]Added 401 Read/Feed constraints in 73 ms returned sat
[2021-05-16 18:26:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:26:23] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1229 ms returned sat
[2021-05-16 18:26:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:26:35] [INFO ] [Nat]Absence check using state equation in 11716 ms returned sat
[2021-05-16 18:26:35] [INFO ] [Nat]Added 401 Read/Feed constraints in 103 ms returned sat
[2021-05-16 18:26:35] [INFO ] Computed and/alt/rep : 2127/7495/2127 causal constraints in 104 ms.
[2021-05-16 18:26:55] [INFO ] Added : 750 causal constraints over 150 iterations in 20055 ms.(timeout) Result :sat
[2021-05-16 18:26:55] [INFO ] Deduced a trap composed of 6 places in 171 ms
[2021-05-16 18:26:55] [INFO ] Deduced a trap composed of 8 places in 165 ms
[2021-05-16 18:26:56] [INFO ] Deduced a trap composed of 6 places in 180 ms
[2021-05-16 18:26:56] [INFO ] Deduced a trap composed of 5 places in 190 ms
[2021-05-16 18:26:56] [INFO ] Deduced a trap composed of 6 places in 164 ms
[2021-05-16 18:26:57] [INFO ] Deduced a trap composed of 6 places in 175 ms
[2021-05-16 18:26:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2005 ms
Attempting to minimize the solution found.
Minimization took 60 ms.
[2021-05-16 18:26:59] [INFO ] [Real]Absence check using 1100 positive place invariants in 1198 ms returned sat
[2021-05-16 18:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:27:10] [INFO ] [Real]Absence check using state equation in 11425 ms returned sat
[2021-05-16 18:27:10] [INFO ] [Real]Added 401 Read/Feed constraints in 61 ms returned sat
[2021-05-16 18:27:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:27:12] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1161 ms returned sat
[2021-05-16 18:27:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:27:23] [INFO ] [Nat]Absence check using state equation in 11482 ms returned sat
[2021-05-16 18:27:23] [INFO ] [Nat]Added 401 Read/Feed constraints in 120 ms returned sat
[2021-05-16 18:27:23] [INFO ] Deduced a trap composed of 5 places in 118 ms
[2021-05-16 18:27:24] [INFO ] Deduced a trap composed of 5 places in 116 ms
[2021-05-16 18:27:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 477 ms
[2021-05-16 18:27:24] [INFO ] Computed and/alt/rep : 2127/7495/2127 causal constraints in 123 ms.
[2021-05-16 18:27:44] [INFO ] Added : 770 causal constraints over 154 iterations in 20071 ms.(timeout) Result :sat
[2021-05-16 18:27:44] [INFO ] Deduced a trap composed of 5 places in 187 ms
[2021-05-16 18:27:44] [INFO ] Deduced a trap composed of 6 places in 182 ms
[2021-05-16 18:27:45] [INFO ] Deduced a trap composed of 6 places in 175 ms
[2021-05-16 18:27:45] [INFO ] Deduced a trap composed of 8 places in 171 ms
[2021-05-16 18:27:45] [INFO ] Deduced a trap composed of 6 places in 172 ms
[2021-05-16 18:27:46] [INFO ] Deduced a trap composed of 6 places in 170 ms
[2021-05-16 18:27:46] [INFO ] Deduced a trap composed of 8 places in 171 ms
[2021-05-16 18:27:46] [INFO ] Deduced a trap composed of 5 places in 169 ms
[2021-05-16 18:27:47] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2021-05-16 18:27:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2945 ms
Attempting to minimize the solution found.
Minimization took 59 ms.
[2021-05-16 18:27:48] [INFO ] [Real]Absence check using 1100 positive place invariants in 1188 ms returned sat
[2021-05-16 18:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:28:00] [INFO ] [Real]Absence check using state equation in 11600 ms returned sat
[2021-05-16 18:28:00] [INFO ] [Real]Added 401 Read/Feed constraints in 58 ms returned sat
[2021-05-16 18:28:01] [INFO ] Deduced a trap composed of 5 places in 314 ms
[2021-05-16 18:28:01] [INFO ] Deduced a trap composed of 6 places in 330 ms
[2021-05-16 18:28:01] [INFO ] Deduced a trap composed of 3 places in 326 ms
[2021-05-16 18:28:02] [INFO ] Deduced a trap composed of 4 places in 302 ms
[2021-05-16 18:28:02] [INFO ] Deduced a trap composed of 7 places in 295 ms
[2021-05-16 18:28:03] [INFO ] Deduced a trap composed of 3 places in 299 ms
[2021-05-16 18:28:03] [INFO ] Deduced a trap composed of 5 places in 302 ms
[2021-05-16 18:28:03] [INFO ] Deduced a trap composed of 8 places in 300 ms
[2021-05-16 18:28:04] [INFO ] Deduced a trap composed of 3 places in 294 ms
[2021-05-16 18:28:04] [INFO ] Deduced a trap composed of 5 places in 296 ms
[2021-05-16 18:28:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4023 ms
[2021-05-16 18:28:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:28:06] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1186 ms returned sat
[2021-05-16 18:28:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:28:17] [INFO ] [Nat]Absence check using state equation in 11740 ms returned sat
[2021-05-16 18:28:18] [INFO ] [Nat]Added 401 Read/Feed constraints in 233 ms returned sat
[2021-05-16 18:28:18] [INFO ] Deduced a trap composed of 5 places in 150 ms
[2021-05-16 18:28:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2021-05-16 18:28:18] [INFO ] Computed and/alt/rep : 2127/7495/2127 causal constraints in 108 ms.
[2021-05-16 18:28:38] [INFO ] Added : 750 causal constraints over 150 iterations in 20182 ms.(timeout) Result :sat
[2021-05-16 18:28:38] [INFO ] Deduced a trap composed of 6 places in 155 ms
[2021-05-16 18:28:39] [INFO ] Deduced a trap composed of 6 places in 158 ms
[2021-05-16 18:28:39] [INFO ] Deduced a trap composed of 6 places in 155 ms
[2021-05-16 18:28:39] [INFO ] Deduced a trap composed of 7 places in 153 ms
[2021-05-16 18:28:40] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2021-05-16 18:28:40] [INFO ] Deduced a trap composed of 6 places in 157 ms
[2021-05-16 18:28:40] [INFO ] Deduced a trap composed of 7 places in 167 ms
[2021-05-16 18:28:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2332 ms
Attempting to minimize the solution found.
Minimization took 66 ms.
[2021-05-16 18:28:42] [INFO ] [Real]Absence check using 1100 positive place invariants in 1179 ms returned sat
[2021-05-16 18:28:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:28:54] [INFO ] [Real]Absence check using state equation in 11611 ms returned sat
[2021-05-16 18:28:54] [INFO ] [Real]Added 401 Read/Feed constraints in 58 ms returned sat
[2021-05-16 18:28:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:28:55] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1180 ms returned sat
[2021-05-16 18:28:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:29:07] [INFO ] [Nat]Absence check using state equation in 11492 ms returned sat
[2021-05-16 18:29:07] [INFO ] [Nat]Added 401 Read/Feed constraints in 117 ms returned sat
[2021-05-16 18:29:07] [INFO ] Deduced a trap composed of 5 places in 128 ms
[2021-05-16 18:29:07] [INFO ] Deduced a trap composed of 6 places in 129 ms
[2021-05-16 18:29:08] [INFO ] Deduced a trap composed of 7 places in 119 ms
[2021-05-16 18:29:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 694 ms
[2021-05-16 18:29:08] [INFO ] Computed and/alt/rep : 2127/7495/2127 causal constraints in 103 ms.
[2021-05-16 18:29:28] [INFO ] Added : 740 causal constraints over 148 iterations in 20156 ms.(timeout) Result :sat
[2021-05-16 18:29:28] [INFO ] Deduced a trap composed of 6 places in 152 ms
[2021-05-16 18:29:28] [INFO ] Deduced a trap composed of 5 places in 143 ms
[2021-05-16 18:29:29] [INFO ] Deduced a trap composed of 3 places in 151 ms
[2021-05-16 18:29:29] [INFO ] Deduced a trap composed of 6 places in 163 ms
[2021-05-16 18:29:29] [INFO ] Deduced a trap composed of 8 places in 134 ms
[2021-05-16 18:29:30] [INFO ] Deduced a trap composed of 6 places in 136 ms
[2021-05-16 18:29:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1931 ms
Attempting to minimize the solution found.
Minimization took 76 ms.
[2021-05-16 18:29:31] [INFO ] [Real]Absence check using 1100 positive place invariants in 1188 ms returned sat
[2021-05-16 18:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:29:43] [INFO ] [Real]Absence check using state equation in 11704 ms returned sat
[2021-05-16 18:29:43] [INFO ] [Real]Added 401 Read/Feed constraints in 58 ms returned sat
[2021-05-16 18:29:44] [INFO ] Deduced a trap composed of 7 places in 325 ms
[2021-05-16 18:29:44] [INFO ] Deduced a trap composed of 4 places in 321 ms
[2021-05-16 18:29:45] [INFO ] Deduced a trap composed of 5 places in 329 ms
[2021-05-16 18:29:45] [INFO ] Deduced a trap composed of 6 places in 308 ms
[2021-05-16 18:29:45] [INFO ] Deduced a trap composed of 6 places in 314 ms
[2021-05-16 18:29:46] [INFO ] Deduced a trap composed of 8 places in 309 ms
[2021-05-16 18:29:46] [INFO ] Deduced a trap composed of 8 places in 294 ms
[2021-05-16 18:29:47] [INFO ] Deduced a trap composed of 9 places in 298 ms
[2021-05-16 18:29:47] [INFO ] Deduced a trap composed of 8 places in 291 ms
[2021-05-16 18:29:47] [INFO ] Deduced a trap composed of 5 places in 282 ms
[2021-05-16 18:29:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4027 ms
[2021-05-16 18:29:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:29:49] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1175 ms returned sat
[2021-05-16 18:29:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:30:01] [INFO ] [Nat]Absence check using state equation in 11831 ms returned sat
[2021-05-16 18:30:01] [INFO ] [Nat]Added 401 Read/Feed constraints in 252 ms returned sat
[2021-05-16 18:30:01] [INFO ] Deduced a trap composed of 5 places in 149 ms
[2021-05-16 18:30:01] [INFO ] Deduced a trap composed of 6 places in 128 ms
[2021-05-16 18:30:02] [INFO ] Deduced a trap composed of 6 places in 149 ms
[2021-05-16 18:30:02] [INFO ] Deduced a trap composed of 5 places in 125 ms
[2021-05-16 18:30:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 966 ms
[2021-05-16 18:30:02] [INFO ] Computed and/alt/rep : 2127/7495/2127 causal constraints in 109 ms.
[2021-05-16 18:30:22] [INFO ] Added : 740 causal constraints over 148 iterations in 20083 ms.(timeout) Result :sat
[2021-05-16 18:30:22] [INFO ] Deduced a trap composed of 5 places in 202 ms
[2021-05-16 18:30:23] [INFO ] Deduced a trap composed of 6 places in 185 ms
[2021-05-16 18:30:23] [INFO ] Deduced a trap composed of 5 places in 185 ms
[2021-05-16 18:30:23] [INFO ] Deduced a trap composed of 5 places in 177 ms
[2021-05-16 18:30:24] [INFO ] Deduced a trap composed of 6 places in 183 ms
[2021-05-16 18:30:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1710 ms
Attempting to minimize the solution found.
Minimization took 61 ms.
Incomplete Parikh walk after 290300 steps, including 1000 resets, run finished after 2708 ms. (steps per millisecond=107 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 286500 steps, including 1000 resets, run finished after 2651 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 325000 steps, including 1000 resets, run finished after 2907 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 304500 steps, including 1000 resets, run finished after 3039 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 299800 steps, including 1000 resets, run finished after 2801 ms. (steps per millisecond=107 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 40 out of 2548 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2548/2548 places, 2139/2139 transitions.
Applied a total of 0 rules in 79 ms. Remains 2548 /2548 variables (removed 0) and now considering 2139/2139 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2548/2548 places, 2139/2139 transitions.
Starting structural reductions, iteration 0 : 2548/2548 places, 2139/2139 transitions.
Applied a total of 0 rules in 81 ms. Remains 2548 /2548 variables (removed 0) and now considering 2139/2139 (removed 0) transitions.
// Phase 1: matrix 2139 rows 2548 cols
[2021-05-16 18:30:38] [INFO ] Computed 1100 place invariants in 8 ms
[2021-05-16 18:30:47] [INFO ] Implicit Places using invariants in 8944 ms returned []
// Phase 1: matrix 2139 rows 2548 cols
[2021-05-16 18:30:47] [INFO ] Computed 1100 place invariants in 10 ms
[2021-05-16 18:31:00] [INFO ] State equation strengthened by 401 read => feed constraints.
[2021-05-16 18:31:30] [INFO ] Performed 1010/2548 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-16 18:32:00] [INFO ] Performed 1915/2548 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2021-05-16 18:32:21] [INFO ] Implicit Places using invariants and state equation in 94005 ms returned [2531, 2535]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 102952 ms to find 2 implicit places.
[2021-05-16 18:32:21] [INFO ] Redundant transitions in 334 ms returned []
// Phase 1: matrix 2139 rows 2546 cols
[2021-05-16 18:32:21] [INFO ] Computed 1098 place invariants in 10 ms
[2021-05-16 18:32:28] [INFO ] Dead Transitions using invariants and state equation in 6968 ms returned []
Starting structural reductions, iteration 1 : 2546/2548 places, 2139/2139 transitions.
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2546 transition count 2139
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 2544 transition count 2137
Applied a total of 6 rules in 152 ms. Remains 2544 /2546 variables (removed 2) and now considering 2137/2139 (removed 2) transitions.
// Phase 1: matrix 2137 rows 2544 cols
[2021-05-16 18:32:29] [INFO ] Computed 1098 place invariants in 8 ms
[2021-05-16 18:32:37] [INFO ] Implicit Places using invariants in 8461 ms returned []
// Phase 1: matrix 2137 rows 2544 cols
[2021-05-16 18:32:37] [INFO ] Computed 1098 place invariants in 8 ms
[2021-05-16 18:32:38] [INFO ] State equation strengthened by 399 read => feed constraints.
[2021-05-16 18:32:54] [INFO ] Implicit Places using invariants and state equation in 16785 ms returned []
Implicit Place search using SMT with State Equation took 25258 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2544/2548 places, 2137/2139 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 14151 ms. (steps per millisecond=70 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 498110 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 515672 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 498715 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 485747 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 484258 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 757103 steps, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 757103 steps, saw 113913 distinct states, run finished after 30001 ms. (steps per millisecond=25 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 2137 rows 2544 cols
[2021-05-16 18:34:03] [INFO ] Computed 1098 place invariants in 7 ms
[2021-05-16 18:34:04] [INFO ] [Real]Absence check using 1098 positive place invariants in 1217 ms returned sat
[2021-05-16 18:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:34:16] [INFO ] [Real]Absence check using state equation in 11577 ms returned sat
[2021-05-16 18:34:16] [INFO ] State equation strengthened by 399 read => feed constraints.
[2021-05-16 18:34:16] [INFO ] [Real]Added 399 Read/Feed constraints in 69 ms returned sat
[2021-05-16 18:34:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:34:18] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1229 ms returned sat
[2021-05-16 18:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:34:29] [INFO ] [Nat]Absence check using state equation in 11609 ms returned sat
[2021-05-16 18:34:30] [INFO ] [Nat]Added 399 Read/Feed constraints in 152 ms returned sat
[2021-05-16 18:34:30] [INFO ] Computed and/alt/rep : 2125/7482/2125 causal constraints in 121 ms.
[2021-05-16 18:34:50] [INFO ] Added : 740 causal constraints over 148 iterations in 20201 ms.(timeout) Result :sat
[2021-05-16 18:34:50] [INFO ] Deduced a trap composed of 6 places in 153 ms
[2021-05-16 18:34:50] [INFO ] Deduced a trap composed of 5 places in 197 ms
[2021-05-16 18:34:51] [INFO ] Deduced a trap composed of 5 places in 159 ms
[2021-05-16 18:34:51] [INFO ] Deduced a trap composed of 5 places in 147 ms
[2021-05-16 18:34:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1316 ms
Attempting to minimize the solution found.
Minimization took 65 ms.
[2021-05-16 18:34:53] [INFO ] [Real]Absence check using 1098 positive place invariants in 1161 ms returned sat
[2021-05-16 18:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:35:04] [INFO ] [Real]Absence check using state equation in 11478 ms returned sat
[2021-05-16 18:35:04] [INFO ] [Real]Added 399 Read/Feed constraints in 61 ms returned sat
[2021-05-16 18:35:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:35:06] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1172 ms returned sat
[2021-05-16 18:35:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:35:17] [INFO ] [Nat]Absence check using state equation in 11413 ms returned sat
[2021-05-16 18:35:17] [INFO ] [Nat]Added 399 Read/Feed constraints in 125 ms returned sat
[2021-05-16 18:35:18] [INFO ] Deduced a trap composed of 5 places in 133 ms
[2021-05-16 18:35:18] [INFO ] Deduced a trap composed of 5 places in 131 ms
[2021-05-16 18:35:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 502 ms
[2021-05-16 18:35:18] [INFO ] Computed and/alt/rep : 2125/7482/2125 causal constraints in 101 ms.
[2021-05-16 18:35:38] [INFO ] Added : 755 causal constraints over 151 iterations in 20072 ms.(timeout) Result :sat
[2021-05-16 18:35:38] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2021-05-16 18:35:39] [INFO ] Deduced a trap composed of 6 places in 148 ms
[2021-05-16 18:35:39] [INFO ] Deduced a trap composed of 6 places in 166 ms
[2021-05-16 18:35:39] [INFO ] Deduced a trap composed of 5 places in 141 ms
[2021-05-16 18:35:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1295 ms
Attempting to minimize the solution found.
Minimization took 73 ms.
[2021-05-16 18:35:41] [INFO ] [Real]Absence check using 1098 positive place invariants in 1189 ms returned sat
[2021-05-16 18:35:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:35:53] [INFO ] [Real]Absence check using state equation in 11542 ms returned sat
[2021-05-16 18:35:53] [INFO ] [Real]Added 399 Read/Feed constraints in 61 ms returned sat
[2021-05-16 18:35:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:35:54] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1193 ms returned sat
[2021-05-16 18:35:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:36:06] [INFO ] [Nat]Absence check using state equation in 11584 ms returned sat
[2021-05-16 18:36:06] [INFO ] [Nat]Added 399 Read/Feed constraints in 220 ms returned sat
[2021-05-16 18:36:06] [INFO ] Deduced a trap composed of 6 places in 129 ms
[2021-05-16 18:36:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2021-05-16 18:36:06] [INFO ] Computed and/alt/rep : 2125/7482/2125 causal constraints in 102 ms.
[2021-05-16 18:36:26] [INFO ] Added : 740 causal constraints over 148 iterations in 20168 ms.(timeout) Result :sat
[2021-05-16 18:36:27] [INFO ] Deduced a trap composed of 6 places in 205 ms
[2021-05-16 18:36:27] [INFO ] Deduced a trap composed of 5 places in 180 ms
[2021-05-16 18:36:27] [INFO ] Deduced a trap composed of 8 places in 167 ms
[2021-05-16 18:36:28] [INFO ] Deduced a trap composed of 5 places in 183 ms
[2021-05-16 18:36:28] [INFO ] Deduced a trap composed of 5 places in 197 ms
[2021-05-16 18:36:28] [INFO ] Deduced a trap composed of 8 places in 158 ms
[2021-05-16 18:36:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2072 ms
Attempting to minimize the solution found.
Minimization took 162 ms.
[2021-05-16 18:36:30] [INFO ] [Real]Absence check using 1098 positive place invariants in 1186 ms returned sat
[2021-05-16 18:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:36:42] [INFO ] [Real]Absence check using state equation in 11365 ms returned sat
[2021-05-16 18:36:42] [INFO ] [Real]Added 399 Read/Feed constraints in 60 ms returned sat
[2021-05-16 18:36:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:36:43] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1191 ms returned sat
[2021-05-16 18:36:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:36:55] [INFO ] [Nat]Absence check using state equation in 11493 ms returned sat
[2021-05-16 18:36:55] [INFO ] [Nat]Added 399 Read/Feed constraints in 210 ms returned sat
[2021-05-16 18:36:55] [INFO ] Deduced a trap composed of 5 places in 135 ms
[2021-05-16 18:36:55] [INFO ] Deduced a trap composed of 5 places in 139 ms
[2021-05-16 18:36:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 538 ms
[2021-05-16 18:36:56] [INFO ] Computed and/alt/rep : 2125/7482/2125 causal constraints in 105 ms.
[2021-05-16 18:37:16] [INFO ] Added : 755 causal constraints over 151 iterations in 20160 ms.(timeout) Result :sat
[2021-05-16 18:37:16] [INFO ] Deduced a trap composed of 7 places in 164 ms
[2021-05-16 18:37:16] [INFO ] Deduced a trap composed of 7 places in 221 ms
[2021-05-16 18:37:17] [INFO ] Deduced a trap composed of 7 places in 156 ms
[2021-05-16 18:37:17] [INFO ] Deduced a trap composed of 6 places in 159 ms
[2021-05-16 18:37:17] [INFO ] Deduced a trap composed of 3 places in 155 ms
[2021-05-16 18:37:18] [INFO ] Deduced a trap composed of 3 places in 172 ms
[2021-05-16 18:37:18] [INFO ] Deduced a trap composed of 4 places in 155 ms
[2021-05-16 18:37:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2269 ms
Attempting to minimize the solution found.
Minimization took 70 ms.
[2021-05-16 18:37:20] [INFO ] [Real]Absence check using 1098 positive place invariants in 1190 ms returned sat
[2021-05-16 18:37:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:37:31] [INFO ] [Real]Absence check using state equation in 11790 ms returned sat
[2021-05-16 18:37:32] [INFO ] [Real]Added 399 Read/Feed constraints in 60 ms returned sat
[2021-05-16 18:37:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:37:33] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1205 ms returned sat
[2021-05-16 18:37:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:37:45] [INFO ] [Nat]Absence check using state equation in 11745 ms returned sat
[2021-05-16 18:37:45] [INFO ] [Nat]Added 399 Read/Feed constraints in 114 ms returned sat
[2021-05-16 18:37:45] [INFO ] Computed and/alt/rep : 2125/7482/2125 causal constraints in 112 ms.
[2021-05-16 18:38:05] [INFO ] Added : 715 causal constraints over 143 iterations in 20147 ms.(timeout) Result :sat
[2021-05-16 18:38:05] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2021-05-16 18:38:06] [INFO ] Deduced a trap composed of 6 places in 148 ms
[2021-05-16 18:38:06] [INFO ] Deduced a trap composed of 5 places in 146 ms
[2021-05-16 18:38:06] [INFO ] Deduced a trap composed of 6 places in 144 ms
[2021-05-16 18:38:07] [INFO ] Deduced a trap composed of 6 places in 149 ms
[2021-05-16 18:38:07] [INFO ] Deduced a trap composed of 7 places in 150 ms
[2021-05-16 18:38:07] [INFO ] Deduced a trap composed of 7 places in 136 ms
[2021-05-16 18:38:07] [INFO ] Deduced a trap composed of 5 places in 156 ms
[2021-05-16 18:38:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2430 ms
Attempting to minimize the solution found.
Minimization took 71 ms.
Incomplete Parikh walk after 288200 steps, including 1000 resets, run finished after 2658 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 369300 steps, including 1000 resets, run finished after 3246 ms. (steps per millisecond=113 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 297200 steps, including 1000 resets, run finished after 2871 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 313700 steps, including 1000 resets, run finished after 3000 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 343900 steps, including 1000 resets, run finished after 3146 ms. (steps per millisecond=109 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 40 out of 2544 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2544/2544 places, 2137/2137 transitions.
Applied a total of 0 rules in 83 ms. Remains 2544 /2544 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2544/2544 places, 2137/2137 transitions.
Starting structural reductions, iteration 0 : 2544/2544 places, 2137/2137 transitions.
Applied a total of 0 rules in 86 ms. Remains 2544 /2544 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
// Phase 1: matrix 2137 rows 2544 cols
[2021-05-16 18:38:23] [INFO ] Computed 1098 place invariants in 6 ms
[2021-05-16 18:38:31] [INFO ] Implicit Places using invariants in 8306 ms returned []
// Phase 1: matrix 2137 rows 2544 cols
[2021-05-16 18:38:31] [INFO ] Computed 1098 place invariants in 11 ms
[2021-05-16 18:38:32] [INFO ] State equation strengthened by 399 read => feed constraints.
[2021-05-16 18:38:48] [INFO ] Implicit Places using invariants and state equation in 16780 ms returned []
Implicit Place search using SMT with State Equation took 25103 ms to find 0 implicit places.
[2021-05-16 18:38:48] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 2137 rows 2544 cols
[2021-05-16 18:38:48] [INFO ] Computed 1098 place invariants in 14 ms
[2021-05-16 18:38:55] [INFO ] Dead Transitions using invariants and state equation in 6801 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2544/2544 places, 2137/2137 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1491 ms. (steps per millisecond=67 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 2137 rows 2544 cols
[2021-05-16 18:38:56] [INFO ] Computed 1098 place invariants in 7 ms
[2021-05-16 18:38:58] [INFO ] [Real]Absence check using 1098 positive place invariants in 1219 ms returned sat
[2021-05-16 18:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:39:10] [INFO ] [Real]Absence check using state equation in 11666 ms returned sat
[2021-05-16 18:39:10] [INFO ] State equation strengthened by 399 read => feed constraints.
[2021-05-16 18:39:10] [INFO ] [Real]Added 399 Read/Feed constraints in 62 ms returned sat
[2021-05-16 18:39:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:39:11] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1224 ms returned sat
[2021-05-16 18:39:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:39:23] [INFO ] [Nat]Absence check using state equation in 11765 ms returned sat
[2021-05-16 18:39:23] [INFO ] [Nat]Added 399 Read/Feed constraints in 149 ms returned sat
[2021-05-16 18:39:23] [INFO ] Computed and/alt/rep : 2125/7482/2125 causal constraints in 107 ms.
[2021-05-16 18:39:30] [INFO ] Added : 255 causal constraints over 51 iterations in 6513 ms. Result :(error "Failed to check-sat")
[2021-05-16 18:39:31] [INFO ] [Real]Absence check using 1098 positive place invariants in 1170 ms returned sat
[2021-05-16 18:39:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:39:43] [INFO ] [Real]Absence check using state equation in 11339 ms returned sat
[2021-05-16 18:39:43] [INFO ] [Real]Added 399 Read/Feed constraints in 96 ms returned sat
[2021-05-16 18:39:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:39:44] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1193 ms returned sat
[2021-05-16 18:39:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:39:56] [INFO ] [Nat]Absence check using state equation in 11384 ms returned sat
[2021-05-16 18:39:56] [INFO ] [Nat]Added 399 Read/Feed constraints in 126 ms returned sat
[2021-05-16 18:39:56] [INFO ] Deduced a trap composed of 5 places in 143 ms
[2021-05-16 18:39:56] [INFO ] Deduced a trap composed of 5 places in 132 ms
[2021-05-16 18:39:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 543 ms
[2021-05-16 18:39:57] [INFO ] Computed and/alt/rep : 2125/7482/2125 causal constraints in 126 ms.
[2021-05-16 18:40:03] [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: Broken pipe (=> (> t266 0) (and (and (> t269 0) (< o269 o266)) (or (and (> t265 0) (< o265 o266)) (and (> t1966 0) (< o1966 o266)) (and (> t2105 0) (< o2105 o266)))))") while checking expression at index 1
[2021-05-16 18:40:04] [INFO ] [Real]Absence check using 1098 positive place invariants in 1191 ms returned sat
[2021-05-16 18:40:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:40:16] [INFO ] [Real]Absence check using state equation in 11366 ms returned sat
[2021-05-16 18:40:16] [INFO ] [Real]Added 399 Read/Feed constraints in 60 ms returned sat
[2021-05-16 18:40:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:40:17] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1193 ms returned sat
[2021-05-16 18:40:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:40:29] [INFO ] [Nat]Absence check using state equation in 12068 ms returned sat
[2021-05-16 18:40:30] [INFO ] [Nat]Added 399 Read/Feed constraints in 221 ms returned sat
[2021-05-16 18:40:30] [INFO ] Deduced a trap composed of 6 places in 120 ms
[2021-05-16 18:40:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2021-05-16 18:40:30] [INFO ] Computed and/alt/rep : 2125/7482/2125 causal constraints in 106 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2021-05-16 18:40:36] [INFO ] Added : 230 causal constraints over 46 iterations in 5918 ms. Result :(error "Failed to check-sat")
[2021-05-16 18:40:37] [INFO ] [Real]Absence check using 1098 positive place invariants in 1189 ms returned sat
[2021-05-16 18:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:40:49] [INFO ] [Real]Absence check using state equation in 11882 ms returned sat
[2021-05-16 18:40:49] [INFO ] [Real]Added 399 Read/Feed constraints in 118 ms returned sat
[2021-05-16 18:40:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:40:51] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1196 ms returned sat
[2021-05-16 18:40:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:41:03] [INFO ] [Nat]Absence check using state equation in 11466 ms returned sat
[2021-05-16 18:41:03] [INFO ] [Nat]Added 399 Read/Feed constraints in 208 ms returned sat
[2021-05-16 18:41:03] [INFO ] Deduced a trap composed of 5 places in 148 ms
[2021-05-16 18:41:03] [INFO ] Deduced a trap composed of 5 places in 140 ms
[2021-05-16 18:41:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 515 ms
[2021-05-16 18:41:03] [INFO ] Computed and/alt/rep : 2125/7482/2125 causal constraints in 154 ms.
[2021-05-16 18:41:10] [INFO ] Added : 235 causal constraints over 47 iterations in 6199 ms. Result :(error "Failed to check-sat")
[2021-05-16 18:41:11] [INFO ] [Real]Absence check using 1098 positive place invariants in 1197 ms returned sat
[2021-05-16 18:41:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:41:23] [INFO ] [Real]Absence check using state equation in 11782 ms returned sat
[2021-05-16 18:41:23] [INFO ] [Real]Added 399 Read/Feed constraints in 58 ms returned sat
[2021-05-16 18:41:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:41:24] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1184 ms returned sat
[2021-05-16 18:41:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:41:36] [INFO ] [Nat]Absence check using state equation in 11695 ms returned sat
[2021-05-16 18:41:36] [INFO ] [Nat]Added 399 Read/Feed constraints in 112 ms returned sat
[2021-05-16 18:41:36] [INFO ] Computed and/alt/rep : 2125/7482/2125 causal constraints in 112 ms.
[2021-05-16 18:41:43] [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 closed (=> (> t257 0) (and (or (and (> t254 0) (< o254 o257)) (and (> t255 0) (< o255 o257)) (and (> t2105 0) (< o2105 o257))) (or (and (> t1022 0) (< o1022 o257)) (and (> t1024 0) (< o1024 o257)))))") while checking expression at index 4
Partial Free-agglomeration rule applied 629 times.
Drop transitions removed 629 transitions
Iterating global reduction 0 with 629 rules applied. Total rules applied 629 place count 2544 transition count 2137
Partial Post-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 671 place count 2544 transition count 2137
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 673 place count 2544 transition count 2135
Applied a total of 673 rules in 375 ms. Remains 2544 /2544 variables (removed 0) and now considering 2135/2137 (removed 2) transitions.
// Phase 1: matrix 2135 rows 2544 cols
[2021-05-16 18:41:43] [INFO ] Computed 1098 place invariants in 7 ms
[2021-05-16 18:41:45] [INFO ] [Real]Absence check using 1098 positive place invariants in 1236 ms returned sat
[2021-05-16 18:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:41:57] [INFO ] [Real]Absence check using state equation in 11672 ms returned sat
[2021-05-16 18:41:57] [INFO ] State equation strengthened by 609 read => feed constraints.
[2021-05-16 18:41:57] [INFO ] [Real]Added 609 Read/Feed constraints in 113 ms returned sat
[2021-05-16 18:41:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:41:58] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1241 ms returned sat
[2021-05-16 18:41:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:42:10] [INFO ] [Nat]Absence check using state equation in 11694 ms returned sat
[2021-05-16 18:42:10] [INFO ] [Nat]Added 609 Read/Feed constraints in 94 ms returned sat
[2021-05-16 18:42:10] [INFO ] Deduced a trap composed of 3 places in 33 ms
[2021-05-16 18:42:10] [INFO ] Deduced a trap composed of 8 places in 31 ms
[2021-05-16 18:42:11] [INFO ] Deduced a trap composed of 3 places in 44 ms
[2021-05-16 18:42:11] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2021-05-16 18:42:11] [INFO ] Deduced a trap composed of 5 places in 32 ms
[2021-05-16 18:42:11] [INFO ] Deduced a trap composed of 15 places in 28 ms
[2021-05-16 18:42:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 803 ms
[2021-05-16 18:42:11] [INFO ] Computed and/alt/rep : 2125/9172/2125 causal constraints in 109 ms.
[2021-05-16 18:42:31] [INFO ] Added : 755 causal constraints over 151 iterations in 20195 ms.(timeout) Result :sat
[2021-05-16 18:42:31] [INFO ] Deduced a trap composed of 7 places in 100 ms
[2021-05-16 18:42:32] [INFO ] Deduced a trap composed of 7 places in 100 ms
[2021-05-16 18:42:32] [INFO ] Deduced a trap composed of 10 places in 98 ms
[2021-05-16 18:42:32] [INFO ] Deduced a trap composed of 7 places in 87 ms
[2021-05-16 18:42:32] [INFO ] Deduced a trap composed of 7 places in 88 ms
[2021-05-16 18:42:33] [INFO ] Deduced a trap composed of 9 places in 87 ms
[2021-05-16 18:42:33] [INFO ] Deduced a trap composed of 11 places in 76 ms
[2021-05-16 18:42:33] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2021-05-16 18:42:33] [INFO ] Deduced a trap composed of 11 places in 71 ms
[2021-05-16 18:42:34] [INFO ] Deduced a trap composed of 10 places in 58 ms
[2021-05-16 18:42:34] [INFO ] Deduced a trap composed of 9 places in 76 ms
[2021-05-16 18:42:34] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2708 ms
Attempting to minimize the solution found.
Minimization took 67 ms.
[2021-05-16 18:42:36] [INFO ] [Real]Absence check using 1098 positive place invariants in 1176 ms returned sat
[2021-05-16 18:42:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:42:47] [INFO ] [Real]Absence check using state equation in 11551 ms returned sat
[2021-05-16 18:42:47] [INFO ] [Real]Added 609 Read/Feed constraints in 156 ms returned sat
[2021-05-16 18:42:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:42:49] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1178 ms returned sat
[2021-05-16 18:42:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:43:01] [INFO ] [Nat]Absence check using state equation in 11660 ms returned sat
[2021-05-16 18:43:01] [INFO ] [Nat]Added 609 Read/Feed constraints in 107 ms returned sat
[2021-05-16 18:43:01] [INFO ] Deduced a trap composed of 3 places in 27 ms
[2021-05-16 18:43:01] [INFO ] Deduced a trap composed of 3 places in 18 ms
[2021-05-16 18:43:01] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2021-05-16 18:43:01] [INFO ] Deduced a trap composed of 8 places in 22 ms
[2021-05-16 18:43:01] [INFO ] Deduced a trap composed of 5 places in 19 ms
[2021-05-16 18:43:01] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-16 18:43:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 696 ms
[2021-05-16 18:43:01] [INFO ] Computed and/alt/rep : 2125/9172/2125 causal constraints in 111 ms.
[2021-05-16 18:43:22] [INFO ] Added : 745 causal constraints over 149 iterations in 20211 ms.(timeout) Result :sat
[2021-05-16 18:43:22] [INFO ] Deduced a trap composed of 7 places in 107 ms
[2021-05-16 18:43:22] [INFO ] Deduced a trap composed of 7 places in 73 ms
[2021-05-16 18:43:22] [INFO ] Deduced a trap composed of 8 places in 68 ms
[2021-05-16 18:43:22] [INFO ] Deduced a trap composed of 7 places in 66 ms
[2021-05-16 18:43:23] [INFO ] Deduced a trap composed of 7 places in 73 ms
[2021-05-16 18:43:23] [INFO ] Deduced a trap composed of 7 places in 72 ms
[2021-05-16 18:43:23] [INFO ] Deduced a trap composed of 7 places in 68 ms
[2021-05-16 18:43:23] [INFO ] Deduced a trap composed of 7 places in 65 ms
[2021-05-16 18:43:24] [INFO ] Deduced a trap composed of 9 places in 68 ms
[2021-05-16 18:43:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2165 ms
Attempting to minimize the solution found.
Minimization took 71 ms.
[2021-05-16 18:43:25] [INFO ] [Real]Absence check using 1098 positive place invariants in 1173 ms returned sat
[2021-05-16 18:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:43:37] [INFO ] [Real]Absence check using state equation in 11907 ms returned sat
[2021-05-16 18:43:37] [INFO ] [Real]Added 609 Read/Feed constraints in 114 ms returned sat
[2021-05-16 18:43:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:43:39] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1187 ms returned sat
[2021-05-16 18:43:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:43:51] [INFO ] [Nat]Absence check using state equation in 11923 ms returned sat
[2021-05-16 18:43:51] [INFO ] [Nat]Added 609 Read/Feed constraints in 98 ms returned sat
[2021-05-16 18:43:51] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2021-05-16 18:43:51] [INFO ] Deduced a trap composed of 3 places in 25 ms
[2021-05-16 18:43:51] [INFO ] Deduced a trap composed of 3 places in 23 ms
[2021-05-16 18:43:51] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2021-05-16 18:43:52] [INFO ] Deduced a trap composed of 3 places in 18 ms
[2021-05-16 18:43:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 609 ms
[2021-05-16 18:43:52] [INFO ] Computed and/alt/rep : 2125/9172/2125 causal constraints in 109 ms.
[2021-05-16 18:44:12] [INFO ] Added : 725 causal constraints over 145 iterations in 20198 ms.(timeout) Result :sat
[2021-05-16 18:44:12] [INFO ] Deduced a trap composed of 7 places in 105 ms
[2021-05-16 18:44:12] [INFO ] Deduced a trap composed of 7 places in 95 ms
[2021-05-16 18:44:13] [INFO ] Deduced a trap composed of 13 places in 103 ms
[2021-05-16 18:44:13] [INFO ] Deduced a trap composed of 9 places in 117 ms
[2021-05-16 18:44:13] [INFO ] Deduced a trap composed of 7 places in 113 ms
[2021-05-16 18:44:13] [INFO ] Deduced a trap composed of 7 places in 101 ms
[2021-05-16 18:44:14] [INFO ] Deduced a trap composed of 7 places in 148 ms
[2021-05-16 18:44:14] [INFO ] Deduced a trap composed of 10 places in 95 ms
[2021-05-16 18:44:14] [INFO ] Deduced a trap composed of 7 places in 82 ms
[2021-05-16 18:44:14] [INFO ] Deduced a trap composed of 15 places in 69 ms
[2021-05-16 18:44:15] [INFO ] Deduced a trap composed of 9 places in 63 ms
[2021-05-16 18:44:15] [INFO ] Deduced a trap composed of 9 places in 72 ms
[2021-05-16 18:44:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3106 ms
Attempting to minimize the solution found.
Minimization took 71 ms.
[2021-05-16 18:44:17] [INFO ] [Real]Absence check using 1098 positive place invariants in 1210 ms returned sat
[2021-05-16 18:44:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:44:28] [INFO ] [Real]Absence check using state equation in 11580 ms returned sat
[2021-05-16 18:44:28] [INFO ] [Real]Added 609 Read/Feed constraints in 113 ms returned sat
[2021-05-16 18:44:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:44:30] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1196 ms returned sat
[2021-05-16 18:44:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:44:42] [INFO ] [Nat]Absence check using state equation in 11619 ms returned sat
[2021-05-16 18:44:42] [INFO ] [Nat]Added 609 Read/Feed constraints in 95 ms returned sat
[2021-05-16 18:44:42] [INFO ] Deduced a trap composed of 3 places in 31 ms
[2021-05-16 18:44:42] [INFO ] Deduced a trap composed of 3 places in 30 ms
[2021-05-16 18:44:42] [INFO ] Deduced a trap composed of 3 places in 28 ms
[2021-05-16 18:44:42] [INFO ] Deduced a trap composed of 5 places in 26 ms
[2021-05-16 18:44:42] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2021-05-16 18:44:42] [INFO ] Deduced a trap composed of 8 places in 25 ms
[2021-05-16 18:44:42] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2021-05-16 18:44:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 842 ms
[2021-05-16 18:44:43] [INFO ] Computed and/alt/rep : 2125/9172/2125 causal constraints in 111 ms.
[2021-05-16 18:45:03] [INFO ] Added : 760 causal constraints over 152 iterations in 20065 ms.(timeout) Result :sat
[2021-05-16 18:45:03] [INFO ] Deduced a trap composed of 7 places in 87 ms
[2021-05-16 18:45:03] [INFO ] Deduced a trap composed of 8 places in 74 ms
[2021-05-16 18:45:03] [INFO ] Deduced a trap composed of 11 places in 78 ms
[2021-05-16 18:45:03] [INFO ] Deduced a trap composed of 9 places in 93 ms
[2021-05-16 18:45:04] [INFO ] Deduced a trap composed of 11 places in 71 ms
[2021-05-16 18:45:04] [INFO ] Deduced a trap composed of 7 places in 67 ms
[2021-05-16 18:45:04] [INFO ] Deduced a trap composed of 13 places in 54 ms
[2021-05-16 18:45:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1644 ms
Attempting to minimize the solution found.
Minimization took 63 ms.
[2021-05-16 18:45:06] [INFO ] [Real]Absence check using 1098 positive place invariants in 1172 ms returned sat
[2021-05-16 18:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 18:45:17] [INFO ] [Real]Absence check using state equation in 11062 ms returned sat
[2021-05-16 18:45:17] [INFO ] [Real]Added 609 Read/Feed constraints in 113 ms returned sat
[2021-05-16 18:45:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 18:45:19] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1154 ms returned sat
[2021-05-16 18:45:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 18:45:30] [INFO ] [Nat]Absence check using state equation in 11365 ms returned sat
[2021-05-16 18:45:30] [INFO ] [Nat]Added 609 Read/Feed constraints in 95 ms returned sat
[2021-05-16 18:45:30] [INFO ] Deduced a trap composed of 3 places in 28 ms
[2021-05-16 18:45:30] [INFO ] Deduced a trap composed of 6 places in 26 ms
[2021-05-16 18:45:30] [INFO ] Deduced a trap composed of 3 places in 19 ms
[2021-05-16 18:45:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 382 ms
[2021-05-16 18:45:31] [INFO ] Computed and/alt/rep : 2125/9172/2125 causal constraints in 113 ms.
[2021-05-16 18:45:51] [INFO ] Added : 740 causal constraints over 148 iterations in 20071 ms.(timeout) Result :sat
[2021-05-16 18:45:51] [INFO ] Deduced a trap composed of 7 places in 130 ms
[2021-05-16 18:45:51] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2021-05-16 18:45:51] [INFO ] Deduced a trap composed of 7 places in 122 ms
[2021-05-16 18:45:52] [INFO ] Deduced a trap composed of 7 places in 130 ms
[2021-05-16 18:45:52] [INFO ] Deduced a trap composed of 9 places in 124 ms
[2021-05-16 18:45:52] [INFO ] Deduced a trap composed of 7 places in 119 ms
[2021-05-16 18:45:52] [INFO ] Deduced a trap composed of 7 places in 136 ms
[2021-05-16 18:45:53] [INFO ] Deduced a trap composed of 7 places in 122 ms
[2021-05-16 18:45:53] [INFO ] Deduced a trap composed of 7 places in 109 ms
[2021-05-16 18:45:53] [INFO ] Deduced a trap composed of 9 places in 115 ms
[2021-05-16 18:45:53] [INFO ] Deduced a trap composed of 15 places in 105 ms
[2021-05-16 18:45:54] [INFO ] Deduced a trap composed of 13 places in 95 ms
[2021-05-16 18:45:54] [INFO ] Deduced a trap composed of 13 places in 82 ms
[2021-05-16 18:45:54] [INFO ] Deduced a trap composed of 11 places in 90 ms
[2021-05-16 18:45:54] [INFO ] Deduced a trap composed of 7 places in 97 ms
[2021-05-16 18:45:55] [INFO ] Deduced a trap composed of 15 places in 78 ms
[2021-05-16 18:45:55] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4303 ms
Attempting to minimize the solution found.
Minimization took 71 ms.
[2021-05-16 18:45:55] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2021-05-16 18:45:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 23 ms.
[2021-05-16 18:45:56] [INFO ] Flatten gal took : 356 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldPPPt-PT-100B @ 3570 seconds

FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3522
rslt: Output for ReachabilityFireability @ ShieldPPPt-PT-100B

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 16 18:45:57 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 704
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p1412) AND (1 <= p2223) AND (1 <= p2501) AND (1 <= p1169))))",
"processed_size": 73,
"rewrites": 1
},
"result":
{
"edges": 144,
"markings": 145,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 880
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 4,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p37) AND ((p594 <= 0) OR (((p1118 <= 0)) AND ((p1509 <= 0)))) AND ((p1966 <= 0) OR (p1 <= 0)))))",
"processed_size": 111,
"rewrites": 1
},
"result":
{
"edges": 230,
"markings": 231,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 14,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1174
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p939) AND ((p1932 <= 0)) AND (1 <= p611) AND ((p193 <= 0) OR (p195 <= 0)) AND (((1 <= p1495)) OR ((1 <= p336) AND (1 <= p356))))))",
"processed_size": 145,
"rewrites": 1
},
"result":
{
"edges": 352,
"markings": 352,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 22,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1761
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 6,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "A (G (((((p78 <= 0)) AND ((p2139 <= 0)) AND ((p1527 <= 0) OR (p1989 <= 0))) OR (((p196 <= 0) OR (p230 <= 0) OR (p389 <= 0)) AND ((p1191 <= 0) OR (p1208 <= 0) OR (p1302 <= 0) OR (p1326 <= 0))))))",
"processed_size": 201,
"rewrites": 2
},
"result":
{
"edges": 162,
"markings": 163,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 29,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3522
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p1020) AND ((p1954 <= 0) OR (p1956 <= 0) OR ((1 <= p2368)) OR ((1 <= p1455)))) OR ((1 <= p52) AND ((p362 <= 0) OR ((1 <= p2147)) OR (p387 <= 0) OR ((1 <= p1674) AND (1 <= p1708)))))))",
"processed_size": 204,
"rewrites": 1
},
"result":
{
"edges": 144,
"markings": 145,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 17,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 52456,
"runtime": 48.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 9751,
"conflict_clusters": 860,
"places": 2544,
"places_significant": 1446,
"singleton_clusters": 0,
"transitions": 2137
},
"result":
{
"preliminary_value": "yes yes yes no yes ",
"value": "yes yes yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 4681/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2544
lola: finding significant places
lola: 2544 places, 2137 transitions, 1446 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p594 <= 1)
lola: LP says that atomic proposition is always true: (p1118 <= 1)
lola: LP says that atomic proposition is always true: (p1509 <= 1)
lola: LP says that atomic proposition is always true: (p1966 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p1412 <= 1)
lola: LP says that atomic proposition is always true: (p2223 <= 1)
lola: LP says that atomic proposition is always true: (p2501 <= 1)
lola: LP says that atomic proposition is always true: (p1169 <= 1)
lola: LP says that atomic proposition is always true: (p939 <= 1)
lola: LP says that atomic proposition is always true: (p1932 <= 1)
lola: LP says that atomic proposition is always true: (p611 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p1495 <= 1)
lola: LP says that atomic proposition is always true: (p336 <= 1)
lola: LP says that atomic proposition is always true: (p356 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p2139 <= 1)
lola: LP says that atomic proposition is always true: (p1527 <= 1)
lola: LP says that atomic proposition is always true: (p1989 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p389 <= 1)
lola: LP says that atomic proposition is always true: (p1191 <= 1)
lola: LP says that atomic proposition is always true: (p1208 <= 1)
lola: LP says that atomic proposition is always true: (p1302 <= 1)
lola: LP says that atomic proposition is always true: (p1326 <= 1)
lola: LP says that atomic proposition is always true: (p1020 <= 1)
lola: LP says that atomic proposition is always true: (p1954 <= 1)
lola: LP says that atomic proposition is always true: (p1956 <= 1)
lola: LP says that atomic proposition is always true: (p2368 <= 1)
lola: LP says that atomic proposition is always true: (p1455 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p2147 <= 1)
lola: LP says that atomic proposition is always true: (p362 <= 1)
lola: LP says that atomic proposition is always true: (p387 <= 1)
lola: LP says that atomic proposition is always true: (p1674 <= 1)
lola: LP says that atomic proposition is always true: (p1708 <= 1)
lola: E (F (((1 <= p37) AND ((p594 <= 0) OR (((p1118 <= 0)) AND ((p1509 <= 0)))) AND ((p1966 <= 0) OR (p1 <= 0))))) : E (F (((1 <= p1412) AND (1 <= p2223) AND (1 <= p2501) AND (1 <= p1169)))) : E (F (((1 <= p939) AND ((p1932 <= 0)) AND (1 <= p611) AND ((p193 <= 0) OR (p195 <= 0)) AND (((1 <= p1495)) OR ((1 <= p336) AND (1 <= p356)))))) : A (G (((((p78 <= 0)) AND ((p2139 <= 0)) AND ((p1527 <= 0) OR (p1989 <= 0))) OR (((p196 <= 0) OR (p230 <= 0) OR (p389 <= 0)) AND ((p1191 <= 0) OR (p1208 <= 0) OR (p1302 <= 0) OR (p1326 <= 0)))))) : E (F ((((1 <= p1020) AND ((p1954 <= 0) OR (p1956 <= 0) OR ((1 <= p2368)) OR ((1 <= p1455)))) OR ((1 <= p52) AND ((p362 <= 0) OR ((1 <= p2147)) OR (p387 <= 0) OR ((1 <= p1674) AND (1 <= p1708)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1412) AND (1 <= p2223) AND (1 <= p2501) AND (1 <= p1169))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p1412) AND (1 <= p2223) AND (1 <= p2501) AND (1 <= p1169))))
lola: processed formula length: 73
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1412) AND (1 <= p2223) AND (1 <= p2501) AND (1 <= p1169))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 145 markings, 144 edges
lola: ========================================
lola: subprocess 1 will run for 880 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p37) AND ((p594 <= 0) OR (((p1118 <= 0)) AND ((p1509 <= 0)))) AND ((p1966 <= 0) OR (p1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p37) AND ((p594 <= 0) OR (((p1118 <= 0)) AND ((p1509 <= 0)))) AND ((p1966 <= 0) OR (p1 <= 0)))))
lola: processed formula length: 111
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p37) AND ((p594 <= 0) OR (((p1118 <= 0)) AND ((p1509 <= 0)))) AND ((p1966 <= 0) OR (p1 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 231 markings, 230 edges
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file ReachabilityFireability-0.sara.
lola: subprocess 2 will run for 1174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p939) AND ((p1932 <= 0)) AND (1 <= p611) AND ((p193 <= 0) OR (p195 <= 0)) AND (((1 <= p1495)) OR ((1 <= p336) AND (1 <= p356))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p939) AND ((p1932 <= 0)) AND (1 <= p611) AND ((p193 <= 0) OR (p195 <= 0)) AND (((1 <= p1495)) OR ((1 <= p336) AND (1 <= p356))))))
lola: processed formula length: 145
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p939) AND ((p1932 <= 0)) AND (1 <= p611) AND ((p193 <= 0) OR (p195 <= 0)) AND (((1 <= p1495)) OR ((1 <= p336) AND (1 <= p356))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 352 markings, 352 edges
lola: subprocess 3 will run for 1761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p78 <= 0)) AND ((p2139 <= 0)) AND ((p1527 <= 0) OR (p1989 <= 0))) OR (((p196 <= 0) OR (p230 <= 0) OR (p389 <= 0)) AND ((p1191 <= 0) OR (p1208 <= 0) OR (p1302 <= 0) OR (p1326 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((((p78 <= 0)) AND ((p2139 <= 0)) AND ((p1527 <= 0) OR (p1989 <= 0))) OR (((p196 <= 0) OR (p230 <= 0) OR (p389 <= 0)) AND ((p1191 <= 0) OR (p1208 <= 0) OR (p1302 <= 0) OR (p1326 <= 0))))))
lola: processed formula length: 201
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p78)) OR ((1 <= p2139)) OR ((1 <= p1527) AND (1 <= p1989))) AND (((1 <= p196) AND (1 <= p230) AND (1 <= p389)) OR ((1 <= p1191) AND (1 <= p1208) AND (1 <= p1302) AND (1 <= p1326))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 29 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 163 markings, 162 edges
lola: ========================================
lola: subprocess 4 will run for 3522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p1020) AND ((p1954 <= 0) OR (p1956 <= 0) OR ((1 <= p2368)) OR ((1 <= p1455)))) OR ((1 <= p52) AND ((p362 <= 0) OR ((1 <= p2147)) OR (p387 <= 0) OR ((1 <= p1674) AND (1 <= p1708)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p1020) AND ((p1954 <= 0) OR (p1956 <= 0) OR ((1 <= p2368)) OR ((1 <= p1455)))) OR ((1 <= p52) AND ((p362 <= 0) OR ((1 <= p2147)) OR (p387 <= 0) OR ((1 <= p1674) AND (1 <= p1708)))))))
lola: processed formula length: 204
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p1020) AND ((p1954 <= 0) OR (p1956 <= 0) OR ((1 <= p2368)) OR ((1 <= p1455)))) OR ((1 <= p52) AND ((p362 <= 0) OR ((1 <= p2147)) OR (p387 <= 0) OR ((1 <= p1674) AND (1 <= p1708)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 17 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 145 markings, 144 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes
lola:
preliminary result: yes yes yes no yes
lola: ========================================
lola: memory consumption: 52456 KB
lola: time consumption: 48 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427364 kB
MemFree: 13758644 kB
After kill :
MemTotal: 16427364 kB
MemFree: 13756008 kB

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

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="ShieldPPPt-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is ShieldPPPt-PT-100B, 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 r227-tall-162098231300432"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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