/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:40,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:41,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:41,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:41,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:41,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:41,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:41,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:41,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:41,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:41,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:41,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:41,058 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:41,058 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:41,058 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:41,058 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:41,058 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:41,058 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:41,058 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:41,058 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:41,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:41,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:41,058 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:41,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:41,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:41,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:41,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:41,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:41,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:41,059 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:41,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:41,059 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:41,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:41,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:41,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:41,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:41,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:41,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:41,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:41,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:41,060 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:41,060 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:41,060 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:41,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:41,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:41,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:41,289 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:41,289 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:41,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs.bpl [2025-04-26 18:39:41,290 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs.bpl' [2025-04-26 18:39:41,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:41,311 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:41,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:41,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:41,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:41,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,347 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:41,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:41,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:41,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:41,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:41,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,357 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:41,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:41,366 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:41,366 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:41,367 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/1) ... [2025-04-26 18:39:41,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:41,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:41,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:41,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:39:41,410 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum1 given in one single declaration [2025-04-26 18:39:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure sum1 [2025-04-26 18:39:41,410 INFO L138 BoogieDeclarations]: Found implementation of procedure sum1 [2025-04-26 18:39:41,410 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum2 given in one single declaration [2025-04-26 18:39:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure sum2 [2025-04-26 18:39:41,411 INFO L138 BoogieDeclarations]: Found implementation of procedure sum2 [2025-04-26 18:39:41,411 INFO L124 BoogieDeclarations]: Specification and implementation of procedure bank given in one single declaration [2025-04-26 18:39:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure bank [2025-04-26 18:39:41,411 INFO L138 BoogieDeclarations]: Found implementation of procedure bank [2025-04-26 18:39:41,411 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:41,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:41,411 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2025-04-26 18:39:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2025-04-26 18:39:41,411 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2025-04-26 18:39:41,412 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:39:41,445 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:41,446 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:41,523 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:41,524 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:41,543 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:41,544 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 18:39:41,544 INFO L201 PluginConnector]: Adding new model sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:41 BoogieIcfgContainer [2025-04-26 18:39:41,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:41,545 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:41,545 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:41,549 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:41,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:41,549 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:41" (1/2) ... [2025-04-26 18:39:41,550 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c4addf1 and model type sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:41, skipping insertion in model container [2025-04-26 18:39:41,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:41,550 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:41" (2/2) ... [2025-04-26 18:39:41,551 INFO L376 chiAutomizerObserver]: Analyzing ICFG sumsumsampleabs.bpl [2025-04-26 18:39:41,594 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:39:41,625 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:41,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:41,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:41,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:41,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:39:41,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 94 flow [2025-04-26 18:39:41,697 INFO L116 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-04-26 18:39:41,699 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:39:41,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 28 events. 4/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-04-26 18:39:41,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 94 flow [2025-04-26 18:39:41,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 28 transitions, 74 flow [2025-04-26 18:39:41,706 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 37 places, 28 transitions, 74 flow [2025-04-26 18:39:41,707 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 74 flow [2025-04-26 18:39:41,759 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 547 states, 545 states have (on average 3.906422018348624) internal successors, (in total 2129), 546 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:41,762 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 547 states, 545 states have (on average 3.906422018348624) internal successors, (in total 2129), 546 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:41,764 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:41,868 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 498#[L44, L68, sum2FINAL, sum1EXIT]true [2025-04-26 18:39:41,871 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 792#[sum1EXIT, L57-2, L44, sum2FINAL, L69]true [2025-04-26 18:39:41,872 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 914#[sum1EXIT, mapAbsFINAL, L44, L69, sum2FINAL]true [2025-04-26 18:39:41,872 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1002#[sum1EXIT, mapAbsEXIT, L44, sum2FINAL, L69]true [2025-04-26 18:39:41,872 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1044#[L70, L44, sum2FINAL, mapAbsEXIT]true [2025-04-26 18:39:41,874 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 988#[mapAbsFINAL, L70, L44, sum2FINAL]true [2025-04-26 18:39:41,875 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 916#[sum1EXIT, L44, L69, sum2FINAL, L57-1]true [2025-04-26 18:39:41,875 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 990#[L57-1, L70, L44, sum2FINAL]true [2025-04-26 18:39:41,875 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 902#[L57-2, L70, L44, sum2FINAL]true [2025-04-26 18:39:41,892 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 238#[L44, L68, L34, sum1EXIT]true [2025-04-26 18:39:41,898 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 154#[L44, L68, $Ultimate##0, sum1EXIT]true [2025-04-26 18:39:41,945 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 514#[L44, L68, sum2EXIT, sum1FINAL]true [2025-04-26 18:39:41,946 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 808#[L57-2, L44, L69, sum2EXIT, sum1FINAL]true [2025-04-26 18:39:41,946 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 926#[mapAbsFINAL, L44, L69, sum2EXIT, sum1FINAL]true [2025-04-26 18:39:41,947 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1008#[mapAbsEXIT, L44, L69, sum2EXIT, sum1FINAL]true [2025-04-26 18:39:41,947 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 928#[L44, L69, sum2EXIT, L57-1, sum1FINAL]true [2025-04-26 18:39:41,948 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 528#[L44, L68, sum2EXIT, L23-1]true [2025-04-26 18:39:41,950 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 664#[L57-2, L44, sum2FINAL, L69, sum1FINAL]true [2025-04-26 18:39:41,951 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 810#[mapAbsFINAL, L44, L69, sum2FINAL, sum1FINAL]true [2025-04-26 18:39:41,951 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 930#[mapAbsEXIT, L44, sum2FINAL, L69, sum1FINAL]true [2025-04-26 18:39:41,951 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 812#[L44, L69, sum2FINAL, L57-1, sum1FINAL]true [2025-04-26 18:39:41,959 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 108#[L44, L68, $Ultimate##0, L23-1]true [2025-04-26 18:39:41,961 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 276#[L44, L68, L22, sum2EXIT]true [2025-04-26 18:39:41,966 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 82#[L44, L68, L22, L34]true [2025-04-26 18:39:41,967 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 62#[L44, L68, L22, $Ultimate##0]true [2025-04-26 18:39:41,969 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 206#[$Ultimate##0, L44, L68, sum2EXIT]true [2025-04-26 18:39:41,972 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 68#[$Ultimate##0, L44, L68, L34]true [2025-04-26 18:39:41,973 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 56#[$Ultimate##0, L44, L68, $Ultimate##0]true [2025-04-26 18:39:41,974 WARN L140 AmpleReduction]: Number of pruned transitions: 628 [2025-04-26 18:39:41,974 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 28 [2025-04-26 18:39:41,974 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 106 [2025-04-26 18:39:41,974 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:41 [2025-04-26 18:39:41,974 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:251 [2025-04-26 18:39:41,974 WARN L145 AmpleReduction]: Times succ was already a loop node:132 [2025-04-26 18:39:41,975 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:9 [2025-04-26 18:39:41,975 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:41,976 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 371 states, 369 states have (on average 2.165311653116531) internal successors, (in total 799), 370 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:41,982 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:41,982 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:41,982 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:41,982 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:41,982 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:41,982 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:41,982 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:41,982 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:41,984 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 371 states, 369 states have (on average 2.165311653116531) internal successors, (in total 799), 370 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:42,006 INFO L131 ngComponentsAnalysis]: Automaton has 109 accepting balls. 227 [2025-04-26 18:39:42,008 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:42,008 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:42,012 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:42,012 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:39:42,013 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:42,013 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 371 states, 369 states have (on average 2.165311653116531) internal successors, (in total 799), 370 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:42,024 INFO L131 ngComponentsAnalysis]: Automaton has 109 accepting balls. 227 [2025-04-26 18:39:42,024 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:42,024 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:42,024 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:42,024 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:39:42,029 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L44: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0]" "[103] L66-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x]" [2025-04-26 18:39:42,030 INFO L754 eck$LassoCheckResult]: Loop: "[92] L44-->L44: Formula: (= v_B_5 (store (store v_B_7 (+ (- 1) v_i1_12) v_sum1_11) (+ (- 1) v_i2_12) v_sum2_11)) InVars {sum1=v_sum1_11, i1=v_i1_12, sum2=v_sum2_11, i2=v_i2_12, B=v_B_7} OutVars{sum1=v_sum1_11, i1=v_i1_12, sum2=v_sum2_11, i2=v_i2_12, B=v_B_5} AuxVars[] AssignedVars[B]" [2025-04-26 18:39:42,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:42,037 INFO L85 PathProgramCache]: Analyzing trace with hash 4164, now seen corresponding path program 1 times [2025-04-26 18:39:42,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:42,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434102459] [2025-04-26 18:39:42,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:42,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:42,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:42,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:42,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:42,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:42,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:42,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:42,102 INFO L85 PathProgramCache]: Analyzing trace with hash 123, now seen corresponding path program 1 times [2025-04-26 18:39:42,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:42,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514191565] [2025-04-26 18:39:42,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:42,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:42,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:42,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:42,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,111 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:42,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:42,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:42,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:42,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:42,115 INFO L85 PathProgramCache]: Analyzing trace with hash 129176, now seen corresponding path program 1 times [2025-04-26 18:39:42,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:42,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547688376] [2025-04-26 18:39:42,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:42,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:42,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:42,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:42,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:42,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:42,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:42,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:42,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:42,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:42,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:42,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:42,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:42,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:39:42,278 INFO L201 PluginConnector]: Adding new model sumsumsampleabs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:42 BoogieIcfgContainer [2025-04-26 18:39:42,279 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:42,282 INFO L158 Benchmark]: Toolchain (without parser) took 969.01ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 82.4MB in the beginning and 262.5MB in the end (delta: -180.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:42,282 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:42,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.27ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 80.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:42,282 INFO L158 Benchmark]: Boogie Preprocessor took 16.70ms. Allocated memory is still 155.2MB. Free memory was 80.4MB in the beginning and 79.3MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:42,282 INFO L158 Benchmark]: RCFGBuilder took 178.18ms. Allocated memory is still 155.2MB. Free memory was 79.3MB in the beginning and 69.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:42,283 INFO L158 Benchmark]: BuchiAutomizer took 734.00ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 69.2MB in the beginning and 262.5MB in the end (delta: -193.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:42,286 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.17ms. Allocated memory is still 155.2MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.27ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 80.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 16.70ms. Allocated memory is still 155.2MB. Free memory was 80.4MB in the beginning and 79.3MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 178.18ms. Allocated memory is still 155.2MB. Free memory was 79.3MB in the beginning and 69.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 734.00ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 69.2MB in the beginning and 262.5MB in the end (delta: -193.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.6s and 1 iterations. TraceHistogramMax:1. Analysis of lassos took 0.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 354, Number of transitions in reduction automaton: 799, Number of states in reduction automaton: 371, Underlying: - StatisticsResult: Constructed decomposition of program Trivial decomposition into one nonterminating module. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 41]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L66] FORK 0 fork 1 bank(); [L67] FORK 0 fork 2, 2 sum1(); Loop: [L45] B[i1 - 1] := sum1; [L46] B[i2 - 1] := sum2; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 41]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L66] FORK 0 fork 1 bank(); [L67] FORK 0 fork 2, 2 sum1(); Loop: [L45] B[i1 - 1] := sum1; [L46] B[i2 - 1] := sum2; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:39:42,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...