Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690300413.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BugTracking-PT-q8m016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690300413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 08:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 07:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 07:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 08:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 26 08:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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 BugTracking-PT-q8m016-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678355302240

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m016
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 09:48:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 09:48:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 09:48:24] [INFO ] Load time of PNML (sax parser for PT used): 639 ms
[2023-03-09 09:48:24] [INFO ] Transformed 754 places.
[2023-03-09 09:48:24] [INFO ] Transformed 27370 transitions.
[2023-03-09 09:48:24] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 845 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 474 places in 102 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m016-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2023-03-09 09:48:25] [INFO ] Computed 10 place invariants in 68 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :11
FORMULA BugTracking-PT-q8m016-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q8m016-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :5
[2023-03-09 09:48:25] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-09 09:48:25] [INFO ] Computed 10 place invariants in 28 ms
[2023-03-09 09:48:25] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-09 09:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:48:26] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2023-03-09 09:48:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:48:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 09:48:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:48:27] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2023-03-09 09:48:27] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-09 09:48:27] [INFO ] [Nat]Added 303 Read/Feed constraints in 82 ms returned sat
[2023-03-09 09:48:27] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 347 ms.
[2023-03-09 09:48:28] [INFO ] Deduced a trap composed of 64 places in 371 ms of which 4 ms to minimize.
[2023-03-09 09:48:29] [INFO ] Deduced a trap composed of 62 places in 348 ms of which 1 ms to minimize.
[2023-03-09 09:48:29] [INFO ] Deduced a trap composed of 61 places in 351 ms of which 1 ms to minimize.
[2023-03-09 09:48:30] [INFO ] Deduced a trap composed of 38 places in 364 ms of which 3 ms to minimize.
[2023-03-09 09:48:30] [INFO ] Deduced a trap composed of 38 places in 340 ms of which 1 ms to minimize.
[2023-03-09 09:48:31] [INFO ] Deduced a trap composed of 48 places in 367 ms of which 1 ms to minimize.
[2023-03-09 09:48:31] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 2985 ms
[2023-03-09 09:48:32] [INFO ] Deduced a trap composed of 15 places in 693 ms of which 2 ms to minimize.
[2023-03-09 09:48:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 09:48:32] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 09:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:48:32] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2023-03-09 09:48:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:48:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-09 09:48:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:48:33] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2023-03-09 09:48:33] [INFO ] [Nat]Added 303 Read/Feed constraints in 290 ms returned sat
[2023-03-09 09:48:34] [INFO ] Deduced a trap composed of 19 places in 342 ms of which 1 ms to minimize.
[2023-03-09 09:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 597 ms
[2023-03-09 09:48:34] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 348 ms.
[2023-03-09 09:48:35] [INFO ] Added : 8 causal constraints over 2 iterations in 968 ms. Result :sat
[2023-03-09 09:48:35] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-09 09:48:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:48:36] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2023-03-09 09:48:36] [INFO ] [Real]Added 303 Read/Feed constraints in 73 ms returned sat
[2023-03-09 09:48:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:48:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-09 09:48:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:48:37] [INFO ] [Nat]Absence check using state equation in 1259 ms returned sat
[2023-03-09 09:48:37] [INFO ] [Nat]Added 303 Read/Feed constraints in 114 ms returned sat
[2023-03-09 09:48:38] [INFO ] Deduced a trap composed of 78 places in 505 ms of which 1 ms to minimize.
[2023-03-09 09:48:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 747 ms
[2023-03-09 09:48:39] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 348 ms.
[2023-03-09 09:48:39] [INFO ] Added : 2 causal constraints over 1 iterations in 823 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 16] Max seen :[0, 0, 9]
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 278 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 278 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 276 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 276 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 270 transition count 3871
Applied a total of 19 rules in 332 ms. Remains 270 /280 variables (removed 10) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 270/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-09 09:48:40] [INFO ] Computed 9 place invariants in 41 ms
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 2234 ms. (steps per millisecond=447 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1756 ms. (steps per millisecond=569 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1657 ms. (steps per millisecond=603 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1720 ms. (steps per millisecond=581 ) properties (out of 3) seen :2
[2023-03-09 09:48:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-09 09:48:47] [INFO ] Computed 9 place invariants in 37 ms
[2023-03-09 09:48:47] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-09 09:48:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:48:48] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2023-03-09 09:48:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:48:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-09 09:48:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:48:49] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2023-03-09 09:48:49] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:48:49] [INFO ] [Nat]Added 283 Read/Feed constraints in 319 ms returned sat
[2023-03-09 09:48:50] [INFO ] Deduced a trap composed of 23 places in 404 ms of which 1 ms to minimize.
[2023-03-09 09:48:50] [INFO ] Deduced a trap composed of 54 places in 436 ms of which 1 ms to minimize.
[2023-03-09 09:48:51] [INFO ] Deduced a trap composed of 42 places in 385 ms of which 1 ms to minimize.
[2023-03-09 09:48:51] [INFO ] Deduced a trap composed of 63 places in 402 ms of which 1 ms to minimize.
[2023-03-09 09:48:52] [INFO ] Deduced a trap composed of 60 places in 403 ms of which 1 ms to minimize.
[2023-03-09 09:48:52] [INFO ] Deduced a trap composed of 61 places in 397 ms of which 0 ms to minimize.
[2023-03-09 09:48:53] [INFO ] Deduced a trap composed of 26 places in 465 ms of which 1 ms to minimize.
[2023-03-09 09:48:53] [INFO ] Deduced a trap composed of 62 places in 384 ms of which 1 ms to minimize.
[2023-03-09 09:48:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4311 ms
[2023-03-09 09:48:54] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 331 ms.
[2023-03-09 09:48:54] [INFO ] Added : 1 causal constraints over 1 iterations in 630 ms. Result :sat
[2023-03-09 09:48:54] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-09 09:48:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:48:55] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2023-03-09 09:48:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:48:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-09 09:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:48:56] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2023-03-09 09:48:56] [INFO ] [Nat]Added 283 Read/Feed constraints in 240 ms returned sat
[2023-03-09 09:48:56] [INFO ] Deduced a trap composed of 35 places in 543 ms of which 1 ms to minimize.
[2023-03-09 09:48:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 747 ms
[2023-03-09 09:48:57] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 350 ms.
[2023-03-09 09:48:57] [INFO ] Added : 2 causal constraints over 1 iterations in 750 ms. Result :sat
[2023-03-09 09:48:58] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-09 09:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:48:58] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2023-03-09 09:48:58] [INFO ] [Real]Added 283 Read/Feed constraints in 86 ms returned sat
[2023-03-09 09:48:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:48:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-09 09:48:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:48:59] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2023-03-09 09:48:59] [INFO ] [Nat]Added 283 Read/Feed constraints in 105 ms returned sat
[2023-03-09 09:49:00] [INFO ] Deduced a trap composed of 11 places in 458 ms of which 1 ms to minimize.
[2023-03-09 09:49:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 652 ms
[2023-03-09 09:49:00] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 406 ms.
[2023-03-09 09:49:01] [INFO ] Added : 2 causal constraints over 1 iterations in 810 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 16] Max seen :[0, 0, 9]
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 114 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 270/270 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 123 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:49:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:49:01] [INFO ] Invariant cache hit.
[2023-03-09 09:49:02] [INFO ] Implicit Places using invariants in 650 ms returned []
[2023-03-09 09:49:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:49:02] [INFO ] Invariant cache hit.
[2023-03-09 09:49:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:49:06] [INFO ] Implicit Places using invariants and state equation in 4137 ms returned []
Implicit Place search using SMT with State Equation took 4806 ms to find 0 implicit places.
[2023-03-09 09:49:06] [INFO ] Redundant transitions in 351 ms returned []
[2023-03-09 09:49:06] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:49:06] [INFO ] Invariant cache hit.
[2023-03-09 09:49:08] [INFO ] Dead Transitions using invariants and state equation in 1325 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6647 ms. Remains : 270/270 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-11
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-09 09:49:08] [INFO ] Computed 9 place invariants in 12 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2023-03-09 09:49:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-09 09:49:08] [INFO ] Computed 9 place invariants in 29 ms
[2023-03-09 09:49:08] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-09 09:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:49:09] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2023-03-09 09:49:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:49:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 09:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:49:09] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2023-03-09 09:49:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:49:09] [INFO ] [Nat]Added 283 Read/Feed constraints in 253 ms returned sat
[2023-03-09 09:49:10] [INFO ] Deduced a trap composed of 23 places in 359 ms of which 0 ms to minimize.
[2023-03-09 09:49:10] [INFO ] Deduced a trap composed of 54 places in 560 ms of which 1 ms to minimize.
[2023-03-09 09:49:11] [INFO ] Deduced a trap composed of 42 places in 521 ms of which 0 ms to minimize.
[2023-03-09 09:49:12] [INFO ] Deduced a trap composed of 63 places in 524 ms of which 1 ms to minimize.
[2023-03-09 09:49:12] [INFO ] Deduced a trap composed of 60 places in 539 ms of which 0 ms to minimize.
[2023-03-09 09:49:13] [INFO ] Deduced a trap composed of 61 places in 466 ms of which 1 ms to minimize.
[2023-03-09 09:49:13] [INFO ] Deduced a trap composed of 26 places in 498 ms of which 1 ms to minimize.
[2023-03-09 09:49:14] [INFO ] Deduced a trap composed of 4 places in 731 ms of which 1 ms to minimize.
[2023-03-09 09:49:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Graph (complete) has 4586 edges and 270 vertex of which 269 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 65 ms. Remains 269 /270 variables (removed 1) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 269/270 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:49:14] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2582 ms. (steps per millisecond=387 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1817 ms. (steps per millisecond=550 ) properties (out of 1) seen :0
[2023-03-09 09:49:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:49:19] [INFO ] Computed 8 place invariants in 38 ms
[2023-03-09 09:49:19] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 09:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:49:19] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2023-03-09 09:49:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:49:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-09 09:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:49:20] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2023-03-09 09:49:20] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:49:21] [INFO ] [Nat]Added 283 Read/Feed constraints in 87 ms returned sat
[2023-03-09 09:49:21] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 559 ms.
[2023-03-09 09:49:22] [INFO ] Deduced a trap composed of 96 places in 497 ms of which 0 ms to minimize.
[2023-03-09 09:49:23] [INFO ] Deduced a trap composed of 72 places in 695 ms of which 1 ms to minimize.
[2023-03-09 09:49:24] [INFO ] Deduced a trap composed of 53 places in 521 ms of which 1 ms to minimize.
[2023-03-09 09:49:25] [INFO ] Deduced a trap composed of 14 places in 724 ms of which 1 ms to minimize.
[2023-03-09 09:49:25] [INFO ] Deduced a trap composed of 94 places in 474 ms of which 1 ms to minimize.
[2023-03-09 09:49:26] [INFO ] Deduced a trap composed of 45 places in 529 ms of which 0 ms to minimize.
[2023-03-09 09:49:27] [INFO ] Deduced a trap composed of 35 places in 456 ms of which 1 ms to minimize.
[2023-03-09 09:49:27] [INFO ] Deduced a trap composed of 92 places in 448 ms of which 3 ms to minimize.
[2023-03-09 09:49:28] [INFO ] Deduced a trap composed of 90 places in 548 ms of which 1 ms to minimize.
[2023-03-09 09:49:29] [INFO ] Deduced a trap composed of 55 places in 538 ms of which 1 ms to minimize.
[2023-03-09 09:49:29] [INFO ] Deduced a trap composed of 48 places in 457 ms of which 0 ms to minimize.
[2023-03-09 09:49:30] [INFO ] Deduced a trap composed of 54 places in 534 ms of which 1 ms to minimize.
[2023-03-09 09:49:31] [INFO ] Deduced a trap composed of 35 places in 519 ms of which 1 ms to minimize.
[2023-03-09 09:49:31] [INFO ] Deduced a trap composed of 14 places in 409 ms of which 1 ms to minimize.
[2023-03-09 09:49:32] [INFO ] Deduced a trap composed of 41 places in 466 ms of which 1 ms to minimize.
[2023-03-09 09:49:33] [INFO ] Deduced a trap composed of 54 places in 570 ms of which 0 ms to minimize.
[2023-03-09 09:49:33] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 11003 ms
[2023-03-09 09:49:33] [INFO ] Added : 9 causal constraints over 4 iterations in 12693 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 73 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:49:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:49:34] [INFO ] Invariant cache hit.
[2023-03-09 09:49:34] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-09 09:49:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:49:34] [INFO ] Invariant cache hit.
[2023-03-09 09:49:35] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:49:37] [INFO ] Implicit Places using invariants and state equation in 2303 ms returned []
Implicit Place search using SMT with State Equation took 2921 ms to find 0 implicit places.
[2023-03-09 09:49:37] [INFO ] Redundant transitions in 251 ms returned []
[2023-03-09 09:49:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:49:37] [INFO ] Invariant cache hit.
[2023-03-09 09:49:38] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4378 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-11 in 30253 ms.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-09 09:49:38] [INFO ] Computed 9 place invariants in 10 ms
Incomplete random walk after 10013 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=417 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2023-03-09 09:49:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-09 09:49:38] [INFO ] Computed 9 place invariants in 15 ms
[2023-03-09 09:49:38] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 09:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:49:39] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2023-03-09 09:49:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:49:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-09 09:49:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:49:39] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2023-03-09 09:49:39] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:49:40] [INFO ] [Nat]Added 283 Read/Feed constraints in 228 ms returned sat
[2023-03-09 09:49:40] [INFO ] Deduced a trap composed of 35 places in 444 ms of which 1 ms to minimize.
[2023-03-09 09:49:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 647 ms
[2023-03-09 09:49:40] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 293 ms.
[2023-03-09 09:49:41] [INFO ] Added : 2 causal constraints over 1 iterations in 700 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Graph (complete) has 4586 edges and 270 vertex of which 269 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 74 ms. Remains 269 /270 variables (removed 1) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 269/270 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:49:41] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 3216 ms. (steps per millisecond=310 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1815 ms. (steps per millisecond=550 ) properties (out of 1) seen :0
[2023-03-09 09:49:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:49:46] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-09 09:49:46] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:49:47] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2023-03-09 09:49:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:49:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 09:49:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:49:48] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2023-03-09 09:49:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:49:48] [INFO ] [Nat]Added 283 Read/Feed constraints in 137 ms returned sat
[2023-03-09 09:49:48] [INFO ] Deduced a trap composed of 36 places in 463 ms of which 0 ms to minimize.
[2023-03-09 09:49:49] [INFO ] Deduced a trap composed of 23 places in 535 ms of which 1 ms to minimize.
[2023-03-09 09:49:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1292 ms
[2023-03-09 09:49:49] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 289 ms.
[2023-03-09 09:49:50] [INFO ] Added : 2 causal constraints over 1 iterations in 688 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 80 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 72 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:49:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:49:50] [INFO ] Invariant cache hit.
[2023-03-09 09:49:50] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-09 09:49:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:49:50] [INFO ] Invariant cache hit.
[2023-03-09 09:49:51] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:49:53] [INFO ] Implicit Places using invariants and state equation in 2156 ms returned []
Implicit Place search using SMT with State Equation took 2609 ms to find 0 implicit places.
[2023-03-09 09:49:53] [INFO ] Redundant transitions in 163 ms returned []
[2023-03-09 09:49:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:49:53] [INFO ] Invariant cache hit.
[2023-03-09 09:49:54] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4045 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-12 in 15976 ms.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-13
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-09 09:49:54] [INFO ] Computed 9 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :3
[2023-03-09 09:49:54] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-09 09:49:54] [INFO ] Computed 9 place invariants in 10 ms
[2023-03-09 09:49:54] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 09:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:49:55] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2023-03-09 09:49:55] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:49:55] [INFO ] [Real]Added 283 Read/Feed constraints in 70 ms returned sat
[2023-03-09 09:49:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:49:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-09 09:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:49:56] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2023-03-09 09:49:56] [INFO ] [Nat]Added 283 Read/Feed constraints in 106 ms returned sat
[2023-03-09 09:49:56] [INFO ] Deduced a trap composed of 16 places in 568 ms of which 1 ms to minimize.
[2023-03-09 09:49:57] [INFO ] Deduced a trap composed of 11 places in 472 ms of which 1 ms to minimize.
[2023-03-09 09:49:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1392 ms
[2023-03-09 09:49:57] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 333 ms.
[2023-03-09 09:49:58] [INFO ] Added : 2 causal constraints over 1 iterations in 764 ms. Result :sat
Current structural bounds on expressions (after SMT) : [16] Max seen :[4]
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 79 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 270/270 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-09 09:49:58] [INFO ] Computed 9 place invariants in 21 ms
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 2853 ms. (steps per millisecond=350 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2080 ms. (steps per millisecond=480 ) properties (out of 1) seen :8
[2023-03-09 09:50:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-09 09:50:03] [INFO ] Computed 9 place invariants in 23 ms
[2023-03-09 09:50:03] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-09 09:50:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:04] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2023-03-09 09:50:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:50:04] [INFO ] [Real]Added 283 Read/Feed constraints in 64 ms returned sat
[2023-03-09 09:50:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:50:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-09 09:50:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:05] [INFO ] [Nat]Absence check using state equation in 501 ms returned sat
[2023-03-09 09:50:05] [INFO ] [Nat]Added 283 Read/Feed constraints in 97 ms returned sat
[2023-03-09 09:50:05] [INFO ] Deduced a trap composed of 16 places in 574 ms of which 1 ms to minimize.
[2023-03-09 09:50:06] [INFO ] Deduced a trap composed of 11 places in 397 ms of which 0 ms to minimize.
[2023-03-09 09:50:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1265 ms
[2023-03-09 09:50:06] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 305 ms.
[2023-03-09 09:50:07] [INFO ] Added : 2 causal constraints over 1 iterations in 729 ms. Result :sat
Current structural bounds on expressions (after SMT) : [16] Max seen :[8]
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 95 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 270/270 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 72 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:50:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:50:07] [INFO ] Invariant cache hit.
[2023-03-09 09:50:08] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-09 09:50:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:50:08] [INFO ] Invariant cache hit.
[2023-03-09 09:50:08] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:50:09] [INFO ] Implicit Places using invariants and state equation in 1904 ms returned []
Implicit Place search using SMT with State Equation took 2412 ms to find 0 implicit places.
[2023-03-09 09:50:10] [INFO ] Redundant transitions in 164 ms returned []
[2023-03-09 09:50:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:50:10] [INFO ] Invariant cache hit.
[2023-03-09 09:50:11] [INFO ] Dead Transitions using invariants and state equation in 1096 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3755 ms. Remains : 270/270 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-09 09:50:11] [INFO ] Computed 9 place invariants in 8 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 2483 ms. (steps per millisecond=402 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2079 ms. (steps per millisecond=481 ) properties (out of 1) seen :8
[2023-03-09 09:50:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-09 09:50:15] [INFO ] Computed 9 place invariants in 22 ms
[2023-03-09 09:50:15] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-09 09:50:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:16] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2023-03-09 09:50:16] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:50:16] [INFO ] [Real]Added 283 Read/Feed constraints in 74 ms returned sat
[2023-03-09 09:50:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:50:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-09 09:50:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:50:17] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2023-03-09 09:50:17] [INFO ] [Nat]Added 283 Read/Feed constraints in 99 ms returned sat
[2023-03-09 09:50:18] [INFO ] Deduced a trap composed of 16 places in 544 ms of which 2 ms to minimize.
[2023-03-09 09:50:18] [INFO ] Deduced a trap composed of 11 places in 441 ms of which 1 ms to minimize.
[2023-03-09 09:50:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1282 ms
[2023-03-09 09:50:19] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 340 ms.
[2023-03-09 09:50:19] [INFO ] Added : 2 causal constraints over 1 iterations in 768 ms. Result :sat
Current structural bounds on expressions (after SMT) : [16] Max seen :[8]
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 111 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 270/270 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 77 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:50:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:50:20] [INFO ] Invariant cache hit.
[2023-03-09 09:50:20] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-09 09:50:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:50:20] [INFO ] Invariant cache hit.
[2023-03-09 09:50:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:50:22] [INFO ] Implicit Places using invariants and state equation in 1842 ms returned []
Implicit Place search using SMT with State Equation took 2318 ms to find 0 implicit places.
[2023-03-09 09:50:22] [INFO ] Redundant transitions in 133 ms returned []
[2023-03-09 09:50:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:50:22] [INFO ] Invariant cache hit.
[2023-03-09 09:50:23] [INFO ] Dead Transitions using invariants and state equation in 1084 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3620 ms. Remains : 270/270 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-13 in 29162 ms.
[2023-03-09 09:50:24] [INFO ] Flatten gal took : 316 ms
[2023-03-09 09:50:24] [INFO ] Applying decomposition
[2023-03-09 09:50:24] [INFO ] Flatten gal took : 194 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12366401998582233214.txt' '-o' '/tmp/graph12366401998582233214.bin' '-w' '/tmp/graph12366401998582233214.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12366401998582233214.bin' '-l' '-1' '-v' '-w' '/tmp/graph12366401998582233214.weights' '-q' '0' '-e' '0.001'
[2023-03-09 09:50:25] [INFO ] Decomposing Gal with order
[2023-03-09 09:50:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 09:50:25] [INFO ] Removed a total of 424 redundant transitions.
[2023-03-09 09:50:25] [INFO ] Flatten gal took : 349 ms
[2023-03-09 09:50:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 26 ms.
[2023-03-09 09:50:25] [INFO ] Time to serialize gal into /tmp/UpperBounds15183434752681778828.gal : 35 ms
[2023-03-09 09:50:25] [INFO ] Time to serialize properties into /tmp/UpperBounds8043463511031726685.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15183434752681778828.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8043463511031726685.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds8043463511031726685.prop.
Detected timeout of ITS tools.
[2023-03-09 10:11:13] [INFO ] Flatten gal took : 3566 ms
[2023-03-09 10:11:13] [INFO ] Time to serialize gal into /tmp/UpperBounds16925706628682540574.gal : 39 ms
[2023-03-09 10:11:13] [INFO ] Time to serialize properties into /tmp/UpperBounds12659952859822138411.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16925706628682540574.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12659952859822138411.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds12659952859822138411.prop.
Detected timeout of ITS tools.
[2023-03-09 10:31:54] [INFO ] Flatten gal took : 295 ms
[2023-03-09 10:31:55] [INFO ] Input system was already deterministic with 3871 transitions.
[2023-03-09 10:31:55] [INFO ] Transformed 270 places.
[2023-03-09 10:31:55] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 10:31:56] [INFO ] Time to serialize gal into /tmp/UpperBounds14603117221043166175.gal : 32 ms
[2023-03-09 10:31:56] [INFO ] Time to serialize properties into /tmp/UpperBounds4130940305838264483.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14603117221043166175.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4130940305838264483.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds4130940305838264483.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 135676 kB
After kill :
MemTotal: 16393340 kB
MemFree: 10767184 kB

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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="BugTracking-PT-q8m016"
export BK_EXAMINATION="UpperBounds"
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-5348"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q8m016, 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 r037-tajo-167813690300413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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