fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654446400119
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16200.384 3600000.00 10073462.00 563.30 FFTTTTTT?TFFTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446400119.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S02J06T10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446400119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 11K Apr 11 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 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 PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716906958657

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityFireability COL
Running Version 202405141337
[2024-05-28 14:36:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 14:36:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:36:00] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 14:36:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:36:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1149 ms
[2024-05-28 14:36:02] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 63 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 14:36:02] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 14:36:02] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
[2024-05-28 14:36:02] [INFO ] Flatten gal took : 90 ms
[2024-05-28 14:36:02] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:36:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15365675253464727483.gal : 16 ms
RANDOM walk for 40000 steps (22 resets) in 1290 ms. (30 steps per ms) remains 3/3 properties
[2024-05-28 14:36:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5056328769057844697.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15365675253464727483.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5056328769057844697.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (11 resets) in 693 ms. (57 steps per ms) remains 3/3 properties

BEST_FIRST walk for 40002 steps (12 resets) in 531 ms. (75 steps per ms) remains 3/3 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5056328769057844697.prop.
BEST_FIRST walk for 40001 steps (21 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :11 after 21
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :21 after 47
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :47 after 66
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :66 after 117
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :117 after 264
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :264 after 896
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :896 after 5201
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :5201 after 34634
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :77149 after 144495
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :313014 after 315973
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,358221,1.66693,45080,2,3278,20,153843,9,0,428,196946,0
Total reachable state count : 358221

Verifying 3 reachability properties.
Invariant property PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-04 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-04,0,1.66989,45080,1,0,20,153843,9,0,454,196946,0
Invariant property PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-07,0,1.67127,45080,1,0,20,153843,9,0,458,196946,0
Invariant property PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-09,0,1.67217,45080,1,0,20,153843,9,0,473,196946,0
Interrupted probabilistic random walk after 505657 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 3
Probabilistic random walk after 505657 steps, saw 179812 distinct states, run finished after 3032 ms. (steps per millisecond=166 ) properties seen :0
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-28 14:36:06] [INFO ] Flatten gal took : 7 ms
[2024-05-28 14:36:06] [INFO ] Flatten gal took : 7 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-28 14:36:06] [INFO ] Flatten gal took : 15 ms
[2024-05-28 14:36:06] [INFO ] Flatten gal took : 6 ms
[2024-05-28 14:36:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8323935403832525711.gal : 12 ms
[2024-05-28 14:36:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10992225523144021543.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8323935403832525711.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10992225523144021543.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :
ITS runner timed out or was interrupted.

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10992225523144021543.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5,0.008978,4076,2,156,5,310,6,0,419,107,0
Total reachable state count : 5

FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-04 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-07 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-09 TRUE TECHNIQUES CPN_APPROX
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 14:36:06] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 150 ms.
[2024-05-28 14:36:06] [INFO ] Unfolded 16 HLPN properties in 1 ms.
[2024-05-28 14:36:06] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 14:36:06] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-28 14:36:06] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 14:36:06] [INFO ] Reduced 40 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
[2024-05-28 14:36:07] [INFO ] Flatten gal took : 504 ms
RANDOM walk for 40000 steps (11 resets) in 3068 ms. (13 steps per ms) remains 6/13 properties
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 14:36:07] [INFO ] Flatten gal took : 267 ms
[2024-05-28 14:36:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12904027721365769664.gal : 53 ms
[2024-05-28 14:36:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10903818038889126777.prop : 38 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12904027721365769664.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10903818038889126777.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10903818038889126777.prop.
BEST_FIRST walk for 40003 steps (10 resets) in 1975 ms. (20 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 2034 ms. (19 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 463 ms. (86 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
BEST_FIRST walk for 40003 steps (35 resets) in 470 ms. (84 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 7
BEST_FIRST walk for 40003 steps (8 resets) in 1060 ms. (37 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :7 after 11
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :11 after 12
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :12 after 16
BEST_FIRST walk for 40004 steps (8 resets) in 1978 ms. (20 steps per ms) remains 6/6 properties
[2024-05-28 14:36:10] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-05-28 14:36:10] [INFO ] Computed 58 invariants in 123 ms
[2024-05-28 14:36:10] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :16 after 67
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :67 after 209
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :433 after 4649
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 62/705 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-00 is UNSAT
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-01 is UNSAT
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-10 is UNSAT
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-11 is UNSAT
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-12 is UNSAT
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 133/838 variables, 17/52 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/838 variables, 0/52 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/844 variables, 6/58 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 0/58 constraints. Problems are: Problem set: 5 solved, 1 unsolved
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :4649 after 5279
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2476/2476 variables, and 902 constraints, problems are : Problem set: 5 solved, 1 unsolved in 3707 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 844/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 267/277 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 530/807 variables, 30/32 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-28 14:36:19] [INFO ] Deduced a trap composed of 73 places in 310 ms of which 56 ms to minimize.
[2024-05-28 14:36:19] [INFO ] Deduced a trap composed of 73 places in 447 ms of which 4 ms to minimize.
[2024-05-28 14:36:19] [INFO ] Deduced a trap composed of 73 places in 293 ms of which 8 ms to minimize.
[2024-05-28 14:36:20] [INFO ] Deduced a trap composed of 74 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:36:20] [INFO ] Deduced a trap composed of 74 places in 383 ms of which 26 ms to minimize.
[2024-05-28 14:36:20] [INFO ] Deduced a trap composed of 74 places in 284 ms of which 2 ms to minimize.
[2024-05-28 14:36:21] [INFO ] Deduced a trap composed of 73 places in 155 ms of which 2 ms to minimize.
[2024-05-28 14:36:21] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 8/40 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-28 14:36:21] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 1/41 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/807 variables, 0/41 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 21/828 variables, 11/52 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-28 14:36:25] [INFO ] Deduced a trap composed of 498 places in 4078 ms of which 9 ms to minimize.
SMT process timed out in 15392ms, After SMT, problems are : Problem set: 5 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 542 place count 572 transition count 1382
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 562 place count 572 transition count 1362
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 582 place count 552 transition count 1362
Applied a total of 582 rules in 417 ms. Remains 552 /844 variables (removed 292) and now considering 1362/1652 (removed 290) transitions.
Running 1360 sub problems to find dead transitions.
[2024-05-28 14:36:26] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 552 cols
[2024-05-28 14:36:26] [INFO ] Computed 56 invariants in 34 ms
[2024-05-28 14:36:26] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :5279 after 5633
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-05-28 14:36:46] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-05-28 14:36:46] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-28 14:36:46] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2024-05-28 14:36:46] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:36:47] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:36:47] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:36:47] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2024-05-28 14:36:47] [INFO ] Deduced a trap composed of 44 places in 239 ms of which 26 ms to minimize.
[2024-05-28 14:36:47] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 1 ms to minimize.
[2024-05-28 14:36:47] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2024-05-28 14:36:48] [INFO ] Deduced a trap composed of 214 places in 423 ms of which 3 ms to minimize.
SMT process timed out in 22754ms, After SMT, problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 22777ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23218 ms. Remains : 552/844 places, 1362/1652 transitions.
RANDOM walk for 40000 steps (20 resets) in 854 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (10 resets) in 265 ms. (150 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 252464 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 252464 steps, saw 155640 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-28 14:36:52] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 14:36:52] [INFO ] Invariant cache hit.
[2024-05-28 14:36:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 298/515 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:36:52] [INFO ] Deduced a trap composed of 225 places in 352 ms of which 5 ms to minimize.
[2024-05-28 14:36:53] [INFO ] Deduced a trap composed of 222 places in 331 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:36:53] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 4 ms to minimize.
[2024-05-28 14:36:53] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 5 ms to minimize.
[2024-05-28 14:36:53] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 2 ms to minimize.
[2024-05-28 14:36:54] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 2 ms to minimize.
[2024-05-28 14:36:54] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 2 ms to minimize.
[2024-05-28 14:36:54] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 1 ms to minimize.
[2024-05-28 14:36:54] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 2 ms to minimize.
[2024-05-28 14:36:54] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2024-05-28 14:36:54] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/525 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/549 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/550 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1342/1892 variables, 550/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1892 variables, 120/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1892 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1894 variables, 2/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1894 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1894 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1894 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1894/1894 variables, and 739 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4107 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 298/515 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:36:56] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/525 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/549 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/550 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1342/1892 variables, 550/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1892 variables, 120/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1892 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1892 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1894 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1894 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1894 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1894 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1894/1894 variables, and 741 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2384 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 6525ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
Parikh walk visited 0 properties in 156 ms.
Support contains 10 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
SDD size :5633 after 7280
Applied a total of 0 rules in 57 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 552/552 places, 1362/1362 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 39 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
[2024-05-28 14:36:59] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 14:36:59] [INFO ] Invariant cache hit.
[2024-05-28 14:36:59] [INFO ] Implicit Places using invariants in 705 ms returned [496, 497, 498, 499, 500, 501, 502, 503, 504, 505]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 714 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 542/552 places, 1362/1362 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 532 transition count 1352
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 532 transition count 1352
Applied a total of 20 rules in 38 ms. Remains 532 /542 variables (removed 10) and now considering 1352/1362 (removed 10) transitions.
[2024-05-28 14:36:59] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
// Phase 1: matrix 1332 rows 532 cols
[2024-05-28 14:36:59] [INFO ] Computed 46 invariants in 17 ms
[2024-05-28 14:37:00] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-05-28 14:37:00] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:37:00] [INFO ] Invariant cache hit.
[2024-05-28 14:37:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:37:13] [INFO ] Implicit Places using invariants and state equation in 12894 ms returned []
Implicit Place search using SMT with State Equation took 13595 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 532/552 places, 1352/1362 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 14388 ms. Remains : 532/552 places, 1352/1362 transitions.
RANDOM walk for 40000 steps (22 resets) in 355 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (11 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 293925 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 1
Probabilistic random walk after 293925 steps, saw 168598 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
[2024-05-28 14:37:16] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:37:16] [INFO ] Invariant cache hit.
[2024-05-28 14:37:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:37:17] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 16 ms to minimize.
[2024-05-28 14:37:17] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 2 ms to minimize.
[2024-05-28 14:37:17] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
[2024-05-28 14:37:17] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 2 ms to minimize.
[2024-05-28 14:37:17] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2024-05-28 14:37:17] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2024-05-28 14:37:17] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:37:18] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/530 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1332/1862 variables, 530/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1862 variables, 120/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1862 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1864 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1864 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1864/1864 variables, and 706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2907 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 398/408 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/421 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/526 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:37:20] [INFO ] Deduced a trap composed of 44 places in 691 ms of which 4 ms to minimize.
[2024-05-28 14:37:21] [INFO ] Deduced a trap composed of 44 places in 755 ms of which 27 ms to minimize.
[2024-05-28 14:37:21] [INFO ] Deduced a trap composed of 226 places in 605 ms of which 29 ms to minimize.
[2024-05-28 14:37:22] [INFO ] Deduced a trap composed of 218 places in 530 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/530 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1332/1862 variables, 530/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1862 variables, 120/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1862 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1862 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1864 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1864 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1864 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1864/1864 variables, and 711 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 532/532 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 6996ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 139 ms.
Support contains 10 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 46 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 532/532 places, 1352/1352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 1352/1352 transitions.
Applied a total of 0 rules in 41 ms. Remains 532 /532 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-05-28 14:37:23] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:37:23] [INFO ] Invariant cache hit.
[2024-05-28 14:37:24] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-05-28 14:37:24] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:37:24] [INFO ] Invariant cache hit.
[2024-05-28 14:37:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:37:34] [INFO ] Implicit Places using invariants and state equation in 10269 ms returned []
Implicit Place search using SMT with State Equation took 10939 ms to find 0 implicit places.
[2024-05-28 14:37:34] [INFO ] Redundant transitions in 96 ms returned []
Running 1350 sub problems to find dead transitions.
[2024-05-28 14:37:34] [INFO ] Flow matrix only has 1332 transitions (discarded 20 similar events)
[2024-05-28 14:37:34] [INFO ] Invariant cache hit.
[2024-05-28 14:37:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:37:51] [INFO ] Deduced a trap composed of 44 places in 2900 ms of which 1 ms to minimize.
[2024-05-28 14:37:51] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:37:51] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2024-05-28 14:37:51] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:37:51] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2024-05-28 14:37:51] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
[2024-05-28 14:37:51] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:37:51] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:37:51] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:37:52] [INFO ] Deduced a trap composed of 196 places in 431 ms of which 4 ms to minimize.
[2024-05-28 14:37:52] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 8 ms to minimize.
[2024-05-28 14:37:54] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 2 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :7280 after 9594
[2024-05-28 14:38:02] [INFO ] Deduced a trap composed of 203 places in 417 ms of which 3 ms to minimize.
[2024-05-28 14:38:03] [INFO ] Deduced a trap composed of 224 places in 372 ms of which 3 ms to minimize.
[2024-05-28 14:38:04] [INFO ] Deduced a trap composed of 223 places in 379 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1864 variables, and 59 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
[2024-05-28 14:38:12] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 2 ms to minimize.
[2024-05-28 14:38:12] [INFO ] Deduced a trap composed of 186 places in 361 ms of which 3 ms to minimize.
[2024-05-28 14:38:24] [INFO ] Deduced a trap composed of 79 places in 419 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1864 variables, and 62 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 18/18 constraints]
After SMT, in 63365ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 63385ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74510 ms. Remains : 532/532 places, 1352/1352 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 532 transition count 1332
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 522 transition count 1372
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 1 with 40 rules applied. Total rules applied 80 place count 522 transition count 1332
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 90 place count 522 transition count 1322
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 100 place count 512 transition count 1322
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 512 transition count 1312
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 502 transition count 1312
Applied a total of 120 rules in 222 ms. Remains 502 /532 variables (removed 30) and now considering 1312/1352 (removed 40) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1312 rows 502 cols
[2024-05-28 14:38:38] [INFO ] Computed 46 invariants in 41 ms
[2024-05-28 14:38:38] [INFO ] [Real]Absence check using 18 positive place invariants in 58 ms returned sat
[2024-05-28 14:38:38] [INFO ] [Real]Absence check using 18 positive and 28 generalized place invariants in 31 ms returned sat
[2024-05-28 14:38:39] [INFO ] After 1258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 14:38:39] [INFO ] [Nat]Absence check using 18 positive place invariants in 20 ms returned sat
[2024-05-28 14:38:39] [INFO ] [Nat]Absence check using 18 positive and 28 generalized place invariants in 22 ms returned sat
[2024-05-28 14:38:41] [INFO ] After 1709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 14:38:42] [INFO ] Deduced a trap composed of 210 places in 575 ms of which 4 ms to minimize.
[2024-05-28 14:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 760 ms
TRAPS : Iteration 1
[2024-05-28 14:38:42] [INFO ] After 2969ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 14:38:43] [INFO ] After 3458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-28 14:38:43] [INFO ] Flatten gal took : 255 ms
[2024-05-28 14:38:43] [INFO ] Flatten gal took : 204 ms
[2024-05-28 14:38:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7800903980520593397.gal : 33 ms
[2024-05-28 14:38:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12535657351639191802.prop : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7800903980520593397.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12535657351639191802.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12535657351639191802.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 35
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :35 after 47
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :47 after 61
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :61 after 77
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :77 after 244
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :244 after 343
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :343 after 516
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :516 after 1225
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1225 after 2313
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2313 after 6695
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6695 after 12213
Detected timeout of ITS tools.
[2024-05-28 14:38:59] [INFO ] Flatten gal took : 100 ms
[2024-05-28 14:38:59] [INFO ] Applying decomposition
[2024-05-28 14:38:59] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17846101320237055405.txt' '-o' '/tmp/graph17846101320237055405.bin' '-w' '/tmp/graph17846101320237055405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17846101320237055405.bin' '-l' '-1' '-v' '-w' '/tmp/graph17846101320237055405.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:38:59] [INFO ] Decomposing Gal with order
[2024-05-28 14:38:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:38:59] [INFO ] Removed a total of 1392 redundant transitions.
[2024-05-28 14:39:00] [INFO ] Flatten gal took : 370 ms
[2024-05-28 14:39:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 1222 labels/synchronizations in 123 ms.
[2024-05-28 14:39:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4076774024647511247.gal : 31 ms
[2024-05-28 14:39:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5239783760848155660.prop : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4076774024647511247.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5239783760848155660.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5239783760848155660.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4 after 23
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :23 after 34
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :34 after 287
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :287 after 1355
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1355 after 1469
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1469 after 2888
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 37094 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 14:39:15] [INFO ] Flatten gal took : 98 ms
[2024-05-28 14:39:15] [INFO ] Applying decomposition
[2024-05-28 14:39:15] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3136666430853414325.txt' '-o' '/tmp/graph3136666430853414325.bin' '-w' '/tmp/graph3136666430853414325.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3136666430853414325.bin' '-l' '-1' '-v' '-w' '/tmp/graph3136666430853414325.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:39:15] [INFO ] Decomposing Gal with order
[2024-05-28 14:39:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:39:16] [INFO ] Removed a total of 1408 redundant transitions.
[2024-05-28 14:39:16] [INFO ] Flatten gal took : 202 ms
[2024-05-28 14:39:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 44 ms.
[2024-05-28 14:39:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5612958772891074165.gal : 20 ms
[2024-05-28 14:39:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2561548734918535673.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5612958772891074165.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2561548734918535673.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2561548734918535673.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7 after 83
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :83 after 275
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :275 after 899
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :899 after 2285
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2285 after 5183
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :29231 after 40823
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :75819 after 312043
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.45204e+06 after 1.6638e+06
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :1.6638e+06 after 2.17235e+06
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :5.14259e+06 after 1.37463e+07
SDD proceeding with computation,1 properties remain. new max is 2097152
SDD size :7.01832e+07 after 8.20242e+07
ITS-tools command line returned an error code 137
[2024-05-28 15:01:38] [INFO ] Flatten gal took : 89 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15819350787269029209
[2024-05-28 15:01:38] [INFO ] Computing symmetric may disable matrix : 1352 transitions.
[2024-05-28 15:01:38] [INFO ] Applying decomposition
[2024-05-28 15:01:38] [INFO ] Flatten gal took : 68 ms
[2024-05-28 15:01:38] [INFO ] Computation of Complete disable matrix. took 56 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:01:39] [INFO ] Computing symmetric may enable matrix : 1352 transitions.
[2024-05-28 15:01:39] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16471998088522313392.txt' '-o' '/tmp/graph16471998088522313392.bin' '-w' '/tmp/graph16471998088522313392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16471998088522313392.bin' '-l' '-1' '-v' '-w' '/tmp/graph16471998088522313392.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:01:39] [INFO ] Decomposing Gal with order
[2024-05-28 15:01:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:01:39] [INFO ] Removed a total of 1263 redundant transitions.
[2024-05-28 15:01:39] [INFO ] Flatten gal took : 188 ms
[2024-05-28 15:01:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 778 labels/synchronizations in 65 ms.
[2024-05-28 15:01:39] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4100034070404771350.gal : 26 ms
[2024-05-28 15:01:39] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3193415109469123336.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4100034070404771350.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3193415109469123336.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2024-05-28 15:01:39] [INFO ] Computing Do-Not-Accords matrix : 1352 transitions.
Loading property file /tmp/ReachabilityFireability3193415109469123336.prop.
[2024-05-28 15:01:39] [INFO ] Computation of Completed DNA matrix. took 143 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
[2024-05-28 15:01:39] [INFO ] Built C files in 1100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15819350787269029209
Running compilation step : cd /tmp/ltsmin15819350787269029209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :19 after 55
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :55 after 262
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :262 after 1107
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1107 after 1188
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1188 after 2718
Compilation finished in 5953 ms.
Running link step : cd /tmp/ltsmin15819350787269029209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 107 ms.
Running LTSmin : cd /tmp/ltsmin15819350787269029209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PolyORBLFCOLS02J06T10ReachabilityFireability202408==true'
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2718 after 5175
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5175 after 14896
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :14896 after 26883
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :26883 after 37374
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :37374 after 703024
Detected timeout of ITS tools.
[2024-05-28 15:30:11] [INFO ] Applying decomposition
[2024-05-28 15:30:12] [INFO ] Flatten gal took : 155 ms
[2024-05-28 15:30:12] [INFO ] Decomposing Gal with order
[2024-05-28 15:30:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:30:12] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[AwakeTasks_0, IdleTasks_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, Check_Sources_B_0, Check_Sources_E_0, P_1617_0],[AwakeTasks_1, IdleTasks_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, Check_Sources_B_1, Check_Sources_E_1, P_1617_1],[AwakeTasks_2, IdleTasks_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, Check_Sources_B_2, Check_Sources_E_2, P_1617_2],[AwakeTasks_3, IdleTasks_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, Check_Sources_B_3, Check_Sources_E_3, P_1617_3],[AwakeTasks_4, IdleTasks_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, Check_Sources_B_4, Check_Sources_E_4, P_1617_4],[AwakeTasks_5, IdleTasks_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, Check_Sources_B_5, Check_Sources_E_5, P_1617_5],[AwakeTasks_6, IdleTasks_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, Check_Sources_B_6, Check_Sources_E_6, P_1617_6],[AwakeTasks_7, IdleTasks_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, Check_Sources_B_7, Check_Sources_E_7, P_1617_7],[AwakeTasks_8, IdleTasks_8, P_2321_8, TryAllocateOneTaskE_8, TryAllocateOneTaskB_8, P_2318_8, EnablePollingB_8, FetchJobB_8, ScheduleTaskE_Check_8, ScheduleTaskB_8, Abort_Check_Sources_E_8, Abort_Check_Sources_B_8, P_1158_8, P_1159_8, P_1160_8, NotifyEventEndOfCheckSourcesB_8, Check_Sources_B_8, Check_Sources_E_8, P_1617_8],[AwakeTasks_9, IdleTasks_9, P_2321_9, TryAllocateOneTaskE_9, TryAllocateOneTaskB_9, P_2318_9, EnablePollingB_9, FetchJobB_9, ScheduleTaskE_Check_9, ScheduleTaskB_9, Abort_Check_Sources_E_9, Abort_Check_Sources_B_9, P_1158_9, P_1159_9, P_1160_9, NotifyEventEndOfCheckSourcesB_9, Check_Sources_B_9, Check_Sources_E_9, P_1617_9],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49],[NotifyEventJobQueuedB_50, QueueJobB_50, FetchJobE_50],[NotifyEventJobQueuedB_51, QueueJobB_51, FetchJobE_51],[NotifyEventJobQueuedB_52, QueueJobB_52, FetchJobE_52],[NotifyEventJobQueuedB_53, QueueJobB_53, FetchJobE_53],[NotifyEventJobQueuedB_54, QueueJobB_54, FetchJobE_54],[NotifyEventJobQueuedB_55, QueueJobB_55, FetchJobE_55],[NotifyEventJobQueuedB_56, QueueJobB_56, FetchJobE_56],[NotifyEventJobQueuedB_57, QueueJobB_57, FetchJobE_57],[NotifyEventJobQueuedB_58, QueueJobB_58, FetchJobE_58],[NotifyEventJobQueuedB_59, QueueJobB_59, FetchJobE_59],[NotifyEventJobQueuedB_60, QueueJobB_60, FetchJobE_60],[NotifyEventJobQueuedB_61, QueueJobB_61, FetchJobE_61],[NotifyEventJobQueuedB_62, QueueJobB_62, FetchJobE_62],[NotifyEventJobQueuedB_63, QueueJobB_63, FetchJobE_63],[NotifyEventJobQueuedB_64, QueueJobB_64, FetchJobE_64],[NotifyEventJobQueuedB_65, QueueJobB_65, FetchJobE_65],[NotifyEventJobQueuedB_66, QueueJobB_66, FetchJobE_66],[NotifyEventJobQueuedB_67, QueueJobB_67, FetchJobE_67],[NotifyEventJobQueuedB_68, QueueJobB_68, FetchJobE_68],[NotifyEventJobQueuedB_69, QueueJobB_69, FetchJobE_69],[PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[Insert_Source_B_0, P_1119_0, P_2579_0],[Insert_Source_B_1, P_1119_1, P_2579_1],[Insert_Source_B_2, P_1119_2, P_2579_2],[Insert_Source_B_3, P_1119_3, P_2579_3],[Insert_Source_B_4, P_1119_4, P_2579_4],[Insert_Source_B_5, P_1119_5, P_2579_5],[Insert_Source_B_6, P_1119_6, P_2579_6],[Insert_Source_B_7, P_1119_7, P_2579_7],[Insert_Source_B_8, P_1119_8, P_2579_8],[Insert_Source_B_9, P_1119_9, P_2579_9],[Insert_Source_B_10, P_1119_10, P_2579_10],[Insert_Source_B_11, P_1119_11, P_2579_11],[Insert_Source_B_12, P_1119_12, P_2579_12],[Insert_Source_B_13, P_1119_13, P_2579_13],[Insert_Source_B_14, P_1119_14, P_2579_14],[Insert_Source_B_15, P_1119_15, P_2579_15],[Insert_Source_B_16, P_1119_16, P_2579_16],[Insert_Source_B_17, P_1119_17, P_2579_17],[Insert_Source_B_18, P_1119_18, P_2579_18],[Insert_Source_B_19, P_1119_19, P_2579_19],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1234)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 15:30:12] [INFO ] Flatten gal took : 82 ms
[2024-05-28 15:30:12] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5073494501372640164.gal : 23 ms
[2024-05-28 15:30:12] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2659118922875758174.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5073494501372640164.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2659118922875758174.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityFireability2659118922875758174.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 29
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :29 after 33
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :33 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 76
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :76 after 80
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :80 after 474
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :474 after 798
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :798 after 1444
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1444 after 3624
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3624 after 7984
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7984 after 17311
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :17311 after 76362
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :76362 after 152369

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="PolyORBLF-COL-S02J06T10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J06T10, 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 r290-tajo-171654446400119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 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 ;