Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r504-tall-171649611800005.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is JoinFreeModules-PT-0003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649611800005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.4K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717217856179

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0003
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:57:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 04:57:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:57:37] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2024-06-01 04:57:37] [INFO ] Transformed 16 places.
[2024-06-01 04:57:37] [INFO ] Transformed 25 transitions.
[2024-06-01 04:57:37] [INFO ] Parsed PT model containing 16 places and 25 transitions and 71 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 10
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[2, 0, 1, 0, 3, 0, 3, 3, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[2, 0, 1, 0, 3, 0, 3, 3, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 25 rows 15 cols
[2024-06-01 04:57:37] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0, 1, 0, 3, 0, 3, 3, 0, 0] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6, 6]
RANDOM walk for 10000 steps (2 resets) in 41 ms. (238 steps per ms)
BEST_FIRST walk for 100008 steps (20 resets) in 89 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 4, 4, 5, 3, 4, 3, 3, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6, 6]
[2024-06-01 04:57:37] [INFO ] Invariant cache hit.
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 04:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 04:57:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 04:57:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:57:38] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 04:57:38] [INFO ] Added : 11 causal constraints over 4 iterations in 31 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2024-06-01 04:57:38] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 04:57:38] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 10 ms to minimize.
[2024-06-01 04:57:38] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 04:57:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2024-06-01 04:57:38] [INFO ] Added : 11 causal constraints over 3 iterations in 101 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:57:38] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:57:38] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2024-06-01 04:57:38] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:57:38] [INFO ] Added : 9 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2024-06-01 04:57:38] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 04:57:38] [INFO ] Added : 9 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 7 ms returned sat
[2024-06-01 04:57:38] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:57:38] [INFO ] Added : 8 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-06-01 04:57:38] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:57:38] [INFO ] Added : 5 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:57:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-06-01 04:57:39] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 04:57:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2024-06-01 04:57:39] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:57:39] [INFO ] Added : 14 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 04:57:39] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-06-01 04:57:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 04:57:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:39] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-06-01 04:57:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2024-06-01 04:57:39] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:57:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 04:57:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-06-01 04:57:39] [INFO ] Added : 12 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 04:57:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:39] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:57:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:39] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:57:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:57:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
[2024-06-01 04:57:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-06-01 04:57:39] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:57:39] [INFO ] Added : 9 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 4, 4, 5, 3, 4, 3, 3, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 4, 4, 5, 3, 4, 3, 3, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6, 6]
Support contains 10 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 25/25 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 24
Applied a total of 1 rules in 12 ms. Remains 15 /15 variables (removed 0) and now considering 24/25 (removed 1) transitions.
Running 18 sub problems to find dead transitions.
// Phase 1: matrix 24 rows 15 cols
[2024-06-01 04:57:39] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 04:57:39] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 04:57:39] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 04:57:39] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 04:57:39] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 18 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 18 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
After SMT, in 542ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 548ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 570 ms. Remains : 15/15 places, 24/25 transitions.
[2024-06-01 04:57:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 4, 4, 5, 3, 4, 3, 3, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6, 6]
RANDOM walk for 1000000 steps (2 resets) in 945 ms. (1057 steps per ms)
BEST_FIRST walk for 10000008 steps (20 resets) in 2894 ms. (3454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 4, 4, 5, 3, 4, 3, 3, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6, 6]
[2024-06-01 04:57:43] [INFO ] Invariant cache hit.
[2024-06-01 04:57:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:57:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 04:57:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-06-01 04:57:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 04:57:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:57:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:57:44] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:57:44] [INFO ] Added : 10 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:57:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 04:57:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-06-01 04:57:44] [INFO ] Added : 16 causal constraints over 4 iterations in 55 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:57:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 12 ms returned sat
[2024-06-01 04:57:44] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:57:44] [INFO ] Added : 16 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:57:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2024-06-01 04:57:44] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:57:44] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2024-06-01 04:57:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 04:57:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2024-06-01 04:57:44] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:57:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 04:57:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2024-06-01 04:57:44] [INFO ] Added : 15 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 04:57:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:57:44] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:57:44] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 10 ms returned sat
[2024-06-01 04:57:44] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 04:57:44] [INFO ] Added : 9 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:57:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 04:57:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2024-06-01 04:57:44] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:57:45] [INFO ] Added : 8 causal constraints over 2 iterations in 232 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 04:57:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:57:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 04:57:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-06-01 04:57:45] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:57:45] [INFO ] Added : 9 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 4, 4, 5, 3, 4, 3, 3, 5, 4] Max Struct:[5, 6, 6, 6, 6, 6, 6, 6, 6, 6]
FORMULA JoinFreeModules-PT-0003-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4, 5, 3, 4, 3, 3, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6]
Support contains 9 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 24/24 transitions.
[2024-06-01 04:57:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 4, 5, 3, 4, 3, 3, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6]
RANDOM walk for 1000000 steps (2 resets) in 856 ms. (1166 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 2530 ms. (3555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4, 5, 3, 4, 3, 3, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6]
[2024-06-01 04:57:48] [INFO ] Invariant cache hit.
[2024-06-01 04:57:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:48] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 04:57:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:57:48] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:57:48] [INFO ] Added : 10 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 04:57:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:48] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-06-01 04:57:48] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:57:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 04:57:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-06-01 04:57:48] [INFO ] Added : 16 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 04:57:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:57:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 12 ms returned sat
[2024-06-01 04:57:48] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:57:48] [INFO ] Added : 16 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 04:57:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 04:57:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2024-06-01 04:57:49] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:57:49] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 04:57:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2024-06-01 04:57:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 04:57:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2024-06-01 04:57:49] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 04:57:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 04:57:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2024-06-01 04:57:49] [INFO ] Added : 15 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 04:57:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:57:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:57:49] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:57:49] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 04:57:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 04:57:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2024-06-01 04:57:49] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:57:49] [INFO ] Added : 9 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 04:57:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:57:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2024-06-01 04:57:49] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 04:57:49] [INFO ] Added : 8 causal constraints over 2 iterations in 234 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 04:57:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 04:57:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:57:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 04:57:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-06-01 04:57:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 04:57:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-06-01 04:57:49] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 04:57:49] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4, 5, 3, 4, 3, 3, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4, 5, 3, 4, 3, 3, 5, 4] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6]
Support contains 9 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 24/24 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-06-01 04:57:49] [INFO ] Invariant cache hit.
[2024-06-01 04:57:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 04:57:49] [INFO ] Invariant cache hit.
[2024-06-01 04:57:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 04:57:49] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-06-01 04:57:49] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-06-01 04:57:49] [INFO ] Invariant cache hit.
[2024-06-01 04:57:49] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 04:57:49] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 04:57:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 04:57:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 18 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 18 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
After SMT, in 530ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 530ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 587 ms. Remains : 15/15 places, 24/24 transitions.
RANDOM walk for 40000 steps (8 resets) in 1352 ms. (29 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
Probably explored full state space saw : 35937 states, properties seen :0
Probabilistic random walk after 261360 steps, saw 35937 distinct states, run finished after 1086 ms. (steps per millisecond=240 ) properties seen :0
Explored full state space saw : 35937 states, properties seen :0
Exhaustive walk after 261360 steps, saw 35937 distinct states, run finished after 780 ms. (steps per millisecond=335 ) properties seen :0
FORMULA JoinFreeModules-PT-0003-UpperBounds-13 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-12 5 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-14 3 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-11 3 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-10 3 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-08 3 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-05 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-04 3 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-03 5 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-07 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-02 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-15 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-01 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 9 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 15441 ms.
ITS solved all properties within timeout

BK_STOP 1717217872959

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="JoinFreeModules-PT-0003"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is JoinFreeModules-PT-0003, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r504-tall-171649611800005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0003.tgz
mv JoinFreeModules-PT-0003 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;