/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/sumsuminc.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:38,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:38,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:38,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:38,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:38,808 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:38,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:38,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:38,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:38,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:38,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:38,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:38,828 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:38,828 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:38,828 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:38,828 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:38,829 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:38,829 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:38,829 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:38,829 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:38,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:38,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:38,829 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:38,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:38,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:38,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:38,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:38,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:38,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:38,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:38,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:38,831 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:38,831 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:38,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:38,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:38,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:38,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:38,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:38,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:38,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:38,832 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:38,832 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:38,832 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:39,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:39,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:39,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:39,043 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:39,044 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:39,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl [2025-04-26 18:39:39,045 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsuminc.bpl' [2025-04-26 18:39:39,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:39,059 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:39,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:39,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:39,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:39,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:39" (1/1) ... [2025-04-26 18:39:39,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:39" (1/1) ... [2025-04-26 18:39:39,086 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:39,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:39,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:39,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:39,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:39,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:39" (1/1) ... [2025-04-26 18:39:39,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:39" (1/1) ... [2025-04-26 18:39:39,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:39" (1/1) ... [2025-04-26 18:39:39,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:39" (1/1) ... [2025-04-26 18:39:39,094 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:39" (1/1) ... [2025-04-26 18:39:39,095 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:39" (1/1) ... [2025-04-26 18:39:39,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:39" (1/1) ... [2025-04-26 18:39:39,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:39" (1/1) ... [2025-04-26 18:39:39,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:39" (1/1) ... [2025-04-26 18:39:39,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:39,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:39,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:39,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:39,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:39" (1/1) ... [2025-04-26 18:39:39,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:39,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:39,136 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:39,139 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:39,159 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum1 given in one single declaration [2025-04-26 18:39:39,159 INFO L130 BoogieDeclarations]: Found specification of procedure sum1 [2025-04-26 18:39:39,159 INFO L138 BoogieDeclarations]: Found implementation of procedure sum1 [2025-04-26 18:39:39,159 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum2 given in one single declaration [2025-04-26 18:39:39,159 INFO L130 BoogieDeclarations]: Found specification of procedure sum2 [2025-04-26 18:39:39,159 INFO L138 BoogieDeclarations]: Found implementation of procedure sum2 [2025-04-26 18:39:39,159 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:39,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:39,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:39,159 INFO L124 BoogieDeclarations]: Specification and implementation of procedure inc given in one single declaration [2025-04-26 18:39:39,159 INFO L130 BoogieDeclarations]: Found specification of procedure inc [2025-04-26 18:39:39,159 INFO L138 BoogieDeclarations]: Found implementation of procedure inc [2025-04-26 18:39:39,160 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:39,195 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:39,197 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:39,271 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:39,271 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:39,298 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:39,298 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:39,299 INFO L201 PluginConnector]: Adding new model sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:39 BoogieIcfgContainer [2025-04-26 18:39:39,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:39,300 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:39,300 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:39,305 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:39,305 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:39,306 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:39" (1/2) ... [2025-04-26 18:39:39,307 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44a7f642 and model type sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:39, skipping insertion in model container [2025-04-26 18:39:39,307 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:39,307 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:39" (2/2) ... [2025-04-26 18:39:39,308 INFO L376 chiAutomizerObserver]: Analyzing ICFG sumsuminc.bpl [2025-04-26 18:39:39,345 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:39:39,387 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:39,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:39,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:39,391 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:39,392 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:39,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 80 flow [2025-04-26 18:39:39,463 INFO L116 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-04-26 18:39:39,465 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:39:39,472 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 47 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. [2025-04-26 18:39:39,472 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 80 flow [2025-04-26 18:39:39,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 65 flow [2025-04-26 18:39:39,476 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 25 transitions, 65 flow [2025-04-26 18:39:39,476 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 25 transitions, 65 flow [2025-04-26 18:39:39,523 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 273 states, 271 states have (on average 2.918819188191882) internal successors, (in total 791), 272 states have internal predecessors, (791), 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:39,524 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 273 states, 271 states have (on average 2.918819188191882) internal successors, (in total 791), 272 states have internal predecessors, (791), 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:39,526 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:39,648 WARN L140 AmpleReduction]: Number of pruned transitions: 133 [2025-04-26 18:39:39,648 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:39,649 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 33 [2025-04-26 18:39:39,649 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:28 [2025-04-26 18:39:39,649 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:86 [2025-04-26 18:39:39,649 WARN L145 AmpleReduction]: Times succ was already a loop node:53 [2025-04-26 18:39:39,649 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:39:39,649 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:39,650 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 148 states, 146 states have (on average 1.7671232876712328) internal successors, (in total 258), 147 states have internal predecessors, (258), 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:39,656 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:39,657 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:39,657 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:39,657 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:39,657 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:39,657 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:39,657 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:39,657 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:39,659 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 148 states, 146 states have (on average 1.7671232876712328) internal successors, (in total 258), 147 states have internal predecessors, (258), 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:39,678 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 90 [2025-04-26 18:39:39,678 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:39,678 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:39,683 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:39,684 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:39,684 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:39,684 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 148 states, 146 states have (on average 1.7671232876712328) internal successors, (in total 258), 147 states have internal predecessors, (258), 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:39,693 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 90 [2025-04-26 18:39:39,693 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:39,693 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:39,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:39,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:39,699 INFO L752 eck$LassoCheckResult]: Stem: "[99] $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]" "[80] $Ultimate##0-->L19: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1]" "[81] L19-->L21-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1]" [2025-04-26 18:39:39,699 INFO L754 eck$LassoCheckResult]: Loop: "[83] 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[]" "[85] L21-->L21-1: Formula: (and (= v_i1_9 (+ v_i1_10 1)) (= (+ v_sum1_7 (select v_A_5 v_i1_10)) v_sum1_6)) InVars {sum1=v_sum1_7, A=v_A_5, i1=v_i1_10} OutVars{sum1=v_sum1_6, A=v_A_5, i1=v_i1_9} AuxVars[] AssignedVars[sum1, i1]" [2025-04-26 18:39:39,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:39,703 INFO L85 PathProgramCache]: Analyzing trace with hash 127491, now seen corresponding path program 1 times [2025-04-26 18:39:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:39,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551815279] [2025-04-26 18:39:39,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:39,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:39,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:39,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:39,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:39,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:39,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:39,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:39,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:39,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:39,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:39,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:39,774 INFO L85 PathProgramCache]: Analyzing trace with hash 3619, now seen corresponding path program 1 times [2025-04-26 18:39:39,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:39,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201941684] [2025-04-26 18:39:39,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:39,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:39,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:39,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:39,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:39,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:39,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:39,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:39,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:39,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:39,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:39,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:39,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:39,795 INFO L85 PathProgramCache]: Analyzing trace with hash 122521509, now seen corresponding path program 1 times [2025-04-26 18:39:39,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:39,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380787455] [2025-04-26 18:39:39,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:39,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:39,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:39,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:39,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:39,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:39,804 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:39,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:39,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:39,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:39,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:39,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:39,910 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:39,911 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:39,911 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:39,911 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:39,911 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:39,911 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:39,911 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:39,911 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:39,911 INFO L132 ssoRankerPreferences]: Filename of dumped script: sumsuminc.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:39,911 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:39,911 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:39,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:40,080 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:40,083 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:40,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:40,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:40,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:40,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:39:40,092 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 [2025-04-26 18:39:40,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:40,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:40,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:40,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:40,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:40,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:40,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:40,110 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:40,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:39:40,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:40,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:40,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:40,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:39:40,122 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 [2025-04-26 18:39:40,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:40,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:40,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:40,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:40,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:40,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:40,142 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:40,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:40,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:40,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:40,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:40,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:39:40,155 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 [2025-04-26 18:39:40,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:40,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:40,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:40,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:40,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:40,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:40,175 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:40,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:40,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:40,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:40,184 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:40,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:39:40,187 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 [2025-04-26 18:39:40,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:40,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:40,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:40,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:40,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:40,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:40,209 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:40,220 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:40,220 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:40,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:40,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:40,243 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:40,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:39:40,245 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:40,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:39:40,263 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:40,264 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:40,264 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2025-04-26 18:39:40,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:40,273 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:40,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:40,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:40,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:40,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:40,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:40,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:40,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:40,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:40,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:40,315 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:40,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:40,348 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 [2025-04-26 18:39:40,351 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 148 states, 146 states have (on average 1.7671232876712328) internal successors, (in total 258), 147 states have internal predecessors, (258), 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:40,462 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 148 states, 146 states have (on average 1.7671232876712328) internal successors, (in total 258), 147 states have internal predecessors, (258), 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). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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) Result 305 states and 569 transitions. Complement of second has 6 states. [2025-04-26 18:39:40,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-04-26 18:39:40,475 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:39:40,475 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:40,475 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:39:40,475 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:40,475 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:39:40,476 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:40,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 305 states and 569 transitions. [2025-04-26 18:39:40,486 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 60 [2025-04-26 18:39:40,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 305 states to 164 states and 296 transitions. [2025-04-26 18:39:40,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2025-04-26 18:39:40,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2025-04-26 18:39:40,495 INFO L74 IsDeterministic]: Start isDeterministic. Operand 164 states and 296 transitions. [2025-04-26 18:39:40,495 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:40,495 INFO L218 hiAutomatonCegarLoop]: Abstraction has 164 states and 296 transitions. [2025-04-26 18:39:40,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 296 transitions. [2025-04-26 18:39:40,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2025-04-26 18:39:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 152 states have (on average 1.8223684210526316) internal successors, (in total 277), 151 states have internal predecessors, (277), 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:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 277 transitions. [2025-04-26 18:39:40,520 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 277 transitions. [2025-04-26 18:39:40,520 INFO L438 stractBuchiCegarLoop]: Abstraction has 152 states and 277 transitions. [2025-04-26 18:39:40,520 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:40,520 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 277 transitions. [2025-04-26 18:39:40,521 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 60 [2025-04-26 18:39:40,522 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:40,522 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:40,522 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:39:40,522 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:40,522 INFO L752 eck$LassoCheckResult]: Stem: "[99] $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]" "[80] $Ultimate##0-->L19: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1]" "[102] 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]" "[86] $Ultimate##0-->L34: Formula: (= v_sum2_3 0) InVars {} OutVars{sum2=v_sum2_3} AuxVars[] AssignedVars[sum2]" "[87] L34-->L36-1: Formula: (= v_i2_6 0) InVars {} OutVars{i2=v_i2_6} AuxVars[] AssignedVars[i2]" [2025-04-26 18:39:40,522 INFO L754 eck$LassoCheckResult]: Loop: "[89] 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[]" "[91] L36-->L36-1: Formula: (and (= v_i2_9 (+ v_i2_10 1)) (= (+ (select v_A_7 v_i2_10) v_sum2_7) v_sum2_6)) InVars {A=v_A_7, sum2=v_sum2_7, i2=v_i2_10} OutVars{A=v_A_7, sum2=v_sum2_6, i2=v_i2_9} AuxVars[] AssignedVars[sum2, i2]" [2025-04-26 18:39:40,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:40,523 INFO L85 PathProgramCache]: Analyzing trace with hash 122541785, now seen corresponding path program 1 times [2025-04-26 18:39:40,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:40,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739260483] [2025-04-26 18:39:40,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:40,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:40,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:40,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:40,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:40,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:40,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:40,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:40,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:40,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash 3811, now seen corresponding path program 1 times [2025-04-26 18:39:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:40,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268947967] [2025-04-26 18:39:40,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:40,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:40,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:40,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:40,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:40,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:40,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:40,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:40,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:40,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:40,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:40,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1798541243, now seen corresponding path program 1 times [2025-04-26 18:39:40,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:40,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820185140] [2025-04-26 18:39:40,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:40,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:40,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:40,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:40,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:40,542 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:40,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:40,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:40,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:40,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:40,599 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:40,599 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:40,599 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:40,599 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:40,599 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:40,599 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:40,599 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:40,599 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:40,599 INFO L132 ssoRankerPreferences]: Filename of dumped script: sumsuminc.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:39:40,599 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:40,599 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:40,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:40,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:40,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:40,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:40,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:40,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:40,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:40,689 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:40,689 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:40,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:40,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:40,691 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:40,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:39:40,694 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 [2025-04-26 18:39:40,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:40,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:40,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:40,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:40,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:40,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:40,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:40,706 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:40,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:40,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:40,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:40,713 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:40,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:39:40,715 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 [2025-04-26 18:39:40,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:40,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:40,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:40,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:40,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:40,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:40,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:40,726 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:40,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:39:40,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:40,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:40,734 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:40,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:39:40,736 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 [2025-04-26 18:39:40,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:40,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:40,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:40,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:40,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:40,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:40,752 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:40,757 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:39:40,757 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:40,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:40,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:40,759 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:40,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:39:40,761 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:40,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:39:40,779 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:40,779 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:40,779 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2025-04-26 18:39:40,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:39:40,785 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:40,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:40,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:40,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:40,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:40,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:40,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:40,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:40,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:40,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:40,812 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:40,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:40,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:40,824 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 [2025-04-26 18:39:40,824 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 152 states and 277 transitions. cyclomatic complexity: 164 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:40,877 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 152 states and 277 transitions. cyclomatic complexity: 164. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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) Result 326 states and 624 transitions. Complement of second has 6 states. [2025-04-26 18:39:40,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-04-26 18:39:40,878 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:39:40,878 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:40,878 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:39:40,878 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:40,878 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:39:40,878 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:40,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 326 states and 624 transitions. [2025-04-26 18:39:40,881 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-04-26 18:39:40,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 326 states to 169 states and 304 transitions. [2025-04-26 18:39:40,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2025-04-26 18:39:40,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2025-04-26 18:39:40,882 INFO L74 IsDeterministic]: Start isDeterministic. Operand 169 states and 304 transitions. [2025-04-26 18:39:40,882 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:40,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 169 states and 304 transitions. [2025-04-26 18:39:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 304 transitions. [2025-04-26 18:39:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 155. [2025-04-26 18:39:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 155 states have (on average 1.8129032258064517) internal successors, (in total 281), 154 states have internal predecessors, (281), 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:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 281 transitions. [2025-04-26 18:39:40,887 INFO L240 hiAutomatonCegarLoop]: Abstraction has 155 states and 281 transitions. [2025-04-26 18:39:40,887 INFO L438 stractBuchiCegarLoop]: Abstraction has 155 states and 281 transitions. [2025-04-26 18:39:40,887 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:40,887 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 281 transitions. [2025-04-26 18:39:40,888 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-04-26 18:39:40,888 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:40,888 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:40,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:39:40,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:40,889 INFO L752 eck$LassoCheckResult]: Stem: "[99] $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]" "[80] $Ultimate##0-->L19: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1]" "[102] 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]" "[86] $Ultimate##0-->L34: Formula: (= v_sum2_3 0) InVars {} OutVars{sum2=v_sum2_3} AuxVars[] AssignedVars[sum2]" "[105] 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]" "[92] $Ultimate##0-->L50-1: Formula: (= v_incThread1of1ForFork2_j_1 0) InVars {} OutVars{incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_1} AuxVars[] AssignedVars[incThread1of1ForFork2_j]" [2025-04-26 18:39:40,889 INFO L754 eck$LassoCheckResult]: Loop: "[94] L50-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[]" "[96] L50-->L50-1: Formula: (or (and (= v_incThread1of1ForFork2_j_8 (+ v_incThread1of1ForFork2_j_7 1)) (< v_incThread1of1ForFork2_j_7 v_i2_17) (= v_A_21 (store v_A_22 v_incThread1of1ForFork2_j_7 (+ 1 (select v_A_22 v_incThread1of1ForFork2_j_7)))) (< v_incThread1of1ForFork2_j_7 v_i1_17)) (and (or (<= v_i2_17 v_incThread1of1ForFork2_j_7) (<= v_i1_17 v_incThread1of1ForFork2_j_7)) (= v_A_21 v_A_22) (= v_incThread1of1ForFork2_j_8 v_incThread1of1ForFork2_j_7))) InVars {A=v_A_22, i1=v_i1_17, i2=v_i2_17, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_7} OutVars{A=v_A_21, i1=v_i1_17, i2=v_i2_17, incThread1of1ForFork2_j=v_incThread1of1ForFork2_j_8} AuxVars[] AssignedVars[A, incThread1of1ForFork2_j]" [2025-04-26 18:39:40,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:40,889 INFO L85 PathProgramCache]: Analyzing trace with hash -496171311, now seen corresponding path program 1 times [2025-04-26 18:39:40,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:40,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241782902] [2025-04-26 18:39:40,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:40,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:40,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:40,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:40,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:40,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:40,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:40,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:40,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:40,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:40,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash 3971, now seen corresponding path program 1 times [2025-04-26 18:39:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:40,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829590408] [2025-04-26 18:39:40,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:40,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:40,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:40,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:40,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:40,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:40,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:40,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:40,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:40,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:40,914 INFO L85 PathProgramCache]: Analyzing trace with hash -79257005, now seen corresponding path program 1 times [2025-04-26 18:39:40,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:40,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189217472] [2025-04-26 18:39:40,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:40,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:40,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:40,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:40,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:40,926 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:40,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:40,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:40,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:40,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:41,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:41,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:41,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:41,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:41,061 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:41,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:41,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:41,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:41,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:41,086 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:41,093 INFO L201 PluginConnector]: Adding new model sumsuminc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:41 BoogieIcfgContainer [2025-04-26 18:39:41,093 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:41,094 INFO L158 Benchmark]: Toolchain (without parser) took 2034.57ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.4MB in the beginning and 36.9MB in the end (delta: 49.6MB). Peak memory consumption was 45.3MB. Max. memory is 8.0GB. [2025-04-26 18:39:41,094 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:41,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.86ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 84.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:41,094 INFO L158 Benchmark]: Boogie Preprocessor took 22.23ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 83.5MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:41,094 INFO L158 Benchmark]: RCFGBuilder took 188.76ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 72.7MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:41,095 INFO L158 Benchmark]: BuchiAutomizer took 1793.30ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.6MB in the beginning and 36.9MB in the end (delta: 35.7MB). Peak memory consumption was 32.8MB. Max. memory is 8.0GB. [2025-04-26 18:39:41,095 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.15ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.86ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 84.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.23ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 83.5MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 188.76ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 72.7MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1793.30ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.6MB in the beginning and 36.9MB in the end (delta: 35.7MB). Peak memory consumption was 32.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations. 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, 94 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81 IncrementalHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 39 mSDtfsCounter, 81 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital32 mio100 ax100 hnf100 lsp78 ukn92 mio100 lsp60 div100 bol100 ite100 ukn100 eq171 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 266, Number of transitions in reduction automaton: 258, Number of states in reduction automaton: 148, Underlying: - 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 4 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 4 locations. The remainder module has 155 locations. - 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(); [L17] 1 sum1 := 0; VAL [sum1=0] [L65] FORK 0 fork 2, 2 sum2(); VAL [sum1=0] [L32] 2 sum2 := 0; VAL [sum1=0, sum2=0] [L66] FORK 0 fork 3, 3, 3 inc(); VAL [sum1=0, sum2=0] [L48] 3 j := 0; VAL [j=0, sum1=0, sum2=0] Loop: [L49] COND TRUE j < N [L51] COND TRUE j < i1 && j < i2 [L52] A[j] := A[j] + 1; [L53] j := j + 1; 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(); [L17] 1 sum1 := 0; VAL [sum1=0] [L65] FORK 0 fork 2, 2 sum2(); VAL [sum1=0] [L32] 2 sum2 := 0; VAL [sum1=0, sum2=0] [L66] FORK 0 fork 3, 3, 3 inc(); VAL [sum1=0, sum2=0] [L48] 3 j := 0; VAL [j=0, sum1=0, sum2=0] Loop: [L49] COND TRUE j < N [L51] COND TRUE j < i1 && j < i2 [L52] A[j] := A[j] + 1; [L53] j := j + 1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:39:41,106 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...