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-171654447300501.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 PolyORBNT-PT-S10J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447300501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 32K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 249K Apr 12 10:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 904K Apr 12 10:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 190K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 233K Apr 12 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 627K Apr 12 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 12 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716933732572

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 22:02:14] [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]
[2024-05-28 22:02:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:02:15] [INFO ] Load time of PNML (sax parser for PT used): 778 ms
[2024-05-28 22:02:15] [INFO ] Transformed 854 places.
[2024-05-28 22:02:15] [INFO ] Transformed 12340 transitions.
[2024-05-28 22:02:15] [INFO ] Parsed PT model containing 854 places and 12340 transitions and 113999 arcs in 1045 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 86 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 10, 0, 1, 0, 10, 0, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 10, 0, 1, 0, 10, 0, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 22:02:15] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2024-05-28 22:02:15] [INFO ] Computed 112 invariants in 160 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 10, 0, 1, 0, 10, 0, 1, 0, 0, 0, 0, 0] Max Struct:[149, 4, 343, 109, 1, 1, 343, 410, 1, 109, 445, 1, 1, 1]
FORMULA PolyORBNT-PT-S10J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (559 resets) in 440 ms. (22 steps per ms)
FORMULA PolyORBNT-PT-S10J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (793 resets) in 561 ms. (160 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 10, 1, 10, 1, 1, 1, 0] Max Struct:[149, 4, 343, 109, 343, 410, 109, 445, 1]
[2024-05-28 22:02:16] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-05-28 22:02:16] [INFO ] Invariant cache hit.
[2024-05-28 22:02:17] [INFO ] [Real]Absence check using 81 positive place invariants in 34 ms returned sat
[2024-05-28 22:02:17] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 30 ms returned unsat
[2024-05-28 22:02:17] [INFO ] [Real]Absence check using 81 positive place invariants in 70 ms returned sat
[2024-05-28 22:02:17] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 25 ms returned unsat
[2024-05-28 22:02:17] [INFO ] [Real]Absence check using 81 positive place invariants in 47 ms returned sat
[2024-05-28 22:02:17] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 55 ms returned unsat
[2024-05-28 22:02:18] [INFO ] [Real]Absence check using 81 positive place invariants in 18 ms returned sat
[2024-05-28 22:02:18] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 26 ms returned unsat
[2024-05-28 22:02:18] [INFO ] [Real]Absence check using 81 positive place invariants in 17 ms returned sat
[2024-05-28 22:02:18] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 22 ms returned unsat
[2024-05-28 22:02:18] [INFO ] [Real]Absence check using 81 positive place invariants in 18 ms returned sat
[2024-05-28 22:02:18] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 49 ms returned sat
[2024-05-28 22:02:20] [INFO ] [Real]Absence check using state equation in 2170 ms returned sat
[2024-05-28 22:02:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:02:21] [INFO ] [Nat]Absence check using 81 positive place invariants in 551 ms returned sat
[2024-05-28 22:02:21] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 218 ms returned sat
[2024-05-28 22:02:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
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 22:02:26] [INFO ] [Real]Absence check using 81 positive place invariants in 34 ms returned sat
[2024-05-28 22:02:26] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 26 ms returned unsat
[2024-05-28 22:02:26] [INFO ] [Real]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-05-28 22:02:26] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 33 ms returned sat
[2024-05-28 22:02:27] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2024-05-28 22:02:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:02:27] [INFO ] [Nat]Absence check using 81 positive place invariants in 25 ms returned sat
[2024-05-28 22:02:27] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 25 ms returned sat
[2024-05-28 22:02:28] [INFO ] [Nat]Absence check using state equation in 1160 ms returned sat
[2024-05-28 22:02:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:02:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 155 ms returned sat
[2024-05-28 22:02:29] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 253 ms.
[2024-05-28 22:02:29] [INFO ] Added : 5 causal constraints over 1 iterations in 924 ms. Result :sat
Minimization took 746 ms.
[2024-05-28 22:02:30] [INFO ] [Real]Absence check using 81 positive place invariants in 27 ms returned sat
[2024-05-28 22:02:30] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 25 ms returned sat
[2024-05-28 22:02:31] [INFO ] [Real]Absence check using state equation in 1233 ms returned sat
[2024-05-28 22:02:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:02:32] [INFO ] [Nat]Absence check using 81 positive place invariants in 20 ms returned sat
[2024-05-28 22:02:32] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 48 ms returned sat
[2024-05-28 22:02:33] [INFO ] [Nat]Absence check using state equation in 1238 ms returned sat
[2024-05-28 22:02:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 399 ms returned sat
[2024-05-28 22:02:34] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 229 ms.
[2024-05-28 22:02:36] [INFO ] Deduced a trap composed of 12 places in 887 ms of which 40 ms to minimize.
[2024-05-28 22:02:37] [INFO ] Deduced a trap composed of 19 places in 730 ms of which 7 ms to minimize.
[2024-05-28 22:02:37] [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 8
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 10, 1, 10, 1, 1, 1, 0] Max Struct:[1, 1, 10, 1, 10, 410, 1, 445, 1]
FORMULA PolyORBNT-PT-S10J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0] Max Struct:[410, 445, 1]
Support contains 412 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 844 transition count 2185
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 101 place count 799 transition count 2184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 798 transition count 2184
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 102 place count 798 transition count 2140
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 190 place count 754 transition count 2140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 191 place count 753 transition count 2139
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 753 transition count 2139
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 196 place count 751 transition count 2137
Applied a total of 196 rules in 343 ms. Remains 751 /854 variables (removed 103) and now considering 2137/2230 (removed 93) transitions.
Running 2126 sub problems to find dead transitions.
[2024-05-28 22:02:37] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
// Phase 1: matrix 2128 rows 751 cols
[2024-05-28 22:02:37] [INFO ] Computed 102 invariants in 133 ms
[2024-05-28 22:02:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-05-28 22:03:20] [INFO ] Deduced a trap composed of 18 places in 371 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20084 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 58087ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 58131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58515 ms. Remains : 751/854 places, 2137/2230 transitions.
[2024-05-28 22:03:35] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:03:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0] Max Struct:[410, 181, 1]
RANDOM walk for 1000000 steps (70473 resets) in 21030 ms. (47 steps per ms)
FORMULA PolyORBNT-PT-S10J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1580752 steps (12950 resets) in 7963 ms. (198 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 3] Max Struct:[410, 181]
[2024-05-28 22:04:04] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:04:04] [INFO ] Invariant cache hit.
[2024-05-28 22:04:04] [INFO ] [Real]Absence check using 81 positive place invariants in 35 ms returned sat
[2024-05-28 22:04:04] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 37 ms returned sat
[2024-05-28 22:04:11] [INFO ] [Real]Absence check using state equation in 6428 ms returned sat
[2024-05-28 22:04:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:04:11] [INFO ] [Nat]Absence check using 81 positive place invariants in 29 ms returned sat
[2024-05-28 22:04:11] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 24 ms returned sat
[2024-05-28 22:04:14] [INFO ] [Nat]Absence check using state equation in 2556 ms returned unsat
[2024-05-28 22:04:14] [INFO ] [Real]Absence check using 81 positive place invariants in 34 ms returned sat
[2024-05-28 22:04:14] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 23 ms returned sat
[2024-05-28 22:04:15] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2024-05-28 22:04:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:04:15] [INFO ] [Nat]Absence check using 81 positive place invariants in 42 ms returned sat
[2024-05-28 22:04:15] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 40 ms returned sat
[2024-05-28 22:04:16] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2024-05-28 22:04:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:04:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 286 ms returned sat
[2024-05-28 22:04:16] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 249 ms.
[2024-05-28 22:04:17] [INFO ] Added : 6 causal constraints over 2 iterations in 741 ms. Result :sat
Minimization took 4669 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 3] Max Struct:[4, 181]
FORMULA PolyORBNT-PT-S10J40-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[181]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 224 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 751/751 places, 2137/2137 transitions.
[2024-05-28 22:04:22] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:04:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[181]
RANDOM walk for 1000000 steps (70237 resets) in 13848 ms. (72 steps per ms)
BEST_FIRST walk for 1000001 steps (8185 resets) in 2710 ms. (368 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[181]
[2024-05-28 22:04:39] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:04:39] [INFO ] Invariant cache hit.
[2024-05-28 22:04:39] [INFO ] [Real]Absence check using 81 positive place invariants in 37 ms returned sat
[2024-05-28 22:04:39] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 64 ms returned sat
[2024-05-28 22:04:40] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2024-05-28 22:04:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:04:40] [INFO ] [Nat]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-05-28 22:04:40] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 25 ms returned sat
[2024-05-28 22:04:41] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2024-05-28 22:04:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:04:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 271 ms returned sat
[2024-05-28 22:04:41] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 228 ms.
[2024-05-28 22:04:42] [INFO ] Added : 6 causal constraints over 2 iterations in 795 ms. Result :sat
Minimization took 5199 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[181]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[181]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 150 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 129 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2024-05-28 22:04:47] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:04:47] [INFO ] Invariant cache hit.
[2024-05-28 22:04:49] [INFO ] Implicit Places using invariants in 2106 ms returned []
[2024-05-28 22:04:49] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:04:49] [INFO ] Invariant cache hit.
[2024-05-28 22:04:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:05:05] [INFO ] Implicit Places using invariants and state equation in 15538 ms returned []
Implicit Place search using SMT with State Equation took 17651 ms to find 0 implicit places.
[2024-05-28 22:05:05] [INFO ] Redundant transitions in 169 ms returned []
Running 2126 sub problems to find dead transitions.
[2024-05-28 22:05:05] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:05:05] [INFO ] Invariant cache hit.
[2024-05-28 22:05:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
(s26 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 4.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-05-28 22:06:03] [INFO ] Deduced a trap composed of 18 places in 425 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 84672ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 84701ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102675 ms. Remains : 751/751 places, 2137/2137 transitions.
RANDOM walk for 40000 steps (2830 resets) in 1946 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (311 resets) in 292 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (347 resets) in 315 ms. (126 steps per ms) remains 2/2 properties
[2024-05-28 22:06:31] [INFO ] Flatten gal took : 422 ms
[2024-05-28 22:06:31] [INFO ] Flatten gal took : 169 ms
[2024-05-28 22:06:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7223663568653057820.gal : 62 ms
[2024-05-28 22:06:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6337790343285574210.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/ReachabilityCardinality7223663568653057820.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6337790343285574210.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/ReachabilityCardinality6337790343285574210.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
Interrupted probabilistic random walk after 129443 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 129443 steps, saw 22986 distinct states, run finished after 3007 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-28 22:06:34] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:06:34] [INFO ] Invariant cache hit.
[2024-05-28 22:06:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 64
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1336 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/174 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :64 after 129
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :130 after 131
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 22:06:37] [INFO ] Deduced a trap composed of 339 places in 572 ms of which 4 ms to minimize.
[2024-05-28 22:06:37] [INFO ] Deduced a trap composed of 160 places in 455 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 2/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 0/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2879 variables, 1/856 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2879 variables, 1/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 857 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2541 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 3915ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 89 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Running 2126 sub problems to find dead transitions.
[2024-05-28 22:06:38] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:06:38] [INFO ] Invariant cache hit.
[2024-05-28 22:06:38] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :131 after 290365
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :290365 after 298293
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :298293 after 306687
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20081 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Detected timeout of ITS tools.
[2024-05-28 22:07:21] [INFO ] Flatten gal took : 136 ms
[2024-05-28 22:07:21] [INFO ] Applying decomposition
[2024-05-28 22:07:21] [INFO ] Flatten gal took : 136 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/graph1962322260446103819.txt' '-o' '/tmp/graph1962322260446103819.bin' '-w' '/tmp/graph1962322260446103819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1962322260446103819.bin' '-l' '-1' '-v' '-w' '/tmp/graph1962322260446103819.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:07:22] [INFO ] Decomposing Gal with order
[2024-05-28 22:07:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:07:23] [INFO ] Removed a total of 4552 redundant transitions.
[2024-05-28 22:07:23] [INFO ] Flatten gal took : 536 ms
[2024-05-28 22:07:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 503 labels/synchronizations in 86 ms.
[2024-05-28 22:07:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4062047697062334338.gal : 40 ms
[2024-05-28 22:07:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15382985745650861994.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/ReachabilityCardinality4062047697062334338.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15382985745650861994.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 ...308
Loading property file /tmp/ReachabilityCardinality15382985745650861994.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-05-28 22:07:25] [INFO ] Deduced a trap composed of 18 places in 509 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 59953ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 59991ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60099 ms. Remains : 751/751 places, 2137/2137 transitions.
RANDOM walk for 40000 steps (2828 resets) in 1320 ms. (30 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (327 resets) in 330 ms. (120 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 134340 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 1
Probabilistic random walk after 134340 steps, saw 23694 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-28 22:07:41] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:07:41] [INFO ] Invariant cache hit.
[2024-05-28 22:07:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1743 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:07:45] [INFO ] Deduced a trap composed of 339 places in 996 ms of which 21 ms to minimize.
[2024-05-28 22:07:46] [INFO ] Deduced a trap composed of 160 places in 899 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2879 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2879 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 857 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3445 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 5233ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 94 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 76 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2024-05-28 22:07:47] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:07:47] [INFO ] Invariant cache hit.
[2024-05-28 22:07:48] [INFO ] Implicit Places using invariants in 1758 ms returned []
[2024-05-28 22:07:48] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:07:48] [INFO ] Invariant cache hit.
[2024-05-28 22:07:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:08:07] [INFO ] Implicit Places using invariants and state equation in 19018 ms returned []
Implicit Place search using SMT with State Equation took 20787 ms to find 0 implicit places.
[2024-05-28 22:08:08] [INFO ] Redundant transitions in 203 ms returned []
Running 2126 sub problems to find dead transitions.
[2024-05-28 22:08:08] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:08:08] [INFO ] Invariant cache hit.
[2024-05-28 22:08:08] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-05-28 22:09:05] [INFO ] Deduced a trap composed of 18 places in 452 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 82994ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 83019ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104113 ms. Remains : 751/751 places, 2137/2137 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[181]
Starting property specific reduction for PolyORBNT-PT-S10J40-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[181]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[181]
[2024-05-28 22:09:31] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:09:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[181]
RANDOM walk for 10000 steps (705 resets) in 222 ms. (44 steps per ms)
BEST_FIRST walk for 10001 steps (84 resets) in 34 ms. (285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[181]
[2024-05-28 22:09:31] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:09:31] [INFO ] Invariant cache hit.
[2024-05-28 22:09:31] [INFO ] [Real]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-05-28 22:09:31] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 27 ms returned sat
[2024-05-28 22:09:32] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2024-05-28 22:09:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:09:32] [INFO ] [Nat]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-05-28 22:09:32] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 23 ms returned sat
[2024-05-28 22:09:33] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2024-05-28 22:09:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:09:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 256 ms returned sat
[2024-05-28 22:09:33] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 204 ms.
[2024-05-28 22:09:34] [INFO ] Added : 6 causal constraints over 2 iterations in 764 ms. Result :sat
Minimization took 1061 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[181]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[181]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 99 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Running 2126 sub problems to find dead transitions.
[2024-05-28 22:09:35] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:09:35] [INFO ] Invariant cache hit.
[2024-05-28 22:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-05-28 22:10:23] [INFO ] Deduced a trap composed of 18 places in 393 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 63357ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 63384ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63490 ms. Remains : 751/751 places, 2137/2137 transitions.
[2024-05-28 22:10:39] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:10:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[181]
RANDOM walk for 1000000 steps (70151 resets) in 13232 ms. (75 steps per ms)
BEST_FIRST walk for 1000001 steps (8237 resets) in 2314 ms. (431 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[181]
[2024-05-28 22:10:54] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:10:54] [INFO ] Invariant cache hit.
[2024-05-28 22:10:54] [INFO ] [Real]Absence check using 81 positive place invariants in 21 ms returned sat
[2024-05-28 22:10:54] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 30 ms returned sat
[2024-05-28 22:10:55] [INFO ] [Real]Absence check using state equation in 685 ms returned sat
[2024-05-28 22:10:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:10:55] [INFO ] [Nat]Absence check using 81 positive place invariants in 17 ms returned sat
[2024-05-28 22:10:55] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 28 ms returned sat
[2024-05-28 22:10:56] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2024-05-28 22:10:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:10:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 269 ms returned sat
[2024-05-28 22:10:56] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 192 ms.
[2024-05-28 22:10:57] [INFO ] Added : 6 causal constraints over 2 iterations in 657 ms. Result :sat
Minimization took 4926 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[181]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[181]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 109 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 80 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2024-05-28 22:11:02] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:11:02] [INFO ] Invariant cache hit.
[2024-05-28 22:11:04] [INFO ] Implicit Places using invariants in 1936 ms returned []
[2024-05-28 22:11:04] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:11:04] [INFO ] Invariant cache hit.
[2024-05-28 22:11:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:11:18] [INFO ] Implicit Places using invariants and state equation in 14275 ms returned []
Implicit Place search using SMT with State Equation took 16233 ms to find 0 implicit places.
[2024-05-28 22:11:18] [INFO ] Redundant transitions in 115 ms returned []
Running 2126 sub problems to find dead transitions.
[2024-05-28 22:11:18] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:11:18] [INFO ] Invariant cache hit.
[2024-05-28 22:11:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-05-28 22:12:18] [INFO ] Deduced a trap composed of 18 places in 582 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 84005ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 84039ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100492 ms. Remains : 751/751 places, 2137/2137 transitions.
[2024-05-28 22:12:43] [INFO ] Flatten gal took : 262 ms
[2024-05-28 22:12:43] [INFO ] Flatten gal took : 209 ms
[2024-05-28 22:12:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13061414761312261045.gal : 32 ms
[2024-05-28 22:12:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6584698346929016613.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/ReachabilityCardinality13061414761312261045.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6584698346929016613.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
RANDOM walk for 40000 steps (2824 resets) in 1748 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (359 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (321 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality6584698346929016613.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
Interrupted probabilistic random walk after 152889 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 152889 steps, saw 26564 distinct states, run finished after 3003 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-28 22:12:46] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:12:46] [INFO ] Invariant cache hit.
[2024-05-28 22:12:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 64
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :64 after 129
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :129 after 130
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :130 after 131
At refinement iteration 16 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2314 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/174 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 22:12:51] [INFO ] Deduced a trap composed of 339 places in 714 ms of which 7 ms to minimize.
[2024-05-28 22:12:51] [INFO ] Deduced a trap composed of 160 places in 732 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 2/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 0/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2879 variables, 1/856 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2879 variables, 1/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 857 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3307 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 5677ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 75 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Running 2126 sub problems to find dead transitions.
[2024-05-28 22:12:52] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:12:52] [INFO ] Invariant cache hit.
[2024-05-28 22:12:52] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :131 after 290365
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :290365 after 298293
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :298293 after 306687
Detected timeout of ITS tools.
[2024-05-28 22:13:33] [INFO ] Flatten gal took : 97 ms
[2024-05-28 22:13:33] [INFO ] Applying decomposition
[2024-05-28 22:13:33] [INFO ] Flatten gal took : 129 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/graph15851246986916450156.txt' '-o' '/tmp/graph15851246986916450156.bin' '-w' '/tmp/graph15851246986916450156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15851246986916450156.bin' '-l' '-1' '-v' '-w' '/tmp/graph15851246986916450156.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:13:34] [INFO ] Decomposing Gal with order
[2024-05-28 22:13:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:13:34] [INFO ] Removed a total of 4233 redundant transitions.
[2024-05-28 22:13:34] [INFO ] Flatten gal took : 226 ms
[2024-05-28 22:13:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 518 labels/synchronizations in 58 ms.
[2024-05-28 22:13:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3339246169456831603.gal : 50 ms
[2024-05-28 22:13:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7470794331832684700.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/ReachabilityCardinality3339246169456831603.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7470794331832684700.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/ReachabilityCardinality7470794331832684700.prop.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
SMT process timed out in 43423ms, After SMT, problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 43456ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43544 ms. Remains : 751/751 places, 2137/2137 transitions.
RANDOM walk for 40000 steps (2820 resets) in 777 ms. (51 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (317 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 202954 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 202954 steps, saw 34275 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-28 22:13:39] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:13:39] [INFO ] Invariant cache hit.
[2024-05-28 22:13:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1028 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:13:42] [INFO ] Deduced a trap composed of 339 places in 667 ms of which 6 ms to minimize.
[2024-05-28 22:13:42] [INFO ] Deduced a trap composed of 160 places in 571 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2879 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2879 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 857 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2919 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3963ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 73 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 90 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2024-05-28 22:13:43] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:13:43] [INFO ] Invariant cache hit.
[2024-05-28 22:13:44] [INFO ] Implicit Places using invariants in 1220 ms returned []
[2024-05-28 22:13:44] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:13:44] [INFO ] Invariant cache hit.
[2024-05-28 22:13:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:13:57] [INFO ] Implicit Places using invariants and state equation in 12968 ms returned []
Implicit Place search using SMT with State Equation took 14211 ms to find 0 implicit places.
[2024-05-28 22:13:57] [INFO ] Redundant transitions in 132 ms returned []
Running 2126 sub problems to find dead transitions.
[2024-05-28 22:13:58] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 22:13:58] [INFO ] Invariant cache hit.
[2024-05-28 22:13:58] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-05-28 22:14:56] [INFO ] Deduced a trap composed of 18 places in 425 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 83959ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 84019ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98477 ms. Remains : 751/751 places, 2137/2137 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[181]
Ending property specific reduction for PolyORBNT-PT-S10J40-UpperBounds-12 in 350783 ms.
[2024-05-28 22:15:22] [INFO ] Flatten gal took : 210 ms
[2024-05-28 22:15:22] [INFO ] Applying decomposition
[2024-05-28 22:15:22] [INFO ] Flatten gal took : 186 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/graph5753923143227479694.txt' '-o' '/tmp/graph5753923143227479694.bin' '-w' '/tmp/graph5753923143227479694.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5753923143227479694.bin' '-l' '-1' '-v' '-w' '/tmp/graph5753923143227479694.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:15:22] [INFO ] Decomposing Gal with order
[2024-05-28 22:15:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:15:23] [INFO ] Removed a total of 4555 redundant transitions.
[2024-05-28 22:15:23] [INFO ] Flatten gal took : 251 ms
[2024-05-28 22:15:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 507 labels/synchronizations in 78 ms.
[2024-05-28 22:15:23] [INFO ] Time to serialize gal into /tmp/UpperBounds8663738458650705081.gal : 24 ms
[2024-05-28 22:15:23] [INFO ] Time to serialize properties into /tmp/UpperBounds12607818269675533474.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/UpperBounds8663738458650705081.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12607818269675533474.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 ...284
Loading property file /tmp/UpperBounds12607818269675533474.prop.
ITS-tools command line returned an error code 137
[2024-05-28 22:20:28] [INFO ] Flatten gal took : 131 ms
[2024-05-28 22:20:28] [INFO ] Time to serialize gal into /tmp/UpperBounds5887869083393890119.gal : 22 ms
[2024-05-28 22:20:28] [INFO ] Time to serialize properties into /tmp/UpperBounds16919025490816425238.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/UpperBounds5887869083393890119.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16919025490816425238.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 ...305
Loading property file /tmp/UpperBounds16919025490816425238.prop.
ITS-tools command line returned an error code 137
[2024-05-28 22:29:07] [INFO ] Flatten gal took : 131 ms
[2024-05-28 22:29:07] [INFO ] Input system was already deterministic with 2137 transitions.
[2024-05-28 22:29:07] [INFO ] Transformed 751 places.
[2024-05-28 22:29:07] [INFO ] Transformed 2137 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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
[2024-05-28 22:29:38] [INFO ] Time to serialize gal into /tmp/UpperBounds6484342907484972624.gal : 29 ms
[2024-05-28 22:29:38] [INFO ] Time to serialize properties into /tmp/UpperBounds18059281215278219279.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/UpperBounds6484342907484972624.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18059281215278219279.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds18059281215278219279.prop.
ITS-tools command line returned an error code 137
Total runtime 2147626 ms.

BK_STOP 1716935882040

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="PolyORBNT-PT-S10J40"
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-5568"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S10J40, 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 r290-tajo-171654447300501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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