/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl


--------------------------------------------------------------------------------


This is Ultimate 0.2.3-?-9ecb849-m
[2024-02-10 01:37:38,719 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-02-10 01:37:38,802 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf
[2024-02-10 01:37:38,806 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-02-10 01:37:38,807 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-02-10 01:37:38,807 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks
[2024-02-10 01:37:38,833 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-10 01:37:38,834 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-10 01:37:38,834 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-10 01:37:38,835 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-10 01:37:38,835 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-10 01:37:38,836 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-02-10 01:37:38,836 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-02-10 01:37:38,836 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2024-02-10 01:37:38,837 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2024-02-10 01:37:38,837 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2024-02-10 01:37:38,837 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2024-02-10 01:37:38,837 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2024-02-10 01:37:38,838 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-10 01:37:38,838 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2024-02-10 01:37:38,838 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-02-10 01:37:38,839 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-10 01:37:38,839 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-02-10 01:37:38,839 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-10 01:37:38,840 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2024-02-10 01:37:38,840 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-02-10 01:37:38,840 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2024-02-10 01:37:38,840 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-02-10 01:37:38,841 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-02-10 01:37:38,841 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-10 01:37:38,841 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2024-02-10 01:37:38,841 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-02-10 01:37:38,842 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-10 01:37:38,842 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-10 01:37:38,842 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-10 01:37:38,843 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-10 01:37:38,843 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-02-10 01:37:38,844 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-02-10 01:37:38,844 INFO  L153        SettingsManager]:  * TransformationType=MODULO_NEIGHBOR
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true
[2024-02-10 01:37:39,149 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-10 01:37:39,177 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-10 01:37:39,180 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-10 01:37:39,181 INFO  L270        PluginConnector]: Initializing Boogie PL CUP Parser...
[2024-02-10 01:37:39,184 INFO  L274        PluginConnector]: Boogie PL CUP Parser initialized
[2024-02-10 01:37:39,185 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl
[2024-02-10 01:37:39,185 INFO  L110           BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl'
[2024-02-10 01:37:39,217 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-10 01:37:39,218 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2024-02-10 01:37:39,219 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-10 01:37:39,220 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-10 01:37:39,220 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-10 01:37:39,231 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:39" (1/1) ...
[2024-02-10 01:37:39,239 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:39" (1/1) ...
[2024-02-10 01:37:39,248 INFO  L138                Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0
[2024-02-10 01:37:39,252 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-10 01:37:39,253 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-10 01:37:39,253 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-10 01:37:39,254 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-02-10 01:37:39,290 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:39" (1/1) ...
[2024-02-10 01:37:39,290 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:39" (1/1) ...
[2024-02-10 01:37:39,305 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:39" (1/1) ...
[2024-02-10 01:37:39,305 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:39" (1/1) ...
[2024-02-10 01:37:39,310 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:39" (1/1) ...
[2024-02-10 01:37:39,343 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:39" (1/1) ...
[2024-02-10 01:37:39,344 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:39" (1/1) ...
[2024-02-10 01:37:39,346 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:39" (1/1) ...
[2024-02-10 01:37:39,347 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-10 01:37:39,348 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-10 01:37:39,348 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-02-10 01:37:39,348 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-02-10 01:37:39,349 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:39" (1/1) ...
[2024-02-10 01:37:39,356 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-10 01:37:39,365 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-10 01:37:39,390 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-02-10 01:37:39,416 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2024-02-10 01:37:39,451 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure sum1 given in one single declaration
[2024-02-10 01:37:39,451 INFO  L130     BoogieDeclarations]: Found specification of procedure sum1
[2024-02-10 01:37:39,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure sum1
[2024-02-10 01:37:39,452 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure sum2 given in one single declaration
[2024-02-10 01:37:39,452 INFO  L130     BoogieDeclarations]: Found specification of procedure sum2
[2024-02-10 01:37:39,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure sum2
[2024-02-10 01:37:39,453 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration
[2024-02-10 01:37:39,453 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-10 01:37:39,453 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-10 01:37:39,453 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inc given in one single declaration
[2024-02-10 01:37:39,453 INFO  L130     BoogieDeclarations]: Found specification of procedure inc
[2024-02-10 01:37:39,453 INFO  L138     BoogieDeclarations]: Found implementation of procedure inc
[2024-02-10 01:37:39,455 WARN  L210             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-02-10 01:37:39,511 INFO  L236             CfgBuilder]: Building ICFG
[2024-02-10 01:37:39,513 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-10 01:37:39,661 INFO  L277             CfgBuilder]: Performing block encoding
[2024-02-10 01:37:39,687 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-10 01:37:39,687 INFO  L302             CfgBuilder]: Removed 0 assume(true) statements.
[2024-02-10 01:37:39,689 INFO  L201        PluginConnector]: Adding new model sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:37:39 BoogieIcfgContainer
[2024-02-10 01:37:39,689 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-10 01:37:39,690 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-02-10 01:37:39,690 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2024-02-10 01:37:39,694 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2024-02-10 01:37:39,695 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-02-10 01:37:39,695 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:39" (1/2) ...
[2024-02-10 01:37:39,696 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5327a351 and model type sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:37:39, skipping insertion in model container
[2024-02-10 01:37:39,697 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-02-10 01:37:39,697 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:37:39" (2/2) ...
[2024-02-10 01:37:39,698 INFO  L332   chiAutomizerObserver]: Analyzing ICFG sumsuminc.bpl
[2024-02-10 01:37:39,762 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-02-10 01:37:39,786 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 80 flow
[2024-02-10 01:37:39,808 INFO  L124   PetriNetUnfolderBase]: 3/25 cut-off events.
[2024-02-10 01:37:39,808 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2024-02-10 01:37:39,813 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 3/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. 
[2024-02-10 01:37:39,813 INFO  L82        GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 80 flow
[2024-02-10 01:37:39,817 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 65 flow
[2024-02-10 01:37:39,822 INFO  L303   stractBuchiCegarLoop]: Interprodecural is true
[2024-02-10 01:37:39,822 INFO  L304   stractBuchiCegarLoop]: Hoare is false
[2024-02-10 01:37:39,822 INFO  L305   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-02-10 01:37:39,823 INFO  L306   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-02-10 01:37:39,823 INFO  L307   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-02-10 01:37:39,823 INFO  L308   stractBuchiCegarLoop]: Difference is false
[2024-02-10 01:37:39,823 INFO  L309   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-02-10 01:37:39,824 INFO  L313   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ========
[2024-02-10 01:37:39,825 INFO  L139   chiPetriNetCegarLoop]: use automaton for emptiness check
[2024-02-10 01:37:39,826 INFO  L128   iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 32 places, 25 transitions, 65 flow
[2024-02-10 01:37:39,872 INFO  L151   iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result  has 273 states, 271 states have (on average 2.918819188191882) internal successors, (791), 272 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-10 01:37:39,875 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 273 states, 271 states have (on average 2.918819188191882) internal successors, (791), 272 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-10 01:37:39,917 INFO  L131   ngComponentsAnalysis]: Automaton has 74 accepting balls. 180
[2024-02-10 01:37:39,918 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-02-10 01:37:39,918 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-02-10 01:37:39,922 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-02-10 01:37:39,922 INFO  L139   chiPetriNetCegarLoop]: use automaton for emptiness check
[2024-02-10 01:37:39,922 INFO  L128   iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 32 places, 25 transitions, 65 flow
[2024-02-10 01:37:39,948 INFO  L151   iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result  has 273 states, 271 states have (on average 2.918819188191882) internal successors, (791), 272 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-10 01:37:39,949 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 273 states, 271 states have (on average 2.918819188191882) internal successors, (791), 272 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-10 01:37:39,964 INFO  L131   ngComponentsAnalysis]: Automaton has 74 accepting balls. 180
[2024-02-10 01:37:39,965 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-02-10 01:37:39,965 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-02-10 01:37:39,970 INFO  L748   eck$LassoCheckResult]: Stem: Black: 586#[$Ultimate##0]don't care [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2}  AuxVars[]  AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0] 589#[L64, $Ultimate##0]don't care [76] $Ultimate##0-->L19: Formula: (= v_sum1_1 0)  InVars {}  OutVars{sum1=v_sum1_1}  AuxVars[]  AssignedVars[sum1] 593#[L19, L64]don't care [77] L19-->L21-1: Formula: (= v_i1_1 0)  InVars {}  OutVars{i1=v_i1_1}  AuxVars[]  AssignedVars[i1] 601#[L64, L21-1]don't care 
[2024-02-10 01:37:39,970 INFO  L750   eck$LassoCheckResult]: Loop: 601#[L64, L21-1]don't care [79] L21-1-->L21: Formula: (< v_i1_2 v_N_1)  InVars {i1=v_i1_2, N=v_N_1}  OutVars{i1=v_i1_2, N=v_N_1}  AuxVars[]  AssignedVars[] 617#[L64, L21]don't care [81] L21-->L21-1: Formula: (and (= (+ v_i1_12 1) v_i1_11) (= v_sum1_6 (+ (select v_A_15 v_i1_12) v_sum1_7)))  InVars {sum1=v_sum1_7, A=v_A_15, i1=v_i1_12}  OutVars{sum1=v_sum1_6, A=v_A_15, i1=v_i1_11}  AuxVars[]  AssignedVars[sum1, i1] 601#[L64, L21-1]don't care 
[2024-02-10 01:37:39,975 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 01:37:39,975 INFO  L85        PathProgramCache]: Analyzing trace with hash 123519, now seen corresponding path program 1 times
[2024-02-10 01:37:39,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 01:37:39,991 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64189744]
[2024-02-10 01:37:39,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 01:37:39,996 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 01:37:40,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:40,058 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 01:37:40,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:40,086 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 01:37:40,091 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 01:37:40,091 INFO  L85        PathProgramCache]: Analyzing trace with hash 3491, now seen corresponding path program 1 times
[2024-02-10 01:37:40,091 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 01:37:40,092 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750512122]
[2024-02-10 01:37:40,092 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 01:37:40,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 01:37:40,112 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:40,113 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 01:37:40,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:40,119 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 01:37:40,121 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 01:37:40,122 INFO  L85        PathProgramCache]: Analyzing trace with hash 118704289, now seen corresponding path program 1 times
[2024-02-10 01:37:40,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 01:37:40,122 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532352626]
[2024-02-10 01:37:40,122 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 01:37:40,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 01:37:40,131 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:40,132 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 01:37:40,137 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:40,140 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 01:37:40,259 INFO  L210          LassoAnalysis]: Preferences:
[2024-02-10 01:37:40,259 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2024-02-10 01:37:40,260 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-02-10 01:37:40,260 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2024-02-10 01:37:40,260 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2024-02-10 01:37:40,260 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-10 01:37:40,260 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2024-02-10 01:37:40,260 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2024-02-10 01:37:40,260 INFO  L133   ssoRankerPreferences]: Filename of dumped script: sumsuminc.bpl_BEv2_Iteration1_Lasso
[2024-02-10 01:37:40,260 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2024-02-10 01:37:40,260 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2024-02-10 01:37:40,273 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-10 01:37:40,303 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-10 01:37:40,305 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-10 01:37:40,381 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2024-02-10 01:37:40,385 INFO  L490          LassoAnalysis]: Using template 'affine'.
[2024-02-10 01:37:40,387 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-10 01:37:40,387 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-10 01:37:40,388 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-02-10 01:37:40,391 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-02-10 01:37:40,392 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process
[2024-02-10 01:37:40,400 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-02-10 01:37:40,400 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-02-10 01:37:40,400 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-02-10 01:37:40,400 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-02-10 01:37:40,407 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-02-10 01:37:40,407 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-02-10 01:37:40,421 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-02-10 01:37:40,428 INFO  L443   ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-02-10 01:37:40,429 INFO  L444   ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-02-10 01:37:40,430 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-10 01:37:40,431 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-10 01:37:40,433 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-02-10 01:37:40,444 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-02-10 01:37:40,452 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process
[2024-02-10 01:37:40,466 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-02-10 01:37:40,467 INFO  L513          LassoAnalysis]: Proved termination.
[2024-02-10 01:37:40,468 INFO  L515          LassoAnalysis]: Termination argument consisting of:
Ranking function f(i1, N) = -1*i1 + 1*N
Supporting invariants []
[2024-02-10 01:37:40,474 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0
[2024-02-10 01:37:40,477 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-02-10 01:37:40,510 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 01:37:40,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-10 01:37:40,523 INFO  L262         TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core
[2024-02-10 01:37:40,524 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-10 01:37:40,558 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-10 01:37:40,559 WARN  L260         TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-02-10 01:37:40,560 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-10 01:37:40,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-10 01:37:40,618 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 
[2024-02-10 01:37:40,620 INFO  L162     BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-10 01:37:40,804 INFO  L171     BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 392 transitions.6 powerset states3 rank states. The highest rank that occured is 1
[2024-02-10 01:37:40,805 INFO  L89          BuchiIntersect]: Starting Intersection
[2024-02-10 01:37:40,806 INFO  L72    uchiIntersectDefault]: Starting Basic Intersection
[2024-02-10 01:37:40,817 INFO  L85    uchiIntersectDefault]: Exiting Basic Intersection
[2024-02-10 01:37:40,817 INFO  L99          BuchiIntersect]: Exiting Intersection
[2024-02-10 01:37:40,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 
[2024-02-10 01:37:40,825 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-10 01:37:40,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions.
[2024-02-10 01:37:40,862 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 3 letters. Loop has 2 letters.
[2024-02-10 01:37:40,862 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-10 01:37:40,862 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 5 letters. Loop has 2 letters.
[2024-02-10 01:37:40,863 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-10 01:37:40,863 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 3 letters. Loop has 4 letters.
[2024-02-10 01:37:40,863 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-10 01:37:40,863 INFO  L428   stractBuchiCegarLoop]: Abstraction has has 50 places, 628 transitions, 2902 flow
[2024-02-10 01:37:40,863 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-02-10 01:37:40,863 INFO  L139   chiPetriNetCegarLoop]: use automaton for emptiness check
[2024-02-10 01:37:40,864 INFO  L128   iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 50 places, 628 transitions, 2902 flow
[2024-02-10 01:37:40,883 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0
[2024-02-10 01:37:40,965 INFO  L151   iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result  has 847 states, 837 states have (on average 3.838709677419355) internal successors, (3213), 846 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-10 01:37:40,967 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 847 states, 837 states have (on average 3.838709677419355) internal successors, (3213), 846 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-10 01:37:41,005 INFO  L131   ngComponentsAnalysis]: Automaton has 132 accepting balls. 292
[2024-02-10 01:37:41,005 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-02-10 01:37:41,006 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-02-10 01:37:41,008 INFO  L748   eck$LassoCheckResult]: Stem: Black: 1182#[$Ultimate##0]don't care [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2}  AuxVars[]  AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0] Black: 1185#[L64, $Ultimate##0]don't care [98] L64-->$Ultimate##0: Formula: (and (= 2 v_sum2Thread1of1ForFork1_thidvar0_2) (= 2 v_sum2Thread1of1ForFork1_thidvar1_2))  InVars {}  OutVars{sum2Thread1of1ForFork1_thidvar0=v_sum2Thread1of1ForFork1_thidvar0_2, sum2Thread1of1ForFork1_thidvar1=v_sum2Thread1of1ForFork1_thidvar1_2, sum2Thread1of1ForFork1_y=v_sum2Thread1of1ForFork1_y_2}  AuxVars[]  AssignedVars[sum2Thread1of1ForFork1_thidvar0, sum2Thread1of1ForFork1_thidvar1, sum2Thread1of1ForFork1_y] 1198#[L65, $Ultimate##0, $Ultimate##0]don't care [82] $Ultimate##0-->L34: Formula: (= v_sum2_3 0)  InVars {}  OutVars{sum2=v_sum2_3}  AuxVars[]  AssignedVars[sum2] Black: 1227#[L65, $Ultimate##0, L34]don't care [83] L34-->L36-1: Formula: (= v_i2_6 0)  InVars {}  OutVars{i2=v_i2_6}  AuxVars[]  AssignedVars[i2] 1286#[L65, L36-1, $Ultimate##0]don't care 
[2024-02-10 01:37:41,009 INFO  L750   eck$LassoCheckResult]: Loop: 1286#[L65, L36-1, $Ultimate##0]don't care [85] L36-1-->L36: Formula: (< v_i2_1 v_N_3)  InVars {i2=v_i2_1, N=v_N_3}  OutVars{i2=v_i2_1, N=v_N_3}  AuxVars[]  AssignedVars[] Black: 1406#[L65, $Ultimate##0, L36]don't care [87] L36-->L36-1: Formula: (and (= (+ v_i2_12 1) v_i2_11) (= (+ (select v_A_13 v_i2_12) v_sum2_7) v_sum2_6))  InVars {A=v_A_13, sum2=v_sum2_7, i2=v_i2_12}  OutVars{A=v_A_13, sum2=v_sum2_6, i2=v_i2_11}  AuxVars[]  AssignedVars[sum2, i2] 1286#[L65, L36-1, $Ultimate##0]don't care 
[2024-02-10 01:37:41,011 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 01:37:41,011 INFO  L85        PathProgramCache]: Analyzing trace with hash 3850469, now seen corresponding path program 1 times
[2024-02-10 01:37:41,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 01:37:41,012 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021149376]
[2024-02-10 01:37:41,012 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 01:37:41,012 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 01:37:41,026 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:41,027 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 01:37:41,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:41,042 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 01:37:41,044 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 01:37:41,044 INFO  L85        PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times
[2024-02-10 01:37:41,045 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 01:37:41,045 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913809317]
[2024-02-10 01:37:41,045 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 01:37:41,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 01:37:41,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:41,050 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 01:37:41,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:41,054 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 01:37:41,054 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 01:37:41,054 INFO  L85        PathProgramCache]: Analyzing trace with hash -594663865, now seen corresponding path program 1 times
[2024-02-10 01:37:41,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 01:37:41,055 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13574876]
[2024-02-10 01:37:41,055 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 01:37:41,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 01:37:41,077 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:41,077 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 01:37:41,089 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:41,091 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 01:37:41,168 INFO  L210          LassoAnalysis]: Preferences:
[2024-02-10 01:37:41,169 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2024-02-10 01:37:41,169 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-02-10 01:37:41,169 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2024-02-10 01:37:41,169 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2024-02-10 01:37:41,169 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-10 01:37:41,169 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2024-02-10 01:37:41,169 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2024-02-10 01:37:41,169 INFO  L133   ssoRankerPreferences]: Filename of dumped script: sumsuminc.bpl_BEv2_Iteration2_Lasso
[2024-02-10 01:37:41,169 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2024-02-10 01:37:41,169 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2024-02-10 01:37:41,173 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-10 01:37:41,176 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-10 01:37:41,191 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-10 01:37:41,193 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-10 01:37:41,197 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-10 01:37:41,202 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-10 01:37:41,272 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2024-02-10 01:37:41,272 INFO  L490          LassoAnalysis]: Using template 'affine'.
[2024-02-10 01:37:41,272 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-10 01:37:41,272 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-10 01:37:41,274 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-02-10 01:37:41,278 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-02-10 01:37:41,287 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-02-10 01:37:41,287 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-02-10 01:37:41,288 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-02-10 01:37:41,288 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-02-10 01:37:41,288 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-02-10 01:37:41,289 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-02-10 01:37:41,289 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-02-10 01:37:41,291 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process
[2024-02-10 01:37:41,300 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-02-10 01:37:41,308 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0
[2024-02-10 01:37:41,309 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-10 01:37:41,309 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-10 01:37:41,310 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-02-10 01:37:41,317 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-02-10 01:37:41,326 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-02-10 01:37:41,326 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-02-10 01:37:41,326 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-02-10 01:37:41,326 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-02-10 01:37:41,332 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-02-10 01:37:41,333 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-02-10 01:37:41,342 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process
[2024-02-10 01:37:41,352 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-02-10 01:37:41,358 INFO  L443   ModelExtractionUtils]: Simplification made 4 calls to the SMT solver.
[2024-02-10 01:37:41,358 INFO  L444   ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero.
[2024-02-10 01:37:41,358 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-10 01:37:41,359 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-10 01:37:41,360 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-02-10 01:37:41,364 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process
[2024-02-10 01:37:41,365 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-02-10 01:37:41,383 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-02-10 01:37:41,383 INFO  L513          LassoAnalysis]: Proved termination.
[2024-02-10 01:37:41,383 INFO  L515          LassoAnalysis]: Termination argument consisting of:
Ranking function f(i2, N) = -1*i2 + 1*N
Supporting invariants []
[2024-02-10 01:37:41,391 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0
[2024-02-10 01:37:41,393 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-02-10 01:37:41,407 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 01:37:41,419 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-10 01:37:41,420 INFO  L262         TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core
[2024-02-10 01:37:41,420 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-10 01:37:41,434 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-10 01:37:41,435 WARN  L260         TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-02-10 01:37:41,435 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-10 01:37:41,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-10 01:37:41,457 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 
[2024-02-10 01:37:41,457 INFO  L162     BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand  has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-10 01:37:41,581 INFO  L171     BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand  has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 392 transitions.6 powerset states3 rank states. The highest rank that occured is 1
[2024-02-10 01:37:41,581 INFO  L89          BuchiIntersect]: Starting Intersection
[2024-02-10 01:37:41,581 INFO  L72    uchiIntersectDefault]: Starting Basic Intersection
[2024-02-10 01:37:41,670 INFO  L85    uchiIntersectDefault]: Exiting Basic Intersection
[2024-02-10 01:37:41,670 INFO  L99          BuchiIntersect]: Exiting Intersection
[2024-02-10 01:37:41,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 
[2024-02-10 01:37:41,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-10 01:37:41,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions.
[2024-02-10 01:37:41,672 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 4 letters. Loop has 2 letters.
[2024-02-10 01:37:41,672 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-10 01:37:41,672 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 6 letters. Loop has 2 letters.
[2024-02-10 01:37:41,672 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-10 01:37:41,673 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 152 transitions. Stem has 4 letters. Loop has 4 letters.
[2024-02-10 01:37:41,673 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-10 01:37:41,673 INFO  L428   stractBuchiCegarLoop]: Abstraction has has 68 places, 15756 transitions, 104676 flow
[2024-02-10 01:37:41,673 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2024-02-10 01:37:41,674 INFO  L139   chiPetriNetCegarLoop]: use automaton for emptiness check
[2024-02-10 01:37:41,674 INFO  L128   iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 68 places, 15756 transitions, 104676 flow
[2024-02-10 01:37:42,092 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0
[2024-02-10 01:37:44,465 INFO  L151   iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result  has 2309 states, 2255 states have (on average 4.972062084257206) internal successors, (11212), 2308 states have internal predecessors, (11212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-10 01:37:44,470 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 2309 states, 2255 states have (on average 4.972062084257206) internal successors, (11212), 2308 states have internal predecessors, (11212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-10 01:37:44,513 INFO  L131   ngComponentsAnalysis]: Automaton has 92 accepting balls. 184
[2024-02-10 01:37:44,513 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-02-10 01:37:44,514 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-02-10 01:37:44,514 INFO  L748   eck$LassoCheckResult]: Stem: Black: 3504#[$Ultimate##0]don't care [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sum1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{sum1Thread1of1ForFork0_x=v_sum1Thread1of1ForFork0_x_2, sum1Thread1of1ForFork0_thidvar0=v_sum1Thread1of1ForFork0_thidvar0_2}  AuxVars[]  AssignedVars[sum1Thread1of1ForFork0_x, sum1Thread1of1ForFork0_thidvar0] Black: 3507#[$Ultimate##0, L64]don't care [98] L64-->$Ultimate##0: Formula: (and (= 2 v_sum2Thread1of1ForFork1_thidvar0_2) (= 2 v_sum2Thread1of1ForFork1_thidvar1_2))  InVars {}  OutVars{sum2Thread1of1ForFork1_thidvar0=v_sum2Thread1of1ForFork1_thidvar0_2, sum2Thread1of1ForFork1_thidvar1=v_sum2Thread1of1ForFork1_thidvar1_2, sum2Thread1of1ForFork1_y=v_sum2Thread1of1ForFork1_y_2}  AuxVars[]  AssignedVars[sum2Thread1of1ForFork1_thidvar0, sum2Thread1of1ForFork1_thidvar1, sum2Thread1of1ForFork1_y] Black: 3521#[L65, $Ultimate##0, $Ultimate##0]don't care [101] L65-->$Ultimate##0: Formula: (and (= 3 v_incThread1of1ForFork2_thidvar1_2) (= 3 v_incThread1of1ForFork2_thidvar2_2) (= 3 v_incThread1of1ForFork2_thidvar0_2))  InVars {}  OutVars{incThread1of1ForFork2_thidvar2=v_incThread1of1ForFork2_thidvar2_2, incThread1of1ForFork2_thidvar1=v_incThread1of1ForFork2_thidvar1_2, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_12, incThread1of1ForFork2_thidvar0=v_incThread1of1ForFork2_thidvar0_2}  AuxVars[]  AssignedVars[incThread1of1ForFork2_thidvar2, incThread1of1ForFork2_thidvar1, incThread1of1ForFork2_j, incThread1of1ForFork2_thidvar0] Black: 3570#[$Ultimate##0, L66, $Ultimate##0, $Ultimate##0]don't care [88] $Ultimate##0-->L51-1: Formula: (= v_incThread1of1ForFork2_j_1 0)  InVars {}  OutVars{incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_1}  AuxVars[]  AssignedVars[incThread1of1ForFork2_j] 3684#[$Ultimate##0, L66, $Ultimate##0, L51-1]don't care 
[2024-02-10 01:37:44,515 INFO  L750   eck$LassoCheckResult]: Loop: 3684#[$Ultimate##0, L66, $Ultimate##0, L51-1]don't care [90] L51-1-->L50: Formula: (< v_incThread1of1ForFork2_j_5 v_N_5)  InVars {incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_5, N=v_N_5}  OutVars{incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_5, N=v_N_5}  AuxVars[]  AssignedVars[] Black: 3947#[$Ultimate##0, L66, $Ultimate##0, L50]don't care [92] L50-->L51-1: Formula: (or (and (= v_A_In_1 v_A_Out_2) (or (<= v_i1_In_1 v_incThread1of1ForFork2_j_7) (<= v_i2_In_1 v_incThread1of1ForFork2_j_7)) (= v_incThread1of1ForFork2_j_8 v_incThread1of1ForFork2_j_7)) (and (< v_incThread1of1ForFork2_j_7 v_i2_In_1) (< v_incThread1of1ForFork2_j_7 v_i1_In_1) (= v_incThread1of1ForFork2_j_8 (+ v_incThread1of1ForFork2_j_7 1)) (= v_A_Out_2 (store v_A_In_1 v_incThread1of1ForFork2_j_7 (+ (select v_A_In_1 v_incThread1of1ForFork2_j_7) 1)))))  InVars {A=v_A_In_1, i1=v_i1_In_1, i2=v_i2_In_1, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_7}  OutVars{A=v_A_Out_2, i1=v_i1_In_1, i2=v_i2_In_1, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_8}  AuxVars[]  AssignedVars[A, incThread1of1ForFork2_j] 3684#[$Ultimate##0, L66, $Ultimate##0, L51-1]don't care 
[2024-02-10 01:37:44,515 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 01:37:44,515 INFO  L85        PathProgramCache]: Analyzing trace with hash 3851063, now seen corresponding path program 1 times
[2024-02-10 01:37:44,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 01:37:44,516 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178581910]
[2024-02-10 01:37:44,516 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 01:37:44,516 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 01:37:44,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:44,520 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 01:37:44,522 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:44,524 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 01:37:44,524 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 01:37:44,524 INFO  L85        PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 1 times
[2024-02-10 01:37:44,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 01:37:44,525 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875219401]
[2024-02-10 01:37:44,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 01:37:44,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 01:37:44,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:44,536 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 01:37:44,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:44,541 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 01:37:44,542 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-10 01:37:44,542 INFO  L85        PathProgramCache]: Analyzing trace with hash -594092871, now seen corresponding path program 1 times
[2024-02-10 01:37:44,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-10 01:37:44,542 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709515815]
[2024-02-10 01:37:44,543 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-10 01:37:44,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-10 01:37:44,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:44,550 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 01:37:44,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:44,557 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-10 01:37:44,713 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:44,713 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-10 01:37:44,721 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-10 01:37:44,748 INFO  L201        PluginConnector]: Adding new model sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:37:44 BoogieIcfgContainer
[2024-02-10 01:37:44,748 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2024-02-10 01:37:44,749 INFO  L158              Benchmark]: Toolchain (without parser) took 5530.61ms. Allocated memory was 159.4MB in the beginning and 292.6MB in the end (delta: 133.2MB). Free memory was 97.0MB in the beginning and 233.1MB in the end (delta: -136.1MB). There was no memory consumed. Max. memory is 8.0GB.
[2024-02-10 01:37:44,750 INFO  L158              Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 8.0GB.
[2024-02-10 01:37:44,750 INFO  L158              Benchmark]: Boogie Procedure Inliner took 32.93ms. Allocated memory is still 159.4MB. Free memory was 97.0MB in the beginning and 95.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2024-02-10 01:37:44,751 INFO  L158              Benchmark]: Boogie Preprocessor took 93.79ms. Allocated memory is still 159.4MB. Free memory was 95.3MB in the beginning and 130.4MB in the end (delta: -35.1MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB.
[2024-02-10 01:37:44,752 INFO  L158              Benchmark]: RCFGBuilder took 341.81ms. Allocated memory is still 159.4MB. Free memory was 130.4MB in the beginning and 119.4MB in the end (delta: 11.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB.
[2024-02-10 01:37:44,753 INFO  L158              Benchmark]: BuchiAutomizer took 5058.16ms. Allocated memory was 159.4MB in the beginning and 292.6MB in the end (delta: 133.2MB). Free memory was 119.2MB in the beginning and 233.1MB in the end (delta: -113.9MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB.
[2024-02-10 01:37:44,759 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * Boogie PL CUP Parser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 32.93ms. Allocated memory is still 159.4MB. Free memory was 97.0MB in the beginning and 95.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 93.79ms. Allocated memory is still 159.4MB. Free memory was 95.3MB in the beginning and 130.4MB in the end (delta: -35.1MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB.
 * RCFGBuilder took 341.81ms. Allocated memory is still 159.4MB. Free memory was 130.4MB in the beginning and 119.4MB in the end (delta: 11.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB.
 * BuchiAutomizer took 5058.16ms. Allocated memory was 159.4MB in the beginning and 292.6MB in the end (delta: 133.2MB). Free memory was 119.2MB in the beginning and 233.1MB in the end (delta: -113.9MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Constructed decomposition of program
    Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 5 locations.  The remainder module has 104676 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 4.9s and 3 iterations.  TraceHistogramMax:0. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1.	Nontrivial modules had stage [2, 0, 0, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/0	HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 114 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks:   Lassos: inital31 mio100 ax100 hnf100 lsp81 ukn92 mio100 lsp60 div100 bol100 ite100 ukn100 eq171 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 81ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.0s	InitialAbstractionConstructionTime: 0.0s
  - TerminationAnalysisResult: Nontermination possible
    Buchi Automizer proved that your program is nonterminating for some inputs
  - LassoShapedNonTerminationArgument [Line: 49]: Nontermination argument in form of an infinite program execution.
    Nontermination argument in form of an infinite program execution.
Stem:
[L64]  FORK  0  fork 1 sum1();
[L65]  FORK  0  fork 2, 2 sum2();
[L66]  FORK  0  fork 3, 3, 3 inc();
[L48]        3  j := 0;
       VAL      [j=0]
Loop:
[L49]  COND TRUE   j < N
[L51]  COND FALSE  !(j < i1 && j < i2)
End of lasso representation.
  - StatisticsResult: NonterminationArgumentStatistics
    Fixpoint
  - NonterminatingLassoResult [Line: 49]: Nonterminating execution
    Found a nonterminating execution for the following lasso shaped sequence of statements.
Stem:
[L64]  FORK  0  fork 1 sum1();
[L65]  FORK  0  fork 2, 2 sum2();
[L66]  FORK  0  fork 3, 3, 3 inc();
[L48]        3  j := 0;
       VAL      [j=0]
Loop:
[L49]  COND TRUE   j < N
[L51]  COND FALSE  !(j < i1 && j < i2)
End of lasso representation.
RESULT: Ultimate proved your program to be incorrect!
[2024-02-10 01:37:44,781 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...