/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/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:52,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:52,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:23:52,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:52,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:52,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:52,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:52,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:52,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:52,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:52,556 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:52,556 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:52,556 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:52,556 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:52,556 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:52,556 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:52,556 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:52,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:52,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:52,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:52,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:52,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:52,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:52,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:52,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:52,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:52,557 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:52,557 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:52,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:52,557 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:52,557 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:52,557 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:52,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:52,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:52,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:52,557 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:52,557 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:52,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:52,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:52,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:52,783 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:52,783 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:52,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl [2025-04-26 16:23:52,784 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl' [2025-04-26 16:23:52,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:52,800 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:52,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:52,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:52,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:52,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:52" (1/1) ... [2025-04-26 16:23:52,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:52" (1/1) ... [2025-04-26 16:23:52,834 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:52,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:52,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:52,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:52,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:52,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:52" (1/1) ... [2025-04-26 16:23:52,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:52" (1/1) ... [2025-04-26 16:23:52,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:52" (1/1) ... [2025-04-26 16:23:52,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:52" (1/1) ... [2025-04-26 16:23:52,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:52" (1/1) ... [2025-04-26 16:23:52,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:52" (1/1) ... [2025-04-26 16:23:52,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:52" (1/1) ... [2025-04-26 16:23:52,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:52" (1/1) ... [2025-04-26 16:23:52,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:52" (1/1) ... [2025-04-26 16:23:52,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:52,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:52,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:52,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:52,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:52" (1/1) ... [2025-04-26 16:23:52,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,892 INFO L229 MonitoredProcess]: Starting monitored process 1 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 16:23:52,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:23:52,919 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:52,920 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:52,920 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:52,920 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:52,920 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:52,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:52,920 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:23:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:23:52,920 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:23:52,921 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 16:23:52,960 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:52,963 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:53,057 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:53,057 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:53,078 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:53,078 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:53,078 INFO L201 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:53 BoogieIcfgContainer [2025-04-26 16:23:53,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:53,079 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:53,079 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:53,085 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:53,085 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:53,086 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:52" (1/2) ... [2025-04-26 16:23:53,087 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63fa497b and model type simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:53, skipping insertion in model container [2025-04-26 16:23:53,087 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:53,087 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:53" (2/2) ... [2025-04-26 16:23:53,088 INFO L376 chiAutomizerObserver]: Analyzing ICFG simple-array-sum.wvr.bpl [2025-04-26 16:23:53,136 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:23:53,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-26 16:23:53,184 INFO L116 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-04-26 16:23:53,186 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:23:53,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2025-04-26 16:23:53,189 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-26 16:23:53,191 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 26 transitions, 70 flow [2025-04-26 16:23:53,192 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 26 transitions, 70 flow [2025-04-26 16:23:53,199 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:53,200 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:53,200 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:53,200 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:53,200 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:53,200 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:53,200 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:53,200 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:53,201 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:53,251 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 105 [2025-04-26 16:23:53,251 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:53,251 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:53,254 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:23:53,254 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:53,254 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:53,254 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 132 states, but on-demand construction may add more states [2025-04-26 16:23:53,259 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 105 [2025-04-26 16:23:53,259 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:53,259 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:53,259 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:23:53,260 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:53,263 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L60: Formula: (and (= v_i_6 0) (= v_i_6 v_l_1) (= v_i_6 v_asum_3) (= v_i_6 v_csum_1) (= v_i_6 v_k_7) (= v_i_6 v_p_2)) InVars {csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} OutVars{csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[62] L60-->L61: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:53,263 INFO L754 eck$LassoCheckResult]: Loop: "[74] L23-1-->L23: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[76] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= v_asum_5 (+ (select v_A_3 v_i_8) v_asum_6))) InVars {A=v_A_3, i=v_i_8, asum=v_asum_6} OutVars{A=v_A_3, i=v_i_7, asum=v_asum_5} AuxVars[] AssignedVars[i, asum]" [2025-04-26 16:23:53,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:53,267 INFO L85 PathProgramCache]: Analyzing trace with hash 94267, now seen corresponding path program 1 times [2025-04-26 16:23:53,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:53,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912911077] [2025-04-26 16:23:53,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:53,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:53,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:53,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:53,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:53,318 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:53,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:53,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:53,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:53,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:53,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:53,335 INFO L85 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2025-04-26 16:23:53,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:53,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442275760] [2025-04-26 16:23:53,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:53,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:53,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:53,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:53,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:53,345 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:53,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:53,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:53,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:53,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:53,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:53,352 INFO L85 PathProgramCache]: Analyzing trace with hash 90592957, now seen corresponding path program 1 times [2025-04-26 16:23:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:53,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099119763] [2025-04-26 16:23:53,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:53,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:53,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:53,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:53,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:53,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:53,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:53,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:53,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:53,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:53,531 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:53,531 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:53,532 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:53,532 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:53,532 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:53,533 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:53,533 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:53,533 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:53,533 INFO L132 ssoRankerPreferences]: Filename of dumped script: simple-array-sum.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:23:53,533 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:53,534 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:53,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:53,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:53,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:53,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:53,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:53,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:53,683 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:53,685 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:53,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:53,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:53,688 INFO L229 MonitoredProcess]: Starting monitored process 2 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 16:23:53,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:23:53,692 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 16:23:53,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:53,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:53,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:53,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:53,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:53,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:53,719 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:53,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:53,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:53,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:53,756 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 16:23:53,757 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 16:23:53,759 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 16:23:53,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:53,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:53,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:53,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:53,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:53,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:53,781 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:53,792 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:53,792 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:53,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:53,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:53,796 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 16:23:53,797 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 16:23:53,798 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:53,816 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 16:23:53,816 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:53,816 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:53,817 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:23:53,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:53,825 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:53,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:53,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:53,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:53,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:53,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:53,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:53,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:53,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:53,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:53,873 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:53,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:53,910 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 16:23:53,947 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 16:23:53,960 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 132 states, but on-demand construction may add more states 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 16:23:54,090 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 132 states, but on-demand construction may add more states. 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 357 states and 1194 transitions. Complement of second has 7 states. [2025-04-26 16:23:54,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:54,095 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 16:23:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-04-26 16:23:54,103 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:23:54,104 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:54,104 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:23:54,104 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:54,104 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:23:54,104 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:54,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 357 states and 1194 transitions. [2025-04-26 16:23:54,112 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 91 [2025-04-26 16:23:54,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 357 states to 228 states and 782 transitions. [2025-04-26 16:23:54,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2025-04-26 16:23:54,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2025-04-26 16:23:54,120 INFO L74 IsDeterministic]: Start isDeterministic. Operand 228 states and 782 transitions. [2025-04-26 16:23:54,120 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:54,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 228 states and 782 transitions. [2025-04-26 16:23:54,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states and 782 transitions. [2025-04-26 16:23:54,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 168. [2025-04-26 16:23:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 3.511904761904762) internal successors, (in total 590), 167 states have internal predecessors, (590), 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 16:23:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 590 transitions. [2025-04-26 16:23:54,142 INFO L240 hiAutomatonCegarLoop]: Abstraction has 168 states and 590 transitions. [2025-04-26 16:23:54,142 INFO L438 stractBuchiCegarLoop]: Abstraction has 168 states and 590 transitions. [2025-04-26 16:23:54,142 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:54,142 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 590 transitions. [2025-04-26 16:23:54,144 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 91 [2025-04-26 16:23:54,144 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:54,144 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:54,144 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:23:54,144 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:54,145 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L60: Formula: (and (= v_i_6 0) (= v_i_6 v_l_1) (= v_i_6 v_asum_3) (= v_i_6 v_csum_1) (= v_i_6 v_k_7) (= v_i_6 v_p_2)) InVars {csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} OutVars{csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[62] L60-->L61: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[92] L61-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:23:54,145 INFO L754 eck$LassoCheckResult]: Loop: "[78] L34-1-->L34: Formula: (< v_k_1 v_N_3) InVars {k=v_k_1, N=v_N_3} OutVars{k=v_k_1, N=v_N_3} AuxVars[] AssignedVars[]" "[80] L34-->L34-1: Formula: (and (= v_k_12 (+ v_k_13 1)) (= (store v_C_5 v_k_13 (+ (select v_A_5 v_k_13) 1)) v_C_4) (= v_k_12 v_p_7)) InVars {A=v_A_5, k=v_k_13, C=v_C_5} OutVars{A=v_A_5, p=v_p_7, k=v_k_12, C=v_C_4} AuxVars[] AssignedVars[p, k, C]" [2025-04-26 16:23:54,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2922369, now seen corresponding path program 1 times [2025-04-26 16:23:54,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728768131] [2025-04-26 16:23:54,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:54,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:54,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:54,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:54,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,152 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2025-04-26 16:23:54,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687898116] [2025-04-26 16:23:54,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:54,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:54,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:54,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:54,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1486568189, now seen corresponding path program 1 times [2025-04-26 16:23:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388334709] [2025-04-26 16:23:54,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:54,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:54,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,167 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:54,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:54,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,256 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:54,256 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:54,256 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:54,256 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:54,257 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:54,257 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:54,257 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:54,257 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:54,257 INFO L132 ssoRankerPreferences]: Filename of dumped script: simple-array-sum.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:23:54,257 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:54,257 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:54,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:54,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:54,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:54,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:54,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:54,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:54,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:54,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:54,377 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:54,378 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:54,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:54,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:54,383 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 16:23:54,384 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 16:23:54,386 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 16:23:54,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:54,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:54,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:54,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:54,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:54,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:54,403 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:54,409 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 16:23:54,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:54,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:54,411 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 16:23:54,413 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 16:23:54,414 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 16:23:54,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:54,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:54,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:54,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:54,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:54,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:54,429 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:54,434 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 16:23:54,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:54,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:54,440 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 16:23:54,442 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 16:23:54,443 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 16:23:54,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:54,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:54,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:54,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:54,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:54,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:54,458 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:54,463 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 16:23:54,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:54,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:54,465 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 16:23:54,466 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 16:23:54,467 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 16:23:54,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:54,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:54,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:54,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:54,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:54,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:54,482 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:54,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:23:54,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:54,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:54,490 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 16:23:54,491 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 16:23:54,492 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 16:23:54,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:54,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:54,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:54,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:54,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:54,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:54,535 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:54,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:54,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:54,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:54,572 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 16:23:54,574 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 16:23:54,575 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 16:23:54,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:54,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:54,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:54,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:54,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:54,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:54,605 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:54,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:54,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:54,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:54,613 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 16:23:54,615 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 16:23:54,615 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 16:23:54,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:54,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:54,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:54,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:54,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:54,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:54,634 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:54,641 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:23:54,641 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:23:54,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:54,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:54,643 INFO L229 MonitoredProcess]: Starting monitored process 12 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 16:23:54,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:23:54,646 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:54,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:54,662 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:54,663 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:54,663 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 16:23:54,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:54,669 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:54,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:54,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:54,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:54,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:54,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:54,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:54,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:54,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:54,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:54,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:54,714 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 16:23:54,715 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 16:23:54,715 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 168 states and 590 transitions. cyclomatic complexity: 461 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 16:23:54,787 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 168 states and 590 transitions. cyclomatic complexity: 461. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 508 states and 1872 transitions. Complement of second has 6 states. [2025-04-26 16:23:54,787 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 16:23:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 16:23:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-04-26 16:23:54,788 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:23:54,788 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:54,788 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:23:54,788 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:54,788 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:23:54,788 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:54,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 508 states and 1872 transitions. [2025-04-26 16:23:54,794 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 63 [2025-04-26 16:23:54,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 508 states to 307 states and 1152 transitions. [2025-04-26 16:23:54,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-04-26 16:23:54,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 171 [2025-04-26 16:23:54,798 INFO L74 IsDeterministic]: Start isDeterministic. Operand 307 states and 1152 transitions. [2025-04-26 16:23:54,798 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:54,798 INFO L218 hiAutomatonCegarLoop]: Abstraction has 307 states and 1152 transitions. [2025-04-26 16:23:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 1152 transitions. [2025-04-26 16:23:54,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 251. [2025-04-26 16:23:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 251 states have (on average 3.9163346613545817) internal successors, (in total 983), 250 states have internal predecessors, (983), 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 16:23:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 983 transitions. [2025-04-26 16:23:54,809 INFO L240 hiAutomatonCegarLoop]: Abstraction has 251 states and 983 transitions. [2025-04-26 16:23:54,809 INFO L438 stractBuchiCegarLoop]: Abstraction has 251 states and 983 transitions. [2025-04-26 16:23:54,809 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:54,809 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 983 transitions. [2025-04-26 16:23:54,811 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 63 [2025-04-26 16:23:54,811 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:54,811 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:54,811 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:54,811 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:54,812 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L60: Formula: (and (= v_i_6 0) (= v_i_6 v_l_1) (= v_i_6 v_asum_3) (= v_i_6 v_csum_1) (= v_i_6 v_k_7) (= v_i_6 v_p_2)) InVars {csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} OutVars{csum=v_csum_1, i=v_i_6, p=v_p_2, asum=v_asum_3, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[62] L60-->L61: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[92] L61-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[95] L62-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:23:54,812 INFO L754 eck$LassoCheckResult]: Loop: "[82] L46-1-->L46: Formula: (< v_l_8 v_N_8) InVars {l=v_l_8, N=v_N_8} OutVars{l=v_l_8, N=v_N_8} AuxVars[] AssignedVars[]" "[85] L46-->L46-1: Formula: (<= v_p_4 v_l_6) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[]" [2025-04-26 16:23:54,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,812 INFO L85 PathProgramCache]: Analyzing trace with hash 90593534, now seen corresponding path program 1 times [2025-04-26 16:23:54,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522508032] [2025-04-26 16:23:54,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:54,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:54,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,820 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:54,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:54,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash 3588, now seen corresponding path program 1 times [2025-04-26 16:23:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691224053] [2025-04-26 16:23:54,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:54,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:54,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,830 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:54,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:54,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1161042881, now seen corresponding path program 1 times [2025-04-26 16:23:54,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271891321] [2025-04-26 16:23:54,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:54,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:54,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:54,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:54,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:54,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:54,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:54,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:54,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,971 INFO L201 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:54 BoogieIcfgContainer [2025-04-26 16:23:54,971 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:54,971 INFO L158 Benchmark]: Toolchain (without parser) took 2171.17ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 85.3MB in the beginning and 43.1MB in the end (delta: 42.1MB). Peak memory consumption was 47.9MB. Max. memory is 8.0GB. [2025-04-26 16:23:54,972 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:54,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.85ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 83.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:54,972 INFO L158 Benchmark]: Boogie Preprocessor took 26.69ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 82.4MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:23:54,972 INFO L158 Benchmark]: RCFGBuilder took 215.05ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 72.4MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:54,973 INFO L158 Benchmark]: BuchiAutomizer took 1891.65ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 72.2MB in the beginning and 43.1MB in the end (delta: 29.1MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. [2025-04-26 16:23:54,977 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.21ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.85ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 83.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.69ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 82.4MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 215.05ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 72.4MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1891.65ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 72.2MB in the beginning and 43.1MB in the end (delta: 29.1MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 116 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, 69 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 26 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital49 mio100 ax100 hnf100 lsp63 ukn81 mio100 lsp84 div100 bol100 ite100 ukn100 eq165 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - 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 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. The remainder module has 251 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 45]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L59] 0 assume i == k && i == l && i == p && i == asum && i == csum && i == 0; VAL [asum=0, csum=0, i=0, k=0, l=0, p=0] [L60] 0 assume 0 <= N; VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L61] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L62] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L63] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] Loop: [L45] COND TRUE l < N [L46] COND FALSE !(l < p) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 45]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L59] 0 assume i == k && i == l && i == p && i == asum && i == csum && i == 0; VAL [asum=0, csum=0, i=0, k=0, l=0, p=0] [L60] 0 assume 0 <= N; VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L61] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L62] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L63] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] Loop: [L45] COND TRUE l < N [L46] COND FALSE !(l < p) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:23:54,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...